nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algorithms for sequential generation of combinatorial structures
|
Bergeron, F. |
|
1989 |
24 |
1-3 |
p. 29-35 7 p. |
artikel |
2 |
An algebraic point of view of the data structures of database systems
|
Simovici, Dan A. |
|
1989 |
24 |
1-3 |
p. 247-260 14 p. |
artikel |
3 |
A new color change to improve the coloring of a graph
|
Berge, C. |
|
1989 |
24 |
1-3 |
p. 25-28 4 p. |
artikel |
4 |
Anti-commutative languages and n-codes
|
Ito, M. |
|
1989 |
24 |
1-3 |
p. 187-196 10 p. |
artikel |
5 |
Author index
|
|
|
1989 |
24 |
1-3 |
p. 261- 1 p. |
artikel |
6 |
Average sizes of suffix trees and DAWGs
|
Blumer, Anselm |
|
1989 |
24 |
1-3 |
p. 37-45 9 p. |
artikel |
7 |
Codes and matrices in studies on designs
|
Hall Jr., Marshall |
|
1989 |
24 |
1-3 |
p. 145-152 8 p. |
artikel |
8 |
Coding for write-unidirectional memories and conflict resolution
|
Cohen, Gérard |
|
1989 |
24 |
1-3 |
p. 103-114 12 p. |
artikel |
9 |
Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données
|
Arquès, D. |
|
1989 |
24 |
1-3 |
p. 3-23 21 p. |
artikel |
10 |
Concurrency measure in commutation monoids
|
Saheb, N. |
|
1989 |
24 |
1-3 |
p. 223-236 14 p. |
artikel |
11 |
Dyck paths of knight moves
|
Labelle, Jacques |
|
1989 |
24 |
1-3 |
p. 213-221 9 p. |
artikel |
12 |
Editorial Board
|
|
|
1989 |
24 |
1-3 |
p. IFC- 1 p. |
artikel |
13 |
Elementary proofs of (relatively) recent characterizations of Eulerian graphs
|
Fleischner, Herbert |
|
1989 |
24 |
1-3 |
p. 115-119 5 p. |
artikel |
14 |
Enumeration of factors in the Thue-Morse word
|
Brlek, Srećko |
|
1989 |
24 |
1-3 |
p. 83-96 14 p. |
artikel |
15 |
Extensions de réseaux de connexité donnée
|
Konig, Jean-Claude |
|
1989 |
24 |
1-3 |
p. 197-211 15 p. |
artikel |
16 |
Factorisations courtes dans un groupe fini
|
Hamidoune, Y.O. |
|
1989 |
24 |
1-3 |
p. 153-165 13 p. |
artikel |
17 |
Fault-tolerant routings in Kautz and de Bruijn networks
|
Homobono, Nathalie |
|
1989 |
24 |
1-3 |
p. 179-186 8 p. |
artikel |
18 |
Finite automata for languages of combinatorial interest: An order theoretical point of view
|
Simion, Rodica E. |
|
1989 |
24 |
1-3 |
p. 237-246 10 p. |
artikel |
19 |
Fixpoint strategies for deductive databases
|
Guessarian, Irène |
|
1989 |
24 |
1-3 |
p. 121-131 11 p. |
artikel |
20 |
Induced matchings
|
Cameron, Kathie |
|
1989 |
24 |
1-3 |
p. 97-102 6 p. |
artikel |
21 |
König-Egerváry graphs, 2-bicritical graphs and fractional matchings
|
Bourjolly, Jean-Marie |
|
1989 |
24 |
1-3 |
p. 63-82 20 p. |
artikel |
22 |
Learning faster than promised by the Vapnik-Chervonenkis dimension
|
Blumer, Anselm |
|
1989 |
24 |
1-3 |
p. 47-53 7 p. |
artikel |
23 |
Matchings and ▵-matroids
|
Bouchet, André |
|
1989 |
24 |
1-3 |
p. 55-62 8 p. |
artikel |
24 |
Maximal partial clones determined by the areflexive relations
|
Haddad, Lucien |
|
1989 |
24 |
1-3 |
p. 133-143 11 p. |
artikel |
25 |
Preface
|
Hahn, Geňa |
|
1989 |
24 |
1-3 |
p. 1-2 2 p. |
artikel |
26 |
TC operations and Latin bricks
|
Hazan, Simone |
|
1989 |
24 |
1-3 |
p. 167-177 11 p. |
artikel |