External Links

    Journal: J. Algorithms

    Volume 8, Issue 4

    451 -- 469Janet A. Blumer. How Much is that DAWG in the Window? A Moving Window Algorithm for the Directed Acyclic Word Graph
    470 -- 479Joan Boyar, Howard J. Karloff. Coloring Planar Graphs in Parallel
    480 -- 502Mikhail J. Atallah, Susanne E. Hambrusch. On Bipartite Matchings of Minimum Density
    503 -- 535Joan M. Lucas. The Rotation Graph of Binary Trees is Hamiltonian
    536 -- 556Ouri Wolfson. The Virtues of Locking by Symbolic Names
    557 -- 571Jeffrey S. Salowe, William L. Steiger. Simplified Stable Merging Tasks
    572 -- 578Shankar M. Venkatesan. Improved Constants for Some Separator Theorems
    579 -- 591Lawrence L. Larmore. A Subquadratic Algorithm for Constructing Approximately Optimal Binary Search Trees
    592 -- 597Fanica Gavril. Generating the Maximum Spanning Trees of a Weighted Graph

    Volume 8, Issue 3

    305 -- 323Dorit S. Hochbaum, Wolfgang Maass. Fast Approximation Algorithms for a Nonconvex Covering Problem
    324 -- 336Shih Ping Tung. Computational Complexities of Diophantine Equations with Parameters
    337 -- 347Noga Alon, Zvi Galil, V. D. Milman. Better Expanders and Superconcentrators
    348 -- 361David P. Dobkin, Herbert Edelsbrunner. Space Searching for Intersecting Objects
    362 -- 371Donald W. Loveland. Finding Critical Sets
    372 -- 384Ten-Hwang Lai, Alan P. Sprague. On the Routability of a Convex Grid
    385 -- 394Stephen A. Cook, Pierre McKenzie. Problems Complete for Deterministic Logarithmic Space
    395 -- 404Michael F. Bridgland. Universal Traversal Sequences for Paths and Cycles
    405 -- 437David A. Plaisted, Jiarong Hong. A Heuristic Triangulation Algorithm
    438 -- 448David S. Johnson. The NP-Completeness Column: An Ongoing Guide

    Volume 8, Issue 2

    159 -- 172M. D. Atkinson. An Optimal Algorithm for Geometrical Congruence
    173 -- 191J. C. Lagarias, Andrew M. Odlyzko. Computing pi(x): An Analytic Method
    192 -- 215Daniel Leven, Micha Sharir. An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers
    216 -- 235Marshall W. Bern, Eugene L. Lawler, A. L. Wong. Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs
    236 -- 249Boris Pittel. Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records
    250 -- 259Vojtech Rödl, C. Tovey. Multiple Optima in Local Search
    260 -- 284Thomas Lengauer. Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs
    285 -- 303David S. Johnson. The NP-Completeness Column: An Ongoing Guide

    Volume 8, Issue 1

    1 -- 18Hiroshi Imai, Takao Asano. Dynamic Orthogonal Segment Intersection Search
    19 -- 38Richard Cole, Chee-Keng Yap. Shape from Probing
    39 -- 52Howard J. Karloff, David B. Shmoys. Efficient Parallel Algorithms for Edge Coloring Problems
    53 -- 65Jan K. Pachl. A Lower Bound for Probabilistic Distributed Algorithms
    66 -- 94Alejandro A. Schäffer, Christopher J. Van Wyk. Convex Hulls of Piecewise-Smooth Jordan Curves
    95 -- 105George Steiner. Searching in 2-Dimensional Partial Orders
    106 -- 112Moon-Jung Chung. O(n^(2.55)) Time Algorithms for the Subgraph Homeomorphism Problem on Trees
    113 -- 121John L. Mohammed, Carlos S. Subi. An Improved Block-Interchange Algorithm
    122 -- 130George K. Georgakopoulos, Christos H. Papadimitriou. The 1-Steiner Tree Problem
    131 -- 145Helaman R. P. Ferguson. A Noninductive GL(n, Z) Algorithm That Constructs Integral Linear Relations for n Z-Linearly Dependent Real Numbers
    146 -- 156Shou-Hsuan Stephen Huang. Optimal Multiway Split Trees
    runs on