Volume 23,
Number 1,
April 1997
- Vijaya Ramachandran:
Parallel Algorithms for Reducible Flow Graphs.
1-31
- Evangelos Kranakis, Danny Krizanc:
Distributed Computing on Anonymous Hypercube Networks.
32-50
- Michael T. Goodrich, Roberto Tamassia:
Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations.
51-73
- Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter:
Sequential and Parallel Approximation of Shortest Superstrings.
74-100
- Ishai Ben-Aroya, Ilan Newman, Assaf Schuster:
Randomized Single-Target Hot-Potato Routing.
101-120
- Karsten Weihe:
Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time.
121-138
- Mikkel Thorup:
Parallel Shortcutting of Rooted Trees.
139-159
- Ramakrishna Thurimella:
Sub-Linear Distributed Algorithms for Sparse Certificates and Biconnected Components.
160-179
- Juan A. Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung:
Efficient On-Line Call Control Algorithms.
180-194
- Boris Pittel, Robert S. Weishaar:
On-Line Coloring of Sparse Random Graphs and Random Trees.
195-205
Volume 23,
Number 2,
May 1997
- Martin Loebl, Jaroslav Nesetril:
Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder.
207-220
- C. Greg Plaxton, Torsten Suel:
Lower Bounds for Shellsort.
221-240
- Yair Bartal, Adi Rosén:
The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms.
241-264
- Magnús M. Halldórsson:
Parallel and On-Line Graph Coloring.
265-280
- Akiyoshi Shioura, Takeaki Uno:
A Linear Time Algorithm for Finding a k-Tree Core.
281-290
- Lisa Higham, David G. Kirkpatrick, Karl R. Abrahamson, Andrew Adler:
Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings.
291-328
- Biing-Feng Wang:
Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence.
345-358
- Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki:
An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs.
359-374
- David Eppstein:
Minimum Range Balanced Cuts via Dynamic Subset Sums.
375-385
- Phillip G. Bradford, Rudolf Fleischer, Michiel H. M. Smid:
More Efficient Parallel Totally Monotone Matrix Searching.
386-400
- Samir Khuller:
Problems.
401-403
Copyright © Mon Nov 2 21:43:00 2009
by Michael Ley (ley@uni-trier.de)
