Volume 11,
Number 1,
March 1990
Volume 11,
Number 2,
June 1990
- Francine Berman, David S. Johnson, Frank Thomson Leighton, Peter W. Shor, Larry Snyder:
Generalized Planar Matching.
153-184 BibTeX
- Vidyadhar G. Kulkarni:
Generating Random Combinatorial Objects.
185-207 BibTeX
- Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator:
Competitive Algorithms for Server Problems.
208-230 BibTeX
- Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, G. Sullivan:
A Parallel Fault Identification Algorithm.
231-241 BibTeX
- Mark Allen Weiss, Robert Sedgewick:
Tight Lower Bounds for Shellsort.
242-251 BibTeX
- Gur Saran Adhar, Shietung Peng:
Parallel Algorithms for Cographs and Parity Graphs with Applications.
252-284 BibTeX
- Eytan Ronn:
NP-Complete Stable Matching Problems.
285-304 BibTeX
Volume 11,
Number 3,
September 1990
- Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg:
Improved Routing Strategies with Succinct Tables.
307-341 BibTeX
- Baruch Awerbuch:
On the Effects of Feedback in Dynamic Network Protocols.
342-373 BibTeX
- Gil Neiger, Sam Toueg:
Automatically Increasing the Fault-Tolerance of Distributed Algorithms.
374-419 BibTeX
- Ofer Biran, Shlomo Moran, Shmuel Zaks:
A Combinatorial Characterization of the Distributed 1-Solvable Tasks.
420-440 BibTeX
- James Aspnes, Maurice Herlihy:
Fast Randomized Consensus Using Shared Memory.
441-461 BibTeX
- David B. Johnson, Willy Zwaenepoel:
Recovery in Distributed Systems Using Optimistic Message Logging and Checkpointing.
462-491 BibTeX
- Ming-Deh A. Huang, Shang-Hua Teng:
Security, Verifiability, and Universality in Distributed Computing.
492-521 BibTeX
Volume 11,
Number 4,
December 1990
Copyright © Sun May 17 00:06:06 2009
by Michael Ley (ley@uni-trier.de)
