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=J. ACM AND Volume=36
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Incremental modular decomposition
John H. Muller
,
Jeremy Spinrad
Journal of the ACM
36
(1), 1989, January, pp. 1-19
A unified framework for race analysis of asynchronous networks
J.A. Brzozowski
,
C.-J. Seger
Journal of the ACM
36
(1), 1989, January, pp. 20-45
Maintaining state constraints in relational databases: A proof theoretic basis
William W. McCune
,
Lawrence J. Henschen
Journal of the ACM
36
(1), 1989, January, pp. 46-68
Minimizing function-free recursive inference rules
Jeffrey F. Naughton
Journal of the ACM
36
(1), 1989, January, pp. 69-91
A counter-example for ``A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars''
Jens M. Dill
Journal of the ACM
36
(1), 1989, January, pp. 92-96
A common schema for dynamic programming and branch and bound algorithms
Paul Helman
Journal of the ACM
36
(1), 1989, January, pp. 97-128
Inferring sequences produced by pseudo-random number generators
Joan Boyar
Journal of the ACM
36
(1), 1989, January, pp. 129-141
A note on probabilistically verifying integer and polynomial products
Michael Kaminski
Journal of the ACM
36
(1), 1989, January, pp. 142-149
Multiplicative complexity of polynomial multiplication over finite fields
Michael Kaminski
,
Nader H. Bshouty
Journal of the ACM
36
(1), 1989, January, pp. 150-170
Calculating availability and performability measures of repairable computer systems using randomization
Edmundo de Souza e Silva
,
H. Richard Gail
Journal of the ACM
36
(1), 1989, January, pp. 171-193
Calculating joint queue length distributions in product form queueing networks
Edmundo de Souza e Silva
,
S.S. Lavenberg
Journal of the ACM
36
(1), 1989, January, pp. 194-207
Rasterizing curves of constant width
John D. Hobby
Journal of the ACM
36
(2), 1989, April, pp. 209-229
A model for concurrency in nested transactions systems
Catriel Beeri
,
Philip A. Bernstein
,
Nathan Goodman
Journal of the ACM
36
(2), 1989, April, pp. 230-269
Average case selection
Walter Cunto
,
J. Ian Munro
Journal of the ACM
36
(2), 1989, April, pp. 270-279
On the path length of binary trees
Rolf Klein
,
Derick Wood
Journal of the ACM
36
(2), 1989, April, pp. 280-289
Optimum combinations of sorting and merging
G.K. Manacher
,
T.D. Bui
,
T. Mai
Journal of the ACM
36
(2), 1989, April, pp. 290-334
Efficient dispersal of information for security, load balancing, and fault tolerance
Michael O. Rabin
Journal of the ACM
36
(2), 1989, April, pp. 335-348
A generalized algorithm for centrality problems on trees
Arnie Rosenthal
,
José A. Pino
Journal of the ACM
36
(2), 1989, April, pp. 349-361
Size-time complexity of Boolean networks for prefix computations
G. Bilardi
,
F.P. Preparata
Journal of the ACM
36
(2), 1989, April, pp. 362-382
Probabilistic inductive inference
L. Pitt
Journal of the ACM
36
(2), 1989, April, pp. 383-433
Recognizing circle graphs in polynomial time
Csaba P. Gabor
,
Kenneth J. Supowit
,
Wen-Lian Hsu
Journal of the ACM
36
(3), 1989, July, pp. 435-473
Hierarchical planarity testing algorithms
Thomas Lengauer
Journal of the ACM
36
(3), 1989, July, pp. 474-509
A trade-off between space and efficiency for routing tables
David Peleg
,
Eli Upfal
Journal of the ACM
36
(3), 1989, July, pp. 510-530
Invariance of complexity measures for networks with unreliable gates
Nicholas Pippenger
Journal of the ACM
36
(3), 1989, July, pp. 531-539
Efficient implementation of graph algorithms using contraction
Harold N. Gabow
,
Zvi Galil
,
Thomas H. Spencer
Journal of the ACM
36
(3), 1989, July, pp. 540-572
Seiten 1
2
>