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
[1]
Hilfe
Suche: Journal=J. ACM AND Volume=36
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimum lopsided binary trees
Sanjiv Kapoor
,
Edward M. Reingold
Journal of the ACM
36
(3), 1989, July, pp. 573-590
Simple constant-time consensus protocols in realistic failure models
Benny Chor
,
Michael Merritt
,
David B. Shmoys
Journal of the ACM
36
(3), 1989, July, pp. 591-614
Acyclic fork-join queueing networks
François Baccelli
,
William A. Massey
,
Don Towsley
Journal of the ACM
36
(3), 1989, July, pp. 615-642
Optimal bounds for decision problems on the CRCW PRAM
Paul Beame
,
Johan Håstad
Journal of the ACM
36
(3), 1989, July, pp. 643-670
New lower bounds for parallel computation
Ming Li
,
Yacov Yesha
Journal of the ACM
36
(3), 1989, July, pp. 671-680
Using temporal hierarchies to efficiently maintain large temporal databases
T. Dean
Journal of the ACM
36
(4), 1989, October, pp. 687-718
Spacefilling curves and the planar travelling salesman problem
L.K. Platzman
,
J.J. Bartholdi III
Journal of the ACM
36
(4), 1989, October, pp. 719-737
The periodic balanced sorting network
M. Dowd
,
Y. Perl
,
L. Rudolph
,
M. Saks
Journal of the ACM
36
(4), 1989, October, pp. 738-757
A transaction-based approach to relational database specification
S. Abiteboul
,
V. Vianu
Journal of the ACM
36
(4), 1989, October, pp. 758-789
A uniform approach toward handling atomic and structured information in the nested relational database model
M. Gyssens
,
J. Paredaens
,
D. van Gucht
Journal of the ACM
36
(4), 1989, October, pp. 790-825
On the design of some systolic algorithms
J.L.A. van de Snepscheut
,
J.B. Swenker
Journal of the ACM
36
(4), 1989, October, pp. 826-840
Passes, sweeps, and visits in attribute grammars
J. Engelfriet
,
G. Filé
Journal of the ACM
36
(4), 1989, October, pp. 841-869
The conjecture of Fliess on commutative context-free languages
J. Kortelainen
Journal of the ACM
36
(4), 1989, October, pp. 870-872
Finding minimum-cost circulations by canceling negative cycles
A.V. Goldberg
,
R.E. Tarjan
Journal of the ACM
36
(4), 1989, October, pp. 873-886
Distributed bisimulations
I. Castellani
,
M. Hennessy
Journal of the ACM
36
(4), 1989, October, pp. 887-911
P-uniform circuit complexity
Eric W. Allender
Journal of the ACM
36
(4), 1989, October, pp. 912-928
Learnability and the Vapnik-Chervonenkis dimension
A. Blumer
,
A. Ehrenfeucht
,
D. Haussler
,
M.K. Warmuth
Journal of the ACM
36
(4), 1989, October, pp. 929-965
Seiten
<
1
2