External Links

    Journal: J. Algorithms

    Volume 11, Issue 4

    523 -- 563William M. Kantor. Finding Sylow Normalizers in Polynomial Time
    564 -- 580David M. Mount, Ruth Silverman. Packing and Covering the Plane with Translates of a Convex Polygon
    581 -- 621Dennis Shasha, Kaizhong Zhang. Fast Algorithms for the Unit Cost Editing Distance Between Trees
    622 -- 630Yishay Mansour, Leonard J. Schulman. Sorting on a Ring of Processors
    631 -- 643Hans L. Bodlaender. Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees
    644 -- 654Johan Håstad. Tensor Rank is NP-Complete

    Volume 11, Issue 3

    307 -- 341Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg. Improved Routing Strategies with Succinct Tables
    342 -- 373Baruch Awerbuch. On the Effects of Feedback in Dynamic Network Protocols
    374 -- 419Gil Neiger, Sam Toueg. Automatically Increasing the Fault-Tolerance of Distributed Algorithms
    420 -- 440Ofer Biran, Shlomo Moran, Shmuel Zaks. A Combinatorial Characterization of the Distributed 1-Solvable Tasks
    441 -- 461James Aspnes, Maurice Herlihy. Fast Randomized Consensus Using Shared Memory
    462 -- 491David B. Johnson, Willy Zwaenepoel. Recovery in Distributed Systems Using Optimistic Message Logging and Checkpointing
    492 -- 521Ming-Deh A. Huang, Shang-Hua Teng. Security, Verifiability, and Universality in Distributed Computing

    Volume 11, Issue 2

    153 -- 184Francine Berman, David S. Johnson, Frank Thomson Leighton, Peter W. Shor, Larry Snyder. Generalized Planar Matching
    185 -- 207Vidyadhar G. Kulkarni. Generating Random Combinatorial Objects
    208 -- 230Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator. Competitive Algorithms for Server Problems
    231 -- 241Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, G. Sullivan. A Parallel Fault Identification Algorithm
    242 -- 251Mark Allen Weiss, Robert Sedgewick. Tight Lower Bounds for Shellsort
    252 -- 284Gur Saran Adhar, Shietung Peng. Parallel Algorithms for Cographs and Parity Graphs with Applications
    285 -- 304Eytan Ronn. NP-Complete Stable Matching Problems

    Volume 11, Issue 1

    1 -- 26Hazel Everett, Derek G. Corneil. Recognizing Visibility Graphs of Spiral Polygons
    27 -- 43Liwu Li, T. Anthony Marsland. Probability-Based Game Tree Pruning
    44 -- 51Yuejiang Huang. A New Algorithm for the Generation of Binary de Bruijn Sequences
    52 -- 67Brendan D. McKay, Nicholas C. Wormald. Uniform Generation of Random Regular Graphs of Moderate Degree
    68 -- 84Frank Ruskey, Andrzej Proskurowski. Generating Binary Trees by Transpositions
    85 -- 101David Eppstein. Sequence Comparison with Mixed Convex and Concave Costs
    102 -- 116Marek Chrobak, Takao Nishizeki. Improved Edge-Coloring Algorithms for Planar Graphs
    117 -- 131H. R. Morton, H. B. Short. Calculating the 2-Variable Polynomial for Knots Presented as Closed Braids
    132 -- 143Joseph Naor, Mark B. Novick. An Efficient Reconstruction of a Graph from its Line Graph in Parallel
    144 -- 151David S. Johnson. The NP-Completeness Column: An Ongoing Guide
    runs on