Volume 10,
Number 1,
March 1989
- Steven Minsker:
The Towers of Hanoi Rainbow Problem: Coloring the Rings.
1-19
- Gary D. Knott, Pilar de la Torre:
Hash Table Collision Resolution with Direct Chaining.
20-34
- Marek Chrobak, Moti Yung:
Fast Algorithms for Edge-Coloring Planar Graphs.
35-51
- Hosam M. Mahmoud, Boris Pittel:
Analysis of the Space of Search Trees under the Random Insertion Algorithm.
52-75
- Yishay Mansour, Baruch Schieber:
Finding the Edge Connectivity of Directed Graphs.
76-85
- Yukon Chang, Susanne E. Hambrusch, Janos Simon:
On the Computational Complexity of Continuous Routing.
86-108
- Ellen B. Feinberg, Christos H. Papadimitriou:
Finding Feasible Paths for a Two-Point Body.
109-119
- David Bernstein, Michael Rodeh, Izidor Gertner:
Approximation Algorithms for Scheduling Arithmetic Expressions on Pipelined Machines.
120-139
- Robert Cypher, Jorge L. C. Sanz, L. Snyder:
Hypercube and Shuffle-Exchange Algorithms for Image Component Labeling.
140-150
- Yahya Ould Hamidoune, David Roeder, Steven Janke, Todd Feil, Richard Koo:
The Probability of Splitters in a List.
151-154
Volume 10,
Number 2,
June 1989
- Gad M. Landau, Uzi Vishkin:
Fast Parallel and Serial Approximate String Matching.
157-169
- Ralf Hartmut Güting, Otto Nurmi, Thomas Ottmann:
Fast Algorithms for Direct Enclosures and Direct Dominances.
170-186
- Norishige Chiba, Takao Nishizeki:
The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs.
187-211
- Hugo Heusinger, Hartmut Noltemeier:
On Separable Clusterings.
212-227
- Patricio V. Poblete, J. Ian Munro:
Last-Come-First-Served Hashing.
228-248
- Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys:
The Parallel Complexity of TSP Heuristics.
249-270
- Charles J. Colbourn, Robert P. J. Day, Louis D. Nel:
Unranking and Ranking Spanning Trees of a Graph.
271-286
- Karl R. Abrahamson, Norm Dadoun, David G. Kirkpatrick, Teresa M. Przytycka:
A Simple Parallel Tree Contraction Algorithm.
287-302
Volume 10,
Number 3,
September 1989
- Prakash V. Ramanan, Donna J. Brown, C. C. Lee, D. T. Lee:
On-Line Bin Packing in Linear Time.
305-326
- Michael T. Goodrich:
Triangulating a Polygon in Parallel.
327-351
- Colin McDiarmid, Bruce A. Reed:
Building Heaps Fast.
352-365
- Renzo Sprugnoli:
The Analysis of a Simple In-Place Merging Algorithm.
366-380
- David Fernández-Baca, Giora Slutzki:
Solving Parametric Problems on Trees.
381-402
- François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc:
Addition Chains Using Continued Fractions.
403-412
- Nancy M. Amato, Manuel Blum, Sandy Irani, Ronitt Rubinfeld:
Reversing Trains: A Turn of the Century Sorting Problem.
413-428
- Richard M. Karp, Michael Luby, Neal Madras:
Monte-Carlo Approximation Algorithms for Enumeration Problems.
429-448
Volume 10,
Number 4,
December 1989
Last update Mon Feb 13 04:51:15 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
