Volume 14,
Number 1,
January 1993
Volume 14,
Number 2,
March 1993
- David Pearson, Vijay V. Vazirani:
Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets.
171-179 BibTeX
- Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya:
Sublinear-Time Parallel Algorithms for Matching and Related Problems.
180-213 BibTeX
- Samir Khuller, Ramakrishna Thurimella:
Approximation Algorithms for Graph Augmentation.
214-225 BibTeX
- Janez Zerovnik, Tomaz Pisanski:
Computing the Diameter in Multiple-Loop Networks.
226-243 BibTeX
- Oscar H. Ibarra, Hui Wang, Tao Jiang:
On Efficient Parallel Algorithms for Solving Set Recurrence Equations.
244-257 BibTeX
- Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto:
Edge Separators of Planar and Outerplanar Graphs with Applications.
258-279 BibTeX
- Marek Karpinski, Michael Luby:
Approximating the Number of Zeroes of a GF[2] Polynomial.
280-287 BibTeX
- Sara Bitan, Shmuel Zaks:
Optimal Linear Broadcast.
288-315 BibTeX
- Yehuda Afek, Moty Ricklin:
Sparser: A Paradigm for Running Distributed Algorithms.
316-328 BibTeX
Volume 14,
Number 3,
May 1993
- Philip N. Klein:
Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs.
331-343 BibTeX
- Omer Berkman, Baruch Schieber, Uzi Vishkin:
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values.
344-370 BibTeX
- Prabhakar Ragde:
The Parallel Simplicity of Compaction and Chaining.
371-380 BibTeX
- Luc Devroye, Godfried T. Toussaint:
Convex Hulls for Random Lines.
381-394 BibTeX
- Christos Levcopoulos, Ola Petersson:
Adaptive Heapsort.
395-413 BibTeX
- James Aspnes:
Time- and Space-Efficient Randomized Consensus.
414-431 BibTeX
- Jirí Matousek:
Linear Optimization Queries.
432-448 BibTeX
- Yishay Mansour, Boaz Patt-Shamir:
Greedy Packet Scheduling on Shortest Paths.
449-465 BibTeX
- Biing-Feng Wang, Gen-Huey Chen, Kunsoo Park:
On the Set LCS and Set-Set LCS Problems.
466-477 BibTeX
- Bala Kalyanasundaram, Kirk Pruhs:
Online Weighted Matching.
478-488 BibTeX
Copyright © Sun May 17 00:06:07 2009
by Michael Ley (ley@uni-trier.de)