External Links

    Journal: J. Algorithms

    Volume 5, Issue 4

    451 -- 470Gaston H. Gonnet, J. Ian Munro. The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform
    471 -- 487Jeffrey B. Remmel, Roger Whitney. Multiplying Schur functions
    488 -- 501Eli Shamir, Eli Upfal. Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces
    502 -- 525S. F. Assmann, David S. Johnson, Daniel J. Kleitman, Joseph Y.-T. Leung. On a Dual Version of the One-Dimensional Bin Packing Problem
    526 -- 530S. Louis Hakimi, Edward F. Schmeichel. An Adaptive Algorithm for System Level Diagnosis
    531 -- 546Eitan M. Gurari, Ivan Hal Sudborough. Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem
    547 -- 556Micha Hofri. A Probabilistic Analysis of the Next-Fit Bin Packing Algorithm
    557 -- 578Prakash V. Ramanan, Laurent Hyafil. New Algorithms for Selection
    579 -- 594Leonidas J. Guibas. Problems
    595 -- 609David S. Johnson. The NP-Completeness Column: An Ongoing Guide

    Volume 5, Issue 3

    303 -- 326Ralf Hartmut Güting. An Optimal Contour Algorithm for Iso-Oriented Rectangles
    327 -- 344Gadiel Seroussi, Abraham Lempel. On Symmetric Algorithms for Bilinear Forms over Finite Fields
    345 -- 362Derek G. Corneil, Mark K. Goldberg. A Non-Factorial Algorithm for Canonical Numbering of a Graph
    363 -- 366Leslie G. Valiant. Short Monotone Formulae for the Majority Function
    367 -- 374Yehoshua Perl. Optimum Split Trees
    375 -- 390Pierre Rosenstiehl, Robert Endre Tarjan. Gauss Codes, Planar Hamiltonian Graphs, and Stack-Sortable Permutations
    391 -- 407John R. Gilbert, Joan P. Hutchinson, Robert Endre Tarjan. A Separator Theorem for Graphs of Bounded Genus
    408 -- 421Thomas Lengauer. On the Solution of Inequality Systems Relevant to IC-Layout
    422 -- 432Michael G. Main, Richard J. Lorentz. An O(n log n) Algorithm for Finding All Repetitions in a String
    433 -- 447David S. Johnson. The NP-Completeness Column: An Ongoing Guide

    Volume 5, Issue 2

    163 -- 179David A. Plaisted. Heuristic Matching for Graphs Satisfying the Triangle Inequality
    180 -- 186Peter J. Weinberger. Finding the Number of Factors of a Polynomial
    187 -- 198M. Boshernitzan, Aviezri S. Fraenkel. A Linear Algorithm for Nonhomogeneous Spectra of Numbers
    199 -- 214Eljas Soisalon-Soininen, Derick Wood. Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles
    215 -- 230Richard P. Anstee, Martin Farber. Characterizations of Totally Balanced Matrices
    231 -- 246Christos H. Papadimitriou, Umesh V. Vazirani. On Two Geometric Problems Related to the Traveling Salesman Problem
    247 -- 280Nicholas C. Wormald. Generating Random Regular Graphs
    281 -- 283Ichiro Semba. An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set { 1, 2, ..., n } in Lexicographical Order
    284 -- 299David S. Johnson. The NP-Completeness Column: An Ongoing Guide

    Volume 5, Issue 1

    1 -- 6Dan Gusfield. Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines
    7 -- 21Gary D. Knott. Direct-Chaining with Coalescing Lists
    22 -- 35Joseph Y.-T. Leung. Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs
    36 -- 47Per-Åke Larson. Analysis of Hashing with Chaining in the Prime Area
    48 -- 59Danny Dolev, Manfred K. Warmuth. Scheduling Precedence Graphs of Bounded Height
    60 -- 68Alan C. Tucker, Donna Wilson. An O(N²) Algorithm for Coloring Perfect Planar Graphs
    69 -- 79Shou-Hsuan Stephen Huang, C. K. Wong. Optimal Binary Split Trees
    80 -- 131Harold N. Gabow, Robert Endre Tarjan. Efficient Algorithms for a Family of Matroid Intersection Problems
    132 -- 144Prakash V. Ramanan, Jitender S. Deogun, C. L. Liu. A Personnel Assignment Problem
    145 -- 146Leonidas J. Guibas. Problems
    147 -- 160David S. Johnson. The NP-Completeness Column: An Ongoing Guide
    runs on