default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 24
Volume 24, Numbers 1-3, 1989
- Gena Hahn, Ivo G. Rosenberg:
Preface. 1-2 - Didier Arquès:
Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données. 3-23 - Claude Berge:
A new color change to improve the coloring of a graph. 25-28 - François Bergeron
:
Algorithms for sequential generation of combinatorial structures. 29-35 - Anselm Blumer, Andrzej Ehrenfeucht, David Haussler:
Average sizes of suffix trees and DAWGs. 37-45 - Anselm Blumer, Nick Littlestone:
Learning faster than promised by the Vapnik-Chervonenkis dimension. 47-53 - André Bouchet:
Matchings and -matroids. 55-62 - Jean-Marie Bourjolly, William R. Pulleyblank:
König-Egerváry graphs, 2-bicritical graphs and fractional matchings. 63-82 - Srecko Brlek:
Enumeration of factors in the Thue-Morse word. 83-96 - Kathie Cameron:
Induced matchings. 97-102 - Gérard D. Cohen, Gábor Simonyi:
Coding for write-unidirectional memories and conflict resolution. 103-114 - Herbert Fleischner:
Elementary proofs of (relatively) recent characterizations of Eulerian graphs. 115-119 - Irène Guessarian:
Fixpoint strategies for deductive databases. 121-131 - Lucien Haddad, Ivo G. Rosenberg:
Maximal partial clones determined by the areflexive relations. 133-143 - Marshall Hall Jr.:
Codes and matrices in studies on designs. 145-152 - Yahya Ould Hamidoune:
Factorisations courtes dans un groupe fini. 153-165 - Simone Hazan:
TC operations and Latin bricks. 167-177 - Nathalie Homobono, Claudine Peyrat:
Fault-tolerant routings in Kautz and de Bruijn networks. 179-186 - Masami Ito, Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin:
Anti-commutative languages and n-codes. 187-196 - Jean-Claude König:
Extensions de réseaux de connexité donnée. 197-211 - Jacques Labelle, Yeong-Nan Yeh:
Dyck paths of knight moves. 213-221 - Nasser Saheb:
Concurrency measure in commutation monoids. 223-236 - Rodica Simion:
Finite automata for languages of combinatorial interest: An order theoretical point of view. 237-246 - Dan A. Simovici, Corina Reischer:
An algebraic point of view of the data structures of database systems. 247-260
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-29 00:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
