Volume 36,
Number 1,
January 1989
Volume 36,
Number 2,
April 1989
- John D. Hobby:
Rasterizing curves of constant width.
209-229
Electronic Edition (ACM DL) BibTeX
- Catriel Beeri, Philip A. Bernstein, Nathan Goodman:
A model for concurrency in nested transactions systems.
230-269
Electronic Edition BibTeX
- Walter Cunto, J. Ian Munro:
Average case selection.
270-279
Electronic Edition (ACM DL) BibTeX
- Rolf Klein, Derick Wood:
On the path length of binary trees.
280-289
Electronic Edition (ACM DL) BibTeX
- Glenn K. Manacher, T. D. Bui, T. Mai:
Optimum combinations of sorting and merging.
290-334
Electronic Edition (ACM DL) BibTeX
- Michael O. Rabin:
Efficient dispersal of information for security, load balancing, and fault tolerance.
335-348
Electronic Edition BibTeX
- Arnon Rosenthal, José A. Pino:
A generalized algorithm for centrality problems on trees.
349-361
Electronic Edition (ACM DL) BibTeX
- Gianfranco Bilardi, Franco P. Preparata:
Size-time complexity of Boolean networks for prefix computations.
362-382
Electronic Edition (ACM DL) BibTeX
- Leonard Pitt:
Probabilistic inductive inference.
383-433
Electronic Edition (ACM DL) BibTeX
Volume 36,
Number 3,
July 1989
- Csaba P. Gabor, Kenneth J. Supowit, Wen-Lian Hsu:
Recognizing circle graphs in polynomial time.
435-473
Electronic Edition (ACM DL) BibTeX
- Thomas Lengauer:
Hierarchical planarity testing algorithms.
474-509
Electronic Edition (ACM DL) BibTeX
- David Peleg, Eli Upfal:
A trade-off between space and efficiency for routing tables.
510-530
Electronic Edition (ACM DL) BibTeX
- Nicholas Pippenger:
Invariance of complexity measures for networks with unreliable gates.
531-539
Electronic Edition (ACM DL) BibTeX
- Harold N. Gabow, Zvi Galil, Thomas H. Spencer:
Efficient implementation of graph algorithms using contraction.
540-572
Electronic Edition (ACM DL) BibTeX
- Sanjiv Kapoor, Edward M. Reingold:
Optimum lopsided binary trees.
573-590
Electronic Edition (ACM DL) BibTeX
- Benny Chor, Michael Merritt, David B. Shmoys:
Simple constant-time consensus protocols in realistic failure models.
591-614
Electronic Edition (ACM DL) BibTeX
- François Baccelli, William A. Massey, Donald F. Towsley:
Acyclic fork-join queuing networks.
615-642
Electronic Edition (ACM DL) BibTeX
- Paul Beame, Johan Håstad:
Optimal bounds for decision problems on the CRCW PRAM.
643-670
Electronic Edition (ACM DL) BibTeX
- Ming Li, Yaacov Yesha:
New lower bounds for parallel computation.
671-680
Electronic Edition (ACM DL) BibTeX
Volume 36,
Number 4,
October 1989
- Thomas Dean:
Using temporal hierarchies to efficiently maintain large temporal databases.
687-718
Electronic Edition BibTeX
- Loren K. Platzman, John J. Bartholdi III:
Spacefilling curves and the planar travelling salesman problem.
719-737
Electronic Edition (ACM DL) BibTeX
- Martin Dowd, Yehoshua Perl, Larry Rudolph, Michael E. Saks:
The periodic balanced sorting network.
738-757
Electronic Edition (ACM DL) BibTeX
- Serge Abiteboul, Victor Vianu:
A transaction-based approach to relational database specification.
758-789
Electronic Edition BibTeX
- Marc Gyssens, Jan Paredaens, Dirk Van Gucht:
A uniform approach toward handling atomic and structured information in the nested relational database model.
790-825
Electronic Edition BibTeX
- Jan L. A. van de Snepscheut, Johan B. Swenker:
On the design of some systolic algorithms.
826-840
Electronic Edition (ACM DL) BibTeX
- Joost Engelfriet, Gilberto Filé:
Passes, sweeps, and visits in attribute grammars.
841-869
Electronic Edition (ACM DL) BibTeX
- Juha Kortelainen:
The conjecture of Fliess on commutative context-free languages.
870-872
Electronic Edition (ACM DL) BibTeX
- Andrew V. Goldberg, Robert Endre Tarjan:
Finding minimum-cost circulations by canceling negative cycles.
873-886
Electronic Edition (ACM DL) BibTeX
- Ilaria Castellani, Matthew Hennessy:
Distributed bisimulations.
887-911
Electronic Edition (ACM DL) BibTeX
- Eric Allender:
P-uniform circuit complexity.
912-928
Electronic Edition (ACM DL) BibTeX
- Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth:
Learnability and the Vapnik-Chervonenkis dimension.
929-965
Electronic Edition BibTeX
Copyright © Sun May 17 00:05:48 2009
by Michael Ley (ley@uni-trier.de)