Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Discrete Appl.~Math. AND Volume=24
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données
D. Arquès
Discrete Applied Mathematics
24
, 1989, pp. 3-23
A new color change to improve the coloring of a graph
C. Berge
Discrete Applied Mathematics
24
, 1989, pp. 25-28
Algorithms for sequential generation of combinatorial structures
F. Bergeron
Discrete Applied Mathematics
24
, 1989, pp. 29-35
Average sizes of suffix trees and DAWGs
Anselm Blumer
,
Andrzej Ehrenfeucht
,
David Haussler
Discrete Applied Mathematics
24
, 1989, pp. 37-45
Learning faster than promised by the Vapnik-Chervonenkis dimension
Anselm Blumer
,
Nick Littlestone
Discrete Applied Mathematics
24
, 1989, pp. 47-53
Matchings and
\Delta
-matroids
André Bouchet
Discrete Applied Mathematics
24
, 1989, pp. 55-62
König-Egerváry graphs, 2-bicritical graphs and fractional matchings
Jean-Marie Bourjolly
,
William R. Pulleyblank
Discrete Applied Mathematics
24
, 1989, pp. 63-82
Enumeration of factors in the Thue-Morse word
Srećko Brlek
Discrete Applied Mathematics
24
, 1989, pp. 83-96
Induced matchings
Kathie Cameron
Discrete Applied Mathematics
24
, 1989, pp. 97-102
Coding for write-unidirectional memories and conflict resolution
Gérard Cohen
,
Gábor Simonyi
Discrete Applied Mathematics
24
, 1989, pp. 103-114
Elemenary proofs of (relatively) recent characterizations of Eulerian graphs
Herbert Fleischner
Discrete Applied Mathematics
24
, 1989, pp. 115-119
Fixpoint strategies for deductive databases
Irène Guessarian
Discrete Applied Mathematics
24
, 1989, pp. 121-131
Maximal partial clones determined by the areflexive relations
Lucien Haddad
,
I.G. Rosenberg
Discrete Applied Mathematics
24
, 1989, pp. 133-143
Codes and matrices in studies on designs
Marshall, Jr. Hall
Discrete Applied Mathematics
24
, 1989, pp. 145-152
Factorisations courtes dans un groupe fini
Y.O. Hamidoune
Discrete Applied Mathematics
24
, 1989, pp. 153-165
TC operations and Latin bricks
Simone Hazan
Discrete Applied Mathematics
24
, 1989, pp. 167-177
Fault-tolerant routings in Kautz and de Bruijn networks
Nathalie Homobono
,
Claudine Peyrat
Discrete Applied Mathematics
24
, 1989, pp. 179-186
Anti-commutative languages and
n
-codes
M. Ito
,
H. Jürgensen
,
H.J. Shyr
,
G. Thierrin
Discrete Applied Mathematics
24
, 1989, pp. 187-196
Extensions de réseaux de connexité donnée
Jean-Claude Konig
Discrete Applied Mathematics
24
, 1989, pp. 197-211
Dyck paths of knight moves
Jacques Labelle
,
Yeong-Nan Yeh
Discrete Applied Mathematics
24
, 1989, pp. 213-221
Concurrency measure in commutation monoids
N. Saheb
Discrete Applied Mathematics
24
, 1989, pp. 223-236
Finite automata for languages of combinatorial interest: An order theoretical point of view
Rodica E. Simion
Discrete Applied Mathematics
24
, 1989, pp. 237-246
An algebraic point of view of the data structures of database systems
Dan A. Simovici
,
Corina Reischer
Discrete Applied Mathematics
24
, 1989, pp. 247-260