Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJournal of Algorithms, Volume 10
Volume 10, Number 1, March 1989
Steven Minsker:
The Towers of Hanoi Rainbow Problem: Coloring the Rings. 1-19Gary D. Knott, Pilar de la Torre:
Hash Table Collision Resolution with Direct Chaining. 20-34Marek Chrobak, Moti Yung:
Fast Algorithms for Edge-Coloring Planar Graphs. 35-51Hosam M. Mahmoud, Boris G. Pittel:
Analysis of the Space of Search Trees under the Random Insertion Algorithm. 52-75Yishay Mansour, Baruch Schieber:
Finding the Edge Connectivity of Directed Graphs. 76-85Yukon Chang, Susanne E. Hambrusch, Janos Simon:
On the Computational Complexity of Continuous Routing. 86-108Ellen B. Feinberg, Christos H. Papadimitriou:
Finding Feasible Paths for a Two-Point Body. 109-119David Bernstein, Michael Rodeh, Izidor Gertner:
Approximation Algorithms for Scheduling Arithmetic Expressions on Pipelined Machines. 120-139Robert Cypher, Jorge L. C. Sanz, L. Snyder:
Hypercube and Shuffle-Exchange Algorithms for Image Component Labeling. 140-150Yahya 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-169Ralf Hartmut Güting, Otto Nurmi, Thomas Ottmann:
Fast Algorithms for Direct Enclosures and Direct Dominances. 170-186Norishige Chiba, Takao Nishizeki:
The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs. 187-211Hugo Heusinger, Hartmut Noltemeier:
On Separable Clusterings. 212-227Patricio V. Poblete, J. Ian Munro:
Last-Come-First-Served Hashing. 228-248Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys:
The Parallel Complexity of TSP Heuristics. 249-270Charles J. Colbourn, Robert P. J. Day, Louis D. Nel:
Unranking and Ranking Spanning Trees of a Graph. 271-286Karl 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-326Michael T. Goodrich:
Triangulating a Polygon in Parallel. 327-351Colin McDiarmid, Bruce A. Reed:
Building Heaps Fast. 352-365Renzo Sprugnoli:
The Analysis of a Simple In-Place Merging Algorithm. 366-380David Fernández-Baca, Giora Slutzki:
Solving Parametric Problems on Trees. 381-402François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc:
Addition Chains Using Continued Fractions. 403-412Nancy M. Amato, Manuel Blum, Sandy Irani, Ronitt Rubinfeld:
Reversing Trains: A Turn of the Century Sorting Problem. 413-428Richard M. Karp, Michael Luby, Neal Madras:
Monte-Carlo Approximation Algorithms for Enumeration Problems. 429-448
Volume 10, Number 4, December 1989
Martin E. Dyer, Alan M. Frieze:
The Solution of Some Random NP-Hard Problems in Polynomial Expected Time. 451-489Ching-Tsun Chou, Inder S. Gopal:
Linear Broadcast Routing. 490-517Michelle L. Wachs:
On an Efficient Dynamic Programming Technique of F. F. Yao. 518-530James L. Hafner, Kevin S. McCurley:
On the Distribution of Running Times of Certain Integer Factoring Algorithms. 531-556Michael O. Rabin, Vijay V. Vazirani:
Maximum Matchings in General Graphs Through Randomization. 557-567Carsten Thomassen:
The Graph Genus Problem is NP-Complete. 568-576Carla D. Savage:
Gray Code Sequences of Partitions. 577-595
last updated on 2019-10-17 23:01 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
