External Links

    Journal: J. Algorithms

    Volume 2, Issue 4

    317 -- 327Norishige Chiba, Takao Nishizeki, Nobuji Saito. A Linear 5-Coloring Algorithm of Planar Graphs
    328 -- 336András Frank. A Weighted Matroid Intersection Algorithm
    337 -- 347D. T. Lee, C. K. Wong. Finding Intersection of Rectangles by Range Search
    348 -- 368Brenda S. Baker, Donna J. Brown, Howard P. Katseff. A 5/4 Algorithm for Two-Dimensional Packing
    369 -- 384Peter Eades, John Staples. On Optimal Trees
    385 -- 392David G. Cantor. Irreducible Polynomials with Integral Coefficients Have Succinct Certificates
    393 -- 405David S. Johnson. The NP-Completeness Column: An Ongoing Guide

    Volume 2, Issue 3

    211 -- 226Witold Lipski Jr., Christos H. Papadimitriou. A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems
    227 -- 244Lloyd Allison. Generating Coset Representatives for Permutation Groups
    245 -- 260Mark H. Overmars. Dynamization of Order Decomposable Set Problems
    261 -- 281Ephraim Feig. On Systems of Bilinear Forms Whose Minimal Division-Free Algorithms Are All Bilinear
    282 -- 300Jan van Leeuwen, Derick Wood. The Measure Problem for Rectangular Ranges in d-Space
    301 -- 310Victor Y. Pan. A Unified Approach to the Analysis of Bilinear Algorithms
    311 -- 313Shimon Even, Oded Goldreich. The Minimum-Length Generator Sequence Problem is NP-Hard
    314 -- 315Leonidas J. Guibas. Problems

    Volume 2, Issue 2

    107 -- 121Yossi Shiloach. Fast Canonization of Circular Strings
    122 -- 138T. C. Hu, M. T. Shing. An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon
    139 -- 143Robert Melville. A Time/Space Tradeoff for In-Place Array Permutation
    144 -- 163Victor Y. Pan. The Bit-Complexity of Arithmetic Algorithms
    164 -- 177Judea Pearl. A Space-Efficient On-Line Method of Computing Quantile Estimates
    178 -- 185William H. Burge. Stacks in a Two-Level Store
    186 -- 197Hossam A. ElGindy, David Avis. A Linear Algorithm for Computing the Visibility Polygon from a Point
    198 -- 203Reuven Bar-Yehuda, Shimon Even. A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem
    204 -- 207Herbert S. Wilf. The Uniform Selection of Free Trees
    208 -- 210Leonidas J. Guibas. Problems

    Volume 2, Issue 1

    1 -- 12Gideon Ehrlich. Searching and Sorting Real Numbers
    13 -- 21Jorge Olivos. On Vectorial Addition Chains
    22 -- 30Shlomo Moran, Yehoshua Perl. The Complexity of Identifying Redundant and Essential Elements
    31 -- 43David A. Klarner. An Algorithm to Determine When Certain Sets Have 0-Density
    44 -- 49Irvin Roy Hentzel, Leslie Hogben. Exhaustive Checking of Sparse Algebras
    50 -- 62Anthony Ralston. A New Memoryless Algorithm for De Bruijn Sequences
    63 -- 76Witold Lipski Jr., Franco P. Preparata. Segments, Rectangles, Contours
    77 -- 87Michael L. Fredman. The Spanning Bound as a Measure of Range Query Complexity
    88 -- 102Yossi Shiloach, Uzi Vishkin. Finding the Maximum, Merging, and Sorting in a Parallel Computation Model
    103 -- 104Leonidas J. Guibas. Problems
    105 -- 0Witold Lipski Jr., Franco P. Preparata. Erratum: Finding the Contour of a Union of Iso-Oriented Rectangles
    runs on