Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJournal of Algorithms, Volume 10
Volume 10, Number 1, March 1989
- Hosam M. Mahmoud, Boris Pittel:
Analysis of the Space of Search Trees under the Random Insertion Algorithm. 52-75 - Yukon Chang, Susanne E. Hambrusch, Janos Simon:
On the Computational Complexity of Continuous Routing. 86-108 - 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
- 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 - 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 - 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
- Martin E. Dyer, Alan M. Frieze:
The Solution of Some Random NP-Hard Problems in Polynomial Expected Time. 451-489 - James L. Hafner, Kevin S. McCurley:
On the Distribution of Running Times of Certain Integer Factoring Algorithms. 531-556 - Michael O. Rabin, Vijay V. Vazirani:
Maximum Matchings in General Graphs Through Randomization. 557-567
maintained by 
, founded at 
, founded at 
last updated on 2019-02-17 19:32 CET 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:
