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=37
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some computational aspects of circumscription
Phokion G. Kolaitis
,
Christos H. Papadimitriou
Journal of the ACM
37
(1), 1990, January, pp. 1-14
Polynomial-time implication problems for unary inclusion dependencies
Stavros S. Cosmadakis
,
Paris C. Kanellakis
,
Moshe Y. Vardi
Journal of the ACM
37
(1), 1990, January, pp. 15-46
Minimal and complete word unification
Joxan Jaffar
Journal of the ACM
37
(1), 1990, January, pp. 47-85
Completeness of rewrite rules and rewrite strategies for FP
Joseph Y. Halpern
,
John H. Williams
,
Edward L. Wimmers
Journal of the ACM
37
(1), 1990, January, pp. 86-143
Asymptotic expansions for large closed queueing networks
Charles Knessl
,
Charles Tier
Journal of the ACM
37
(1), 1990, January, pp. 144-174
Nondeterministic polynomial-time computations and models of arithmetic
Attila Máté
Journal of the ACM
37
(1), 1990, January, pp. 175-193
Cost-error relationships in
A^*
tree-searching
H.W. Davis
Journal of the ACM
37
(2), 1990, April, pp. 195-199
Lower bounds for orthogonal range searching: I. The reporting case
B. Chazelle
Journal of the ACM
37
(2), 1990, April, pp. 200-212
Faster algorithms for the shortest path problem
R.K. Ahuja
,
K. Mehlhorn
,
J.B. Orlin
,
R.E. Tarjan
Journal of the ACM
37
(2), 1990, April, pp. 213-223
The cost distribution of clustering in random probing
B. Bollobás
,
A.Z. Broder
,
I. Simon
Journal of the ACM
37
(2), 1990, April, pp. 224-237
A trade-off between information and communication in broadcast protocols
B. Awerbuch
,
O. Goldreich
,
D. Peleg
,
R. Vainish
Journal of the ACM
37
(2), 1990, April, pp. 238-256
Concurrency and availability as dual properties of replicated atomic data
M. Herlihy
Journal of the ACM
37
(2), 1990, April, pp. 257-278
Nonclausal deduction in first-order temporal logic
M. Abadi
,
Z. Manna
Journal of the ACM
37
(2), 1990, April, pp. 279-317
The maximum concurrent flow problem
F. Shahrokhi
,
D. Matula
Journal of the ACM
37
(2), 1990, April, pp. 318-334
Module algebra
J. Bergstra
,
J. Heering
,
P. Klint
Journal of the ACM
37
(2), 1990, April, pp. 335-372
On the execution of parallel programs on multiprocessor systems-a queueing theory approach
F. Baccelli
,
Z. Liu
Journal of the ACM
37
(2), 1990, April, pp. 373-414
Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
K.-I. Ko
Journal of the ACM
37
(2), 1990, April, pp. 415-438
Lower bounds for orthogonal range searching II: The arithmetic model
B. Chazelle
Journal of the ACM
37
(3), 1990, July, pp. 439-463
A fast algorithm for optimal length-limited Huffman codes
L.L. Larmore
,
D.S. Hirschberg
Journal of the ACM
37
(3), 1990, July, pp. 464-473
On the equivalence of an egd to a set of fd's
M.H. Graham
,
K. Wang
Journal of the ACM
37
(3), 1990, July, pp. 474-490
Analysis of database performance with dynamic locking
I.K. Ryu
,
A. Thomasian
Journal of the ACM
37
(3), 1990, July, pp. 491-523
Renaming in an asynchronous environment
H. Attiya
,
A. Bar-Noy
,
D. Dolev
,
D. Peleg
,
R. Reischuk
Journal of the ACM
37
(3), 1990, July, pp. 524-548
Knowledge and common knowledge in a distributed environment
J.Y. Halpern
,
Y. Moses
Journal of the ACM
37
(3), 1990, July, pp. 549-587
Parallel asynchronous algorithms for discrete data
A. üresin
,
M. Dubois
Journal of the ACM
37
(3), 1990, July, pp. 588-606
Shortest-path and minimum delay algorithms in networks with time-dependent edge-length
A. Orda
,
R. Rom
Journal of the ACM
37
(3), 1990, July, pp. 607-625
Seiten 1
2
>