Volume 20,
Number 1,
January 1996
- Danny Krizanc:
Time-Randomness Trade-offs in Parallel Computation.
1-19 BibTeX
- Jens Lagergren:
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width.
20-44 BibTeX
- Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman:
Parallel Algorithms with Processor Failures and Delays.
45-86 BibTeX
- David M. Cohen, Michael L. Fredman:
Weighted Binary Trees for Concurrent Searching.
87-112 BibTeX
- André van Vliet:
On the Asymptotic Worst Case Behavior of Harmonic Fit.
113-136 BibTeX
- Yair Caro, András Sebö, Michael Tarsi:
Recognizing Greedy Structures.
137-156 BibTeX
- Jan Karel Lenstra, Marinus Veldhorst, Bart Veltman:
The Complexity of Scheduling Trees with Communication Delays.
157-173 BibTeX
- Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki:
A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs.
174-201 BibTeX
Volume 20,
Number 2,
March 1996
Dedicated to the Memory of Paris C. Kanellakis
- Alexander A. Shvartsman:
In Memoriam: Paris C. Kanellakis (1953-1995).
203-204 BibTeX
- Béla Bollobás, Trevor I. Fenner, Alan M. Frieze:
On the Best Case of Heapsort.
205-217 BibTeX
- Alon Itai, Hadas Shachnai:
Adaptive Source Routing in High-Speed Networks.
218-243 BibTeX
- Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya:
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons.
244-267 BibTeX
- Charles J. Colbourn, Wendy J. Myrvold, Eugene Neufeld:
Two Algorithms for Unranking Arborescences.
268-281 BibTeX
- Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
Multiobjektive Heuristic Search in AND/OR Graphs.
282-311 BibTeX
- Alan M. Frieze, Stephen Suen:
Analysis of Two Simple Heuristics on a Random Instance of k-SAT.
312-355 BibTeX
- Alessandro Panconesi, Aravind Srinivasan:
On the Complexity of Distributed Network Decomposition.
356-374 BibTeX
- Volker Heun, Ernst W. Mayr:
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube.
375-399 BibTeX
- David R. Karger, Steven J. Phillips, Eric Torng:
A Better Algorithm for an Ancient Scheduling Problem.
400-430 BibTeX
- Donald E. Knuth:
An Exact Analysis of Stable Allocation.
431-442 BibTeX
Volume 20, Number 3, May 1996
Copyright © Sun May 17 00:06:08 2009
by Michael Ley (ley@uni-trier.de)
