Table of contents for issues of SIAM Journal on Computing

Last update: Sat Mar 30 12:37:19 MDT 2019                Valid HTML 3.2!

Volume 1, Number 1, 1972
Volume 1, Number 2, 1972
Volume 1, Number 3, 1972
Volume 1, Number 4, 1972
Volume 2, Number 1, 1973
Volume 2, Number 2, 1973
Volume 2, Number 3, August, 1973
Volume 2, Number 4, 1973
Volume 3, Number 1, 1974
Volume 3, Number 2, 1974
Volume 3, Number 3, 1974
Volume 3, Number 4, 1974
Volume 4, Number 1, 1975
Volume 4, Number 2, June, 1975
Volume 4, Number 3, 1975
Volume 4, Number 4, 1975
Volume 5, Number 1, 1976
Volume 5, Number 2, June, 1976
Volume 5, Number 3, 1976
Volume 5, Number 4, 1976
Volume 6, Number 1, 1977
Volume 6, Number 2, 1977
Volume 6, Number 3, 1977
Volume 6, Number 4, 1977
Volume 7, Number 1, 1978
Volume 7, Number 2, 1978
Volume 7, Number 3, 1978
Volume 7, Number 4, 1978
Volume 8, Number 1, 1979
Volume 8, Number 2, 1979
Volume 8, Number 3, 1979
Volume 8, Number 4, 1979
Volume 9, Number 1, 1980
Volume 9, Number 2, 1980
Volume 9, Number 3, 1980
Volume 9, Number 4, 1980
Volume 10, Number 1, 1981
Volume 10, Number 2, 1981
Volume 10, Number 3, 1981
Volume 10, Number 4, 1981
Volume 11, Number 1, 1982
Volume 11, Number 2, 1982
Volume 11, Number 3, 1982
Volume 11, Number 4, 1982
Volume 12, Number 1, 1983
Volume 12, Number 2, 1983
Volume 12, Number 3, 1983
Volume 12, Number 4, 1983
Volume 13, Number 1, 1984
Volume 13, Number 2, 1984
Volume 13, Number 3, 1984
Volume 13, Number 4, 1984
Volume 14, Number 1, 1985
Volume 14, Number 2, 1985
Volume 14, Number 3, 1985
Volume 14, Number 4, 1985
Volume 15, Number 1, 1986
Volume 15, Number 2, 1986
Volume 15, Number 3, 1986
Volume 15, Number 4, 1986
Volume 16, Number 1, February, 1987
Volume 16, Number 2, April, 1987
Volume 16, Number 3, June, 1987
Volume 16, Number 4, August, 1987
Volume 16, Number 5, October, 1987
Volume 16, Number 6, December, 1987
Volume 17, Number 1, February, 1988
Volume 17, Number 2, April, 1988
Volume 17, Number 3, June, 1988
Volume 17, Number 4, August, 1988
Volume 17, Number 5, October, 1988
Volume 17, Number 6, December, 1988
Volume 18, Number 1, February, 1989
Volume 18, Number 2, April, 1989
Volume 18, Number 3, June, 1989
Volume 18, Number 4, August, 1989
Volume 18, Number 5, October, 1989
Volume 18, Number 6, December, 1989
Volume 19, Number 1, February, 1990
Volume 19, Number 2, April, 1990
Volume 19, Number 3, June, 1990
Volume 19, Number 4, August, 1990
Volume 19, Number 5, October, 1990
Volume 19, Number 6, December, 1990
Volume 20, Number 1, February, 1991
Volume 20, Number 2, April, 1991
Volume 20, Number 3, June, 1991
Volume 20, Number 4, August, 1991
Volume 20, Number 5, October, 1991
Volume 20, Number 6, December, 1991
Volume 21, Number 1, February, 1992
Volume 21, Number 2, April, 1992
Volume 21, Number 3, June, 1992
Volume 21, Number 4, August, 1992
Volume 21, Number 5, October, 1992
Volume 21, Number 6, December, 1992
Volume 22, Number 1, February, 1993
Volume 22, Number 2, April, 1993
Volume 22, Number 3, June, 1993
Volume 22, Number 4, August, 1993
Volume 22, Number 5, October, 1993
Volume 22, Number 6, December, 1993
Volume 23, Number 1, February, 1994
Volume 23, Number 2, April, 1994
Volume 23, Number 3, June, 1994
Volume 23, Number 4, August, 1994
Volume 23, Number 5, October, 1994
Volume 23, Number 6, December, 1994
Volume 24, Number 1, February, 1995
Volume 24, Number 2, April, 1995
Volume 24, Number 3, June, 1995
Volume 24, Number 4, June, 1995
Volume 24, Number 5, October, 1995
Volume 24, Number 6, December, 1995
Volume 25, Number 1, February, 1996
Volume 25, Number 2, April, 1996
Volume 25, Number 3, June, 1996
Volume 25, Number 4, August, 1996
Volume 25, Number 5, October, 1996
Volume 25, Number 6, December, 1996
Volume 26, Number 1, February, 1997
Volume 26, Number 2, April, 1997
Volume 26, Number 3, June, 1997
Volume 26, Number 4, August, 1997
Volume 26, Number 5, October, 1997
Volume 26, Number 6, December, 1997
Volume 27, Number 1, February, 1998
Volume 27, Number 2, April, 1998
Volume 27, Number 3, June, 1998
Volume 27, Number 4, August, 1998
Volume 27, Number 5, October, 1998
Volume 27, Number 6, December, 1998
Volume 28, Number 1, February, 1998
Volume 28, Number 2, April, 1998
Volume 28, Number 3, June, 1998
Volume 28, Number 4, August, 1999
Volume 28, Number 5, October, 1999
Volume 28, Number 6, December, 1999
Volume 29, Number 1, February, 1999
Volume 29, Number 2, April, 1999
Volume 29, Number 3, June, 1999
Volume 29, Number 4, August, 2000
Volume 29, Number 5, October, 2000
Volume 29, Number 6, December, 2000
Volume 30, Number 1, February, 2000
Volume 30, Number 2, April, 2000
Volume 30, Number 3, June, 2000
Volume 30, Number 4, August, 2000
Volume 30, Number 5, October, 2000
Volume 30, Number 6, December, 2001
Volume 31, Number 1, February, 2001
Volume 31, Number 2, April, 2001
Volume 31, Number 3, June, 2001
Volume 31, Number 4, August, 2002
Volume 31, Number 5, October, 2002
Volume 31, Number 6, December, 2002
Volume 32, Number 1, February, 2002
Volume 32, Number 2, April, 2003
Volume 32, Number 3, June, 2003
Volume 32, Number 4, August, 2003
Volume 32, Number 5, October, 2003
Volume 32, Number 6, December, 2003
Volume 33, Number 1, February, 2003
Volume 33, Number 2, April, 2004
Volume 33, Number 3, June, 2004
Volume 33, Number 4, August, 2004
Volume 33, Number 5, October, 2004
Volume 33, Number 6, December, 2004
Volume 34, Number 1, February, 2004
Volume 34, Number 2, April, 2004
Volume 34, Number 3, June, 2005
Volume 34, Number 4, August, 2005
Volume 34, Number 5, October, 2005
Volume 34, Number 6, December, 2005
Volume 35, Number 1, 2005
Volume 35, Number 2, 2005
Volume 35, Number 3, 2005
Volume 35, Number 4, 2006
Volume 35, Number 5, 2006
Volume 35, Number 6, 2006
Volume 36, Number 1, 2006
Volume 36, Number 2, 2006
Volume 36, Number 3, 2006
Volume 36, Number 4, 2006
Volume 36, Number 5, 2007
Volume 36, Number 6, 2007
Volume 37, Number 1, 2007
Volume 37, Number 2, 2007
Volume 37, Number 3, 2007
Volume 37, Number 4, 2007
Volume 37, Number 5, 2008
Volume 37, Number 6, 2008
Volume 38, Number 1, 2008
Volume 38, Number 2, 2008
Volume 38, Number 3, 2008
Volume 38, Number 4, 2008
Volume 38, Number 5, 2009
Volume 38, Number 6, 2009
Volume 39, Number 1, 2009
Volume 39, Number 2, 2009
Volume 39, Number 3, 2009
Volume 39, Number 4, 2010
Volume 39, Number 5, 2010
Volume 39, Number 6, 2010
Volume 39, Number 7, 2010
Volume 39, Number 8, 2010
Volume 40, Number 1, 2011
Volume 40, Number 2, 2011
Volume 40, Number 3, 2011
Volume 40, Number 4, 2011
Volume 40, Number 5, 2011
Volume 40, Number 6, 2011
Volume 41, Number 1, 2012
Volume 41, Number 2, 2012
Volume 41, Number 3, 2012
Volume 41, Number 4, 2012
Volume 41, Number 5, 2012
Volume 41, Number 6, 2012
Volume 42, Number 1, 2013
Volume 42, Number 2, 2013
Volume 42, Number 3, 2013
Volume 42, Number 4, 2013
Volume 42, Number 5, 2013
Volume 42, Number 6, 2013
Volume 43, Number 1, 2014
Volume 43, Number 2, 2014
Volume 43, Number 3, 2014
Volume 43, Number 4, 2014
Volume 43, Number 5, 2014
Volume 43, Number 6, 2014
Volume 44, Number 1, 2015
Volume 44, Number 2, 2015
Volume 44, Number 3, 2015
Volume 44, Number 4, 2015
Volume 44, Number 5, 2015
Volume 44, Number 6, 2015
Volume 45, Number 1, 2016
Volume 45, Number 2, 2016
Volume 45, Number 3, 2016
Volume 45, Number 4, 2016
Volume 45, Number 5, 2016
Volume 45, Number 6, 2016
Volume 46, Number 1, 2017
Volume 46, Number 2, 2017
Volume 46, Number 3, 2017
Volume 46, Number 4, 2017
Volume 46, Number 5, 2017
Volume 46, Number 6, 2017


SIAM Journal on Computing
Volume 1, Number 1, 1972

              Alfred V. Aho and   
              Jeffrey D. Ullman   Optimization of Straight Line Programs   1--19
                 Ronald V. Book   Terminal Context in Context-Sensitive
                                  Grammars . . . . . . . . . . . . . . . . 20--30
                F. K. Hwang and   
                         S. Lin   A Simple Algorithm for Merging Two
                                  Disjoint Linearly Ordered Sets . . . . . 31--39
            Arnold L. Rosenberg   Symmetries in Data Graphs  . . . . . . . 40--65
        Robert L. Constable and   
                    Gries David   On Classes of Program Schemata . . . . . 66--118
              Raymond E. Miller   Some Undecidability Results for Parallel
                                  Program Schemata . . . . . . . . . . . . 119--129
            Philip M. Lewis, II   Preface  . . . . . . . . . . . . . . . . v--vi

SIAM Journal on Computing
Volume 1, Number 2, 1972

                  A. V. Aho and   
                M. R. Garey and   
                   J. D. Ullman   The Transitive Reduction of a Directed
                                  Graph  . . . . . . . . . . . . . . . . . 131--137
                Donald P. Gaver   Asymptotic Service System Output, with
                                  Application to Multiprogramming  . . . . 138--145
               Robert E. Tarjan   Depth First Search and Linear Graph
                                  Algorithms . . . . . . . . . . . . . . . 146--160
                Alan G. Konheim   A Note on Merging  . . . . . . . . . . . 161--166
                    J. F. Traub   Computational Complexity of Iterative
                                  Processes  . . . . . . . . . . . . . . . 167--179
              F\uanic\ua Gavril   Algorithms for Minimum Coloring, Maximum
                                  Clique, Minimum Covering by Cliques, and
                                  Maximum Independent Set of a Chordal
                                  Graph  . . . . . . . . . . . . . . . . . 180--187
           Matthew S. Hecht and   
              Jeffrey D. Ullman   Flow Graph Reducibility  . . . . . . . . 188--202

SIAM Journal on Computing
Volume 1, Number 3, 1972

                  D. M. Jackson   Expectations of Functions of Sequences
                                  over Finite Alphabets with Given
                                  Transition Probabilities by Methods
                                  Independent of Sequence Length . . . . . 203--217
              G. S. Shedler and   
                        C. Tung   Locality in Page Reference Strings . . . 218--241
               Steven Brown and   
                David Gries and   
               Thomas Szymanski   Program Schemes with Pushdown Stores . . 242--268
              E. G. Coffman and   
               L. A. Klimko and   
                   Barbara Ryan   Analysis of Scanning Policies for
                                  Reducing Disk Seek Times . . . . . . . . 269--279

SIAM Journal on Computing
Volume 1, Number 4, 1972

                 Ronald V. Book   On Languages Accepted in Polynomial Time 281--287
                Leonard J. Bass   A Note on the Intersection of Complexity
                                  Classes of Functions . . . . . . . . . . 288--289
                      C. L. Liu   Analysis and Synthesis of Sorting
                                  Algorithms . . . . . . . . . . . . . . . 290--304
              Alfred V. Aho and   
             Thomas G. Peterson   A Minimum Distance Error-Correcting
                                  Parser for Context-Free Languages  . . . 305--312
        Richard B. Kieburtz and   
                  David Luckham   Compatibility and Complexity of
                                  Refinements of the Resolution Principle  313--332
        Michael A. Harrison and   
                  Ivan M. Havel   Real-Time Strict Deterministic Languages 333--349
             Edward M. Reingold   Infix to Prefix Translation: The
                                  Insufficiency of a Pushdown Stack  . . . 350--353


SIAM Journal on Computing
Volume 2, Number 1, 1973

                E. A. Akkoyunlu   The Enumeration of Maximal Cliques of
                                  Large Graphs . . . . . . . . . . . . . . 1--6
                C. L. Chang and   
               R. C. T. Lee and   
                    J. K. Dixon   The Specialization of Programs by
                                  Theorem Proving  . . . . . . . . . . . . 7--15
                 S. Goodman and   
                  S. Hedetniemi   Eulerian Walks in Graphs . . . . . . . . 16--27
                    P. M. Spira   A New Algorithm for Finding All Shortest
                                  Paths in a Graph of Positive Arcs in
                                  Average Time $O(n^2 \log ^2 n)$  . . . . 28--32
              J. Nievergelt and   
                 E. M. Reingold   Binary Search Trees of Bounded Balance   33--43
               S. G. Williamson   Isomorph Rejection and a Theorem of de
                                  Bruijn . . . . . . . . . . . . . . . . . 44--59
        Michael S. Paterson and   
            Larry J. Stockmeyer   On the Number of Nonscalar
                                  Multiplications Necessary to Evaluate
                                  Polynomials  . . . . . . . . . . . . . . 60--66

SIAM Journal on Computing
Volume 2, Number 2, 1973

             J. Robert Jump and   
              P. S. Thiagarajan   On the Equivalence of Asynchronous
                                  Control Structures . . . . . . . . . . . 67--87
                John H. Holland   Genetic Algorithms and the Optimal
                                  Allocation of Trials . . . . . . . . . . 88--105
                  A. V. Aho and   
                   J. D. Ullman   A Technique for Speeding up
                                  ${\text{LR}}(k)$ Parsers . . . . . . . . 106--127
               Phillip J. Chase   Transposition Graphs . . . . . . . . . . 128--133

SIAM Journal on Computing
Volume 2, Number 3, August, 1973

             J. E. Hopcroft and   
                   R. E. Tarjan   Dividing a Graph into Triconnected
                                  Components . . . . . . . . . . . . . . . 135--158
             J. E. Hopcroft and   
                    J. Musinski   Duality Applied to the Complexity of
                                  Matrix Multiplication and Other Bilinear
                                  Forms  . . . . . . . . . . . . . . . . . 159--173
              Walter J. Savitch   How to Make Arbitrary Grammars Look Like
                                  Context-Free Grammars  . . . . . . . . . 174--182
                D. P. Gaver and   
                  G. S. Shedler   Approximate Models for Processor
                                  Utilization in Multiprogrammed Computer
                                  Systems  . . . . . . . . . . . . . . . . 183--192
              Toshihide Ibaraki   Finite State Representations of Discrete
                                  Optimization Problems  . . . . . . . . . 193--210
                  Robert Tarjan   Enumeration of the Elementary Circuits
                                  of a Directed Graph  . . . . . . . . . . 211--216

SIAM Journal on Computing
Volume 2, Number 4, 1973

              Loren Haskins and   
                 Donald J. Rose   Toward Characterization of Perfect
                                  Elimination Digraphs . . . . . . . . . . 217--224
           John E. Hopcroft and   
                Richard M. Karp   An $n^{5/2}$ algorithm for maximum
                                  matchings in bipartite graphs  . . . . . 225--231
           Stephen S. Lavenberg   Queueing Analysis of a Multiprogrammed
                                  Computer System Having a Multilevel
                                  Storage Hierarchy  . . . . . . . . . . . 232--252
                     J. C. Dunn   Continuous Group Averaging and Pattern
                                  Classification Problems  . . . . . . . . 253--272
                     L. J. Bass   On Optimal Processor Scheduling for
                                  Multiprogramming . . . . . . . . . . . . 273--280
            Walter B. McRae and   
             Ernest R. Davidson   An algorithm for the extreme rays of a
                                  pointed convex polyhedral cone . . . . . 281--293
             J. E. Hopcroft and   
                   J. D. Ullman   Set Merging Algorithms . . . . . . . . . 294--303
             Sheila A. Greibach   The Hardest Context-Free Language  . . . 304--310
              D. G. Corneil and   
                      B. Graham   An algorithm for determining the
                                  chromatic number of a graph  . . . . . . 311--318


SIAM Journal on Computing
Volume 3, Number 1, 1974

              George E. Collins   The Computing Time of the Euclidean
                                  Algorithm  . . . . . . . . . . . . . . . 1--10
                R. R. Muntz and   
                   H. Opderbeck   Stack Replacement Algorithms for
                                  Two-Level Directly Addressable Paged
                                  Memories . . . . . . . . . . . . . . . . 11--22
               R. E. Osteen and   
                      P. P. Lin   Picture Skeletons Based on
                                  Eccentricities of Points of Minimum
                                  Spanning Trees . . . . . . . . . . . . . 23--40
            Jay P. Fillmore and   
               S. G. Williamson   On Backtracking: a Combinatorial
                                  Description of the Algorithm . . . . . . 41--55
          Jean Francois Pacault   Computing the Weak Components of a
                                  Directed Graph . . . . . . . . . . . . . 56--61
                  Robert Tarjan   Finding Dominators in Directed Graphs    62--89
                 Curtis R. Cook   First Order Graph Grammars . . . . . . . 90--99

SIAM Journal on Computing
Volume 3, Number 2, 1974

                    M. R. Garey   Optimal Binary Search Trees with
                                  Restricted Maximal Depth . . . . . . . . 101--110
                 S. A. Greibach   Jump PDA's and Hierarchies of
                                  Deterministic Context-Free Languages . . 111--127
                Volker Strassen   Polynomials with Rational Coefficients
                                  Which are Hard to Compute  . . . . . . . 128--149
                 John E. Savage   An Algorithm for the Computation of
                                  Linear Forms . . . . . . . . . . . . . . 150--158

SIAM Journal on Computing
Volume 3, Number 3, 1974

                 Y. S. Chua and   
                A. J. Bernstein   Analysis of a Feedback Scheduler . . . . 159--176
               David M. Perlman   Isomorph Rejection on Power Sets . . . . 177--183
                Oscar H. Ibarra   A Hierarchy Theorem for Polynomial-Space
                                  Recognition  . . . . . . . . . . . . . . 184--187
                       T. C. Hu   Optimum Communication Spanning Trees . . 188--195
             Richard J. Fateman   Polynomial Multiplication, Powers, and
                                  asymptotic Analysis: Some Comments . . . 196--213
              S. E. Goodman and   
               S. T. Hedetniemi   On Hamiltonian Walks in Graphs . . . . . 214--221
                J. M. Adams and   
               J. M. Phelan and   
                    R. H. Stark   A Note on the Hecht-Ullman
                                  Characterization of Nonreducible Flow
                                  Graphs . . . . . . . . . . . . . . . . . 222--223
                Susan L. Graham   On Bounded Right Context Languages and
                                  Grammars . . . . . . . . . . . . . . . . 224--254

SIAM Journal on Computing
Volume 3, Number 4, 1974

                  M. D. McIlroy   The Number of $1$'s in Binary Integers:
                                  Bounds and Extremal Properties . . . . . 255--261
                   Sartaj Sahni   Computationally Related Problems . . . . 262--279
                 D. J. Kleitman   A Note on Perfect Elimination Digraphs   280--282
                Ronald Book and   
              Maurice Nivat and   
               Michael Paterson   Reversal-Bounded Acceptors and
                                  Intersections of Linear Languages  . . . 283--295
                 Sukhamay Kundu   Existence of Graphs with Three Spanning
                                  Trees and Given Degree Sequence  . . . . 296--298
              D. S. Johnson and   
                  A. Demers and   
               J. D. Ullman and   
                M. R. Garey and   
                   R. L. Graham   Worst-case Performance Bounds for Simple
                                  One-dimensional Packing Algorithms . . . 299--325
                John H. Holland   Erratum: Genetic Algorithms and the
                                  Optimal Allocation of Trials . . . . . . 326--326


SIAM Journal on Computing
Volume 4, Number 1, 1975

               J. Hartmanis and   
                    T. P. Baker   On Simple Goedel Numberings and
                                  Translations . . . . . . . . . . . . . . 1--11
               Dennis P. Geller   Realization with Feedback Encoding. I:
                                  Analogues of the Classical Theory  . . . 12--33
               Dennis P. Geller   Realization with Feedback Encoding. II:
                                  Applications to Distinguishing Sequences 34--48
               Robert Mandl and   
                    Thomas Vari   Computational Complexity of Inner
                                  Products of Vectors (And That of Other
                                  Bilinear Forms) over a Noncommutative
                                  Ring (Auxiliary Functions Allowed) . . . 49--55
              Kapali P. Eswaran   Faithful Representation of a Family of
                                  Sets by a Set of Intervals . . . . . . . 56--68
            Jeanne Ferrante and   
                Charles Rackoff   A Decision Procedure for the First Order
                                  Theory of Real Addition with Order . . . 69--76
              Donald B. Johnson   Finding All the Elementary Circuits of a
                                  Directed Graph . . . . . . . . . . . . . 77--84
               Eugene S. Santos   State-Splitting for Stochastic Machines  85--96

SIAM Journal on Computing
Volume 4, Number 2, June, 1975

                    Webb Miller   Computational Complexity and Numerical
                                  Stability  . . . . . . . . . . . . . . . 97--107
            S. S. Lavenberg and   
                  G. S. Shedler   Derivation of Confidence Intervals for
                                  Work Rate Estimators in a Closed
                                  Queueing Network . . . . . . . . . . . . 108--124
            Edward Ashcroft and   
                    Zohar Manna   Translating Program Schemas to
                                  While-Schemas  . . . . . . . . . . . . . 125--146
                 D. J. Kuck and   
                    K. Maruyama   Time Bounds on the Parallel Evaluation
                                  of Arithmetic Expressions  . . . . . . . 147--162
            Andrew D. Hall, Jr.   Solving a problem in eigenvalue
                                  approximation with a symbolic algebra
                                  system . . . . . . . . . . . . . . . . . 163--174
                 Abraham Lempel   Matrix Factorization over ${GF}(2)$ and
                                  Trace-Orthogonal Bases of ${GF}(2^n )$   175--186
                M. R. Garey and   
                   R. L. Graham   Bounds for Multiprocessor Scheduling
                                  with Resource Constraints  . . . . . . . 187--200
             Ellis Horowitz and   
                   Sartaj Sahni   The Computation of Powers of Symbolic
                                  Polynomials  . . . . . . . . . . . . . . 201--208

SIAM Journal on Computing
Volume 4, Number 3, 1975

                D. E. White and   
               S. G. Williamson   Computational Algorithms for the
                                  Enumeration of Group Invariant
                                  Partitions . . . . . . . . . . . . . . . 209--213
               Vaughan R. Pratt   Every Prime Has a Succinct Certificate   214--220
                     F. Hadlock   Finding a Maximum Cut of a Planar Graph
                                  in Polynomial Time . . . . . . . . . . . 221--225
                     Ravi Sethi   Complete Register Allocation Problems    226--248
           Ashok K. Chandra and   
                     C. K. Wong   Worst-Case Analysis of a Placement
                                  Algorithm Related to Storage Allocation  249--263
 R. L. (Scot) Drysdale, III and   
                 Frank H. Young   Improved Divide/Sort/Merge Sorting
                                  Networks . . . . . . . . . . . . . . . . 264--270
                 R. M. Karp and   
             A. C. McKellar and   
                     C. K. Wong   Near-Optimal Solutions to a
                                  $2$-Dimensional Placement Problem  . . . 271--286
            Arnold L. Rosenberg   Managing Storage for Extendible Arrays   287--306
          H. R. Strong, Jr. and   
      A. Maggiolo-Schettini and   
                    B. K. Rosen   Recursion Structure Simplification . . . 307--320
                   R. Bumby and   
                  E. Cooper and   
                       D. Latch   Interactive Computation of Homology of
                                  Finite Partially Ordered Sets  . . . . . 321--325
               Vaughan R. Pratt   The Power of Negative Thinking in
                                  Multiplying Boolean Matrices . . . . . . 326--330
                S. Rao Kosaraju   Speed of Recognition of Context-Free
                                  Languages by Array Automata  . . . . . . 331--340
                   W. H. Hosken   Optimum Partitions of Tree Addressing
                                  Structures . . . . . . . . . . . . . . . 341--347
              Leslie G. Valiant   Parallelism in Comparison Problems . . . 348--355
               H. Opderbeck and   
                      W. W. Chu   The Renewal Model for Program Behavior   356--374
                P. M. Spira and   
                         A. Pan   On Finding and Updating Spanning Trees
                                  and Shortest Paths . . . . . . . . . . . 375--380
                       L. Revah   On the Number of
                                  Multiplications/Divisions Evaluating a
                                  Polynomial with Auxiliary Functions  . . 381--392
                    Shimon Even   An Algorithm for Determining Whether the
                                  Connectivity of a Graph is at Least $k$  393--396

SIAM Journal on Computing
Volume 4, Number 4, 1975

                M. R. Garey and   
                  D. S. Johnson   Complexity Results for Multiprocessor
                                  Scheduling under Resource Constraints    397--411
                       D. Brand   Proving Theorems with the Modification
                                  Method . . . . . . . . . . . . . . . . . 412--430
             Theodore Baker and   
                  John Gill and   
                 Robert Solovay   Relativizations of the $\mathcal{P} =?
                                  \mathcal{NP}$ Question . . . . . . . . . 431--442
            Arnold L. Rosenberg   Preserving Proximity in Arrays . . . . . 443--460
               Erol Gelenbe and   
            Jacques Lenfant and   
               Dominique Potier   Response Time of a Fixed-Head Disk to
                                  Transfers of Variable Length . . . . . . 461--473
              D. M. Jackson and   
              G. H. J. Van Rees   The Enumeration of Generalized Double
                                  Stochastic Nonnegative Integer Square
                                  Matrices . . . . . . . . . . . . . . . . 474--477
                 John Bruno and   
                    Micha Hofri   On Scheduling Chains of Jobs on One
                                  Processor with Limited Preemption  . . . 478--490
                    M. D. Alder   A Convergence Theorem for Hierarchies of
                                  Model Neurones . . . . . . . . . . . . . 491--506
                Shimon Even and   
                R. Endre Tarjan   Network Flow and Testing Graph
                                  Connectivity . . . . . . . . . . . . . . 507--518
           Matthew S. Hecht and   
              Jeffrey D. Ullman   A Simple Algorithm for Global Data Flow
                                  Analysis Problems  . . . . . . . . . . . 519--532
                  A. V. Aho and   
               K. Steiglitz and   
                   J. D. Ullman   Evaluating Polynomials at Fixed Sets of
                                  Points . . . . . . . . . . . . . . . . . 533--539
                Alan G. Konheim   An Elementary Solution of the Queuing
                                  System G/G/1 . . . . . . . . . . . . . . 540--545


SIAM Journal on Computing
Volume 5, Number 1, 1976

                  Ian Munro and   
                Philip M. Spira   Sorting and Searching in Multisets . . . 1--8
                      Alon Itai   Optimal Alphabetic Trees . . . . . . . . 9--18
               Ronald L. Rivest   Partial Match Retrieval Algorithms . . . 19--50
            Lawrence J. Mazlack   Machine Selection of Elements in
                                  Crossword Puzzles: An Application of
                                  Computational Linguistics  . . . . . . . 51--72
                     Ravi Sethi   Scheduling Graphs on Two Processors  . . 73--82
             Michael L. Fredman   New Bounds on the Complexity of the
                                  Shortest Path Problem  . . . . . . . . . 83--89
           Prabhaker Mateti and   
                   Narsingh Deo   On Algorithms for Enumerating All
                                  Circuits of a Graph  . . . . . . . . . . 90--99
            Andrew Chi-Chih Yao   On the Evaluation of Powers  . . . . . . 100--103
                 S. Goodman and   
              S. Hedetniemi and   
                   R. E. Tarjan   $b$-Matchings in Trees . . . . . . . . . 104--108
                 Laurent Hyafil   Bounds for Selection . . . . . . . . . . 109--114
                  A. V. Aho and   
             J. E. Hopcroft and   
                   J. D. Ullman   On Finding Lowest Common Ancestors in
                                  Trees  . . . . . . . . . . . . . . . . . 115--132
                 Tatsuo Ohtsuki   A Fast Algorithm for Finding an Optimal
                                  Ordering for Vertex Elimination on a
                                  Graph  . . . . . . . . . . . . . . . . . 133--145
              Allan Borodin and   
                   Stephen Cook   On the Number of Additions to Compute
                                  Specific Polynomials . . . . . . . . . . 146--157
                    Ken Kennedy   A Comparison of Two Algorithms for
                                  Global Data Flow Analysis  . . . . . . . 158--180

SIAM Journal on Computing
Volume 5, Number 2, June, 1976

            David P. Dobkin and   
              Richard J. Lipton   Multidimensional Searching Problems  . . 181--186
              Robert L. Probert   On the Additive Complexity of Matrix
                                  Multiplication . . . . . . . . . . . . . 187--203
                    Webb Miller   Graph Transformations for Roundoff
                                  Analysis . . . . . . . . . . . . . . . . 204--216
           I. H. Sudborough and   
                    A. Zalcberg   On Families of Languages Defined by
                                  Time-Bounded Random Access Machines  . . 217--230
        Thomas G. Szymanski and   
               John H. Williams   Noncanonical Extensions of Bottom-Up
                                  Parsing Techniques . . . . . . . . . . . 231--250
                 Y. Edmund Lien   Termination Properties of Generalized
                                  Petri Nets . . . . . . . . . . . . . . . 251--265
             Donald J. Rose and   
            R. Endre Tarjan and   
               George S. Lueker   Algorithmic Aspects of Vertex
                                  Elimination on Graphs  . . . . . . . . . 266--283
                     Sven Skyum   Decomposition Theorems for Various Kinds
                                  of Languages Parallel in Nature  . . . . 284--296
            Jay P. Fillmore and   
               S. G. Williamson   Ranking Algorithms: The Symmetries and
                                  Colorations of the $n$-Cube  . . . . . . 297--304
                   Leon S. Levy   Local Adjunct Languages and Regular Sets 305--308
               Arthur Bernstein   Synthesizing a Response Function with a
                                  Feedback Scheduling Algorithm  . . . . . 309--317
                     D. Bollman   On Preserving Proximity in Extendible
                                  Arrays . . . . . . . . . . . . . . . . . 318--323
                Volker Strassen   Computational Complexity over Finite
                                  Fields . . . . . . . . . . . . . . . . . 324--331

SIAM Journal on Computing
Volume 5, Number 3, 1976

        Robert L. Constable and   
                     David Park   Preface  . . . . . . . . . . . . . . . . 333--335
             E. A. Ashcroft and   
                    W. W. Wadge   Lucid --- a Formal System for Writing
                                  and Proving Programs . . . . . . . . . . 336--354
               Susan L. Gerhart   Proof Theory of Partial Correctness
                                  Verification Systems . . . . . . . . . . 355--377
            Peter J. Downey and   
                     Ravi Sethi   Correct Computation Rules for Recursive
                                  Languages  . . . . . . . . . . . . . . . 378--401
               Ashok K. Chandra   Generalized Program Schemas  . . . . . . 402--413
                Zohar Manna and   
                     Adi Shamir   The Theoretical Aspects of the Optimal
                                  FixedPoint . . . . . . . . . . . . . . . 414--426
             Steven S. Muchnick   Computational Complexity of Multiple
                                  Recursive Schemata . . . . . . . . . . . 427--451
                  G. D. Plotkin   A Powerdomain Construction . . . . . . . 452--487
       Christopher P. Wadsworth   The Relation Between Computational and
                                  Denotational Properties for Scott's
                                  $D_\infty$-Models of the Lambda-Calculus 488--521
                     Dana Scott   Data Types as Lattices . . . . . . . . . 522--587

SIAM Journal on Computing
Volume 5, Number 4, 1976

          Bharat Kinariwala and   
            Kabekode V. S. Bhat   Theory of Output Set Assignments and
                                  Degree Switching Operations  . . . . . . 589--601
               S. G. Williamson   Ranking Algorithms for Lists of
                                  Partitions . . . . . . . . . . . . . . . 602--617
                      L. Csanky   Fast Parallel Matrix Inversion
                                  Algorithms . . . . . . . . . . . . . . . 618--623
          Roger W. Brockett and   
                   David Dobkin   On the Number of Multiplications
                                  Required for Matrix Multiplication . . . 624--628
                Takao Asano and   
             Michiro Shibui and   
                 Itsuo Takanami   General Results on Tour Lengths in
                                  Machines and Digraphs  . . . . . . . . . 629--645
              Robert M. Solovay   On Sets Cook-Reducible to Sparse Sets    646--652
          Kapali P. Eswaran and   
                R. Endre Tarjan   Augmentation Problems  . . . . . . . . . 653--665
            John C. Cherniavsky   Simple Programs Realize Exactly
                                  Presburger Formulas  . . . . . . . . . . 666--677
                Amnon Barak and   
                  Eliahu Shamir   On the Parallel Evaluation of Boolean
                                  Expressions  . . . . . . . . . . . . . . 678--681
                Francis Y. Chin   A Generalized Asymptotic Upper Bound on
                                  Fast Polynomial Evaluation and
                                  Interpolation  . . . . . . . . . . . . . 682--690
                    S. Even and   
                    A. Itai and   
                      A. Shamir   On the Complexity of Timetable and
                                  Multicommodity Flow Problems . . . . . . 691--703
                M. R. Garey and   
              D. S. Johnson and   
                R. Endre Tarjan   The Planar Hamiltonian Circuit Problem
                                  is NP-Complete . . . . . . . . . . . . . 704--714
                W. J. Hendricks   An Account of Self-Organizing Systems    715--723
             David Cheriton and   
            Robert Endre Tarjan   Finding Minimum Spanning Trees . . . . . 724--742
                 Alan Jay Smith   Analysis of the Optimal, Look-Ahead
                                  Demand Paging Algorithms . . . . . . . . 743--757
                     L. J. Bass   Errata: On Optimal Processor Scheduling
                                  for Multiprogramming . . . . . . . . . . 758--758


SIAM Journal on Computing
Volume 6, Number 1, 1977

                  Derek A. Zave   Optimal Polyphase Sorting  . . . . . . . 1--39
            Donald L. Adolphson   Single Machine Job Sequencing with
                                  Precedence Constraints . . . . . . . . . 40--54
            Arnie Rosenthal and   
                  Anita Goldner   Smallest Augmentations to Biconnect a
                                  Graph  . . . . . . . . . . . . . . . . . 55--66
                Lawrence T. Kou   Polynomial Complete Consecutive
                                  Information Retrieval Problems . . . . . 67--75
  Christos H. Papadimitriou and   
              Kenneth Steiglitz   On the Complexity of Local Search for
                                  the Traveling Salesman Problem . . . . . 76--83
                 R. Solovay and   
                    V. Strassen   A Fast Monte-Carlo Test for Primality    84--85
                 K. Aoshima and   
                         M. Iri   Comments on F. Hadlock's Paper:
                                  ``Finding a Maximum Cut of a Planar
                                  Graph in Polynomial Time'' . . . . . . . 86--87
         Peter B. Henderson and   
            Yechezkel Zalcstein   A Graph-Theoretic Characterization of
                                  the $\text{PV}_{\text{chunk}}$ Class of
                                  Synchronizing Primitives . . . . . . . . 88--108
            T. G. Szymanski and   
                   J. D. Ullman   Evaluating Relational Expressions with
                                  Dense and Sparse Arguments . . . . . . . 109--122
           Seymour Ginsburg and   
                    Nancy Lynch   Derivation Complexity in Context-Free
                                  Grammar Forms  . . . . . . . . . . . . . 123--138
                Harold N. Gabow   Two Algorithms for Generating Weighted
                                  Spanning Trees in Order  . . . . . . . . 139--150
             Sukhamay Kundu and   
                  Jayadev Misra   A Linear Tree Partitioning Algorithm . . 151--154
           Teofilo Gonzalez and   
            Oscar H. Ibarra and   
                   Sartaj Sahni   Bounds for LPT Schedules on Uniform
                                  Processors . . . . . . . . . . . . . . . 155--166
               D. G. Kafura and   
                     V. Y. Shen   Task Scheduling on a Multiprocessor
                                  System with Independent Memories . . . . 167--187
       David G. Kirkpatrick and   
                   Zvi M. Kedem   Addition Requirements for Rational
                                  Functions  . . . . . . . . . . . . . . . 188--199

SIAM Journal on Computing
Volume 6, Number 2, 1977

          Masahiro Miyakawa and   
            Toshitsugu Yuba and   
              Yoshio Sugito and   
                   Mamoru Hoshi   Optimum Sequence Trees . . . . . . . . . 201--234
                  Kurt Mehlhorn   A Best Possible Bound for The Weighted
                                  Path Length of Binary Search Trees . . . 235--239
               Robert Sedgewick   Quicksort with Equal Keys  . . . . . . . 240--267
                    Janet Fabri   Some Remarks on $p$-Way Merging  . . . . 268--271
           Aravind K. Joshi and   
                   Leon S. Levy   Constraints on Structural Descriptions:
                                  Local Transformations  . . . . . . . . . 272--284
                  T. Hikita and   
                      A. Nozaki   A Completeness Criterion for Spectra . . 285--297
             Nicholas Pippenger   Superconcentrators . . . . . . . . . . . 298--304
                  L. Berman and   
                   J. Hartmanis   On Isomorphisms and Density of ${NP}$
                                  and Other Complete Sets  . . . . . . . . 305--322
            Donald E. Knuth and   
       James H. Morris, Jr. and   
               Vaughan R. Pratt   Fast Pattern Matching in Strings . . . . 323--350
               Luis Trabb Pardo   Stable Sorting and Merging with Optimal
                                  Space and Time Bounds  . . . . . . . . . 351--372
               W. F. McColl and   
                M. S. Patterson   The Depth of All Boolean Functions . . . 373--380
                David B. Benson   Some Preservation Properties of Normal
                                  Form Grammars  . . . . . . . . . . . . . 381--402

SIAM Journal on Computing
Volume 6, Number 3, 1977

               Bruce D. Russell   Implementation Correctness Involving a
                                  Language with goto Statements  . . . . . 403--415
                M. R. Garey and   
                  D. S. Johnson   Two-Processor Scheduling with
                                  Start-Times and Deadlines* . . . . . . . 416--426
               Wolfgang J. Paul   A $2.5n$-Lower Bound on the
                                  Combinational Complexity of Boolean
                                  Functions  . . . . . . . . . . . . . . . 427--443
                      Zvi Galil   On Resolution with Clauses of Bounded
                                  Size . . . . . . . . . . . . . . . . . . 444--459
                    Y. Igarashi   The Tape Comilexity of Some Classes of
                                  Szilard Languages  . . . . . . . . . . . 460--466
              Richard E. Ladner   The Computational Complexity of
                                  Provability in Systems of Modal
                                  Propositional Logic  . . . . . . . . . . 467--480
            D. L. Adolphson and   
                   G. N. Thomas   A Linear Time Algorithm for a $2 \times
                                  n$ Transportation Problem  . . . . . . . 481--486
               Joel I. Seiferas   Linear-Time Computation by
                                  Nondeterministic Multidimensional
                                  Iterative Arrays . . . . . . . . . . . . 487--504
            Shuji Tsukiyama and   
                  Mikio Ide and   
            Hiromu Ariyoshi and   
                 Isao Shirakawa   A New Algorithm for Generating All the
                                  Maximal Independent Sets . . . . . . . . 505--517
                   Shui Lam and   
                     Ravi Sethi   Worst Case Analysis of Two Scheduling
                                  Algorithms . . . . . . . . . . . . . . . 518--536
        Robert Endre Tarjan and   
         Anthony E. Trojanowski   Finding a Maximum Independent Set  . . . 537--546
      Erik Meineche Schmidt and   
            Thomas G. Szymanski   Succinctness of Descriptions of
                                  Unambiguous Context-Free Languages . . . 547--553
                Francis Y. Chin   The Partial Fraction Expansion Problem
                                  and Its Inverse  . . . . . . . . . . . . 554--562
      Daniel J. Rosenkrantz and   
         Richard E. Stearns and   
            Philip M. Lewis, II   An analysis of several heuristics for
                                  the traveling salesman problem . . . . . 563--581
                 H. T. Kung and   
                     D. M. Tong   Fast Algorithms for Partial Fraction
                                  Decomposition  . . . . . . . . . . . . . 582--593
                  D. T. Lee and   
                F. P. Preparata   Location of a Point in a Planar
                                  Subdivision and its Applications . . . . 594--606

SIAM Journal on Computing
Volume 6, Number 4, 1977

               David L. Russell   Internal Fragmentation in a Class of
                                  Buddy Systems  . . . . . . . . . . . . . 607--621
          Adriano M. Garsia and   
              Michelle L. Wachs   A New Algorithm for Minimum Cost Binary
                                  Trees  . . . . . . . . . . . . . . . . . 622--642
              V. Chvátal   Determining the Stability Number of a
                                  Graph  . . . . . . . . . . . . . . . . . 643--662
              Richard G. Larson   Minimizing Garbage Collection as a
                                  Function of Region Size  . . . . . . . . 663--668
               Ronald L. Rivest   On the Worst-Case Behavior of
                                  String-Searching Algorithms  . . . . . . 669--674
                      John Gill   Computational Complexity of
                                  Probabilistic Turing Machines  . . . . . 675--695
             John S. Carson and   
                 Averill M. Law   A Note on Spira's Algorithm for the
                                  All-Pairs Shortest-Path Problem  . . . . 696--699
            Bernard J. Fino and   
                V. Ralph Algazi   A Unified Treatment of Discrete Fast
                                  Unitary Transforms . . . . . . . . . . . 700--717
                  Jayadev Misra   Prospects and Limitations of Automatic
                                  Assertion Generation for Loop Programs   718--729
               Steven W. Reyner   An Analysis of a Good Algorithm for the
                                  Subtree Problem  . . . . . . . . . . . . 730--732
                  Allan Borodin   On Relating Time and Space to Size and
                                  Depth  . . . . . . . . . . . . . . . . . 733--744
                  F. Ruskey and   
                       T. C. Hu   Generating Binary Trees
                                  Lexicographically  . . . . . . . . . . . 745--758


SIAM Journal on Computing
Volume 7, Number 1, 1978

         E. G. Coffman, Jr. and   
                M. R. Garey and   
                  D. S. Johnson   An Application of Bin-Packing to
                                  Multiprocessor Scheduling  . . . . . . . 1--17
              R. Michael Tanner   Minimean Merging and Sorting: An
                                  Algorithm  . . . . . . . . . . . . . . . 18--38
            Michael Machtey and   
             Karl Winklmann and   
                     Paul Young   Simple Gödel Numberings, Isomorphisms,
                                  and Programming Properties . . . . . . . 39--60
              Richard J. Lipton   Polynomials with $0$-$1$ Coefficients
                                  That are Hard to Evaluate  . . . . . . . 61--69
                Stephen A. Cook   Soundness and Completeness of an Axiom
                                  System for Program Verification  . . . . 70--90
              Robert L. Probert   An extension of computational duality to
                                  sequences of bilinear computations . . . 91--98
            H. B. Hunt, III and   
              D. J. Rosenkrantz   Computational Parallels between the
                                  Regular and Context-Free Languages . . . 99--114
                 Joachim Biskup   The Time Measure of One-Tape Turing
                                  Machines Does Not Have the Parallel
                                  Computation Property . . . . . . . . . . 115--117
                 R. Solovay and   
                    V. Strassen   Erratum: a Fast Monte-Carlo Test for
                                  Primality  . . . . . . . . . . . . . . . 118--118

SIAM Journal on Computing
Volume 7, Number 2, 1978

                Nancy Lynch and   
              Richard J. Lipton   On Structure Preserving Reductions . . . 119--126
                  C. P. Schnorr   An algorithm for transitive closure with
                                  linear expected time . . . . . . . . . . 127--133
             Michael L. Fredman   Observations on the Complexity of
                                  Generating Quasi-Gray Codes  . . . . . . 134--146
          Donald B. Johnson and   
               Tetsuo Mizoguchi   Selecting the ${K}$th Element in ${X} +
                                  {Y}$ and ${X}_1 + {X}_2 + \cdots + {X}_m
                                  $  . . . . . . . . . . . . . . . . . . . 147--153
             Nimrod Megiddo and   
                     Arie Tamir   An $O(n \cdot \log n)$ Algorithm for a
                                  Class of Matching Problems . . . . . . . 154--157
               H. A. Maurer and   
                 A. Salomaa and   
                        D. Wood   On Good EOL Forms  . . . . . . . . . . . 158--166
             Ronald V. Book and   
                  Maurice Nivat   Linear languages and the intersection
                                  closures of classes of languages . . . . 167--177
       Greg N. Frederickson and   
           Matthew S. Hecht and   
                    Chul E. Kim   Approximation Algorithms for Some
                                  Routing Problems . . . . . . . . . . . . 178--193
                 Celia Wrathall   Rudimentary Predicates and Relative
                                  Computation  . . . . . . . . . . . . . . 194--209
              A. G. Konheim and   
                      M. Reiser   Finite Capacity Queuing Systems with
                                  Applications in Computer Modeling  . . . 210--229
Eshrat Reghbati (Arjomandi) and   
                  D. G. Corneil   Parallel Computations in Graph Theory    230--237
             R. W. Brockett and   
                      D. Dobkin   Errata: On the Number of Multiplications
                                  Required for Matrix Multiplication . . . 238--238

SIAM Journal on Computing
Volume 7, Number 3, 1978

               Robert Sedgewick   Data Movement in Odd-Even Merging  . . . 239--272
               Kellogg S. Booth   Isomorphism Testing for Graphs,
                                  Semigroups, and Finite Automata are
                                  Polynomially Equivalent Problems . . . . 273--279
            Harold N. Gabow and   
                Eugene W. Myers   Finding All Spanning Trees of Directed
                                  and Undirected Graphs  . . . . . . . . . 280--287
               Ronald Fagin and   
                Thomas G. Price   Efficient Calculation of Expected Miss
                                  Ratios in the Independent Reference
                                  Model  . . . . . . . . . . . . . . . . . 288--297
                  Mark R. Brown   Implementation and Analysis of Binomial
                                  Queue Algorithms . . . . . . . . . . . . 298--319
                   E. Mark Gold   Deadlock Prediction: Easy and Difficult
                                  Cases  . . . . . . . . . . . . . . . . . 320--336
       Christopher P. Wadsworth   Approximate Reduction and Lambda
                                  Calculus Models  . . . . . . . . . . . . 337--356
           Robert A. Wagner and   
               Joel I. Seiferas   Correcting
                                  Counter-Automaton-Recognizable Languages 357--375
                Brenda S. Baker   Generalized Syntax Directed Translation,
                                  Tree Transducers, and Linear Space . . . 376--391

SIAM Journal on Computing
Volume 7, Number 4, 1978

                 John Bruno and   
                   Peter Downey   Complexity of task sequencing with
                                  deadlines, setup times and changeover
                                  costs  . . . . . . . . . . . . . . . . . 393--404
      Daniel J. Rosenkrantz and   
             Harry B. Hunt, III   Polynomial algorithms for deterministic
                                  pushdown automata  . . . . . . . . . . . 405--412
                  Alon Itai and   
                  Michael Rodeh   Finding a Minimum Circuit in a Graph . . 413--423
                   Frank Ruskey   Generating $t$-Ary Trees
                                  Lexicographically  . . . . . . . . . . . 424--439
                 Alan L. Selman   Polynomial Time Enumeration Reducibility 440--457
                 David Plaisted   Some polynomial and integer divisibility
                                  problems are ${NP}$-hard . . . . . . . . 458--464
        Arnold L. Rosenberg and   
                Lawrence Snyder   Minimal-comparison $2,\,3$-trees . . . . 465--480
                 Paul W. Purdom   Tree Size by Partial Backtracking  . . . 481--491
         Anthony E. Trojanowski   Ranking and Listing Algorithms for
                                  $k$-Ary Trees  . . . . . . . . . . . . . 492--509
             Nicholas Pippenger   Generalized Connectors . . . . . . . . . 510--514
            Andrew Chi Chih Yao   On the Loop Switching Addressing Problem 515--523
                Oscar H. Ibarra   The unsolvability of the equivalence
                                  problem for $\varepsilon $-free NGSM's
                                  with unary input (output) alphabet and
                                  applications . . . . . . . . . . . . . . 524--532
              Theodore P. Baker   A technique for extending rapid
                                  exact-match string matching to arrays of
                                  more than one dimension  . . . . . . . . 533--541


SIAM Journal on Computing
Volume 8, Number 1, 1979

                Colin McDiarmid   Determining the Chromatic Number of a
                                  Graph  . . . . . . . . . . . . . . . . . 1--14
                 Yossi Shiloach   A minimum linear arrangement algorithm
                                  for undirected trees . . . . . . . . . . 15--32
                  Mark R. Brown   A Partial Analysis of Random
                                  Height-Balanced Trees  . . . . . . . . . 33--41
          Raymond E. Miller and   
         Nicholas Pippenger and   
        Arnold L. Rosenberg and   
                Lawrence Snyder   Optimal $2$,$3$-Trees  . . . . . . . . . 42--59
          Vijay B. Aggarwal and   
             James W. Burgmeier   A round-off error model with
                                  applications to arithmetic expressions   60--72
                    S. Zaks and   
                    D. Richards   Generating trees and other combinatorial
                                  objects lexicographically  . . . . . . . 73--81
                James R. Bitner   Heuristics That Dynamically Organize
                                  Data Structures  . . . . . . . . . . . . 82--110
              J. Opatrný   Total Ordering Problem . . . . . . . . . 111--114

SIAM Journal on Computing
Volume 8, Number 2, 1979

               L. H. Harper and   
                   J. E. Savage   Lower Bounds on Synchronous
                                  Combinational Complexity . . . . . . . . 115--119
                 Laurent Hyafil   On the parallel evaluation of
                                  multivariate polynomials . . . . . . . . 120--123
            E. C. R. Hehner and   
              R. N. S. Horspool   A new representation of the rational
                                  numbers for fast easy arithmetic . . . . 124--134
                  Alon Itai and   
                 Yossi Shiloach   Maximum Flow in Planar Networks  . . . . 135--150
        Larry J. Stockmeyer and   
               Ashok K. Chandra   Provably Difficult Combinatorial Games   151--174
                  Kurt Mehlhorn   Dynamic Binary Search  . . . . . . . . . 175--198
                Carl R. Carlson   A counterexample to Reingold's pushdown
                                  permuter characterization theorem  . . . 199--201
         E. G. Coffman, Jr. and   
             Joseph Y.-T. Leung   Combinatorial analysis of an efficient
                                  algorithm for processor and storage
                                  allocation . . . . . . . . . . . . . . . 202--217
                  A. V. Aho and   
                   Y. Sagiv and   
                   J. D. Ullman   Equivalences among Relational
                                  Expressions  . . . . . . . . . . . . . . 218--246
           Kenichi Hagihara and   
                 Minoru Ito and   
          Kenichi Taniguchi and   
                   Tadao Kasami   Decision problems for multi-valued
                                  dependencies in relational databases . . 247--264
                  C. P. Schnorr   Bottlenecks and edge connectivity in
                                  unsymmetrical networks . . . . . . . . . 265--274
               Sartaj Sahni and   
                     Yookun Cho   Nearly on line scheduling of a uniform
                                  processor system with release times  . . 275--285

SIAM Journal on Computing
Volume 8, Number 3, 1979

            David R. Stoutemyer   Automatic asymptotic and big-$O$
                                  calculations via computer algebra  . . . 287--299
               Paul S. Wang and   
                Barry M. Trager   New algorithms for polynomial squarefree
                                  decomposition over the integers  . . . . 300--305
               Michael C. Wirth   Symbolic Vector and Dyadic Analysis  . . 306--319
                  H. I. Epstein   A Natural Structure Theorem for Complex
                                  Fields . . . . . . . . . . . . . . . . . 320--325
               Dorothea A. Klip   New Algorithms for Polynomial
                                  Multiplication . . . . . . . . . . . . . 326--343
                       J. McKay   Some Remarks on Computing Galois Groups  344--347
                David Y. Y. Yun   Uniform Bounds for a Class of Algebraic
                                  Mappings . . . . . . . . . . . . . . . . 348--356
          Michael Rothstein and   
                 B. F. Caviness   A structure theorem for exponential and
                                  primitive functions  . . . . . . . . . . 357--367
            Andrew Chi Chih Yao   The complexity of pattern matching for a
                                  random string  . . . . . . . . . . . . . 368--387
           L. J. Stockmeyer and   
                     C. K. Wong   On the number of comparisons to find the
                                  intersection of two relations  . . . . . 388--404
        C. H. Papadimitriou and   
                  M. Yannakakis   Scheduling Interval-Ordered Tasks  . . . 405--409
              Leslie G. Valiant   The Complexity of Enumeration and
                                  Reliability Problems . . . . . . . . . . 410--421
                 Yossi Shiloach   Multi-Terminal $0$--$1$ Flow . . . . . . 422--430
                 Steven Fortune   A Note on Sparse Complete Sets . . . . . 431--433
                 Ronald V. Book   Polynomial Space and Transitive Closure  434--439
                David W. Walkup   On the Expected Value of a Random
                                  Assignment Problem . . . . . . . . . . . 440--442
      Joseph JáJá   Optimal Evaluation of Pairs of Bilinear
                                  Forms  . . . . . . . . . . . . . . . . . 443--462
           Gaston H. Gonnet and   
                   J. Ian Munro   Efficient Ordering of Hash Tables  . . . 463--478

SIAM Journal on Computing
Volume 8, Number 4, 1979

               J. R. Bitner and   
                     C. K. Wong   Optimal and near-optimal scheduling
                                  algorithms for batched processing in
                                  linear storage . . . . . . . . . . . . . 479--498
           Ravindran Kannan and   
                   Achim Bachem   Polynomial algorithms for computing the
                                  Smith and Hermite normal forms of an
                                  integer matrix . . . . . . . . . . . . . 499--507
                    Lutz Priese   Towards a precise characterization of
                                  the complexity of universal and
                                  nonuniversal Turing machines . . . . . . 508--523
                  A. Bagchi and   
                      J. K. Roy   On ${V}$-Optimal Trees . . . . . . . . . 524--541
                F. P. Preparata   A note on locating a set of points in a
                                  planar subdivision . . . . . . . . . . . 542--545
                  James Donahue   On the semantics of ``data type''  . . . 546--560
                Richard M. Karp   A patching algorithm for the
                                  nonsymmetric traveling-salesman problem  561--573
               Takumi Kasai and   
                Akeo Adachi and   
                  Shigeki Iwata   Classes of Pebble Games and Complete
                                  Problems . . . . . . . . . . . . . . . . 574--586
              Elaine J. Weyuker   Translatability and decidability
                                  questions for restricted classes of
                                  program schemas  . . . . . . . . . . . . 587--598
                    David Maier   An Efficient Method for Storing Ancestor
                                  Information in Trees . . . . . . . . . . 599--618
       M. S. Krishnamoorthy and   
                   Narsingh Deo   Node-Deletion NP-Complete Problems . . . 619--625
            David K. Probst and   
             Vangalur S. Alagar   A family of algorithms for powering
                                  sparse polynomials . . . . . . . . . . . 626--644
                     Adi Shamir   A linear time algorithm for finding
                                  minimum cutsets in reducible graphs  . . 645--655
                  T. Hikita and   
                      A. Nozaki   Corrigenda: ``A completeness criterion
                                  for spectra'' [SIAM J. Comput. \bf 6
                                  (1977), no. 2, 285--297, MR \bf 57
                                  #2759] . . . . . . . . . . . . . . . . . 656--656


SIAM Journal on Computing
Volume 9, Number 1, 1980

                    Alan Tucker   An Efficient Test for Circular-Arc
                                  Graphs . . . . . . . . . . . . . . . . . 1--24
           Stephen L. Bloom and   
            Calvin C. Elgot and   
                Jesse B. Wright   Solutions of the iteration equation and
                                  extensions of the scalar iteration
                                  operation  . . . . . . . . . . . . . . . 25--45
      Chandra M. R. Kintala and   
             Patrick C. Fischer   Refining nondeterminism in relativized
                                  polynomial-time bounded computations . . 46--53
           Richard P. Brent and   
                Joseph F. Traub   On the Complexity of Composition and
                                  Generalized Composition of Power Series  54--66
              M. C. B. Hennessy   The semantics of call-by-value and
                                  call-by-name in a nondeterministic
                                  environment  . . . . . . . . . . . . . . 67--84
         Paul K. Stockmeyer and   
                 F. Frances Yao   On the Optimality of Linear Merge  . . . 85--90
                 Yookun Cho and   
                   Sartaj Sahni   Bounds for List Schedules on Uniform
                                  Processors . . . . . . . . . . . . . . . 91--103
                     R. Statman   Worst case exponential lower bounds for
                                  input resolution with paramodulation . . 104--110
                 C. K. Wong and   
                   M. C. Easton   An efficient method for weighted
                                  sampling without replacement . . . . . . 111--113
                   J. Hartmanis   On the succinctness of different
                                  representations of languages . . . . . . 114--120
               David Dobkin and   
              Richard J. Lipton   Addition chain methods for the
                                  evaluation of specific polynomials . . . 121--125
               D. S. Hirschberg   On the Complexity of Searching a Set of
                                  Vectors  . . . . . . . . . . . . . . . . 126--129
               J. T. Joichi and   
            Dennis E. White and   
               S. G. Williamson   Combinatorial Gray Codes . . . . . . . . 130--141
                P. Flajolet and   
                   Lyle Ramshaw   A Note on Gray Code and Odd-Even Merge   142--158
                 Barry K. Rosen   Monoids for Rapid Data Flow Analysis . . 159--196
                      Zvi Galil   Finding the Vertex Connectivity of
                                  Graphs . . . . . . . . . . . . . . . . . 197--199
                  D. T. Lee and   
                     C. K. Wong   Vorono\uì diagrams in $L_{1}$
                                  ($L_{\infty}$) metrics with
                                  $2$-dimensional storage applications . . 200--211
     László Babai   On the complexity of canonical labeling
                                  of strongly regular graphs . . . . . . . 212--216
            E. C. R. Hehner and   
              R. N. S. Horspool   Corrigendum: ``A new representation of
                                  the rational numbers for fast easy
                                  arithmetic'' [SIAM J. Comput. \bf 8
                                  (1979), no. 2, 124--134, MR 80h:68027]   217--217

SIAM Journal on Computing
Volume 9, Number 2, 1980

                 Yossi Shiloach   A multiterminal minimum cut algorithm
                                  for planar graphs  . . . . . . . . . . . 219--224
                    S. Winograd   On Multiplication of Polynomials Modulo
                                  a Polynomial . . . . . . . . . . . . . . 225--229
             Nicholas Pippenger   On the Evaluation of Powers and
                                  Monomials  . . . . . . . . . . . . . . . 230--250
           Salvatore D. Morgera   Efficient synthesis and implementation
                                  of large discrete Fourier
                                  transformations  . . . . . . . . . . . . 251--272
               Michael O. Rabin   Probabilistic Algorithms in Finite
                                  Fields . . . . . . . . . . . . . . . . . 273--280
              D. G. Corneil and   
              D. G. Kirkpatrick   A theoretical analysis of various
                                  heuristics for the graph isomorphism
                                  problem  . . . . . . . . . . . . . . . . 281--297
                    F. K. Hwang   Optimal Merging of $3$ Elements with $n$
                                  Elements . . . . . . . . . . . . . . . . 298--320
                     V. Ya. Pan   New Fast Algorithms for Matrix
                                  Operations . . . . . . . . . . . . . . . 321--342
              Andrew C. Yao and   
               Ronald L. Rivest   On the Polyhedral Decision Problem . . . 343--347
            Eitan M. Gurari and   
                Oscar H. Ibarra   Path systems: constructions, solutions
                                  and applications . . . . . . . . . . . . 348--374
                   John H. Reif   Code Motion  . . . . . . . . . . . . . . 375--395
            H. B. Hunt, III and   
            R. L. Constable and   
                       S. Sahni   On the computational complexity of
                                  program scheme equivalence . . . . . . . 396--416
                  Zvi Galil and   
                  Joel Seiferas   Saving Space in Fast String-Matching . . 417--438
            David K. Probst and   
             Vangalur S. Alagar   Corrigendum: ``A family of algorithms
                                  for powering sparse polynomials''  . . . 439--439

SIAM Journal on Computing
Volume 9, Number 3, 1980

              Hartmut Ehrig and   
                 Barry K. Rosen   The Mathematics of Record Handling . . . 441--469
           D. Stott Parker, Jr.   Conditions for Optimality of the Huffman
                                  Algorithm  . . . . . . . . . . . . . . . 470--489
              A. Schönhage   Storage Modification Machines  . . . . . 490--508
                Wojciech Rytter   A correct preprocessing algorithm for
                                  Boyer--Moore string-searching  . . . . . 509--512
            John R. Gilbert and   
            Thomas Lengauer and   
            Robert Endre Tarjan   The Pebbling Problem is Complete in
                                  Polynomial Space . . . . . . . . . . . . 513--524
           Stephen L. Bloom and   
            Calvin C. Elgot and   
                Jesse B. Wright   Vector Iteration in Pointed Iterative
                                  Theories . . . . . . . . . . . . . . . . 525--540
               Jeffrey M. Jaffe   Bounds on the Scheduling of Typed Task
                                  Systems  . . . . . . . . . . . . . . . . 541--551
                 Bruce W. Weide   Random Graphs and Graph Optimization
                                  Problems . . . . . . . . . . . . . . . . 552--557
               E. L. Lawler and   
              J. K. Lenstra and   
           A. H. G. Rinnooy Kan   Generating all maximal independent sets:
                                  NP-hardness and polynomial-time
                                  algorithms . . . . . . . . . . . . . . . 558--565
            Andrew Chi Chih Yao   Bounds on Selection Networks . . . . . . 566--582
                Alan George and   
               Joseph W. H. Liu   An Optimal Algorithm for Symbolic
                                  Factorization of Symmetric Matrices  . . 583--593
              Mark R. Brown and   
               Robert E. Tarjan   Design and analysis of a data structure
                                  for representing sorted lists  . . . . . 594--614
          Richard J. Lipton and   
            Robert Endre Tarjan   Applications of a Planar Separator
                                  Theorem  . . . . . . . . . . . . . . . . 615--627
 László Babai and   
               Paul Erd\Hos and   
              Stanley M. Selkow   Random Graph Isomorphism . . . . . . . . 628--635
            Stephen A. Cook and   
             Charles W. Rackoff   Space lower bounds for maze
                                  threadability on restricted machines . . 636--652
                  Kuo Chung Tai   Predictors of Context-Free Grammars  . . 653--664

SIAM Journal on Computing
Volume 9, Number 4, 1980

           Krzysztof R. Apt and   
      Lambert G. L. T. Meertens   Completeness with finite systems of
                                  intermediate assertions for recursive
                                  program schemes  . . . . . . . . . . . . 665--671
              Leo J. Guibas and   
              Andrew M. Odlyzko   A new proof of the linearity of the
                                  Boyer--Moore string searching algorithm  672--682
           Stephen L. Bloom and   
                  Ralph Tindell   Compatible Orderings on the Metric
                                  Theory of Trees  . . . . . . . . . . . . 683--691
                 Dario Bini and   
               Grazia Lotti and   
               Francesco Romani   Approximate solutions for the bilinear
                                  form computational problem . . . . . . . 692--697
              David A. Plaisted   The application of multivariate
                                  polynomials to inference rules and
                                  partial tests for unsatisfiability . . . 698--705
                Terry Beyer and   
     Sandra Mitchell Hedetniemi   Constant Time Generation of Rooted Trees 706--712
      Joseph JáJá   On the complexity of bilinear forms with
                                  commutativity  . . . . . . . . . . . . . 713--728
             Ronald V. Book and   
       Franz--Josef Brandenburg   Equality Sets and Complexity Classes . . 729--743
              David Nassimi and   
                   Sartaj Sahni   Finding connected components and
                                  connected ones on a mesh-connected
                                  parallel computer  . . . . . . . . . . . 744--757
            Gadiel Seroussi and   
                 Abraham Lempel   Factorization of symmetric matrices and
                                  trace-orthogonal bases in finite fields  758--767
          Jerome A. Feldman and   
                     Anil Nigam   A model and proof technique for
                                  message-based systems  . . . . . . . . . 768--784
            Mila E. Majster and   
                Angelika Reiser   Efficient on-line construction and
                                  correction of position trees . . . . . . 785--807
         E. G. Coffman, Jr. and   
                M. R. Garey and   
              D. S. Johnson and   
                   R. E. Tarjan   Performance bounds for level-oriented
                                  two-dimensional packing algorithms . . . 808--826
              Bengt Aspvall and   
                 Yossi Shiloach   A polynomial time algorithm for solving
                                  systems of linear inequalities with two
                                  variables per inequality . . . . . . . . 827--845
            Brenda S. Baker and   
         E. G. Coffman, Jr. and   
               Ronald L. Rivest   Orthogonal Packings in Two Dimensions    846--855


SIAM Journal on Computing
Volume 10, Number 1, 1981

             Michael L. Fredman   Lower bounds on the complexity of some
                                  optimal data structures  . . . . . . . . 1--10
                     Anna Lubiw   Some NP-complete problems similar to
                                  graph isomorphism  . . . . . . . . . . . 11--21
            Oscar H. Ibarra and   
             Brian S. Leininger   Characterizations of Presburger
                                  Functions  . . . . . . . . . . . . . . . 22--39
             A. Ehrenfeucht and   
               G. Rozenberg and   
                     D. Vermeir   On ETOL systems with finite tree-rank    40--58
            John H. Rowland and   
                Philip J. Davis   On the selection of test data for
                                  recursive mathematical subroutines . . . 59--72
                  D. T. Lee and   
            R. L. Drysdale, III   Generalization of Vorono\uì diagrams in
                                  the plane  . . . . . . . . . . . . . . . 73--87
            Martin H. Ellis and   
              J. Michael Steele   Fast Sorting of Weyl Sequences Using
                                  Comparisons  . . . . . . . . . . . . . . 88--95
         Charles H. Bennett and   
                      John Gill   Relative to a Random Oracle ${A}$, ${\bf
                                  P}^{A} \not= {\bf NP}^{A} \ne
                                  \text{co-}{\bf NP}^{A} $ with
                                  Probability $1$  . . . . . . . . . . . . 96--113
              Neil D. Jones and   
                     Sven Skyum   A Note on the Complexity of General
                                  ${D0L}$ Membership . . . . . . . . . . . 114--117
                   Ken Chih Liu   On string pattern matching: a new model
                                  with a polynomial time algorithm . . . . 118--140
                   Frank Ruskey   Listing and Counting Subtrees of a Tree  141--150
                  Manfred Kunde   Nonpreemptive LP-scheduling on
                                  homogeneous multiprocessor systems . . . 151--173
    Stefano Crespi-Reghizzi and   
             Giovanni Guida and   
                 Dino Mandrioli   Operator precedence grammars and the
                                  noncounting property . . . . . . . . . . 174--191
             M. I. Dessouky and   
                   J. S. Deogun   Sequencing Jobs with Unequal Ready Times
                                  to Minimize Mean Flow Time . . . . . . . 192--202
        Charles J. Colbourn and   
               Kellogg S. Booth   Linear time automorphism algorithms for
                                  trees, interval graphs, and planar
                                  graphs . . . . . . . . . . . . . . . . . 203--225

SIAM Journal on Computing
Volume 10, Number 2, 1981

              Lawrence Flon and   
                Norihisa Suzuki   The Total Correctness of Parallel
                                  Programs . . . . . . . . . . . . . . . . 227--246
                   N. Katoh and   
                 T. Ibaraki and   
                        H. Mine   An algorithm for finding ${K}$ minimum
                                  spanning trees . . . . . . . . . . . . . 247--255
                M. R. Garey and   
              D. S. Johnson and   
               B. B. Simons and   
                   R. E. Tarjan   Scheduling unit-time tasks with
                                  arbitrary release times and deadlines    256--269
       Greg N. Frederickson and   
                  Joseph Ja'Ja'   Approximation algorithms for several
                                  graph augmentation problems  . . . . . . 270--283
                Luc Boasson and   
            Bruno Courcelle and   
                  Maurice Nivat   The rational index: a complexity measure
                                  for languages  . . . . . . . . . . . . . 284--296
             Mihalis Yannakakis   Edge-Deletion Problems . . . . . . . . . 297--309
                  M. Yannakakis   Node-Deletion Problems on Bipartite
                                  Graphs . . . . . . . . . . . . . . . . . 310--327
                 N. Megiddo and   
                   A. Tamir and   
                   E. Zemel and   
              R. Chandrasekaran   An $O(n\log^2 n)$ Algorithm for the
                                  $k$th Longest Path in a Tree with
                                  Applications to Location Problems  . . . 328--337
               George S. Lueker   Optimization problems on graphs with
                                  independent random edge weights  . . . . 338--351
              Catriel Beeri and   
       Alberto O. Mendelzon and   
             Yehoshua Sagiv and   
              Jeffrey D. Ullman   Equivalence of Relational Database
                                  Schemes  . . . . . . . . . . . . . . . . 352--370
                  C. P. Schnorr   An Extension of Strassen's Degree Bound  371--382
               J. Hartmanis and   
                     S. Mahaney   Languages simultaneously complete for
                                  one-way and two-way log-tape automata    383--390
           Andrzej Proskurowski   Recursive graphs, recursive labelings
                                  and shortest paths . . . . . . . . . . . 391--397
                  Andrew C. Yao   An analysis of a memory allocation
                                  scheme for implementing stacks . . . . . 398--403

SIAM Journal on Computing
Volume 10, Number 3, 1981

                  A. V. Aho and   
                   Y. Sagiv and   
            T. G. Szymanski and   
                   J. D. Ullman   Inferring a tree from lowest common
                                  ancestors with an application to the
                                  optimization of relational expressions   405--421
                     L. Gotlieb   Optimal Multi-Way Search Trees . . . . . 422--433
              A. Schönhage   Partial and Total Matrix Multiplication  434--455
         Richard Schroeppel and   
                     Adi Shamir   A ${T}={O}(2^{n/2})$, ${S}={O}(2^{n/4})$
                                  algorithm for certain NP-complete
                                  problems . . . . . . . . . . . . . . . . 456--464
      Roland Häggkvist and   
                     Pavol Hell   Parallel Sorting with Constant Time for
                                  Comparisons  . . . . . . . . . . . . . . 465--472
            Franco P. Preparata   A New Approach to Planar Point Location  473--482
               H. A. Maurer and   
                 A. Salomaa and   
                        D. Wood   Uniform Interpretations of Grammar Forms 483--502
                 Brian H. Mayoh   Attribute Grammars and Mathematical
                                  Semantics  . . . . . . . . . . . . . . . 503--518
                Amir Pnueli and   
                  Giora Slutzki   Automatic programming of finite state
                                  linear programs  . . . . . . . . . . . . 519--535
             A. Ehrenfeucht and   
                  R. Parikh and   
                   G. Rozenberg   Pumping Lemmas for Regular Sets  . . . . 536--541
      Christos H. Papadimitriou   Worst-case and probabilistic analysis of
                                  a geometric location problem . . . . . . 542--557
            James R. Bitner and   
               Shou Hsuan Huang   Key comparison optimal $2-3$ trees with
                                  maximum utilization  . . . . . . . . . . 558--570
                     Igal Golan   Performance bounds for orthogonal
                                  oriented two-dimensional packing
                                  algorithms . . . . . . . . . . . . . . . 571--582
           Cynthia A. Brown and   
        Paul Walton Purdom, Jr.   An Average Time Analysis of Backtracking 583--593
                  Sam Toueg and   
              Jeffrey D. Ullman   Deadlock-Free Packet Switching Networks  594--611
                Stephen A. Cook   Corrigendum: ``Soundness and
                                  completeness of an axiom system for
                                  program verification'' [SIAM J. Comput.
                                  \bf 7 (1978), no. 1, 70--90, MR \bf 58
                                  #13843]  . . . . . . . . . . . . . . . . 612--612
           Gaston H. Gonnet and   
               J. Ian Munro and   
                 Hendra Suwanda   Exegesis of Self-Organizing Linear
                                  Search . . . . . . . . . . . . . . . . . 613--637
               Peter Downey and   
               Benton Leong and   
                     Ravi Sethi   Computing Sequences with Addition Chains 638--646
                   C. Beeri and   
                    P. Honeyman   Preserving Functional Dependencies . . . 647--656

SIAM Journal on Computing
Volume 10, Number 4, 1981

              Eliezer Dekel and   
              David Nassimi and   
                   Sartaj Sahni   Parallel Matrix and Graph Algorithms . . 657--675
         Edward M. Reingold and   
               Robert E. Tarjan   On a Greedy Heuristic for Complete
                                  Matching . . . . . . . . . . . . . . . . 676--681
               Carla Savage and   
                  Joseph Ja'Ja'   Fast, efficient parallel algorithms for
                                  some graph problems  . . . . . . . . . . 682--691
               P. J. Slater and   
             E. J. Cockayne and   
               S. T. Hedetniemi   Information Dissemination in Trees . . . 692--701
                  Sam Toueg and   
              Kenneth Steiglitz   Some Complexity Results in the Design of
                                  Deadlock-Free Packet Switching Networks  702--712
                     Ian Holyer   The NP-completeness of some
                                  edge-partition problems  . . . . . . . . 713--717
                     Ian Holyer   The NP-Completeness of Edge-Coloring . . 718--720
                    Azad Bolour   Optimal retrieval algorithms for small
                                  region queries . . . . . . . . . . . . . 721--741
         Charles W. Rackoff and   
               Joel I. Seiferas   Limitations on separating
                                  nondeterministic complexity classes  . . 742--745
                  Alon Itai and   
          Richard J. Lipton and   
  Christos H. Papadimitriou and   
                       M. Rodeh   Covering Graphs by Simple Circuits . . . 746--750
        Philip A. Bernstein and   
                 Nathan Goodman   The Power of Natural Semijoins . . . . . 751--771
 Kari-Jouko Räihä and   
                   Esko Ukkonen   Minimizing the Number of Evaluation
                                  Passes for Attribute Grammars  . . . . . 772--786
                   Ker-I Ko and   
                   Daniel Moore   Completeness, Approximation and Density  787--796
               Maciej M. Sys\lo   An efficient cycle vector space
                                  algorithm for listing all cycles of a
                                  planar graph . . . . . . . . . . . . . . 797--808
             Amnon B. Barak and   
                Peter J. Downey   Distributed processor scheduling and
                                  user countermeasures . . . . . . . . . . 809--819


SIAM Journal on Computing
Volume 11, Number 1, 1982

            Oscar H. Ibarra and   
             Brian S. Leininger   Straight-Line Programs with One Input
                                  Variable . . . . . . . . . . . . . . . . 1--14
            Oscar H. Ibarra and   
             Brian S. Leininger   The complexity of the equivalence
                                  problem for simple loop-free programs    15--27
               J. H. Halton and   
                      R. Terada   A fast algorithm for the Euclidean
                                  traveling salesman problem, optimal with
                                  probability one  . . . . . . . . . . . . 28--46
                Arnon Rosenthal   Dynamic programming is optimal for
                                  nonserial optimization problems  . . . . 47--59
         E. G. Coffman, Jr. and   
                    Micha Hofri   On the Expected Performance of Scanning
                                  Disks  . . . . . . . . . . . . . . . . . 60--70
           Robert P. Burton and   
                 David R. Smith   A Hidden-Line Algorithm for Hyperspace   71--80
               John H. Reif and   
               Robert E. Tarjan   Symbolic Program Analysis in
                                  Almost-Linear Time . . . . . . . . . . . 81--93
             D. Coppersmith and   
               D. S. Parker and   
                     C. K. Wong   Analysis of a General Mass Storage
                                  System . . . . . . . . . . . . . . . . . 94--116
            Harold N. Gabow and   
                     Oded Kariv   Algorithms for edge coloring bipartite
                                  graphs and multigraphs . . . . . . . . . 117--129
                   Martin Tompa   Two familiar transitive closure
                                  algorithms which admit no polynomial
                                  time, sublinear space implementations    130--137
                Lawrence T. Kou   Minimum Variance Huffman Codes . . . . . 138--148
                 Dan E. Willard   Polygon Retrieval  . . . . . . . . . . . 149--165
             E. P. Friedman and   
                 S. A. Greibach   A polynomial time algorithm for deciding
                                  the equivalence problem for $2$-tape
                                  deterministic finite state acceptors . . 166--183
              Per M. Jensen and   
                 Bernhard Korte   Complexity of Matroid Property
                                  Algorithms . . . . . . . . . . . . . . . 184--190
           Kellogg S. Booth and   
              J. Howard Johnson   Dominating Sets in Chordal Graphs  . . . 191--199

SIAM Journal on Computing
Volume 11, Number 2, 1982

                 M. R. Levy and   
               T. S. E. Maibaum   Continuous Data Types  . . . . . . . . . 201--216
              Douglas Comer and   
           Michael J. O'Donnell   Geometric Problems with Application to
                                  Hashing  . . . . . . . . . . . . . . . . 217--226
               Jia Wei Hong and   
            Arnold L. Rosenberg   Graphs That are Almost Binary Trees  . . 227--242
                James R. Bitner   An asymptotically optimal algorithm for
                                  the Dutch National Flag problem  . . . . 243--262
               Francesco Romani   Some properties of disjoint sums of
                                  tensors related to matrix multiplication 263--267
               John Keohane and   
        John C. Cherniavsky and   
             Peter B. Henderson   On Transforming Control Structures . . . 268--286
                 A. Borodin and   
                        S. Cook   A time-space tradeoff for sorting on a
                                  general sequential model of computation  287--297
              Jacobo Valdes and   
           Robert E. Tarjan and   
               Eugene L. Lawler   The Recognition of Series Parallel
                                  Digraphs . . . . . . . . . . . . . . . . 298--313
              Joseph Ja'Ja' and   
                    Janos Simon   Parallel algorithms in graph theory:
                                  planarity testing  . . . . . . . . . . . 314--328
             David Lichtenstein   Planar Formulae and Their Uses . . . . . 329--343
                   Shlomo Moran   On the Accepting Density Hierarchy in NP 344--349
                  L. G. Valiant   A Scheme for Fast Parallel Communication 350--361
                   T. C. Hu and   
                    M. T. Shing   Computation of Matrix Chain Products.
                                  Part I . . . . . . . . . . . . . . . . . 362--373
              Daniel J. Lehmann   On Primality Tests . . . . . . . . . . . 374--375
           Robert Sedgewick and   
        Thomas G. Szymanski and   
                  Andrew C. Yao   The complexity of finding cycles in
                                  periodic functions . . . . . . . . . . . 376--390
             Mihalis Yannakakis   Freedom from Deadlock of Safe Locking
                                  Policies . . . . . . . . . . . . . . . . 391--408

SIAM Journal on Computing
Volume 11, Number 3, 1982

              Nathan Linial and   
                  Michael Tarsi   The Counterfeit Coin Problem Revisited   409--415
         Michael J. Fischer and   
            Albert R. Meyer and   
            Michael S. Paterson   ${\Omega} (n \log n)$ lower bounds on
                                  length of Boolean formulas . . . . . . . 416--427
              Andrew C. Yao and   
                 F. Frances Yao   On the average-case complexity of
                                  selecting the $k$th best . . . . . . . . 428--447
                Eitan M. Gurari   The equivalence problem for
                                  deterministic two-way sequential
                                  transducers is decidable . . . . . . . . 448--452
                   M. Hofri and   
                     P. Tzelnic   The working set size distribution for
                                  the Markov chain model of program
                                  behavior . . . . . . . . . . . . . . . . 453--466
                 D. Coppersmith   Rapid Multiplication of Rectangular
                                  Matrices . . . . . . . . . . . . . . . . 467--471
             D. Coppersmith and   
                    S. Winograd   On the Asymptotic Complexity of Matrix
                                  Multiplication . . . . . . . . . . . . . 472--492
                 Barry K. Rosen   A Lubricant for Data Flow Analysis . . . 493--511
                K. Nakajima and   
               S. L. Hakimi and   
                  J. K. Lenstra   Complexity results for scheduling tasks
                                  in fixed intervals on two types of
                                  machines . . . . . . . . . . . . . . . . 512--520
      Bernhard Banaschewski and   
                  Evelyn Nelson   Completions of Partially Ordered Sets    521--528
           D. Gouyou-Beauchamps   The Hamiltonian circuit problem is
                                  polynomial for $4$-connected planar
                                  graphs . . . . . . . . . . . . . . . . . 529--539
               Richard Cole and   
                  John Hopcroft   On Edge Coloring Bipartite Graphs  . . . 540--546
             Henry W. Davis and   
                Leon E. Winslow   Computational Power in Query Languages   547--554
              Dorit S. Hochbaum   Approximation algorithms for the set
                                  covering and vertex cover problems . . . 555--556
         Aaron M. Tenenbaum and   
               Richard M. Nemes   Two spectra of self-organizing
                                  sequential search algorithms . . . . . . 557--566
             Mikhail J. Atallah   Finding the cyclic index of an
                                  irreducible, nonnegative matrix  . . . . 567--570
             Ronald V. Book and   
      Christopher B. Wilson and   
                     Mei-Rui Xu   Relativizing Time, Space, and Time-Space 571--581
                 Udai Gupta and   
                  D. T. Lee and   
                     C. K. Wong   Ranking and Unranking of $2$-$3$ Trees   582--590
                   Jia Wei Hong   On Some Deterministic Space Complexity
                                  Problems . . . . . . . . . . . . . . . . 591--601
              Virgil Gligor and   
                    David Maier   Finding Augmented-Set Bases  . . . . . . 602--609

SIAM Journal on Computing
Volume 11, Number 4, 1982

                  Kohei Noshita   Predicting the number of distinct
                                  elements in a multiset . . . . . . . . . 611--619
            Richard M. Karp and   
      Christos H. Papadimitriou   On linear characterizations of
                                  combinatorial optimization problems  . . 620--632
           Teofilo Gonzalez and   
                  Joseph Ja'Ja'   Evaluation of arithmetic expressions
                                  with algebraic identities  . . . . . . . 633--662
            Norishige Chiba and   
            Takao Nishizeki and   
                   Nobuji Saito   An approximation algorithm for the
                                  maximum independent set problem on
                                  planar graphs  . . . . . . . . . . . . . 663--675
                  Alon Itai and   
  Christos H. Papadimitriou and   
         Jayme Luiz Szwarcfiter   Hamilton Paths in Grid Graphs  . . . . . 676--686
             Tsu Wu J. Chou and   
              George E. Collins   Algorithms for the solution of systems
                                  of linear Diophantine equations  . . . . 687--708
          James O. Achugbue and   
                Francis Y. Chin   Scheduling the Open Shop to Minimize
                                  Mean Flow Time . . . . . . . . . . . . . 709--720
            Andrew Chi Chih Yao   On constructing minimum spanning trees
                                  in $k$-dimensional spaces and related
                                  problems . . . . . . . . . . . . . . . . 721--736
           Richard P. Brent and   
         Leslie M. Goldschlager   Some Area-Time Tradeoffs for VLSI  . . . 737--747
                  Kurt Mehlhorn   A partial analysis of height-balanced
                                  trees under random insertions and
                                  deletions  . . . . . . . . . . . . . . . 748--760
           Michael B. Smyth and   
              Gordon D. Plotkin   The Category-theoretic Solution of
                                  Recursive Domain Equations . . . . . . . 761--783
                       C. Ronse   Optimization of cost and delay in
                                  cellular permutation networks  . . . . . 784--788
             A. O. L. Atkin and   
                   R. G. Larson   On a primality test of Solovay and
                                  Strassen . . . . . . . . . . . . . . . . 789--791


SIAM Journal on Computing
Volume 12, Number 1, 1983

                    V. Strassen   The Computational Complexity of
                                  Continued Fractions  . . . . . . . . . . 1--27
              David Kirkpatrick   Optimal Search in Planar Subdivisions    28--35
               Ronald Fagin and   
                David Maier and   
          Jeffrey D. Ullman and   
             Mihalis Yannakakis   Tools for Template Dependencies  . . . . 36--59
              D. K. Friesen and   
                 M. A. Langston   Bounds for Multifit Scheduling on
                                  Uniform Processors . . . . . . . . . . . 60--70
                   John H. Reif   Minimum $s$-$t$ cut of a planar
                                  undirected network in $O(n \log
                                  ^{2}(n))$ time . . . . . . . . . . . . . 71--81
             Gerald E. Peterson   A technique for establishing
                                  completeness results in theorem proving
                                  with equality  . . . . . . . . . . . . . 82--100
              Hans F. de Groote   Characterization of division algebras of
                                  minimal rank and the structure of their
                                  algorithm varieties  . . . . . . . . . . 101--117
         Kenneth J. Supowit and   
             Edward M. Reingold   Divide-and-conquer heuristics for
                                  minimum weighted Euclidean matching  . . 118--143
         Kenneth J. Supowit and   
         Edward M. Reingold and   
              David A. Plaisted   The travelling salesman problem and
                                  minimum matching in the unit square  . . 144--156
                   Dan Gusfield   Simple constructions for multiterminal
                                  network flow synthesis . . . . . . . . . 157--165
                A. C. Fleck and   
                   R. S. Limaye   Formal semantics and abstract properties
                                  of string pattern operations and
                                  extended formal language description
                                  mechanisms . . . . . . . . . . . . . . . 166--188
               J. V. Guttag and   
                   D. Kapur and   
                   D. R. Musser   On Proving Uniform Termination and
                                  Restricted Termination of Rewriting
                                  Systems  . . . . . . . . . . . . . . . . 189--214

SIAM Journal on Computing
Volume 12, Number 2, 1983

      Christos H. Papadimitriou   Concurrency Control by Locking . . . . . 215--226
         E. G. Coffman, Jr. and   
                M. R. Garey and   
                  D. S. Johnson   Dynamic Bin Packing  . . . . . . . . . . 227--258
         Patrick C. Fischer and   
                   Don Min Tsou   Whether a set of multivalued
                                  dependencies implies a join dependency
                                  is NP-hard . . . . . . . . . . . . . . . 259--266
                      Avra Cohn   The equivalence of two semantic
                                  definitions: a case study in LCF . . . . 267--285
              Rüdiger Loos   Computing rational zeros of integral
                                  polynomials by $p$-adic expansion  . . . 286--293
                 Barbara Simons   Multiprocessor scheduling of unit-time
                                  jobs with arbitrary release times and
                                  deadlines  . . . . . . . . . . . . . . . 294--299
         Christian Choffrut and   
                 Karel Culik II   Properties of Finite and Pushdown
                                  Transducers  . . . . . . . . . . . . . . 300--315
                 Yehoshua Sagiv   Quadratic algorithms for minimizing
                                  joins in restricted relational
                                  expressions  . . . . . . . . . . . . . . 316--328
               V. Lifschitz and   
                     B. Pittel'   The worst and the most probable
                                  performance of a class of set-covering
                                  algorithms . . . . . . . . . . . . . . . 329--346
                 Nimrod Megiddo   Towards a genuinely polynomial algorithm
                                  for linear programming . . . . . . . . . 347--353
           Susanne E. Hambrusch   VLSI algorithms for the connected
                                  component problem  . . . . . . . . . . . 354--365
             J. A. Bergstra and   
                   J. V. Tucker   Initial and final algebra semantics for
                                  data type specifications: two
                                  characterization theorems  . . . . . . . 366--387
            Oscar H. Ibarra and   
                   Shlomo Moran   Some time-space tradeoff results
                                  concerning single-tape and offline TMs   388--394
                   Markus Lauer   Generalized $p$-Adic Constructions . . . 395--410

SIAM Journal on Computing
Volume 12, Number 3, 1983

                   Yaacov Yesha   On certain polynomial-time truth-table
                                  reducibilities of complete sets to
                                  sparse sets  . . . . . . . . . . . . . . 411--425
              David M. Choy and   
                     C. K. Wong   Construction of optimal $\alpha $-$\beta
                                  $ leaf trees with applications to prefix
                                  code and information retrieval . . . . . 426--446
       Charles E. Leiserson and   
                  Ron Y. Pinter   Optimal Placement for River Routing  . . 447--462
                Michael C. Loui   Optimal Dynamic Embedding of Trees into
                                  Arrays . . . . . . . . . . . . . . . . . 463--472
             Erich Kaltofen and   
            David R. Musser and   
              B. David Saunders   A generalized class of polynomials that
                                  are hard to factor . . . . . . . . . . . 473--483
           Jacob E. Goodman and   
                Richard Pollack   Multidimensional Sorting . . . . . . . . 484--507
            Brenda S. Baker and   
              Jerald S. Schwarz   Shelf algorithms for two-dimensional
                                  packing problems . . . . . . . . . . . . 508--525
            John H. Rowland and   
               Leslie E. Shader   On the selection of test data for
                                  vector-valued recursive subroutines  . . 526--538
               Hisao Yamada and   
                 Masatosi Imori   One step transformation of periodic
                                  sequences by cellular automata . . . . . 539--550
           Trevor I. Fenner and   
               Georghios Loizou   Tree traversal related algorithms for
                                  generating integer partitions  . . . . . 551--564
             Alan L. Selman and   
                 Mei-Rui Xu and   
                 Ronald V. Book   Positive Relativizations of Complexity
                                  Classes  . . . . . . . . . . . . . . . . 565--579
                   Esko Ukkonen   Two results on polynomial time
                                  truth-table reductions to sparse sets    580--587
              Peter A. Bloniarz   A shortest-path algorithm with expected
                                  time $O(n^{2}\log n \log ^{*} n)$  . . . 588--600
          D. G. Kirkpatrick and   
                        P. Hell   On the Complexity of General Graph
                                  Factor Problems  . . . . . . . . . . . . 601--609

SIAM Journal on Computing
Volume 12, Number 4, 1983

             M. D. Atkinson and   
                       S. Lloyd   The Ranks of $m \times n \times (m n -
                                  2)$ Tensors  . . . . . . . . . . . . . . 611--615
              D. S. Johnson and   
                        A. Klug   Optimizing conjunctive queries that
                                  contain untyped variables  . . . . . . . 616--640
              L. G. Valiant and   
                   S. Skyum and   
               S. Berkowitz and   
                     C. Rackoff   Fast parallel computation of polynomials
                                  using few processors . . . . . . . . . . 641--644
             Timothy Hickey and   
                  Jacques Cohen   Uniform random generation of strings in
                                  a context-free language  . . . . . . . . 645--655
                   D. Dolev and   
                   H. R. Strong   Authenticated Algorithms for Byzantine
                                  Agreement  . . . . . . . . . . . . . . . 656--666
              Wen Chin Chen and   
           Jeffrey Scott Vitter   Analysis of early-insertion standard
                                  coalesced hashing  . . . . . . . . . . . 667--676
           Stephen L. Bloom and   
                  Ralph Tindell   Varieties of ``If--Then--Else''  . . . . 677--707
              Tat Hung Chan and   
                Oscar H. Ibarra   On the space and time complexity of
                                  functions computable by simple programs  708--716
    Paul Walton Purdom, Jr. and   
               Cynthia A. Brown   An analysis of backtracking with search
                                  rearrangement  . . . . . . . . . . . . . 717--733
                 John L. Pfaltz   Convex Clusters in a Discrete
                                  $m$-Dimensional Space  . . . . . . . . . 734--750
             Nimrod Megiddo and   
                     Arie Tamir   New Results on the Complexity of
                                  $p$-Centre Problems  . . . . . . . . . . 751--758
                 Nimrod Megiddo   Linear-time algorithms for linear
                                  programming in ${\bf R}^{3}$ and related
                                  problems . . . . . . . . . . . . . . . . 759--776
            J. Scott Provan and   
                Michael O. Ball   The Complexity of Counting Cuts and of
                                  Computing the Probability that a Graph
                                  is Connected . . . . . . . . . . . . . . 777--788
              Debasis Mitra and   
                 J. A. Morrison   Asymptotic expansions of moments of the
                                  waiting time in a shared-processor of an
                                  interactive system . . . . . . . . . . . 789--802


SIAM Journal on Computing
Volume 13, Number 1, 1984

                  Arie de Bruin   On the Existence of Cook Semantics . . . 1--13
       Greg N. Frederickson and   
              Donald B. Johnson   Generalized Selection and Ranking:
                                  Sorted Matrices  . . . . . . . . . . . . 14--30
                     M. E. Dyer   Linear time algorithms for two- and
                                  three-variable linear programs . . . . . 31--45
                   John H. Reif   On synchronous parallel computations
                                  with independent probabilistic choice    46--56
              Norman J. Pullman   Clique covering of graphs. IV.
                                  Algorithms . . . . . . . . . . . . . . . 57--75
                   C. Beeri and   
                    M. Y. Vardi   Formal systems for tuple and equality
                                  generating dependencies  . . . . . . . . 76--98
      Stavros S. Cosmadakis and   
      Christos H. Papadimitriou   The traveling salesman problem with many
                                  visits to few cities . . . . . . . . . . 99--108
                 Udi Manber and   
                   Martin Tompa   The effect of number of Hamiltonian
                                  paths on the complexity of a
                                  vertex-coloring problem  . . . . . . . . 109--115
              Dah Ming Chiu and   
        Philip A. Bernstein and   
                      Yu Chi Ho   Optimizing chain queries in a
                                  distributed database system  . . . . . . 116--134
          Richard E. Ladner and   
          Richard J. Lipton and   
            Larry J. Stockmeyer   Alternating Pushdown and Stack Automata  135--155
                    Maria Klawe   Limitations on explicit constructions of
                                  expanding graphs . . . . . . . . . . . . 156--166
             Prakash V. Ramanan   Pushdown Permuter Characterization
                                  Theorem  . . . . . . . . . . . . . . . . 167--169
              Donald K. Friesen   Tighter bounds for the multifit
                                  processor scheduling algorithm . . . . . 170--181
             Nimrod Megiddo and   
             Kenneth J. Supowit   On the complexity of some common
                                  geometric location problems  . . . . . . 182--196
             Thomas Ottmann and   
            D. Stott Parker and   
        Arnold L. Rosenberg and   
                Hans W. Six and   
                    Derick Wood   Minimal-Cost Brother Trees . . . . . . . 197--217

SIAM Journal on Computing
Volume 13, Number 2, 1984

            Pavol \vDuri\vs and   
                      Zvi Galil   Two tapes are better than one for
                                  nondeterministic machines  . . . . . . . 219--227
                   T. C. Hu and   
                    M. T. Shing   Computation of Matrix Chain Products.
                                  Part II  . . . . . . . . . . . . . . . . 228--251
                   J. M. Robson   ${N}$ by ${N}$ Checkers is Exptime
                                  Complete . . . . . . . . . . . . . . . . 252--267
                     Dario Bini   Parallel solution of certain Toeplitz
                                  linear systems . . . . . . . . . . . . . 268--276
           Greg N. Frederickson   Self-organizing heuristics for implicit
                                  data structures  . . . . . . . . . . . . 277--291
               Micha Sharir and   
                Amir Pnueli and   
                    Sergiu Hart   Verification of Probabilistic Programs   292--314
             Sunita Agarwal and   
               A. K. Mittal and   
                      P. Sharma   Constrained optimum communication trees
                                  and sensitivity analysis . . . . . . . . 315--328
          Uwe Schöning and   
                 Ronald V. Book   Immunity, Relativizations, and
                                  Nondeterminism . . . . . . . . . . . . . 329--337
                  Dov Harel and   
            Robert Endre Tarjan   Fast Algorithms for Finding Nearest
                                  Common Ancestors . . . . . . . . . . . . 338--355
       Étienne Grandjean   The spectra of first-order sentences and
                                  computational complexity . . . . . . . . 356--373
              Robert Cartwright   Recursive programs as definitions in
                                  first-order logic  . . . . . . . . . . . 374--408
           Larry Stockmeyer and   
                    Uzi Vishkin   Simulation of parallel random access
                                  machines by circuits . . . . . . . . . . 409--422
           Ashok K. Chandra and   
           Larry Stockmeyer and   
                    Uzi Vishkin   Constant Depth Reducibility  . . . . . . 423--439

SIAM Journal on Computing
Volume 13, Number 3, 1984

                  Ernst W. Mayr   An algorithm for the general Petri net
                                  reachability problem . . . . . . . . . . 441--460
             Ronald V. Book and   
            Timothy J. Long and   
                 Alan L. Selman   Quantitative Relativizations of
                                  Complexity Classes . . . . . . . . . . . 461--487
               Bernard Chazelle   Convex partitions of polyhedra: a lower
                                  bound and worst-case optimal algorithm   488--507
          D. J. Rosenkrantz and   
              R. E. Stearns and   
                 P. M. Lewis II   Consistency and serializability in
                                  concurrent database systems  . . . . . . 508--530
                   M. Keane and   
              A. G. Konheim and   
                   I. Meilijson   The Organ Pipe Permutation . . . . . . . 531--540
             Rami G. Melhem and   
           Werner C. Rheinboldt   A mathematical model for the
                                  verification of systolic networks  . . . 541--565
           Robert E. Tarjan and   
             Mihalis Yannakakis   Simple linear-time algorithms to test
                                  chordality of graphs, test acyclicity of
                                  hypergraphs, and selectively reduce
                                  acyclic hypergraphs  . . . . . . . . . . 566--579
               Yung H. Tsin and   
                Francis Y. Chin   Efficient parallel algorithms for a
                                  class of graph theoretic problems  . . . 580--599
                B. S. Baker and   
             E. G. Coffman, Jr.   Insertion and compaction algorithms in
                                  sequentially allocated storage . . . . . 600--609
           John E. Hopcroft and   
          Deborah A. Joseph and   
              Sue H. Whitesides   Movement Problems for $2$-Dimensional
                                  Linkages . . . . . . . . . . . . . . . . 610--629
                  Sam Toueg and   
          Özalp Babao\uglu   On the Optimum Checkpoint Selection
                                  Problem  . . . . . . . . . . . . . . . . 630--649
         Joseph Y.-T. Leung and   
          Oliver Vornberger and   
              James D. Witthoff   On some variants of the bandwidth
                                  minimization problem . . . . . . . . . . 650--667

SIAM Journal on Computing
Volume 13, Number 4, 1984

               D. P. Heyman and   
                        S. Tsur   Disk Performance in a
                                  Transaction-Oriented System  . . . . . . 669--681
              Andreas Blass and   
                  Yuri Gurevich   Equivalence Relations, Invariants, and
                                  Normal Forms . . . . . . . . . . . . . . 682--689
              Ten Hwang Lai and   
                   Sartaj Sahni   Preemptive scheduling of a
                                  multiprocessor system with memories to
                                  minimize maximum lateness  . . . . . . . 690--704
                 Gregory Dobson   Scheduling Independent Tasks on Uniform
                                  Processors . . . . . . . . . . . . . . . 705--716
                    Hans Heller   On relativized polynomial and
                                  exponential computations . . . . . . . . 717--725
                     H. W. Barz   The Power of Synchronization Mechanisms  726--749
                Jean H. Gallier   $n$-rational algebras. I. Basic
                                  properties and free algebras . . . . . . 750--775
                Jean H. Gallier   $n$-rational algebras. II. Varieties and
                                  logic of inequalities  . . . . . . . . . 776--794
                  Nathan Linial   The Information-Theoretic Bound is Good
                                  for Merging  . . . . . . . . . . . . . . 795--801
         Joachim von zur Gathen   Parallel Algorithms for Algebraic
                                  Problems . . . . . . . . . . . . . . . . 802--824
                 R. Sherman and   
                  A. Pnueli and   
                       D. Harel   Is the interesting part of process logic
                                  uninteresting? A translation from PL to
                                  PDL  . . . . . . . . . . . . . . . . . . 825--839
                  J. Ja'Ja' and   
       V. K. Prasanna Kumar and   
                       J. Simon   Information transfer under different
                                  sets of protocols  . . . . . . . . . . . 840--849
                Manuel Blum and   
                  Silvio Micali   How to generate cryptographically strong
                                  sequences of pseudorandom bits . . . . . 850--864
            Dennis S. Arnon and   
          George E. Collins and   
                 Scott McCallum   Cylindrical algebraic decomposition. I.
                                  The basic algorithm  . . . . . . . . . . 865--877
            Dennis S. Arnon and   
          George E. Collins and   
                 Scott McCallum   Cylindrical algebraic decomposition. II.
                                  An adjacency algorithm for the plane . . 878--889


SIAM Journal on Computing
Volume 14, Number 1, 1985

      Paul M. B. Vitányi   An Optimal Simulation of Counter
                                  Machines . . . . . . . . . . . . . . . . 1--33
      Paul M. B. Vitányi   An optimal simulation of counter
                                  machines: the ACM case . . . . . . . . . 34--40
                   Ker-I Ko and   
              Uwe Schöning   On circuit-size complexity and the low
                                  hierarchy in NP  . . . . . . . . . . . . 41--51
        Paris C. Kanellakis and   
      Christos H. Papadimitriou   The Complexity of Distributed
                                  Concurrency Control  . . . . . . . . . . 52--74
               John H. Reif and   
               Paul G. Spirakis   Unbounded speed variability in
                                  distributed communications systems . . . 75--92
               Hiroshi Imai and   
                  Masao Iri and   
                   Kazuo Murota   Vorono\uì Diagrams in the Laguerre
                                  Geometry and its Applications  . . . . . 93--105
            Charles M. Fiduccia   An Efficient Formula for Linear
                                  Recurrences  . . . . . . . . . . . . . . 106--112
                Stuart A. Kurtz   Sparse sets in ${\rm NP}-{\rm P}$:
                                  relativizations  . . . . . . . . . . . . 113--119
              Andrew C. Yao and   
                 F. Frances Yao   On Fault-Tolerant Networks for Sorting   120--128
                  Andrew C. Yao   On the expected performance of path
                                  compression algorithms . . . . . . . . . 129--133
             James E. Boyce and   
            David P. Dobkin and   
Robert L. (Scot) Drysdale III and   
                  Leo J. Guibas   Finding Extremal Polygons  . . . . . . . 134--147
 José L. Balcázar   Simplicity, Relativizations and
                                  Nondeterminism . . . . . . . . . . . . . 148--157
            Moon Jung Chung and   
             Fillia Makedon and   
        Ivan Hal Sudborough and   
                Jonathan Turner   Polynomial time algorithms for the MIN
                                  CUT problem on degree restricted trees   158--177
                   J. J. Risler   Additive Complexity and Zeros of Real
                                  Polynomials  . . . . . . . . . . . . . . 178--183
                   Susan Landau   Factoring Polynomials over Algebraic
                                  Number Fields  . . . . . . . . . . . . . 184--195
                 J. C. Lagarias   The computational complexity of
                                  simultaneous Diophantine approximation
                                  problems . . . . . . . . . . . . . . . . 196--209
            Norishige Chiba and   
                Takao Nishizeki   Arboricity and Subgraph Listing
                                  Algorithms . . . . . . . . . . . . . . . 210--223
                   Wen-Lian Hsu   Maximum weight clique algorithms for
                                  circular-arc graphs and circle graphs    224--231
                 Dan E. Willard   New Data Structures for Orthogonal Range
                                  Queries  . . . . . . . . . . . . . . . . 232--253
           Robert E. Tarjan and   
             Mihalis Yannakakis   Addendum: ``Simple linear-time
                                  algorithms to test chordality of graphs,
                                  test acyclicity of hypergraphs, and
                                  selectively reduce acyclic hypergraphs'' 254--255

SIAM Journal on Computing
Volume 14, Number 2, 1985

            Edward M. McCreight   Priority Search Trees  . . . . . . . . . 257--276
                  Andrew C. Yao   On the Complexity of Maintaining Partial
                                  Sums . . . . . . . . . . . . . . . . . . 277--288
         Kazuhiko Matsumoto and   
            Takao Nishizeki and   
                   Nobuji Saito   An efficient algorithm for finding
                                  multicommodity flows in planar networks  289--302
                Uzi Vishkin and   
                  Avi Wigderson   Trade-offs between depth and width in
                                  parallel computation . . . . . . . . . . 303--314
           John E. Hopcroft and   
          Deborah A. Joseph and   
              Sue H. Whitesides   On the movement of robot arms in
                                  $2$-dimensional bounded regions  . . . . 315--333
                 Minoru Ito and   
            Motoaki Iwasaki and   
                   Tadao Kasami   Some results on the representative
                                  instance in relational databases . . . . 334--354
     Gopalakrishnan Vijayan and   
                  Avi Wigderson   Rectilinear Graphs and Their Embeddings  355--372
    György Ré\'vesz   Axioms for the Theory of
                                  Lambda-Conversion  . . . . . . . . . . . 373--382
                    W. Hartmann   On the multiplicative complexity of
                                  modules over associative algebras  . . . 383--395
          Rüdiger Reischuk   Probabilistic parallel algorithms for
                                  sorting and selection  . . . . . . . . . 396--409
              William Ogden and   
           Rockford J. Ross and   
                 Karl Winklmann   An ``interchange lemma'' for
                                  context-free languages . . . . . . . . . 410--415
         E. G. Coffman, Jr. and   
               T. T. Kadota and   
                    L. A. Shepp   A stochastic model of fragmentation in
                                  dynamic storage allocation . . . . . . . 416--425
            Oscar H. Ibarra and   
                 Sam M. Kim and   
                   Shlomo Moran   Sequential machine characterizations of
                                  trellis and cellular automata and
                                  applications . . . . . . . . . . . . . . 426--447
                   Micha Sharir   Intersection and closest-pair problems
                                  for a set of planar discs  . . . . . . . 448--468
                 Erich Kaltofen   Polynomial-time reductions from
                                  multivariate to bi- and univariate
                                  integral polynomial factorization  . . . 469--489
       Jeffrey Scott Vitter and   
                  Wen Chin Chen   Optimum Algorithms for a Model of Direct
                                  Chaining . . . . . . . . . . . . . . . . 490--499
                M. R. Garey and   
                  D. S. Johnson   Composing Functions to Minimize Image
                                  Size . . . . . . . . . . . . . . . . . . 500--503

SIAM Journal on Computing
Volume 14, Number 3, 1985

                J. A. Reeds and   
                N. J. A. Sloane   Shift Register Synthesis (Modulo $m$)    505--513
       David G. Kirkpatrick and   
                 Maria M. Klawe   Alphabetic Minimax Trees . . . . . . . . 514--526
       Susanne E. Hambrusch and   
                    Janos Simon   Solving Undirected Graph Problems on
                                  VLSI . . . . . . . . . . . . . . . . . . 527--544
             Samuel W. Bent and   
          Daniel D. Sleator and   
               Robert E. Tarjan   Biased Search Trees  . . . . . . . . . . 545--568
           Mohamed G. Gouda and   
                Louis E. Rosier   Priority networks of communicating
                                  finite state machines  . . . . . . . . . 569--584
                Timothy J. Long   On restricting the size of oracles
                                  compared with restricting access to
                                  oracles  . . . . . . . . . . . . . . . . 585--597
              R. E. Stearns and   
                H. B. Hunt, III   On the equivalence and containment
                                  problems for unambiguous regular
                                  expressions, regular grammars and finite
                                  automata . . . . . . . . . . . . . . . . 598--611
              Refael Hassin and   
              Donald B. Johnson   An $O(n \log^2 n)$ algorithm for maximum
                                  flow in undirected planar networks . . . 612--624
                Eugene W. Myers   An $O(E \log E + I)$ expected time
                                  algorithm for the planar segment
                                  intersection problem . . . . . . . . . . 625--637
                Danny Dolev and   
                Manfred Warmuth   Scheduling Flat Graphs . . . . . . . . . 638--657
                 Jeremy Spinrad   On Comparability and Permutation Graphs  658--670
           Ashok K. Chandra and   
                 Moshe Y. Vardi   The implication problem for functional
                                  and inclusion dependencies is
                                  undecidable  . . . . . . . . . . . . . . 671--677
                K. A. Kalorkoti   A lower bound for the formula size of
                                  rational functions . . . . . . . . . . . 678--687
                      Marc Snir   On Parallel Searching  . . . . . . . . . 688--708
              Marinus Veldhorst   Approximation of the consecutive ones
                                  matrix augmentation problem  . . . . . . 709--729
                   Zvi M. Kedem   Optimal allocation of area for
                                  single-chip computations . . . . . . . . 730--743
         E. G. Coffman, Jr. and   
                M. R. Garey and   
              D. S. Johnson and   
                  A. S. Lapaugh   Scheduling File Transfers  . . . . . . . 744--780

SIAM Journal on Computing
Volume 14, Number 4, 1985

           Greg N. Frederickson   Data structures for on-line updating of
                                  minimum spanning trees, with
                                  applications . . . . . . . . . . . . . . 781--798
                   J. Mark Keil   Decomposing a Polygon into Simpler
                                  Components . . . . . . . . . . . . . . . 799--817
           A. Satyanarayana and   
                  R. Kevin Wood   A linear-time algorithm for computing
                                  ${K}$-terminal reliability in
                                  series-parallel networks . . . . . . . . 818--832
            Stephen A. Cook and   
                H. James Hoover   A Depth-Universal Circuit  . . . . . . . 833--839
                 Helmut Alt and   
                  Kurt Mehlhorn   Searching Semisorted Tables  . . . . . . 840--848
               Larry Stockmeyer   On approximation algorithms for $\#{\rm
                                  P}$  . . . . . . . . . . . . . . . . . . 849--861
           Robert E. Tarjan and   
                    Uzi Vishkin   An Efficient Parallel Biconnectivity
                                  Algorithm  . . . . . . . . . . . . . . . 862--874
               Jeffrey M. Jaffe   Distributed multidestination routing:
                                  the constraints of local information . . 875--888
                    Henk Alblas   Finding minimal pass sequences for
                                  attribute grammars . . . . . . . . . . . 889--914
          Ehab S. El-Mallah and   
            Charles J. Colbourn   Optimum communication spanning trees in
                                  series-parallel networks . . . . . . . . 915--925
              D. G. Corneil and   
                    Y. Perl and   
                  L. K. Stewart   A Linear Recognition Algorithm for
                                  Cographs . . . . . . . . . . . . . . . . 926--934
               Rohit Parikh and   
              Ashok Chandra and   
                Joe Halpern and   
                   Albert Meyer   Equations between regular terms and an
                                  application to process logic . . . . . . 935--942
    Paul Walton Purdom, Jr. and   
               Cynthia A. Brown   The Pure Literal Rule and Polynomial
                                  Average Time . . . . . . . . . . . . . . 943--953
              Ulrich Faigle and   
              Gerhard Gierz and   
                Rainer Schrader   Algorithmic Approaches to Setup
                                  Minimization . . . . . . . . . . . . . . 954--965
               M. F. Singer and   
             B. D. Saunders and   
                 B. F. Caviness   An extension of Liouville's theorem on
                                  integration in finite terms  . . . . . . 966--990
                Sergiu Hart and   
                   Micha Sharir   Concurrent probabilistic programs, or:
                                  how to schedule if you must  . . . . . . 991--1012
                 Dan E. Willard   Searching unindexed and nonuniformly
                                  generated files in $\log \log N$ time    1013--1029
                  Debasis Mitra   Probabilistic models and asymptotic
                                  results for concurrent processing with
                                  exclusive and nonexclusive locks . . . . 1030--1051
               Deepak Kapur and   
              Paliath Narendran   The Knuth--Bendix completion procedure
                                  and Thue systems . . . . . . . . . . . . 1052--1072


SIAM Journal on Computing
Volume 15, Number 1, 1986

                   G. W. Cherry   Integration in finite terms with special
                                  functions: the logarithmic integral  . . 1--21
              Kurt Mehlhorn and   
          Athanasios Tsakalidis   An Amortized Analysis of Insertions into
                                  AVL-Trees  . . . . . . . . . . . . . . . 22--33
                Joseph O'Rourke   The Signature of a Plane Curve . . . . . 34--51
     Daniel Dominic Sleator and   
            Robert Endre Tarjan   Self-Adjusting Heaps . . . . . . . . . . 52--69
               Joost Engelfriet   The complexity of languages generated by
                                  attribute grammars . . . . . . . . . . . 70--86
               Stephen Cook and   
              Cynthia Dwork and   
          Rüdiger Reischuk   Upper and lower time bounds for parallel
                                  random access machines without
                                  simultaneous writes  . . . . . . . . . . 87--97
         Alberto Apostolico and   
             Raffaele Giancarlo   The Boyer--Moore--Galil string searching
                                  strategies revisited . . . . . . . . . . 98--105
  Friedhelm Meyer auf der Heide   Efficient simulations among several
                                  models of parallel computers . . . . . . 106--119
                  Zvi Galil and   
              Silvio Micali and   
                   Harold Gabow   An $O(EV \log V)$ algorithm for finding
                                  a maximal weighted matching in general
                                  graphs . . . . . . . . . . . . . . . . . 120--130
               Francis Chin and   
               K. V. S. Ramarao   Optimal termination protocols for
                                  network partitioning . . . . . . . . . . 131--144
                    M. Shub and   
                       S. Smale   Computational complexity: on the
                                  geometry of polynomials and a theory of
                                  cost. II . . . . . . . . . . . . . . . . 145--161
                Brenda S. Baker   A Provably Good Algorithm for the Two
                                  Module Routing Problem . . . . . . . . . 162--188
             D. Coppersmith and   
                M. M. Klawe and   
                N. J. Pippenger   Alphabetic Minimax Trees of Degree at
                                  Most $t$ . . . . . . . . . . . . . . . . 189--192
               Micha Sharir and   
                    Amir Schorr   On Shortest Paths in Polyhedral Spaces   193--215
                  T. Etzion and   
                      A. Lempel   An Efficient Algorithm for Generating
                                  Linear Transformations in a
                                  Shuffle-Exchange Network . . . . . . . . 216--221
              D. K. Friesen and   
                 M. A. Langston   Variable Sized Bin Packing . . . . . . . 222--230
                   John H. Reif   Logarithmic Depth Circuits for Algebraic
                                  Functions  . . . . . . . . . . . . . . . 231--242
              Stanley Cabay and   
                  Dong-Koo Choi   Algebraic computations of scaled Padé
                                  fractions  . . . . . . . . . . . . . . . 243--270
            H. Edelsbrunner and   
                       E. Welzl   Constructing belts in two-dimensional
                                  arrangements with applications . . . . . 271--284
                Leonid A. Levin   Average Case Complete Problems . . . . . 285--286
       David G. Kirkpatrick and   
                 Raimund Seidel   The Ultimate Planar Convex Hull
                                  Algorithm? . . . . . . . . . . . . . . . 287--299
                B. Chazelle and   
        R. L. Drysdale, III and   
                      D. T. Lee   Computing the Largest Empty Rectangle    300--315

SIAM Journal on Computing
Volume 15, Number 2, 1986

       Herbert Edelsbrunner and   
         Leonidas J. Guibas and   
                   Jorge Stolfi   Optimal Point Location in a Monotone
                                  Subdivision  . . . . . . . . . . . . . . 317--340
            H. Edelsbrunner and   
                J. O'Rourke and   
                      R. Seidel   Constructing Arrangements of Lines and
                                  Hyperplanes with Applications  . . . . . 341--363
                    L. Blum and   
                    M. Blum and   
                        M. Shub   A Simple Unpredictable Pseudo-Random
                                  Number Generator . . . . . . . . . . . . 364--383
                Lenore Blum and   
                   Michael Shub   Evaluating rational functions: infinite
                                  precision is finite cost and tractable
                                  on average . . . . . . . . . . . . . . . 384--398
              Pekka Orponen and   
             David A. Russo and   
              Uwe Schöning   Optimal approximations and polynomially
                                  levelable sets . . . . . . . . . . . . . 399--408
              John L. Bruno and   
                Peter J. Downey   Probabilistic bounds on the performance
                                  of list scheduling . . . . . . . . . . . 409--417
                G. Ausiello and   
                  A. D'Atri and   
                     D. Sacc\`a   Minimal Representation of Directed
                                  Hypergraphs  . . . . . . . . . . . . . . 418--431
         Joachim von zur Gathen   Representations and parallel
                                  computations for rational functions  . . 432--452
                 Wolfgang Maass   On the Complexity of Nonconvex Covering  453--467
                 Dan E. Willard   Log-logarithmic selection resolution
                                  protocols in a multiple access channel   468--477
               Hiroshi Imai and   
                    Takao Asano   Efficient algorithms for geometric graph
                                  search problems  . . . . . . . . . . . . 478--494
         Kazuhiko Matsumoto and   
            Takao Nishizeki and   
                   Nobuji Saito   Planar multicommodity flows, maximum
                                  matchings and negative cycles  . . . . . 495--510
                 John Geske and   
              Joachim Grollmann   Relativizations of unambiguous and
                                  random polynomial time classes . . . . . 511--519
          Carl E. Langenhop and   
              William E. Wright   Probabilities related to father-son
                                  distances in binary search trees . . . . 520--530
                  L. G. Valiant   Negation is Powerless for Boolean Slice
                                  Functions  . . . . . . . . . . . . . . . 531--535
                   A. M. Frieze   On the Lagarias--Odlyzko algorithm for
                                  the subset sum problem . . . . . . . . . 536--539
         Robert Alan Wright and   
             Bruce Richmond and   
             Andrew Odlyzko and   
               Brendan D. McKay   Constant Time Generation of Free Trees   540--548
              Allan Borodin and   
                Danny Dolev and   
              Faith E. Fich and   
                  Wolfgang Paul   Bounds for Width Two Branching Programs  549--560
             Jonathan S. Turner   On the probable performance of
                                  heuristics for bandwidth minimization    561--580
              D\~ung T. Hu\`ynh   The complexity of the membership problem
                                  for two subclasses of polynomial ideals  581--594
          Rodney W. Johnson and   
           Aileen M. McLoughlin   Noncommutative bilinear algorithms for
                                  $3\times 3$ matrix multiplication  . . . 595--603
            Francine Berman and   
            Mary Ellen Bock and   
               Eric Dittert and   
       Michael J. O'Donnell and   
                  Darrell Plank   Collections of Functions for Perfect
                                  Hashing  . . . . . . . . . . . . . . . . 604--618
            Joan Feigenbaum and   
     Alejandro A. Schäffer   Recognizing composite graphs is
                                  equivalent to testing graph isomorphism  619--627

SIAM Journal on Computing
Volume 15, Number 3, 1986

                P. Flajolet and   
                   H. Prodinger   Register Allocation for Unary--Binary
                                  Trees  . . . . . . . . . . . . . . . . . 629--640
                  Joel Friedman   Constructing $O(n \log n)$ size monotone
                                  formulae for the $k$th threshold
                                  function of $n$ Boolean variables  . . . 641--654
           Robert W. Irving and   
                   Paul Leather   The Complexity of Counting Stable
                                  Marriages  . . . . . . . . . . . . . . . 655--667
            Claudio Citrini and   
    Stefano Crespi-Reghizzi and   
                 Dino Mandrioli   On Deterministic Multi-Pass Analysis . . 668--693
                J. Scott Provan   The complexity of reliability
                                  computations in planar and acyclic
                                  graphs . . . . . . . . . . . . . . . . . 694--702
               Bernard Chazelle   Filtering Search: a New Approach to
                                  Query-Answering  . . . . . . . . . . . . 703--724
                     M. E. Dyer   On a Multidimensional Search Technique
                                  and Its Application to the Euclidean
                                  One-Centre Problem . . . . . . . . . . . 725--738
José L. Balcázar and   
             Ronald V. Book and   
              Uwe Schöning   Sparse Sets, Lowness and Highness  . . . 739--747
          Philippe Flajolet and   
               Robert Sedgewick   Digital Search Trees Revisited . . . . . 748--767
             J. E. Hopcroft and   
                  G. T. Wilfong   Reducing multiple object motion planning
                                  to graph searching . . . . . . . . . . . 768--785
                 Friedrich Otto   Church--Rosser Thue systems that present
                                  free monoids . . . . . . . . . . . . . . 786--792
     Frank Thomson Leighton and   
            Arnold L. Rosenberg   Three-Dimensional Circuit Layouts  . . . 793--813
                Justin R. Smith   Parallel algorithms for depth-first
                                  searches. I. Planar graphs . . . . . . . 814--830
            H. B. Hunt, III and   
              D. J. Rosenkrantz   Recursion schemes and recursive programs
                                  are exponentially hard to analyze  . . . 831--850
                 Benjamin Arazi   A Binary Search with a Parallel Recovery
                                  of the Bits  . . . . . . . . . . . . . . 851--855
                   Richard Hull   Relative information capacity of simple
                                  relational database schemata . . . . . . 856--886
            Jeffrey H. Kingston   Analysis of Henriksen's algorithm for
                                  the simulation event set . . . . . . . . 887--902

SIAM Journal on Computing
Volume 15, Number 4, 1986

                J. H. Davenport   The Risch Differential Equation Problem  903--918
          Martin David Katz and   
               Dennis J. Volper   Data Structures for Retrieval on Square
                                  Grids  . . . . . . . . . . . . . . . . . 919--931
               King F. Pang and   
                 Abbas El Gamal   Communication complexity of computing
                                  the Hamming distance . . . . . . . . . . 932--947
          William H. Cunningham   Improved bounds for matroid partition
                                  and intersection algorithms  . . . . . . 948--957
              Klaus Ambos-Spies   An Inhomogeneity in the Structure of
                                  Karp Degrees . . . . . . . . . . . . . . 958--963
           Gaston H. Gonnet and   
                   J. Ian Munro   Heaps on Heaps . . . . . . . . . . . . . 964--971
                    David Prill   On Approximations and Incidence in
                                  Cylindrical Algebraic Decompositions . . 972--993
              Paul W. Beame and   
            Stephen A. Cook and   
                H. James Hoover   Log Depth Circuits for Division and
                                  Related Problems . . . . . . . . . . . . 994--1003
              Joseph Ja'Ja' and   
                    Jean Takche   On the Validity of the Direct Sum
                                  Conjecture . . . . . . . . . . . . . . . 1004--1020
                   Norbert Blum   On the single-operation worst-case time
                                  complexity of the disjoint set union
                                  problem  . . . . . . . . . . . . . . . . 1021--1024
                       Li Wu Li   Ranking and Unranking of AVL-Trees . . . 1025--1035
                   Michael Luby   A simple parallel algorithm for the
                                  maximal independent set problem  . . . . 1036--1053
                 Egon Balas and   
                  Chang Sung Yu   Finding a Maximum Clique in an Arbitrary
                                  Graph  . . . . . . . . . . . . . . . . . 1054--1068
           D. S. Hirschberg and   
                  L. L. Larmore   Average Case Analysis of Marking
                                  Algorithms . . . . . . . . . . . . . . . 1069--1074
                  U. Faigle and   
           L. Lovász and   
                R. Schrader and   
               Gy. Turán   Searching in trees, series-parallel and
                                  interval orders  . . . . . . . . . . . . 1075--1084
            Donald P. Gaver and   
             Patricia A. Jacobs   Processor-shared time-sharing models in
                                  heavy traffic  . . . . . . . . . . . . . 1085--1100
              D\~ung T. Hu\`ynh   Some observations about the randomness
                                  of hard problems . . . . . . . . . . . . 1101--1105
               Ming-Te Chao and   
                    John Franco   Probabilistic analysis of two heuristics
                                  for the $3$-satisfiability problem . . . 1106--1118
         Tsuyoshi Kawaguchi and   
                     Seiki Kyan   Worst case bound of an LRF schedule for
                                  the mean weighted flow-time problem  . . 1119--1129
                     Udi Manber   On maintaining dynamic information in a
                                  concurrent environment . . . . . . . . . 1130--1142
                  Eric Bach and   
            Gary Lee Miller and   
             Jeffrey O. Shallit   Sums of Divisors, Perfect Numbers and
                                  Factoring  . . . . . . . . . . . . . . . 1143--1154
      Jean-Pierre Jouannaud and   
       Hél\`ene Kirchner   Completion of a set of rules modulo a
                                  set of equations . . . . . . . . . . . . 1155--1194


SIAM Journal on Computing
Volume 16, Number 1, February, 1987

  Christos H. Papadimitriou and   
             John N. Tsitsiklis   On Stochastic Scheduling with In-Tree
                                  Precedence Constraints . . . . . . . . . 1--6
           Ravindran Kannan and   
                Gary Miller and   
                  Larry Rudolph   Sublinear Parallel Algorithm for
                                  Computing the Greatest Common Divisor of
                                  Two Integers . . . . . . . . . . . . . . 7--16
               Oded Shmueli and   
                      Alon Itai   Complexity of Views: Tree and Cyclic
                                  Schemas  . . . . . . . . . . . . . . . . 17--37
                Russ Miller and   
               Quentin F. Stout   Data Movement Techniques for the Pyramid
                                  Computer . . . . . . . . . . . . . . . . 38--60
               Richard Cole and   
               Micha Sharir and   
                    Chee K. Yap   On $k$-hulls and related problems  . . . 61--77
                 F. Aurenhammer   Power Diagrams: Properties, Algorithms,
                                  and Applications . . . . . . . . . . . . 78--96
                 A. Borodin and   
                    F. Fich and   
     F. Meyer auf der Heide and   
                   E. Upfal and   
                   A. Wigderson   A Time-Space Tradeoff for Element
                                  Distinctness . . . . . . . . . . . . . . 97--99
Friedhelm Meyer auf der Heide and   
                  Avi Wigderson   The Complexity of Parallel Sorting . . . 100--107
               Douglas W. Jones   A Note on Bottom-Up Skew Heaps . . . . . 108--110
                   Dan Gusfield   Three fast algorithms for four problems
                                  in stable marriage . . . . . . . . . . . 111--128
            H. B. Hunt, III and   
          D. J. Rosenkrantz and   
                 P. A. Bloniarz   On the computational complexity of
                                  algebra on lattices  . . . . . . . . . . 129--148
               Frank D. Murgolo   An efficient approximation scheme for
                                  variable-sized bin packing . . . . . . . 149--161
             Hyeong-Ah Choi and   
                S. Louis Hakimi   Scheduling File Transfers for Trees and
                                  Odd Cycles . . . . . . . . . . . . . . . 162--168
         C. A. Courcoubetis and   
               M. I. Reiman and   
                       B. Simon   Stability of a queueing system with
                                  concurrent service and locking . . . . . 169--178
            Peter D. Mosses and   
              Gordon D. Plotkin   On Proving Limiting Completeness . . . . 179--194
             Wolfgang Maass and   
                    Amir Schorr   Speed-up of Turing machines with one
                                  work tape and a two-way input tape . . . 195--202
Françoise Fogelman-Soulié and   
         Gérard Weisbuch   Random iterations of threshold networks
                                  and associative memory . . . . . . . . . 203--220

SIAM Journal on Computing
Volume 16, Number 2, April, 1987

            Karel Culik, II and   
          Juhani Karhumäki   The equivalence problem for
                                  single-valued two-way transducers (on
                                  NPDTOL languages) is decidable . . . . . 221--230
                  E. Korach and   
                   S. Moran and   
                        S. Zaks   The optimality of distributive
                                  constructions of minimum weight and
                                  degree restricted spanning trees in a
                                  complete network of processors . . . . . 231--236
               Dan Gusfield and   
             Charles Martel and   
    David Fernández-Baca   Fast Algorithms for Bipartite Network
                                  Flow . . . . . . . . . . . . . . . . . . 237--251
                    D. Bini and   
                    M. Capovani   Tensor rank and border rank of band
                                  Toeplitz matrices  . . . . . . . . . . . 252--258
                 Jin-Yi Cai and   
              Gabriele E. Meyer   Graph Minimal Uncolorability is
                                  ${\text{D}}^{\text{p}}$-Complete . . . . 259--277
                Thomas Lickteig   The computational complexity of division
                                  in quadratic extension fields  . . . . . 278--311
                    Takao Asano   An Application of Duality to
                                  Edge-Deletion Problems . . . . . . . . . 312--331
         Ir\`ene Guessarian and   
           José Meseguer   On the Axiomatization of
                                  ``If--Then--Else'' . . . . . . . . . . . 332--357
                   J. D. Horton   A polynomial-time algorithm to find the
                                  shortest cycle basis of a graph  . . . . 358--366
            Oscar H. Ibarra and   
               Michael A. Palis   On efficient simulations of systolic
                                  arrays by random-access machines . . . . 367--377
                  C. Knessl and   
            B. J. Matkowsky and   
                  Z. Schuss and   
                        C. Tier   Asymptotic expansions for a closed
                                  multiple access system . . . . . . . . . 378--398
                Micha Hofri and   
                  Keith W. Ross   On the optimal control of two queues
                                  with server setup times and its analysis 399--420

SIAM Journal on Computing
Volume 16, Number 3, June, 1987

               Roberto Tamassia   On embedding a graph in the grid with
                                  the minimum number of bends  . . . . . . 421--444
                  Sam Toueg and   
           Kenneth J. Perry and   
                 T. K. Srikanth   Fast Distributed Agreement . . . . . . . 445--457
                 Yossi Azar and   
                    Uzi Vishkin   Tight comparison bounds on the
                                  complexity of parallel sorting . . . . . 458--464
             Alan H. Mekler and   
               Evelyn M. Nelson   Equational Bases for If--Then--Else  . . 465--485
              Yuri Gurevich and   
                 Saharon Shelah   Expected computation time for
                                  Hamiltonian path problem . . . . . . . . 486--502
             Vijay K. Vaishnavi   Weighted Leaf AVL-Trees  . . . . . . . . 503--537
  Christos H. Papadimitriou and   
             Mihalis Yannakakis   The Complexity of Reliable Concurrency
                                  Control  . . . . . . . . . . . . . . . . 538--553
              Donald K. Friesen   Tighter bounds for LPT scheduling on
                                  uniform processors . . . . . . . . . . . 554--560
                   Micha Sharir   On Shortest Paths Amidst Convex
                                  Polyhedra  . . . . . . . . . . . . . . . 561--572
                   T. C. Hu and   
              Michelle L. Wachs   Binary Search on a Tape  . . . . . . . . 573--590
               Arjen K. Lenstra   Factoring multivariate polynomials over
                                  algebraic number fields  . . . . . . . . 591--598

SIAM Journal on Computing
Volume 16, Number 4, August, 1987

                   Dan Gusfield   Optimal Mixed Graph Augmentation . . . . 599--612
                William Gasarch   Oracles for Deterministic Versus
                                  Alternating Classes  . . . . . . . . . . 613--627
           D. S. Hirschberg and   
                  L. L. Larmore   The Least Weight Subsequence Problem . . 628--638
  Christos H. Papadimitriou and   
              Jeffrey D. Ullman   A Communication-Time Tradeoff  . . . . . 639--646
      Joseph S. B. Mitchell and   
             David M. Mount and   
      Christos H. Papadimitriou   The Discrete Geodesic Problem  . . . . . 647--668
        Teofilo F. Gonzalez and   
                  Sing-Ling Lee   A $1.6$ approximation algorithm for
                                  routing multiterminal nets . . . . . . . 669--704
             B. John Oommen and   
                   E. R. Hansen   List organizing strategies using
                                  stochastic move-to-front and stochastic
                                  move-to-rear operations  . . . . . . . . 705--716
            Nicholas C. Wormald   Generating Random Unlabelled Graphs  . . 717--727
                P. Widmayer and   
                   Y. F. Wu and   
                     C. K. Wong   On Some Distance Problems in Fixed
                                  Orientations . . . . . . . . . . . . . . 728--746
             David Helmbold and   
                     Ernst Mayr   Two Processor Scheduling is in
                                  $\mathcal{NC}$ . . . . . . . . . . . . . 747--759
                  Neil Immerman   Languages that Capture Complexity
                                  Classes  . . . . . . . . . . . . . . . . 760--778

SIAM Journal on Computing
Volume 16, Number 5, October, 1987

            Louis E. Rosier and   
                   Hsu-Chun Yen   Logspace hierarchies, polynomial time
                                  and the complexity of fairness problems
                                  concerning $\omega$-machines . . . . . . 779--807
                 Helmut Alt and   
             Torben Hagerup and   
              Kurt Mehlhorn and   
            Franco P. Preparata   Deterministic simulation of idealized
                                  parallel computers on more realistic
                                  ones . . . . . . . . . . . . . . . . . . 808--835
               Wen Qi Huang and   
                  Xiang Dong Yu   A DNF without Regular Shortest Consensus
                                  Path . . . . . . . . . . . . . . . . . . 836--840
          Edward P. F. Chan and   
           Alberto O. Mendelzon   Independent and Separable Database
                                  Schemes  . . . . . . . . . . . . . . . . 841--851
                Stuart A. Kurtz   A Note on Randomized Polynomial Time . . 852--853
                     Anna Lubiw   Doubly Lexical Orderings of Matrices . . 854--879
            Pierre McKenzie and   
                Stephen A. Cook   The parallel complexity of Abelian
                                  permutation group problems . . . . . . . 880--909
            H. B. Hunt, III and   
                  R. E. Stearns   Nonlinear algebra and optimization on
                                  rings are ``hard'' . . . . . . . . . . . 910--929
         Joachim von zur Gathen   Computing Powers in Parallel . . . . . . 930--945
                  B. Becker and   
                        G. Hotz   On the optimal layout of planar graphs
                                  with fixed boundary  . . . . . . . . . . 946--972

SIAM Journal on Computing
Volume 16, Number 6, December, 1987

               Robert Paige and   
               Robert E. Tarjan   Three Partition Refinement Algorithms    973--989
            Mark C. K. Yang and   
               Jun S. Huang and   
                Yuan-Chieh Chow   Optimal Parallel Sorting Scheme by Order
                                  Statistics . . . . . . . . . . . . . . . 990--1003
            Greg N. Federickson   Fast algorithms for shortest paths in
                                  planar graphs, with applications . . . . 1004--1022
            Alistair Moffat and   
                  Tadao Takaoka   An all pairs shortest path algorithm
                                  with expected time $O(n^2 \log n)$ . . . 1023--1031
             Nicholas Pippenger   Sorting and Selecting in Rounds  . . . . 1032--1038
                Karl Abrahamson   Generalized String Matching  . . . . . . 1039--1051
                   A. M. Frieze   On the exact solution of random
                                  travelling salesman problems with medium
                                  size integer coefficients  . . . . . . . 1052--1072
                Micha Hofri and   
                Alan G. Konheim   Padded Lists Revisited . . . . . . . . . 1073--1114
            Lawrence L. Larmore   Height Restricted Optimal Binary Trees   1115--1123
          Edward R. Scheinerman   Almost Sure Fault Tolerance in Random
                                  Graphs . . . . . . . . . . . . . . . . . 1124--1134
            Oscar H. Ibarra and   
                      Tao Jiang   On One-Way Cellular Arrays . . . . . . . 1135--1154
           John A. Morrison and   
             Larry A. Shepp and   
         Christopher J. Van Wyk   A Queueing Analysis of Hashing with Lazy
                                  Deletion . . . . . . . . . . . . . . . . 1155--1164


SIAM Journal on Computing
Volume 17, Number 1, February, 1988

                 Yehoshua Sagiv   On Bounded Database Schemes and Bounded
                                  Horn-Clause Programs . . . . . . . . . . 1--22
              D. K. Friesen and   
                     F. S. Kuhl   Analysis of a hybrid algorithm for
                                  packing unequal bins . . . . . . . . . . 23--40
               Sumio Masuda and   
                 Kazuo Nakajima   An optimal algorithm for finding a
                                  maximum independent set of a
                                  circular-arc graph . . . . . . . . . . . 41--52
           Daniel Bienstock and   
                 Clyde L. Monma   On the complexity of covering vertices
                                  by faces in a planar graph . . . . . . . 53--76
           Jyrki Katajainen and   
            Jan van Leeuwen and   
               Martti Penttonen   Fast simulation of Turing machines by
                                  random access machines . . . . . . . . . 77--88
               Masanori Fushimi   Designing a uniform random number
                                  generator whose subsequences are
                                  $k$-distributed  . . . . . . . . . . . . 89--99
                  U. Faigle and   
               Gy. Turán   Sorting and Recognition Problems for
                                  Ordered Sets . . . . . . . . . . . . . . 100--113
                 David M. Nicol   Expected Performance of $m$-Solution
                                  Backtracking . . . . . . . . . . . . . . 114--127
               Richard Cole and   
                    Uzi Vishkin   Approximate Parallel Scheduling. Part I:
                                  The Basic Technique with Applications to
                                  Optimal Parallel List Ranking in
                                  Logarithmic Time . . . . . . . . . . . . 128--142
           Robert E. Tarjan and   
         Christopher J. Van Wyk   An $O(n \log \log n)$-time algorithm for
                                  triangulating a simple polygon . . . . . 143--178

SIAM Journal on Computing
Volume 17, Number 2, April, 1988

                      Eric Bach   How to Generate Factored Random Numbers  179--193
               Werner Alexi and   
                 Benny Chor and   
             Oded Goldreich and   
               Claus-P. Schnorr   RSA and Rabin functions: certain parts
                                  are as hard as the whole . . . . . . . . 194--209
         Charles H. Bennett and   
            Gilles Brassard and   
               Jean-Marc Robert   Privacy Amplification by Public
                                  Discussion . . . . . . . . . . . . . . . 210--229
                 Benny Chor and   
                 Oded Goldreich   Unbiased bits from sources of weak
                                  randomness and probabilistic
                                  communication complexity . . . . . . . . 230--261
             Alan M. Frieze and   
         Johan Håstad and   
                Ravi Kannan and   
        Jeffrey C. Lagarias and   
                     Adi Shamir   Reconstructing truncated integer
                                  variables satisfying linear congruences  262--280
           Shafi Goldwasser and   
              Silvio Micali and   
               Ronald L. Rivest   A digital signature scheme secure
                                  against adaptive chosen-message attacks  281--308
          Joachim Grollmann and   
                 Alan L. Selman   Complexity Measures for Public-Key
                                  Cryptosystems  . . . . . . . . . . . . . 309--335
             Johan Håstad   Solving Simultaneous Modular Equations
                                  of Low Degree  . . . . . . . . . . . . . 336--341
        Jeffrey C. Lagarias and   
                 James A. Reeds   Unique Extrapolation of Polynomial
                                  Recurrences  . . . . . . . . . . . . . . 342--362
            Douglas L. Long and   
                  Avi Wigderson   The discrete logarithm hides $O(\log n)$
                                  bits . . . . . . . . . . . . . . . . . . 363--372
               Michael Luby and   
                Charles Rackoff   How to construct pseudorandom
                                  permutations from pseudorandom functions 373--386
             Carl Pomerance and   
                J. W. Smith and   
                    Randy Tuler   A pipeline architecture for factoring
                                  large integers with the quadratic sieve
                                  algorithm  . . . . . . . . . . . . . . . 387--403
                 J. H. Reif and   
                    J. D. Tygar   Efficient Parallel Pseudorandom Number
                                  Generation . . . . . . . . . . . . . . . 404--411
              Silvio Micali and   
            Charles Rackoff and   
                      Bob Sloan   The notion of security for probabilistic
                                  cryptosystems  . . . . . . . . . . . . . 412--426
                      Zvi Galil   Preface  . . . . . . . . . . . . . . . . v--vii

SIAM Journal on Computing
Volume 17, Number 3, June, 1988

               Bernard Chazelle   A functional approach to data structures
                                  and its use in multidimensional
                                  searching  . . . . . . . . . . . . . . . 427--462
            Philip N. Klein and   
                   John H. Reif   Parallel time $O(\log n)$ acceptance of
                                  deterministic CFLs on an exclusive-write
                                  P-RAM  . . . . . . . . . . . . . . . . . 463--485
                     Xin He and   
                   Yaacov Yesha   A nearly optimal parallel algorithm for
                                  constructing depth first spanning trees
                                  in planar graphs . . . . . . . . . . . . 486--491
               Boris Pittel and   
                    Jenn-Hwa Yu   On search times for early-insertion
                                  coalesced hashing  . . . . . . . . . . . 492--503
                    R. Book and   
                 P. Orponen and   
                   D. Russo and   
                    O. Watanabe   Lowness properties of sets in the
                                  exponential-time hierarchy . . . . . . . 504--516
            Andrew Chi Chih Yao   Monotone Bipartite Graph Properties are
                                  Evasive  . . . . . . . . . . . . . . . . 517--520
          Alessandro D'Atri and   
               Marina Moscarini   Distance-hereditary graphs, Steiner
                                  trees, and connected domination  . . . . 521--538
          Dorit S. Hochbaum and   
                David B. Shmoys   A polynomial approximation scheme for
                                  scheduling on uniform processors: using
                                  the dual approximation approach  . . . . 539--551
                   Dan Gusfield   A graph theoretic approach to
                                  statistical data security  . . . . . . . 552--571
               Pravin M. Vaidya   Minimum Spanning Trees in
                                  $k$-Dimensional Space  . . . . . . . . . 572--582
                Alan Siegel and   
                    Danny Dolev   Some Geometry for General River Routing  583--605
              Faith E. Fich and   
            Prabhakar Ragde and   
                  Avi Wigderson   Relations between concurrent-write
                                  models of parallel computation . . . . . 606--627
                Timothy J. Long   Erratum: ``On restricting the size of
                                  oracles compared with restricting access
                                  to oracles'' [SIAM J. Comput. \bf 14
                                  (1985), no. 3, 585--597, MR 87h:68053]   628--628

SIAM Journal on Computing
Volume 17, Number 4, August, 1988

          Nachum Dershowitz and   
                 Leo Marcus and   
               Andrzej Tarlecki   Existence, uniqueness, and construction
                                  of rewrite systems . . . . . . . . . . . 629--639
         John Welliaveetil John   A New Lower Bound for the
                                  Set-Partitioning Problem . . . . . . . . 640--647
                    R. Schaback   On the expected sublinearity of the
                                  Boyer--Moore algorithm . . . . . . . . . 648--658
      Paul M. B. Vitányi   Locality, communication, and
                                  interconnect length in multicomputers    659--672
           Lud\vek Ku\vcera and   
          V\vera Trnková   Isomorphism Testing of Unary Algebras    673--686
             Gary L. Miller and   
        Vijaya Ramachandran and   
                 Erich Kaltofen   Efficient parallel evaluation of
                                  straight-line code and arithmetic
                                  circuits . . . . . . . . . . . . . . . . 687--695
                 S. S. Ravi and   
                 Errol L. Lloyd   The complexity of near-optimal
                                  programmable logic array folding . . . . 696--710
              Cynthia Dwork and   
        Paris C. Kanellakis and   
               Larry Stockmeyer   Parallel Algorithms for Term Matching    711--731
                 David Avis and   
                      C. W. Lai   The probabilistic analysis of a
                                  heuristic for the assignment problem . . 732--741
                   Dan Gusfield   The structure of the stable roommate
                                  problem: efficient representation and
                                  enumeration of all stable assignments    742--769
                   Richard Cole   Parallel Merge Sort  . . . . . . . . . . 770--785
       Étienne Grandjean   A natural NP-complete problem with a
                                  nontrivial lower bound . . . . . . . . . 786--809
                Harold N. Gabow   Scheduling UET systems on two uniform
                                  processors and length two pipelines  . . 810--829
            Kenneth L. Clarkson   A Randomized Algorithm for Closest-Point
                                  Queries  . . . . . . . . . . . . . . . . 830--847

SIAM Journal on Computing
Volume 17, Number 5, October, 1988

         Mikhail J. Atallah and   
                S. Rao Kosaraju   Efficient solutions to some
                                  transportation problems with
                                  applications to minimizing robot arm
                                  travel . . . . . . . . . . . . . . . . . 849--869
       Herbert Edelsbrunner and   
               Steven S. Skiena   Probing convex polygons with $x$-rays    870--882
            Richard M. Karp and   
             Rajeev Motwani and   
             Prabhakar Raghavan   Deferred Data Structuring  . . . . . . . 883--902
             Ronald V. Book and   
                       Ker-I Ko   On Sets Truth-Table Reducible to Sparse
                                  Sets . . . . . . . . . . . . . . . . . . 903--919
                J. Scott Provan   An approximation scheme for finding
                                  Steiner trees with obstacles . . . . . . 920--934
                  Neil Immerman   Nondeterministic space is closed under
                                  complementation  . . . . . . . . . . . . 935--938
           Stephen L. Bloom and   
      Zoltán Ésik   Varieties of Iteration Theories  . . . . 939--966
                 M. E. Dyer and   
                   A. M. Frieze   On the Complexity of Computing the
                                  Volume of a Polyhedron . . . . . . . . . 967--974
              Cynthia Dwork and   
                David Peleg and   
         Nicholas Pippenger and   
                      Eli Upfal   Fault Tolerance in Networks of Bounded
                                  Degree . . . . . . . . . . . . . . . . . 975--988
                 Alan L. Selman   Natural Self-Reducible Sets  . . . . . . 989--996
               Matthew Hennessy   Axiomatising Finite Concurrent Processes 997--1017
                    Zevi Miller   A linear algorithm for topological
                                  bandwidth in degree-three trees  . . . . 1018--1035
                  Paolo Zellini   Optimal bounds for solving tridiagonal
                                  systems with preconditioning . . . . . . 1036--1043
                Colin McDiarmid   Average-Case Lower Bounds for Searching  1044--1060
           Robert E. Tarjan and   
         Christopher J. Van Wyk   Erratum: ``An $O(n\log \log n)$-time
                                  algorithm for triangulating a simple
                                  polygon''  . . . . . . . . . . . . . . . 1061--1061

SIAM Journal on Computing
Volume 17, Number 6, December, 1988

            Thomas Lengauer and   
                     Egon Wanke   Efficient solution of connectivity
                                  problems on hierarchically defined
                                  graphs . . . . . . . . . . . . . . . . . 1063--1080
             Michael Ben-Or and   
               Ephraim Feig and   
               Dexter Kozen and   
                 Prasoon Tiwari   A fast parallel algorithm for
                                  determining all roots of a polynomial
                                  with real roots  . . . . . . . . . . . . 1081--1092
              Kurt Mehlhorn and   
          Stefan Näher and   
                     Helmut Alt   A lower bound on the complexity of the
                                  union-split-find problem . . . . . . . . 1093--1102
        Robert J. T. Morris and   
                Wing Shing Wong   A Short-Term Neural Network Memory . . . 1103--1118
Béla Bollobás and   
              Graham Brightwell   Transitive Orientations of Graphs  . . . 1119--1133
             J. A. Bergstra and   
                 J. W. Klop and   
                  E. R. Olderog   Readies and failures in the algebra of
                                  communicating processes  . . . . . . . . 1134--1177
                    N. Alon and   
                        Y. Azar   The average complexity of deterministic
                                  and randomized parallel
                                  comparison-sorting algorithms  . . . . . 1178--1192
           Eric W. Allender and   
              Roy S. Rubinstein   ${\rm P}$-printable sets . . . . . . . . 1193--1202
              William J. Knight   Search in an ordered array having
                                  variable probe cost  . . . . . . . . . . 1203--1214
                 T. Y. Kong and   
             David M. Mount and   
                   A. W. Roscoe   The decomposition of a rectangle into
                                  rectangles of minimal perimeter  . . . . 1215--1231
                 Jin-Yi Cai and   
          Thomas Gundermann and   
            Juris Hartmanis and   
        Lane A. Hemachandra and   
            Vivian Sewelson and   
               Klaus Wagner and   
                  Gerd Wechsung   The Boolean hierarchy. I. Structural
                                  properties . . . . . . . . . . . . . . . 1232--1252
            Baruch Schieber and   
                    Uzi Vishkin   On finding lowest common ancestors:
                                  simplification and parallelization . . . 1253--1262
                      Jim Kadin   The polynomial time hierarchy collapses
                                  if the Boolean hierarchy collapses . . . 1263--1282


SIAM Journal on Computing
Volume 18, Number 1, February, 1989

          Jeffery Westbrook and   
               Robert E. Tarjan   Amortized analysis of algorithms for set
                                  union with backtracking  . . . . . . . . 1--11
            Karl Abrahamson and   
               Andrew Adler and   
             Rachel Gelbart and   
                Lisa Higham and   
              David Kirkpatrick   The bit complexity of randomized leader
                                  election on a ring . . . . . . . . . . . 12--29
              Giorgio Gallo and   
     Michael D. Grigoriadis and   
               Robert E. Tarjan   A fast parametric maximum flow algorithm
                                  and applications . . . . . . . . . . . . 30--55
                  Robert Wilber   Lower bounds for accessing binary search
                                  trees with rotations . . . . . . . . . . 56--67
              Norbert Korte and   
           Rolf H. Möhring   An incremental linear-time algorithm for
                                  recognizing interval graphs  . . . . . . 68--81
            Lawrence L. Larmore   Minimum Delay Codes  . . . . . . . . . . 82--94
                 Jin-Yi Cai and   
          Thomas Gundermann and   
            Juris Hartmanis and   
        Lane A. Hemachandra and   
            Vivian Sewelson and   
               Klaus Wagner and   
                  Gerd Wechsung   The Boolean hierarchy. II. Applications  95--111
       Greg N. Frederickson and   
           Mandayam A. Srinivas   Algorithms and data structures for an
                                  expanded family of matroid intersection
                                  problems . . . . . . . . . . . . . . . . 112--138
             Wansoo T. Rhee and   
               Michel Talagrand   Optimal bin packing with items of random
                                  sizes. II  . . . . . . . . . . . . . . . 139--151
               Edward T. Ordman   Minimal threshold separators and memory
                                  requirements for synchronization . . . . 152--165
         E. G. Coffman, Jr. and   
                 J. C. Lagarias   Algorithms for packing squares: a
                                  probabilistic analysis . . . . . . . . . 166--185
           Shafi Goldwasser and   
              Silvio Micali and   
                Charles Rackoff   The knowledge complexity of interactive
                                  proof systems  . . . . . . . . . . . . . 186--208

SIAM Journal on Computing
Volume 18, Number 2, April, 1989

                Thomas Lickteig   A lower bound on the complexity of
                                  division in finite extension fields and
                                  inversion in quadratic alternative
                                  algebras . . . . . . . . . . . . . . . . 209--215
         Gianfranco Bilardi and   
              Alexandru Nicolau   Adaptive bitonic sorting: an optimal
                                  parallel algorithm for shared-memory
                                  machines . . . . . . . . . . . . . . . . 216--228
                David Peleg and   
                      Eli Upfal   The Token Distribution Problem . . . . . 229--243
            Jing Jang Hwang and   
            Yuan-Chieh Chow and   
             Frank D. Anger and   
                  Chung-Yee Lee   Scheduling precedence graphs in systems
                                  with interprocessor communication times  244--257
                    N. Alon and   
                        Y. Azar   Finding an Approximate Maximum . . . . . 258--267
              Amotz Bar-Noy and   
              Allan Borodin and   
          Mauricio Karchmer and   
              Nathan Linial and   
                 Michael Werman   Bounds on Universal Sequences  . . . . . 268--277
          J. Michael Steele and   
             Timothy Law Snyder   Worst-case growth rates of some
                                  classical problems of combinatorial
                                  optimization . . . . . . . . . . . . . . 278--287
             Torben Hagerup and   
              Marek Chrobak and   
                 Krzysztof Diks   Optimal Parallel $5$-Colouring of Planar
                                  Graphs . . . . . . . . . . . . . . . . . 288--300
             Riccardo Melen and   
             Jonathan S. Turner   Nonblocking Multirate Networks . . . . . 301--313
         Joseph Y.-T. Leung and   
               Gilbert H. Young   Minimizing schedule length subject to
                                  minimum flow time  . . . . . . . . . . . 314--326
                Joseph Naor and   
                  Moni Naor and   
     Alejandro A. Schäffer   Fast Parallel Algorithms for Chordal
                                  Graphs . . . . . . . . . . . . . . . . . 327--349
                  James Renegar   On the worst-case arithmetic complexity
                                  of approximating zeros of systems of
                                  polynomials  . . . . . . . . . . . . . . 350--370
             F. Frances Yao and   
            David P. Dobkin and   
       Herbert Edelsbrunner and   
            Michael S. Paterson   Partitioning Space for Range Queries . . 371--384
                    Kazuo Iwama   CNF-satisfiability test by counting and
                                  polynomial average time  . . . . . . . . 385--391
                       Ker-I Ko   Relativized polynomial time hierarchies
                                  having exactly $k$ levels  . . . . . . . 392--408
          Khaled M. Bugrara and   
                Youfang Pan and   
        Paul Walton Purdom, Jr.   Exponential Average Time for the Pure
                                  Literal Rule . . . . . . . . . . . . . . 409--418
              Mark Goldberg and   
                 Thomas Spencer   A new parallel algorithm for the maximal
                                  independent set problem  . . . . . . . . 419--427

SIAM Journal on Computing
Volume 18, Number 3, June, 1989

              Edward P. F. Chan   A Design Theory for Solving the
                                  Anomalies Problem  . . . . . . . . . . . 429--448
              Shou Wen Tang and   
                 Osamu Watanabe   On tally relativizations of ${\rm
                                  BP}$-complexity classes  . . . . . . . . 449--462
             Shuo-Yen Robert Li   Dynamic Programming by Exchangeability   463--472
             WanSoo T. Rhee and   
               Michel Talagrand   Optimal bin packing with items of random
                                  sizes. III . . . . . . . . . . . . . . . 473--486
             WanSoo T. Rhee and   
               Michel Talagrand   Optimal Bin Covering with Items of
                                  Random Size  . . . . . . . . . . . . . . 487--498
         Mikhail J. Atallah and   
               Richard Cole and   
            Michael T. Goodrich   Cascading divide-and-conquer: a
                                  technique for designing parallel
                                  algorithms . . . . . . . . . . . . . . . 499--532
           H. Venkateswaran and   
                   Martin Tompa   A new pebble game that characterizes
                                  parallel complexity classes  . . . . . . 533--549
           Merrick L. Furst and   
                    Ravi Kannan   Succinct certificates for almost all
                                  subset sum problems  . . . . . . . . . . 550--558
              Allan Borodin and   
            Stephen A. Cook and   
          Patrick W. Dymond and   
            Walter L. Ruzzo and   
                   Martin Tompa   Two applications of inductive counting
                                  for complementation problems . . . . . . 559--578
         Francisco Barahona and   
              éva Tardos   Note on Weintraub's minimum-cost
                                  circulation algorithm  . . . . . . . . . 579--583
                Michael Clausen   Fast Fourier Transforms for Metabelian
                                  Groups . . . . . . . . . . . . . . . . . 584--593
    Sanguthevar Rajasekaran and   
                   John H. Reif   Optimal and sublogarithmic time
                                  randomized parallel sorting algorithms   594--607
                   G. H. Norton   Precise analyses of the right- and
                                  left-shift greatest common divisor
                                  algorithms for ${\rm GF}(q)[x]$  . . . . 608--624
                  Neil Immerman   Expressibility and Parallel Complexity   625--638

SIAM Journal on Computing
Volume 18, Number 4, August, 1989

              George Labahn and   
                     Stan Cabay   Matrix Padé Fractions and Their
                                  Computation  . . . . . . . . . . . . . . 639--657
           Costas S. Iliopoulos   Worst-case complexity bounds on
                                  algorithms for computing the canonical
                                  structure of finite Abelian groups and
                                  the Hermite and Smith normal forms of an
                                  integer matrix . . . . . . . . . . . . . 658--669
           Costas S. Iliopoulos   Worst-case complexity bounds on
                                  algorithms for computing the canonical
                                  structure of infinite Abelian groups and
                                  solving systems of linear Diophantine
                                  equations  . . . . . . . . . . . . . . . 670--678
            Andrew Chi Chih Yao   On the Complexity of Partial Order
                                  Productions  . . . . . . . . . . . . . . 679--689
          Barbara B. Simons and   
             Manfred K. Warmuth   A fast algorithm for multiprocessor
                                  scheduling of unit-length jobs . . . . . 690--710
                  Zvi Galil and   
               Stuart Haber and   
                      Moti Yung   Minimum-knowledge interactive proofs for
                                  decision problems  . . . . . . . . . . . 711--739
                David Peleg and   
              Jeffrey D. Ullman   An Optimal Synchronizer for the
                                  Hypercube  . . . . . . . . . . . . . . . 740--747
               Pravin M. Vaidya   Space-Time Trade-Offs for Orthogonal
                                  Range Queries  . . . . . . . . . . . . . 748--758
               Nader H. Bshouty   A Lower Bound for Matrix Multiplication  759--765
             Charles H. Bennett   Time/Space Trade-Offs for Reversible
                                  Computation  . . . . . . . . . . . . . . 766--776
           Philippe Jacquet and   
           Wojciech Szpankowski   Ultimate characterizations of the burst
                                  response of an interval searching
                                  algorithm: a study of a functional
                                  equation . . . . . . . . . . . . . . . . 777--791
               Richard Cole and   
          Jeffrey S. Salowe and   
              W. L. Steiger and   
         Endre Szemerédi   An Optimal-Time Algorithm for Slope
                                  Selection  . . . . . . . . . . . . . . . 792--810
        Franco P. Preparata and   
               Roberto Tamassia   Fully dynamic point location in a
                                  monotone subdivision . . . . . . . . . . 811--830
            Karel Culik, II and   
                  Jan Pachl and   
                       Sheng Yu   On the Limit Sets of Cellular Automata   831--842
       Greg N. Frederickson and   
                  Ravi Janardan   Efficient Message Routing in Planar
                                  Networks . . . . . . . . . . . . . . . . 843--857

SIAM Journal on Computing
Volume 18, Number 5, October, 1989

            J. Håstad and   
                    B. Just and   
             J. C. Lagarias and   
                  C.-P. Schnorr   Polynomial time algorithms for finding
                                  integer relations among real numbers . . 859--881
                   S. Anily and   
                      R. Hassin   Ranking the Best Binary Trees  . . . . . 882--892
                   G. W. Cherry   An Analysis of the Rational Exponential
                                  Integral . . . . . . . . . . . . . . . . 893--905
            Rakesh M. Verma and   
               Steven W. Reyner   An analysis of a good algorithm for the
                                  subtree problem, corrected . . . . . . . 906--908
             Wansoo T. Rhee and   
               Michel Talagrand   The Complete Convergence of Best Fit
                                  Decreasing . . . . . . . . . . . . . . . 909--918
             Wansoo T. Rhee and   
               Michel Talagrand   The Complete Convergence of First Fit
                                  Decreasing . . . . . . . . . . . . . . . 919--938
          Ravindra K. Ahuja and   
             James B. Orlin and   
               Robert E. Tarjan   Improved Time Bounds for the Maximum
                                  Flow Problem . . . . . . . . . . . . . . 939--954
                   Wayne Eberly   Very Fast Parallel Polynomial Arithmetic 955--976
           Ernst-Erich Doberkat   Topological completeness in an ideal
                                  model for polymorphic types  . . . . . . 977--989
              Brian A. Coan and   
                Danny Dolev and   
              Cynthia Dwork and   
               Larry Stockmeyer   The Distributed Firing Squad Problem . . 990--1012
            Harold N. Gabow and   
               Robert E. Tarjan   Faster Scaling Algorithms for Network
                                  Problems . . . . . . . . . . . . . . . . 1013--1036
           Cynthia A. Brown and   
          Larry Finkelstein and   
        Paul Walton Purdom, Jr.   A New Base Change Algorithm for
                                  Permutation Groups . . . . . . . . . . . 1037--1047
                  Keith Humenik   Ratio estimators are maximum-likelihood
                                  estimators for non-context-free grammars 1048--1055

SIAM Journal on Computing
Volume 18, Number 6, December, 1989

                J. Cheriyan and   
               S. N. Maheshwari   Analysis of preflow push algorithms for
                                  maximum network flow . . . . . . . . . . 1057--1086
              Richard E. Ladner   Polynomial Space Counting Problems . . . 1087--1097
            David Bernstein and   
           Jeffrey M. Jaffe and   
                  Michael Rodeh   Scheduling arithmetic and load
                                  operations in parallel with no spilling  1098--1127
                David Rappaport   Computing simple circuits from a set of
                                  line segments is NP-complete . . . . . . 1128--1139
          Umesh V. Vazirani and   
              Vijay V. Vazirani   The two-processor scheduling problem is
                                  in random ${\rm NC}$ . . . . . . . . . . 1140--1148
                Mark Jerrum and   
              Alistair Sinclair   Approximating the Permanent  . . . . . . 1149--1178
          Manfred Schimmler and   
               Christoph Starke   A Correction Network for ${N}$-Sorters   1179--1187
                 Zhiyuan Li and   
             Edward M. Reingold   Solution of a Divide-and-Conquer Maximin
                                  Recurrence . . . . . . . . . . . . . . . 1188--1200
               Pravin M. Vaidya   Geometry Helps in Matching . . . . . . . 1201--1225
             Ming-Syan Chen and   
                   Kang G. Shin   On relaxed squashed embedding of graphs
                                  into a hypercube . . . . . . . . . . . . 1226--1244
             Kaizhong Zhang and   
                  Dennis Shasha   Simple fast algorithms for the editing
                                  distance between trees and related
                                  problems . . . . . . . . . . . . . . . . 1245--1262
             Bala Ravikumar and   
                Oscar H. Ibarra   Relating the type of ambiguity of finite
                                  automata to the succinctness of their
                                  representation . . . . . . . . . . . . . 1263--1282
              Allan Borodin and   
            Stephen A. Cook and   
          Patrick W. Dymond and   
            Walter L. Ruzzo and   
                   Martin Tompa   Erratum: ``Two applications of inductive
                                  counting for complementation problems''  1283--1283


SIAM Journal on Computing
Volume 19, Number 1, February, 1990

           Michael A. Palis and   
               Sunil Shende and   
                David S. L. Wei   An Optimal Linear Time Parallel Parser
                                  for Tree Adjoining Languages . . . . . . 1--31
              I. R. Hentzel and   
              D. Pokrass Jacobs   Complexity and Unsolvability Properties
                                  of Nilpotency  . . . . . . . . . . . . . 32--43
            H. B. Hunt, III and   
                  R. E. Stearns   The Complexity of Very Simple Boolean
                                  Formulas with Applications . . . . . . . 44--70
                   Cheng Ng and   
           Daniel S. Hirschberg   Lower Bounds for the Stable Marriage
                                  Problem and Its Variants . . . . . . . . 71--77
          Hirofumi Yokouchi and   
                   Teruo Hikita   A Rewriting System for Categorical
                                  Combinators with Multiple Arguments  . . 78--97
              George Labahn and   
              Dong Koo Choi and   
                     Stan Cabay   The Inverses of Block Hankel and Block
                                  Toeplitz Matrices  . . . . . . . . . . . 98--123
                  Joel Friedman   A Density Theorem for Purely Iterative
                                  Zero Finding Methods . . . . . . . . . . 124--132
             Michael L. Dowling   A Fast Parallel Horner Algorithm . . . . 133--142
                   Dan Gusfield   Very Simple Methods for all Pairs
                                  Network Flow Analysis  . . . . . . . . . 143--155
          Edward R. Scheinerman   On the Expected Capacity of Binomial and
                                  Random Concentrators . . . . . . . . . . 156--163
       Greg N. Frederickson and   
                  Ravi Janardan   Space-efficient message routing in
                                  $c$-decomposable networks  . . . . . . . 164--181
                H. James Hoover   Feasible Real Functions and Arithmetic
                                  Circuits . . . . . . . . . . . . . . . . 182--204
       Greg N. Frederickson and   
              Donald B. Johnson   Erratum: ``Generalized selection and
                                  ranking: sorted matrices'' [SIAM J.
                                  Comput. \bf 13 (1984), no. 1, 14--30, MR
                                  85c:68025] . . . . . . . . . . . . . . . 205--206

SIAM Journal on Computing
Volume 19, Number 2, April, 1990

      Miros\law Kuty\lowski and   
        Maciej Li\'skiewicz and   
              Krzysztof Lory\'s   Reversal Complexity Classes for
                                  Alternating Turing Machines  . . . . . . 207--221
             Jennifer Whitehead   The Complexity of File Transfer
                                  Scheduling with Forwarding . . . . . . . 222--245
                 G. Bilardi and   
                F. P. Preparata   Characterization of Associative
                                  Operations with Prefix Circuits of
                                  Constant Depth and Linear Size . . . . . 246--255
                David Peleg and   
                      Eli Upfal   A Time-Randomness Trade-Off for
                                  Oblivious Routing  . . . . . . . . . . . 256--266
              David A. Plaisted   A Heuristic Algorithm for Small
                                  Separators in Arbitrary Graphs . . . . . 267--280
           Laura A. Sanchis and   
                   Mark A. Fulk   On the Efficient Generation of Language
                                  Instances  . . . . . . . . . . . . . . . 281--296
          Pankaj K. Agarwal and   
                   Micha Sharir   Red-Blue Intersection Detection
                                  Algorithms, with Applications to Motion
                                  Planning and Collision Detection . . . . 297--321
  Christos H. Papadimitriou and   
             Mihalis Yannakakis   Towards an Architecture-Independent
                                  Analysis of Parallel Algorithms  . . . . 322--328
            Robert W. Floyd and   
                Donald E. Knuth   Addition Machines  . . . . . . . . . . . 329--340
             J. J. M. M. Rutten   Semantic Correctness for a Parallel
                                  Object-Oriented Language . . . . . . . . 341--383
          Christopher B. Wilson   On the Decomposability of ${NC}$ and
                                  ${AC}$ . . . . . . . . . . . . . . . . . 384--396
              Alok Aggarwal and   
        Richard J. Anderson and   
                  Ming-Yang Kao   Parallel Depth-First Search in General
                                  Directed Graphs  . . . . . . . . . . . . 397--409

SIAM Journal on Computing
Volume 19, Number 3, June, 1990

                      B. Molzan   Expressibility and Nonuniform Complexity
                                  Classes  . . . . . . . . . . . . . . . . 411--423
                   Helmut Seidl   Deciding Equivalence of Finite Tree
                                  Automata . . . . . . . . . . . . . . . . 424--437
       Étienne Grandjean   A Nontrivial Lower Bound for an NP
                                  Problem on Automata  . . . . . . . . . . 438--451
           Nader H. Bshouty and   
               Michael Kaminski   Multiplication of Polynomials over
                                  Finite Fields  . . . . . . . . . . . . . 452--456
                      Yin Yu Ye   A Class of Projective Transformations
                                  for Linear Programming . . . . . . . . . 457--466
               Nader H. Bshouty   Maximal Rank of $m \times n \times
                                  (mn-k)$ Tensors  . . . . . . . . . . . . 467--471
              Cynthia Dwork and   
               David Shmoys and   
               Larry Stockmeyer   Flipping Persuasively in Constant Time   472--499
                 David Eppstein   Reset Sequences for Monotonic Automata   500--510
        Maciej Li\'skiewicz and   
              Krzysztof Lory\'s   Fast Simulations of Time-Bounded
                                  One-Tape Turing Machines by
                                  Space-Bounded Ones . . . . . . . . . . . 511--521
                 Richard Beigel   Unbounded Searching Algorithms . . . . . 522--537
                 Takis Sakkalis   The Euclidean Algorithm and the Degree
                                  of the Gauss Map . . . . . . . . . . . . 538--543
            Fred Annexstein and   
              Marc Baumslag and   
            Arnold L. Rosenberg   Group Action Graphs and Parallel
                                  Architectures  . . . . . . . . . . . . . 544--569
                  A. Wagner and   
                  D. G. Corneil   Embedding Trees in a Hypercube is
                                  NP-Complete  . . . . . . . . . . . . . . 570--590
             Vijay K. Vaishnavi   Erratum: ``Weighted leaf AVL-trees''
                                  [SIAM J. Comput. \bf 16 (1987), no. 3,
                                  503--537, MR 88c:68012]  . . . . . . . . 591--591

SIAM Journal on Computing
Volume 19, Number 4, August, 1990

                 David M. Mount   The Number of Shortest Paths on the
                                  Surface of a Polyhedron  . . . . . . . . 593--611
                    F. Chin and   
                     H. F. Ting   Improving the Time Complexity of
                                  Message-Optimal Distributed Algorithms
                                  for Minimum-Weight Spanning Trees  . . . 612--626
                J. M. Jover and   
                 T. Kailath and   
                 H. Lev-Ari and   
                      S. K. Rao   On the Analysis of Synchronous Computing
                                  Systems  . . . . . . . . . . . . . . . . 627--643
      M. Dezani-Ciancaglini and   
                     B. Venneri   Partial Types and Intervals  . . . . . . 644--658
                   Bill Jackson   Shortest Circuit Covers and Postman
                                  Tours in Graphs with a Nowhere Zero
                                  $4$-Flow . . . . . . . . . . . . . . . . 659--665
                Alan Frieze and   
            Colin McDiarmid and   
                     Bruce Reed   Greedy Matching on the Line  . . . . . . 666--672
           Robert Y. Levine and   
                Alan T. Sherman   A Note on Bennett's Time-Space Tradeoff
                                  for Reversible Computation . . . . . . . 673--677
                 Torben Hagerup   Planar depth-first search in $O(\log n)$
                                  parallel time  . . . . . . . . . . . . . 678--704
                 WanSoo T. Rhee   A Note on Optimal Bin Packing and
                                  Optimal Bin Covering with Items of
                                  Random Size  . . . . . . . . . . . . . . 705--710
                  D. R. Stinson   Some Observations on Parallel Algorithms
                                  for Fast Exponentiation in
                                  $\operatorname{GF}(2^n)$ . . . . . . . . 711--717
              Faith E. Fich and   
                  Avi Wigderson   Toward Understanding Exclusive Read  . . 718--727
           Ashfaq A. Munshi and   
                 Barbara Simons   Scheduling Sequential Loops on Parallel
                                  Processors . . . . . . . . . . . . . . . 728--741
                Mark W. Krentel   On Finding and Verifying Locally Optimal
                                  Solutions  . . . . . . . . . . . . . . . 742--749
          Thomas W. Dubé   The structure of polynomial ideals and
                                  Gröbner bases . . . . . . . . . . . . . . 750--773

SIAM Journal on Computing
Volume 19, Number 5, October, 1990

        Jeanette P. Schmidt and   
                    Alan Siegel   The spatial complexity of oblivious
                                  $k$-probe hash functions . . . . . . . . 775--786
              Erich Grädel   Domino Games and Complexity  . . . . . . 787--804
               R. E. Cypher and   
              J. L. C. Sanz and   
                      L. Snyder   The Hough transform has $O(N)$
                                  complexity on $N\times N$ mesh connected
                                  computers  . . . . . . . . . . . . . . . 805--820
                Luc Devroye and   
                Louise Laforest   An analysis of random $d$-dimensional
                                  quadtrees  . . . . . . . . . . . . . . . 821--832
                Klaus W. Wagner   Bounded Query Classes  . . . . . . . . . 833--846
                   Keqin Li and   
                  Kam-Hoi Cheng   On Three-Dimensional Packing . . . . . . 847--867
                  Joan M. Lucas   Postorder Disjoint Set Union is Linear   868--882
                Kazuo Iwano and   
              Kenneth Steiglitz   A Semiring on Convex Polygons and
                                  Zero-Sum Cycle Problems  . . . . . . . . 883--901
                K. Mehlhorn and   
             St. Näher and   
                       M. Rauch   On the Complexity of a Game Related to
                                  the Dictionary Problem . . . . . . . . . 902--906
                   D. Bienstock   Linear-Time Test for Small Face Covers
                                  in any Fixed Surface . . . . . . . . . . 907--911
               John H. Reif and   
                Stephen R. Tate   Optimal Size Integer Division Circuits   912--924
          John K. Johnstone and   
            Chanderjit L. Bajaj   Sorting Points Along an Algebraic Curve  925--967
         Alberto Apostolico and   
         Mikhail J. Atallah and   
        Lawrence L. Larmore and   
                 Scott McFaddin   Efficient Parallel Algorithms for String
                                  Editing and Related Problems . . . . . . 968--988

SIAM Journal on Computing
Volume 19, Number 6, December, 1990

                  Zvi Galil and   
                    Kunsoo Park   An Improved Algorithm for Approximate
                                  String Matching  . . . . . . . . . . . . 989--999
           George S. Lueker and   
             Nimrod Megiddo and   
            Vijaya Ramachandran   Linear Programming with Two Variables
                                  Per Inequality in Poly-Log Time  . . . . 1000--1010
              Cynthia Dwork and   
               Larry Stockmeyer   A Time Complexity Gap for Two-Way
                                  Probabilistic Finite-State Automata  . . 1011--1023
             Kazuo Sugihara and   
              Ichiro Suzuki and   
             Masafumi Yamashita   The Searchlight Scheduling Problem . . . 1024--1040
                  D. T. Lee and   
             M. Sarrafzadeh and   
                       Y. F. Wu   Minimum Cuts for Circular-Arc Graphs . . 1041--1050
             Dany Breslauer and   
                      Zvi Galil   An optimal $O(\log \log n)$ time
                                  parallel string matching algorithm . . . 1051--1058
         Dima Yu. Grigoriev and   
          Marek Karpi\'nski and   
              Michael F. Singer   Fast Parallel Algorithms for Sparse
                                  Multivariate Polynomial Interpolation
                                  Over Finite Fields . . . . . . . . . . . 1059--1063
                  Noga Alon and   
          Mauricio Karchmer and   
                  Avi Wigderson   Linear Circuits over
                                  $\operatorname{GF}(2)$ . . . . . . . . . 1064--1067
                  Joel Friedman   Random Polynomials and Approximate Zeros
                                  of Newton's Method . . . . . . . . . . . 1068--1099
                   Jack H. Lutz   Category and Measure in Complexity
                                  Classes  . . . . . . . . . . . . . . . . 1100--1131
                   Kazuo Murota   Computing Puiseux-Series Solutions to
                                  Determinantal Equations via
                                  Combinatorial Relaxation . . . . . . . . 1132--1161


SIAM Journal on Computing
Volume 20, Number 1, February, 1991

                Dominique Duval   Absolute Factorization of Polynomials: a
                                  Geometric Approach . . . . . . . . . . . 1--21
                    Uzi Vishkin   Deterministic Sampling --- a New
                                  Technique for Fast Pattern Matching  . . 22--40
               Qian Ping Gu and   
                  Akira Maruoka   Amplification of Bounded Depth Monotone
                                  Read-Once Boolean Formulae . . . . . . . 41--55
 Alejandro A. Schäffer and   
             Mihalis Yannakakis   Simple Local Search Problems that are
                                  Hard to Solve  . . . . . . . . . . . . . 56--87
               Ian Parberry and   
                   Pei Yuan Yan   Improved Upper and Lower Time Bounds for
                                  Parallel Random Access Machines without
                                  Simultaneous Writes  . . . . . . . . . . 88--99
          Jeffrey D. Ullman and   
             Mihalis Yannakakis   High-Probability Parallel
                                  Transitive-Closure Algorithms  . . . . . 100--125
                 Shih Ping Tung   Complexity of Sentences over Number
                                  Rings  . . . . . . . . . . . . . . . . . 126--143
              Marek Chrobak and   
            Lawrence L. Larmore   An optimal on-line algorithm for $k$
                                  servers on trees . . . . . . . . . . . . 144--148
                  K. Sutner and   
           A. Satyanarayana and   
                      C. Suffel   The Complexity of the Residual Node
                                  Connectedness Reliability Problem  . . . 149--155
         Edward M. Reingold and   
                  Xiao Jun Shen   More Nearly Optimal Algorithms for
                                  Unbounded Searching, Part I: The Finite
                                  Case . . . . . . . . . . . . . . . . . . 156--183
         Edward M. Reingold and   
                  Xiao Jun Shen   More nearly optimal algorithms for
                                  unbounded searching. II. The transfinite
                                  case . . . . . . . . . . . . . . . . . . 184--208

SIAM Journal on Computing
Volume 20, Number 2, April, 1991

                 Egon Balas and   
                        Jue Xue   Minimum Weighted Coloring of
                                  Triangulated Graphs, with Application to
                                  Maximum Weight Vertex Packing and Clique
                                  Finding in Arbitrary Graphs  . . . . . . 209--221
       Ji\vrí Matou\vsek   Approximate Levels in Line Arrangements  222--227
  Joseph JáJá and   
              Shing-Chong Chang   Parallel Algorithms for Channel Routing
                                  in the Knock-Knee Model  . . . . . . . . 228--245
                 Ronald V. Book   Some Observations on Separating
                                  Complexity Classes . . . . . . . . . . . 246--258
       Herbert Edelsbrunner and   
                    Weiping Shi   An $O(n \log^{2} h)$ time algorithm for
                                  the three-dimensional convex hull
                                  problem  . . . . . . . . . . . . . . . . 259--269
                     Paul Beame   A General Sequential Time-Space Tradeoff
                                  for Finding Unique Elements  . . . . . . 270--277
            Oscar H. Ibarra and   
                      Tao Jiang   The Power of Alternating One-Reversal
                                  Counters and Stacks  . . . . . . . . . . 278--290
                Ron M. Roth and   
               Gyora M. Benedek   Interpolation and Approximation of
                                  Sparse Multivariate Polynomials over
                                  ${\rm GF}(2)$  . . . . . . . . . . . . . 291--314
             Yishay Mansour and   
            Baruch Schieber and   
                 Prasoon Tiwari   Lower Bounds for Computations with the
                                  Floor Operation  . . . . . . . . . . . . 315--327
                B. K. Natarajan   Probably Approximate Learning of Sets
                                  and Functions  . . . . . . . . . . . . . 328--351
              Samir Khuller and   
                Baruch Schieber   Efficient parallel algorithms for
                                  testing $k$-connectivity and finding
                                  disjoint $s$-$t$ paths in graphs . . . . 352--375
                Yehuda Afek and   
                      Eli Gafni   Time and Message Bounds for Election in
                                  Synchronous and Asynchronous Complete
                                  Networks . . . . . . . . . . . . . . . . 376--394
            Peter Gritzmann and   
          Laurent Habsieger and   
                    Victor Klee   Good and Bad Radii of Convex Polygons    395--403
                      Jim Kadin   Erratum: ``The polynomial time hierarchy
                                  collapses if the Boolean hierarchy
                                  collapses'' [SIAM J. Comput. \bf 17
                                  (1988), no. 6, 1263--1282, MR 90a:03060] 404--404

SIAM Journal on Computing
Volume 20, Number 3, June, 1991

             Odile Marcotte and   
                   Subhash Suri   Fast Matching Algorithms for Points on a
                                  Polygon  . . . . . . . . . . . . . . . . 405--422
               Ouri Wolfson and   
                  Adrian Segall   The Communication Complexity of Atomic
                                  Commitment and of Gossiping  . . . . . . 423--450
                Ulrich Baum and   
                Michael Clausen   Some Lower and Upper Complexity Bounds
                                  for Generalized Fourier Transforms and
                                  Their Inverses . . . . . . . . . . . . . 451--459
          János Pach and   
                   Micha Sharir   On Vertical Visibility in Arrangements
                                  of Segments and the Queue Size in the
                                  Bentley--Ottmann Line Sweeping Algorithm 460--470
          Mitsunori Ogiwara and   
                 Osamu Watanabe   On Polynomial-Time Bounded Truth-Table
                                  Reducibility of NP Sets to Sparse Sets   471--483
                 Viliam Geffert   Nondeterministic, Computations in
                                  Sublogarithmic Space and Space
                                  Constructibility . . . . . . . . . . . . 484--498
                      Uri Zwick   A $4n$ lower bound on the combinational
                                  complexity of certain symmetric Boolean
                                  functions over the basis of unate dyadic
                                  Boolean functions  . . . . . . . . . . . 499--505
             Judy Goldsmith and   
        Lane A. Hemachandra and   
             Deborah Joseph and   
                     Paul Young   Near-Testable Sets . . . . . . . . . . . 506--523
         Andrew V. Goldberg and   
                 Michael Sipser   Compression and Ranking  . . . . . . . . 524--536
              Wei Kuan Shih and   
             Jane W. S. Liu and   
                  Jen-Yao Chung   Algorithms for Scheduling Imprecise
                                  Computations with Timing Constraints . . 537--552
                Peter Colte and   
             Evangelos Kranakis   Boolean Functions, Invariance Groups,
                                  and Parallel Complexity  . . . . . . . . 553--590
         Joachim von zur Gathen   Tests for Permutation Polynomials  . . . 591--602

SIAM Journal on Computing
Volume 20, Number 4, August, 1991

              Kurt Mehlhorn and   
                  Chee-Keng Yap   Constructive Whitney--Graustein theorem,
                                  or how to untangle closed planar curves  603--621
               Jian-er Chen and   
                  Chee-Keng Yap   Reversal Complexity  . . . . . . . . . . 622--638
                   Dan Gusfield   Computing the Strength of a Graph  . . . 639--654
            Andrew Chi Chih Yao   Lower Bounds for Algebraic Computation
                                  Trees of Functions with Finite Domains   655--668
      Christophe Reutenauer and   
Marcel-Paul Schützenberger   Minimization of Rational Word Functions  669--685
                Erich E. Sutter   The fast $m$-transform: a fast
                                  computation of cross-correlations with
                                  binary $m$-sequences . . . . . . . . . . 686--694
                    Martin Dyer   On Counting Lattice Points in Polyhedra  695--707
           Roberto Tamassia and   
              Jeffrey S. Vitter   Parallel Transitive Closure and Point
                                  Location in Planar Structures  . . . . . 708--725
            Shun-Ping Chung and   
                  Keith W. Ross   On Nonblocking Multirate Interconnection
                                  Networks . . . . . . . . . . . . . . . . 726--736
            Michael T. Goodrich   Intersecting Line Segments in Parallel
                                  with an Output- Sensitive Number of
                                  Processors . . . . . . . . . . . . . . . 737--755
           George I. Davida and   
                    Bruce Litow   Fast Parallel Arithmetic via Modular
                                  Representation . . . . . . . . . . . . . 756--765
                    Don Pigozzi   Equality-Test and If--Then--Else
                                  Algebras: Axiomatization and
                                  Specification  . . . . . . . . . . . . . 766--805

SIAM Journal on Computing
Volume 20, Number 5, October, 1991

   Claire M. Kenyon-Mathieu and   
           Jeffrey Scott Vitter   The Maximum Size of Dynamic Data
                                  Structures . . . . . . . . . . . . . . . 807--823
          Miros\law Kuty\lowski   Time complexity of Boolean functions on
                                  CREW PRAMs . . . . . . . . . . . . . . . 824--833
                   Mee Yee Chan   Embedding of Grids into Optimal
                                  Hypercubes . . . . . . . . . . . . . . . 834--864
                 Seinosuke Toda   PP Is as Hard as the Polynomial-Time
                                  Hierarchy  . . . . . . . . . . . . . . . 865--877
             Nicholas Pippenger   Selection Networks . . . . . . . . . . . 878--887
          Subir Kumar Ghosh and   
                 David M. Mount   An Output-Sensitive Algorithm for
                                  Computing Visibility Graphs  . . . . . . 888--910
                    Ming Li and   
      Paul M. B. Vitányi   Learning Simple Concepts under Simple
                                  Distributions  . . . . . . . . . . . . . 911--935
               Zhi-Quan Luo and   
             John N. Tsitsiklis   On the Communication Complexity of
                                  Solving a Polynomial Equation  . . . . . 936--950
                  Joel Friedman   The Spectra of Infinite Hypertrees . . . 951--961
                       Ker-I Ko   On the Complexity of Learning Minimum
                                  Time-Bounded Turing Machines . . . . . . 962--986
                Jan-Ming Ho and   
                  D. T. Lee and   
          Chia-Hsiang Chang and   
                     C. K. Wong   Minimum Diameter Spanning Trees and
                                  Related Problems . . . . . . . . . . . . 987--997
                   Susan Landau   Erratum: ``Factoring polynomials over
                                  algebraic number fields'' [SIAM J.
                                  Comput. \bf 14 (1985), no. 1, 184--195,
                                  MR 86d:11102]  . . . . . . . . . . . . . 998--998

SIAM Journal on Computing
Volume 20, Number 6, December, 1991

                     Noam Nisan   CREW PRAMs and Decision Trees  . . . . . 999--1007
                  Zvi Galil and   
             Raffaele Giancarlo   On the Exact Complexity of String
                                  Matching: Lower Bounds . . . . . . . . . 1008--1020
              Roy S. Rubinstein   Self-P-Printability and Polynomial Time
                                  Turing Equivalence to a Tally Set  . . . 1021--1033
                   Hillel Gazit   New Upper Bounds in Klee's Measure
                                  Problem  . . . . . . . . . . . . . . . . 1034--1045
                   Hillel Gazit   An Optimal Randomized Parallel Algorithm
                                  for Finding Connected Components in a
                                  Graph  . . . . . . . . . . . . . . . . . 1046--1067
            James L. Hafner and   
              Kevin S. McCurley   Asymptotically Fast Triangularization of
                                  Matrices over Rings  . . . . . . . . . . 1068--1083
                Manuel Blum and   
          Alfredo De Santis and   
              Silvio Micali and   
              Giuseppe Persiano   Noninteractive Zero-Knowledge  . . . . . 1084--1118
                    John Franco   Elimination of Infrequent Variables
                                  Improves Average Case Performance of
                                  Satisfiability Algorithms  . . . . . . . 1119--1127
             Gary L. Miller and   
                   John H. Reif   Parallel Tree Contraction Part 2:
                                  Further Applications . . . . . . . . . . 1128--1147
        Lane A. Hemachandra and   
                 Albrecht Hoene   On Sets with Efficient Implicit
                                  Membership Tests . . . . . . . . . . . . 1148--1156
                  Zvi Galil and   
                  Oded Margalit   An Almost Linear-Time Algorithm for the
                                  Dense Subset-Sum Problem . . . . . . . . 1157--1189


SIAM Journal on Computing
Volume 21, Number 1, February, 1992

               Dan Halperin and   
           Mark H. Overmars and   
                   Micha Sharir   Efficient Motion Planning for an
                                  ${L}$-Shaped Object  . . . . . . . . . . 1--23
             R. Baeza-Yates and   
                   R. Casas and   
             J. Díaz and   
             C. Martínez   On the Average Size of the Intersection
                                  of Binary Trees  . . . . . . . . . . . . 24--32
             Jehoshua Bruck and   
                Roman Smolensky   Polynomial threshold functions, ${\rm
                                  AC}^0$ functions, and spectral norms . . 33--42
Mihály Geréb-Graus and   
                  Danny Krizanc   The Average Complexity of Parallel
                                  Comparison Merging . . . . . . . . . . . 43--47
                Luc Devroye and   
       Wojciech Szpankowski and   
                    Bonita Rais   A Note on the Height of Suffix Trees . . 48--53
             Michael Ben-Or and   
                  Richard Cleve   Computing Algebraic Formulas Using a
                                  Constant Number of Registers . . . . . . 54--58
                    Li-Hui Tsai   Asymptotic Analysis of an Algorithm for
                                  Balanced Parallel Processor Scheduling   59--64
              Bruce Hendrickson   Conditions for Unique Graph Realizations 65--84
                   Susan Landau   Simplification of Nested Radicals  . . . 85--110
            David W. Krumme and   
             George Cybenko and   
             K. N. Venkataraman   Gossiping in Minimal Time  . . . . . . . 111--139
         Andrew V. Goldberg and   
           Serge A. Plotkin and   
            David B. Shmoys and   
              Éva Tardos   Using Interior-Point Methods for Fast
                                  Parallel Algorithms for Bipartite
                                  Matching and Related Problems  . . . . . 140--150
           Sandeep N. Bhatt and   
            Fan R. K. Chung and   
        F. Thomson Leighton and   
            Arnold L. Rosenberg   Efficient Embeddings of Trees in
                                  Hypercubes . . . . . . . . . . . . . . . 151--162
             Timothy Law Snyder   On the Exact Location of Steiner Points
                                  in General Dimension . . . . . . . . . . 163--180
               Paul Fischer and   
              Hans Ulrich Simon   On Learning Ring-Sum-Expansions  . . . . 181--192
                  Nathan Linial   Locality in Distributed Graph Algorithms 193--201

SIAM Journal on Computing
Volume 21, Number 2, April, 1992

           Thang Nguyen Bui and   
                    Andrew Peck   Partitioning Planar Graphs . . . . . . . 203--215
                 Wen-Guey Tzeng   A Polynomial-Time Algorithm for the
                                  Equivalence of Probabilistic Automata    216--227
              A. J. Menezes and   
         P. C. van Oorschot and   
                 S. A. Vanstone   Subgroup Refinement Algorithms for Root
                                  Finding in ${\rm GF}(q)$ . . . . . . . . 228--239
             David Helmbold and   
               Robert Sloan and   
             Manfred K. Warmuth   Learning Integer Lattices  . . . . . . . 240--266
        Franco P. Preparata and   
               Roberto Tamassia   Efficient Point Location in a Convex
                                  Spatial Cell-Complex . . . . . . . . . . 267--280
              Qingzhou Wang and   
                  Kam-Hoi Cheng   A Heuristic of Scheduling Parallel Tasks
                                  and Its Analysis . . . . . . . . . . . . 281--294
                   Pang C. Chen   Heuristic Sampling: a Method for
                                  Predicting the Performance of Tree
                                  Searching Programs . . . . . . . . . . . 295--315
             Seinosuke Toda and   
              Mitsunori Ogiwara   Counting Classes Are at Least as Hard as
                                  the Polynomial-Time Hierarchy  . . . . . 316--328
                     Yossi Azar   Lower Bounds for Threshold and Symmetric
                                  Functions in Parallel Computation  . . . 329--338
        Chanderjit L. Bajaj and   
                   Tamal K. Dey   Convex Decomposition of Polyhedra and
                                  Robustness . . . . . . . . . . . . . . . 339--364
                David W. Krumme   Fast Gossiping for the Hypercube . . . . 365--380
            Beverly Jamison and   
                 Stephan Olariu   Recognizing ${P}_4 $-Sparse Graphs in
                                  Linear Time  . . . . . . . . . . . . . . 381--406

SIAM Journal on Computing
Volume 21, Number 3, June, 1992

                  Zvi Galil and   
             Raffaele Giancarlo   On the Exact Complexity of String
                                  Matching: Upper Bounds . . . . . . . . . 407--437
                B. K. Natarajan   Probably Approximate Learning over
                                  Classes of Distributions . . . . . . . . 438--449
      Christos H. Papadimitriou   The Complexity of the Lin--Kernighan
                                  Heuristic for the Traveling Salesman
                                  Problem  . . . . . . . . . . . . . . . . 450--465
               John H. Reif and   
                    Sandeep Sen   Optimal Parallel Randomized Algorithms
                                  for Three-Dimensional Convex Hulls and
                                  Related Problems . . . . . . . . . . . . 466--485
              Samir Khuller and   
        Stephen G. Mitchell and   
              Vijay V. Vazirani   Processor Efficient Parallel Algorithms
                                  for the Two Disjoint Paths Problem and
                                  for Finding a Kuratowski Homeomorph  . . 486--506
                R. W. Gatterdam   Algorithms for Splicing Systems  . . . . 507--520
              Eric Allender and   
        Lane A. Hemachandra and   
          Mitsunori Ogiwara and   
                 Osamu Watanabe   Relating Equivalence and Reducibility to
                                  Sparse Sets  . . . . . . . . . . . . . . 521--539
              Pankaj K. Agarwal   Ray Shooting and Other Applications of
                                  Spanning Trees with Low Stabbing Number  540--570
                    Jarkko Kari   The Nilpotency Problem of
                                  One-Dimensional Cellular Automata  . . . 571--586
               Qian Ping Gu and   
                  Akira Maruoka   Learning Monotone Boolean Functions by
                                  Uniformly Distributed Examples . . . . . 587--599

SIAM Journal on Computing
Volume 21, Number 4, August, 1992

 Elefterios A. Melissaratos and   
              Diane L. Souvaine   Shortest Paths Help Solve Geometric
                                  Optimization Problems in Planar Regions  601--638
             F. T. Leighton and   
             Mark J. Newman and   
          Abhiram G. Ranade and   
                Eric J. Schwabe   Dynamic Tree Embeddings in Butterflies
                                  and Hypercubes . . . . . . . . . . . . . 639--654
               H. Venkateswaran   Circuit Definitions of Nondeterministic
                                  Complexity Classes . . . . . . . . . . . 655--670
               Bernard Chazelle   An Optimal Algorithm for Intersecting
                                  Three-Dimensional Convex Polyhedra . . . 671--696
                    Ming Li and   
         Luc Longpré and   
            Paul Vitányi   The Power of the Queue . . . . . . . . . 697--712
               David Aldous and   
                Micha Hofri and   
           Wojciech Szpankowski   Maximum Size of a Dynamic Data
                                  Structure: Hashing with Lazy Deletion
                                  Revisited  . . . . . . . . . . . . . . . 713--732
                 K. Ganesan and   
                   Steven Homer   Complete Problems and Strong Polynomial
                                  Reducibilities . . . . . . . . . . . . . 733--742
                  Richard Chang   On the Structure of Bounded Queries to
                                  Arbitrary NP Sets  . . . . . . . . . . . 743--754
                    S. Buss and   
                    S. Cook and   
                   A. Gupta and   
                V. Ramachandran   An Optimal Parallel Algorithm for
                                  Formula Evaluation . . . . . . . . . . . 755--780
                 Dario Bini and   
                 Luca Gemignani   On the Complexity of Polynomial Zeros    781--799

SIAM Journal on Computing
Volume 21, Number 5, October, 1992

                   Richard Koch   Increasing the Size of a Network by a
                                  Constant Factor Can Increase Performance
                                  by More Than a Constant Factor . . . . . 801--823
                     Lin Yu and   
          Daniel J. Rosenkrantz   Representability of Design Objects by
                                  Ancestor-Controlled Hierarchical
                                  Specifications . . . . . . . . . . . . . 824--855
             Dany Breslauer and   
                      Zvi Galil   A Lower Bound for Parallel String
                                  Matching . . . . . . . . . . . . . . . . 856--862
              Ichiro Suzuki and   
             Masafumi Yamashita   Searching for a Mobile Intruder in a
                                  Polygonal Region . . . . . . . . . . . . 863--888
                Danny Dolev and   
             Tomás Feder   Determinism vs. Nondeterminism in
                                  Multiparty Communication Complexity  . . 889--895
               John H. Reif and   
                Stephen R. Tate   On Threshold Circuits and Polynomial
                                  Computation  . . . . . . . . . . . . . . 896--908
                   Bettina Just   Generalizing the Continued Fraction
                                  Algorithm to Arbitrary Dimensions  . . . 909--926
           Lenwood S. Heath and   
            Arnold L. Rosenberg   Laying Out Graphs Using Queues . . . . . 927--958
            Michael C. Loui and   
             David R. Luginbuhl   Optimal On-Line Simulations of Tree
                                  Machines by Random Access Machines . . . 959--971
             Siu Wing Cheng and   
                  Ravi Janardan   New Results on Dynamic Planar Point
                                  Location . . . . . . . . . . . . . . . . 972--999
                 Egon Balas and   
                        Jue Xue   Addendum: ``Minimum weighted coloring of
                                  triangulated graphs, with application to
                                  maximum weight vertex packing and clique
                                  finding in arbitrary graphs'' [SIAM J.
                                  Comput. \bf 20 (1991), no. 2, 209--221,
                                  MR 92h:68069]  . . . . . . . . . . . . . 1000--1000

SIAM Journal on Computing
Volume 21, Number 6, December, 1992

                   D. Z. Du and   
                    F. K. Hwang   Reducing the Steiner Problem in a Normed
                                  Space  . . . . . . . . . . . . . . . . . 1001--1007
                  James Renegar   On the Computational Complexity of
                                  Approximating Solutions for Real
                                  Algebraic Formulae . . . . . . . . . . . 1008--1025
              Wei Kuan Shih and   
                T. C. Chern and   
                   Wen-Lian Hsu   An $O(n^2\log n)$ algorithm for the
                                  Hamiltonian cycle problem on
                                  circular-arc graphs  . . . . . . . . . . 1026--1046
                  Zvi Galil and   
           Giuseppe F. Italiano   Fully Dynamic Algorithms for $2$-Edge
                                  Connectivity . . . . . . . . . . . . . . 1047--1069
             Charles Martel and   
                 Arvin Park and   
             Ramesh Subramonian   Work-Optimal Asynchronous Algorithms for
                                  Shared Memory Parallel Computers . . . . 1070--1099
                       Jie Wang   Polynomial Time Productivity,
                                  Approximations, and Levelability . . . . 1100--1111
           Wolfgang W. Bein and   
          Jerzy Kamburowski and   
       Matthias F. M. Stallmann   Optimal Reduction of Two-Terminal
                                  Directed Acyclic Graphs  . . . . . . . . 1112--1129
       Greg N. Frederickson and   
                     D. J. Guan   Preemptive Ensemble Motion Planning on a
                                  Tree . . . . . . . . . . . . . . . . . . 1130--1152
                   Martin Tompa   Lower Bounds on Universal Traversal
                                  Sequences for Cycles and Other Low
                                  Degree Graphs  . . . . . . . . . . . . . 1153--1160
         Stephen Bellantoni and   
            Toniann Pitassi and   
              Alasdair Urquhart   Approximation and Small-Depth Frege
                                  Proofs . . . . . . . . . . . . . . . . . 1161--1179
               Helmut Prodinger   External Internal Nodes in Digital
                                  Search Trees via Mellin Transforms . . . 1180--1183
              Brandon Dixon and   
               Monika Rauch and   
               Robert E. Tarjan   Verification and Sensitivity Analysis of
                                  Minimum Spanning Trees in Linear Time    1184--1192
      Mohammad Amin Shokrollahi   Optimal Algorithms for Multiplication in
                                  Certain Finite Fields Using Elliptic
                                  Curves . . . . . . . . . . . . . . . . . 1193--1198


SIAM Journal on Computing
Volume 22, Number 1, February, 1993

                  Amos Fiat and   
                      Moni Naor   Implicit $O(1)$ Probe Search . . . . . . 1--10
                  Zvi Galil and   
           Giuseppe F. Italiano   Maintaining the $3$-Edge-Connected
                                  Components of a Graph On-Line  . . . . . 11--28
Héctor J. Hernández and   
                        Ke Wang   On the Boundedness of
                                  Constant-Time-Maintainable Database
                                  Schemes  . . . . . . . . . . . . . . . . 29--45
                    Weizhen Mao   Tight worst-case performance bounds for
                                  Next-$k$-Fit bin packing . . . . . . . . 46--56
           Greg N. Frederickson   A Note on the Complexity of a Simple
                                  Transportation Problem . . . . . . . . . 57--61
                  Robert Cypher   A Lower Bound on the Size of Shellsort
                                  Sorting Networks . . . . . . . . . . . . 62--71
                  Joel Friedman   A Note on Poset Geometries . . . . . . . 72--78
                 Sukhamay Kundu   An $O(n)$ algorithm for determining the
                                  subregion-tree representation of a
                                  rectangular dissection . . . . . . . . . 79--101
                 Viliam Geffert   Tally versions of the Savitch and
                                  Immerman--Szelepcsényi theorems for
                                  sublogarithmic space . . . . . . . . . . 102--113
              Michio Oyamaguchi   NV-sequentiality: a decidable condition
                                  for call-by-need computations in
                                  term-rewriting systems . . . . . . . . . 114--135
                    Kazuo Iwama   ${\text{ASPACE}}(o(\log \log n))$ is
                                  Regular  . . . . . . . . . . . . . . . . 136--146
            Peter Bro Miltersen   The Complexity of Malign Measures  . . . 147--156
            Joseph Cheriyan and   
              Ming-Yang Kao and   
         Ramakrishna Thurimella   Scan-first search and sparse
                                  certificates: an improved parallel
                                  algorithm for $k$-vertex connectivity    157--174
                  Andreas Weber   Decomposing Finite-Valued Transducers
                                  and Deciding Their Equivalence . . . . . 175--202
      Jan Kratochvíl and   
        Petr Savický and   
                     Zsolt Tuza   One More Occurrence of Variables Makes
                                  Satisfiability Jump from Trivial to
                                  NP-Complete  . . . . . . . . . . . . . . 203--210
                 Noam Nisan and   
                  Avi Wigderson   Rounds in Communication Complexity
                                  Revisited  . . . . . . . . . . . . . . . 211--219

SIAM Journal on Computing
Volume 22, Number 2, April, 1993

               Omer Berkman and   
                    Uzi Vishkin   Recursive Star-Tree Parallel Data
                                  Structure  . . . . . . . . . . . . . . . 221--242
               Jorma Tarhio and   
                   Esko Ukkonen   Approximate Boyer--Moore String Matching 243--260
Wenceslas Fernandez de la Vega and   
             Sampath Kannan and   
    Miklós Sántha   Two Probabilistic Results on Merging . . 261--271
              Wayne Goddard and   
              Claire Kenyon and   
               Valerie King and   
            Leonard J. Schulman   Optimal Randomized Algorithms for Local
                                  Sorting and Set-Maxima . . . . . . . . . 272--283
               N. Karmarkar and   
                    R. Karp and   
                  R. Lipton and   
           L. Lovász and   
                        M. Luby   A Monte-Carlo Algorithm for Estimating
                                  the Permanent  . . . . . . . . . . . . . 284--293
Miklós Sántha and   
             Christopher Wilson   Limiting Negations in Constant Depth
                                  Circuits . . . . . . . . . . . . . . . . 294--302
          Khaled M. Bugrara and   
        Paul Walton Purdom, Jr.   Average Time Analysis of Clause Order
                                  Backtracking . . . . . . . . . . . . . . 303--317
           Chanderjit Bajaj and   
                 John Canny and   
             Thomas Garrity and   
                     Joe Warren   Factoring Rational Polynomials over the
                                  Complex Numbers  . . . . . . . . . . . . 318--331
         E. G. Coffman, Jr. and   
             Leopold Flatto and   
                 Paul E. Wright   Optimal Stochastic Allocation of
                                  Machines under Waiting-Time Constraints  332--348
      Gábor Galambos and   
           Gerhard J. Woeginger   An On-Line Scheduling Heuristic with
                                  Better Worst Case Ratio Than Graham's
                                  List Scheduling  . . . . . . . . . . . . 349--355
                  Robert Cypher   Theoretical Aspects of VLSI Pin
                                  Limitations  . . . . . . . . . . . . . . 356--378
               Shlomo Moran and   
             Manfred K. Warmuth   Gap Theorems for Distributed Computation 379--394
             Ronald V. Book and   
                   Jack H. Lutz   On Languages With Very High
                                  Space-Bounded Kolmogorov Complexity  . . 395--402
                  Noga Alon and   
                      Moni Naor   Coin-Flipping Games Immune against
                                  Linear-Sized Coalitions  . . . . . . . . 403--417
       Herbert Edelsbrunner and   
             Raimund Seidel and   
                   Micha Sharir   On the Zone Theorem for Hyperplane
                                  Arrangements . . . . . . . . . . . . . . 418--429

SIAM Journal on Computing
Volume 22, Number 3, June, 1993

                  Ming-Yang Kao   Linear-processor NC algorithms for
                                  planar directed graphs. I. Strongly
                                  connected components . . . . . . . . . . 431--459
              Ming-Yang Kao and   
             Gregory E. Shannon   Linear-processor NC algorithms for
                                  planar directed graphs. II. Directed
                                  spanning trees . . . . . . . . . . . . . 460--481
           Daniel Bienstock and   
                    Nicole Diaz   Blocking Small Cuts in a Network, and
                                  Related Problems . . . . . . . . . . . . 482--499
               Kok-Hoo Yeap and   
              Majid Sarrafzadeh   Floor-Planning by Graph Dualization:
                                  $2$-Concave Rectilinear Modules  . . . . 500--526
       Herbert Edelsbrunner and   
                  Tiow Seng Tan   A Quadratic Time Algorithm for the
                                  Minmax Length Triangulation  . . . . . . 527--551
                   K. Kalorkoti   Inverting Polynomials and Formal Power
                                  Series . . . . . . . . . . . . . . . . . 552--559
           Jonathan F. Buss and   
                 Judy Goldsmith   Nondeterminism within $P^*$  . . . . . . 560--572
       Lefteris M. Kirousis and   
                Maria Serna and   
                  Paul Spirakis   Parallel Complexity of the Connected
                                  Subgraph Problem . . . . . . . . . . . . 573--586
             Donald Fussell and   
        Vijaya Ramachandran and   
         Ramakrishna Thurimella   Finding Triconnected Components by Local
                                  Replacement  . . . . . . . . . . . . . . 587--616
                 Dario Bini and   
                     Victor Pan   Improved Parallel Polynomial Division    617--626
      Daniel J. Rosenkrantz and   
             Harry B. Hunt, III   The Complexity of Processing
                                  Hierarchical Specifications  . . . . . . 627--649
         E. G. Coffman, Jr. and   
             Leopold Flatto and   
                 Paul E. Wright   A Stochastic Checkpoint Optimization
                                  Problem  . . . . . . . . . . . . . . . . 650--659

SIAM Journal on Computing
Volume 22, Number 4, August, 1993

                 Andreas Goerdt   Regular Resolution Versus Unrestricted
                                  Resolution . . . . . . . . . . . . . . . 661--683
            H. Niederreiter and   
                  C. P. Schnorr   Local Randomness in Polynomial Random
                                  Number and Random Function Generators    684--694
                A. Dür and   
                   J. Grabmeier   Applying Coding Theory to Sparse
                                  Interpolation  . . . . . . . . . . . . . 695--704
           Sally A. Goldman and   
          Michael J. Kearns and   
             Robert E. Schapire   Exact Identification of Read-Once
                                  Formulas Using Fixed Points of
                                  Amplification Functions  . . . . . . . . 705--726
            Louise E. Moser and   
        P. M. Melliar-Smith and   
                 Vivek Agrawala   Asynchronous Fault-Tolerant Total
                                  Ordering Algorithms  . . . . . . . . . . 727--750
        Arthur S. Goldstein and   
             Edward M. Reingold   A Fibonacci Version of Kraft's
                                  Inequality Applied to Discrete Unimodal
                                  Search . . . . . . . . . . . . . . . . . 751--777
          Pankaj K. Agarwal and   
           Marco Pellegrini and   
                   Micha Sharir   Counting Circular Arc Intersections  . . 778--793
          Pankaj K. Agarwal and   
       Ji\vrí Matou\vsek   Ray Shooting and Parametric Search . . . 794--806
             Michael Kearns and   
                        Ming Li   Learning in the Presence of Malicious
                                  Errors . . . . . . . . . . . . . . . . . 807--837
                Joseph Naor and   
                      Moni Naor   Small-Bias Probability Spaces: Efficient
                                  Constructions and Applications . . . . . 838--856
                David Harel and   
                      Danny Raz   Deciding Properties of Nonregular
                                  Programs . . . . . . . . . . . . . . . . 857--874
          Reuven Bar-Yehuda and   
               Amos Israeli and   
                      Alon Itai   Multiple Communication in Multihop Radio
                                  Networks . . . . . . . . . . . . . . . . 875--887

SIAM Journal on Computing
Volume 22, Number 5, October, 1993

             Tsan-Sheng Hsu and   
            Vijaya Ramachandran   Finding a Smallest Augmentation to
                                  Biconnect a Graph  . . . . . . . . . . . 889--912
          Bernd Halstenberg and   
          Rüdiger Reischuk   Different Modes of Communication . . . . 913--934
                 Udi Manber and   
                     Gene Myers   Suffix Arrays: a New Method for On-Line
                                  String Searches  . . . . . . . . . . . . 935--948
              Andreas Blass and   
                  Yuri Gurevich   Randomizing Reductions of Search
                                  Problems . . . . . . . . . . . . . . . . 949--975
               Ruey-Der Lou and   
              Majid Sarrafzadeh   An Optimal Algorithm for the Maximum
                                  Three-Chain Problem  . . . . . . . . . . 976--993
            Joan Feigenbaum and   
                  Lance Fortnow   Random-Self-Reducibility of Complete
                                  Sets . . . . . . . . . . . . . . . . . . 994--1005
           Sally A. Goldman and   
           Ronald L. Rivest and   
             Robert E. Schapire   Learning Binary Relations and Total
                                  Orders . . . . . . . . . . . . . . . . . 1006--1034
                 M. Formann and   
                 T. Hagerup and   
            J. Haralambides and   
                M. Kaufmann and   
             F. T. Leighton and   
                A. Symvonis and   
                   E. Welzl and   
                   G. Woeginger   Drawing Graphs in the Plane with High
                                  Resolution . . . . . . . . . . . . . . . 1035--1052
Béla Bollobás and   
                   Istvan Simon   Probabilistic Analysis of Disjoint Set
                                  Union Algorithms . . . . . . . . . . . . 1053--1074
                   Jack H. Lutz   A Pseudorandom Oracle Characterization
                                  of ${\text{BPP}}$  . . . . . . . . . . . 1075--1086
                Mark Jerrum and   
              Alistair Sinclair   Polynomial-Time Approximation Algorithms
                                  for the Ising Model  . . . . . . . . . . 1087--1116

SIAM Journal on Computing
Volume 22, Number 6, December, 1993

                  Tao Jiang and   
                   B. Ravikumar   Minimal NFA Problems Are Hard  . . . . . 1117--1141
                Jiazhen Cai and   
               Xiaofeng Han and   
               Robert E. Tarjan   An $O(m\log n)$-time algorithm for the
                                  maximal planar subgraph problem  . . . . 1142--1162
             Oded Goldreich and   
              Hugo Krawczyk and   
                   Michael Luby   On the Existence of Pseudorandom
                                  Generators . . . . . . . . . . . . . . . 1163--1175
           Wojciech Szpankowski   A Generalized Suffix Tree and Its
                                  (Un)Expected Asymptotic Behaviors  . . . 1176--1198
            David R. Karger and   
              Daphne Koller and   
             Steven J. Phillips   Finding the Hidden Path: Time Bounds for
                                  All-Pairs Shortest Paths . . . . . . . . 1199--1217
                         Xin He   On Finding the Rectangular Duals of
                                  Planar Triangular Graphs . . . . . . . . 1218--1226
                 Victor Pan and   
                      John Reif   Fast and Efficient Parallel Solution of
                                  Sparse Linear Systems  . . . . . . . . . 1227--1250
             WanSoo T. Rhee and   
               Michel Talagrand   On-Line Bin Packing of Items of Random
                                  Sizes, II  . . . . . . . . . . . . . . . 1251--1256
           Ricard Gavald\`a and   
                 Osamu Watanabe   On the Computational Complexity of Small
                                  Descriptions . . . . . . . . . . . . . . 1257--1275
          Marek Karpi\'nski and   
               Thorsten Werther   VC Dimension and Uniform Learnability of
                                  Sparse Polynomials and Rational
                                  Functions  . . . . . . . . . . . . . . . 1276--1285
           Bernard Chazelle and   
       Herbert Edelsbrunner and   
            Leonidas Guibas and   
               Micha Sharir and   
                  Jack Snoeyink   Computing a Face in an Arrangement of
                                  Line Segments and Related Problems . . . 1286--1302
                        Bo Chen   A Better Heuristic for Preemptive
                                  Parallel Machine Scheduling with Batch
                                  Setup Times  . . . . . . . . . . . . . . 1303--1318
            Jiang-Hsing Chu and   
                  Gary D. Knott   A New Method for Computing Page-Fault
                                  Rates  . . . . . . . . . . . . . . . . . 1319--1330
           Eyal Kushilevitz and   
                 Yishay Mansour   Learning Decision Trees Using the
                                  Fourier Spectrum . . . . . . . . . . . . 1331--1348
                   Richard Cole   Correction: ``Parallel merge sort''
                                  [SIAM J. Comput. \bf 17 (1988), no. 4,
                                  770--785, MR 89m:68015]  . . . . . . . . 1349--1349


SIAM Journal on Computing
Volume 23, Number 1, February, 1994

             Dima Grigoriev and   
            Marek Karpinski and   
              Michael F. Singer   Computational Complexity of Sparse
                                  Rational Interpolation . . . . . . . . . 1--11
          Alfredo De Santis and   
              Giuseppe Persiano   Tight Upper and Lower Bounds on the Path
                                  Length of Binary Trees . . . . . . . . . 12--23
            Rajamani Sundar and   
               Robert E. Tarjan   Unique Binary-Search-Tree
                                  Representations and Equality Testing of
                                  Sets and Sequences . . . . . . . . . . . 24--44
                   E. Boros and   
                   Y. Crama and   
               P. L. Hammer and   
                        M. Saks   A Complexity Index for Satisfiability
                                  Problems . . . . . . . . . . . . . . . . 45--49
         Alberto Apostolico and   
       Giuseppe F. Italiano and   
            Giorgio Gambosi and   
                Maurizio Talamo   The Set Union Problem with Unlimited
                                  Backtracking . . . . . . . . . . . . . . 50--70
                  David Kuo and   
                Gerard J. Chang   The Profile Minimization Problem in
                                  Trees  . . . . . . . . . . . . . . . . . 71--81
                   D.-Z. Du and   
                  G.-L. Xue and   
                  S.-Z. Sun and   
                    S.-W. Cheng   Modifications of Competitive Group
                                  Testing  . . . . . . . . . . . . . . . . 82--96
              Mihir Bellare and   
               Shafi Goldwasser   The Complexity of Decision Versus Search 97--119
          John Shawe-Taylor and   
               Toma\vz Pisanski   Homeomorphism of $2$-Complexes is Graph
                                  Isomorphism Complete . . . . . . . . . . 120--132
               Marco Pellegrini   On Collision-Free Placements of
                                  Simplices and the Closest Pair of Lines
                                  in $3$-Space . . . . . . . . . . . . . . 133--153
   Ji\vrí Matou\vsek and   
          János Pach and   
               Micha Sharir and   
             Shmuel Sifrony and   
                      Emo Welzl   Fat Triangles Determine Linearly Many
                                  Holes  . . . . . . . . . . . . . . . . . 154--169
           Robert W. Irving and   
                 Mark R. Jerrum   Three-dimensional Statistical Data
                                  Security Problems  . . . . . . . . . . . 170--184
       Greg N. Frederickson and   
                Susan H. Rodger   An NC Algorithm for Scheduling Unit-Time
                                  Jobs with Arbitrary Release Times and
                                  Deadlines  . . . . . . . . . . . . . . . 185--211
        Jean-Claude Bermond and   
              Pierre Fraigniaud   Broadcasting and Gossiping in de Bruijn
                                  Networks . . . . . . . . . . . . . . . . 212--225

SIAM Journal on Computing
Volume 23, Number 2, April, 1994

           Michael Kaufmann and   
                  Kurt Mehlhorn   A Linear-Time Algorithm for the
                                  Homotopic Routing Problem in Grid Graphs 227--246
               Eberhard Triesch   Some Results on Elusive Graph Properties 247--254
                     Bin Fu and   
                   Hong Zhou Li   Closeness of NP-Hard Sets to Other
                                  Complexity Classes . . . . . . . . . . . 255--260
       Johannes Köbler and   
                Thomas Thierauf   Complexity-Restricted Advice Functions   261--275
           Kieran T. Herley and   
             Gianfranco Bilardi   Deterministic Simulations of PRAMs on
                                  Bounded Degree Networks  . . . . . . . . 276--292
             Howard Karloff and   
               Yuval Rabani and   
                  Yiftach Ravid   Lower bounds for randomized $k$-server
                                  and motion-planning algorithms . . . . . 293--312
               Amihood Amir and   
                Gary Benson and   
                  Martin Farach   An Alphabet Independent Approach to
                                  Two-Dimensional Pattern Matching . . . . 313--323
           Andrei Z. Broder and   
             Anna R. Karlin and   
         Prabhakar Raghavan and   
                      Eli Upfal   Trading space for time in undirected
                                  $s$-$t$ connectivity . . . . . . . . . . 324--334
             Soma Chaudhuri and   
              Jennifer L. Welch   Bounds on the Costs of Multivalued
                                  Register Implementations . . . . . . . . 335--354
                  A. Bagchi and   
           E. F. Schmeichel and   
                   S. L. Hakimi   Parallel Information Dissemination by
                                  Packets  . . . . . . . . . . . . . . . . 355--372
               Gara Pruesse and   
                   Frank Ruskey   Generating Linear Extensions Fast  . . . 373--386
               H. Narayanan and   
                Huzur Saran and   
              Vijay V. Vazirani   Randomized Parallel Algorithms for
                                  Matroid Union and Intersection, with
                                  Applications to Arborescences and
                                  Edge-Disjoint Spanning Trees . . . . . . 387--397
             R. Swaminathan and   
               Donald K. Wagner   On the Consecutive-Retrieval Problem . . 398--414
               Myong-Hi Kim and   
               Scott Sutherland   Polynomial Root-Finding Algorithms and
                                  Branched Covers  . . . . . . . . . . . . 415--436
               Mark de Berg and   
              Mark Overmars and   
            Otfried Schwarzkopf   Computing and Verifying Depth Orders . . 437--446
               John H. Reif and   
                    Sandeep Sen   Erratum: ``Optimal parallel randomized
                                  algorithms for three-dimensional convex
                                  hulls and related problems'' [SIAM J.
                                  Comput. \bf 21 (1992), no. 3, 466--485,
                                  MR 93f:68038]  . . . . . . . . . . . . . 447--448

SIAM Journal on Computing
Volume 23, Number 3, June, 1994

               Omer Berkman and   
              Joseph Ja'Ja' and   
      Sridhar Krishnamurthy and   
     Ramakrishna Thurimella and   
                    Uzi Vishkin   Top-Bottom Routing Around a Rectangle is
                                  as Easy as Computing Prefix Minima . . . 449--465
               Philip Klein and   
              Serge Plotkin and   
             Clifford Stein and   
              Éva Tardos   Faster Approximation Algorithms for the
                                  Unit Capacity Concurrent Flow Problem
                                  With Applications to Routing and Finding
                                  Sparse Cuts  . . . . . . . . . . . . . . 466--487
              Ming-Jye Sheu and   
                Timothy J. Long   The Extended Low Hierarchy Is an
                                  Infinite Hierarchy . . . . . . . . . . . 488--509
          Donald B. Johnson and   
                     Larry Raab   Complexity of Network Reliability and
                                  Optimal Resource Placement Problems  . . 510--519
         Jitender S. Deogun and   
                 George Steiner   Polynomial Algorithms for Hamiltonian
                                  Cycle in Cocomparability Graphs  . . . . 520--552
             Victor Pestien and   
            S. Ramakrishnan and   
                   Dilip Sarkar   Packet Transmission in a Noisy-Channel
                                  Ring Network . . . . . . . . . . . . . . 553--562
                 Jin-Yi Cai and   
              Richard J. Lipton   Subquadratic Simulations of Balanced
                                  Formulae by Branching Programs . . . . . 563--572
       Étienne Grandjean   Linear Time Algorithms and NP-Complete
                                  Problems . . . . . . . . . . . . . . . . 573--597
        Peter Kirschenhofer and   
           Helmut Prodinger and   
           Wojciech Szpankowski   Digital Search Trees Again Revisited:
                                  The Internal Path Length Perspective . . 598--616
            David B. Shmoys and   
             Clifford Stein and   
                      Joel Wein   Improved Approximation Algorithms for
                                  Shop Scheduling Problems . . . . . . . . 617--632
               John H. Reif and   
                    Sandeep Sen   Randomized Algorithms for Binary Search
                                  and Load Balancing on Fixed Connection
                                  Networks with Geometric Applications . . 633--651
                 Paul Beame and   
               Martin Tompa and   
                    Peiyuan Yan   Communication-Space Tradeoffs for
                                  Unrestricted Protocols . . . . . . . . . 652--661
           Bertrand Braschi and   
                 Denis Trystram   A New Insight into the Coffman--Graham
                                  Algorithm  . . . . . . . . . . . . . . . 662--669

SIAM Journal on Computing
Volume 23, Number 4, August, 1994

              Ashok Subramanian   A New Approach to Stable Matching
                                  Problems . . . . . . . . . . . . . . . . 671--700
                 Benny Chor and   
               Amos Israeli and   
                        Ming Li   Wait-Free Consensus Using Asynchronous
                                  Hardware . . . . . . . . . . . . . . . . 701--712
          Sampath K. Kannan and   
                Tandy J. Warnow   Inferring Evolutionary History From DNA
                                  Sequences  . . . . . . . . . . . . . . . 713--737
      Martin Dietzfelbinger and   
                Anna Karlin and   
              Kurt Mehlhorn and   
Friedhelm Meyer auf der Heide and   
               Hans Rohnert and   
               Robert E. Tarjan   Dynamic Perfect Hashing: Upper and Lower
                                  Bounds . . . . . . . . . . . . . . . . . 738--761
               Jack H. Lutz and   
               Elvira Mayordomo   Measure, Stochasticity, and the Density
                                  of Hard Languages  . . . . . . . . . . . 762--779
            Alexander Schrijver   Finding $k$ disjoint paths in a directed
                                  planar graph . . . . . . . . . . . . . . 780--788
            Karel Culik, II and   
          Juhani Karhumäki   Finite Automata Computing Real Functions 789--814
               Nader H. Bshouty   On the Complexity of Bilinear Forms Over
                                  Associative Algebras . . . . . . . . . . 815--833
                Prakash Ramanan   A New Lower Bound Technique and its
                                  Application: Tight Lower Bound for a
                                  Polygon Triangulation Problem  . . . . . 834--851
                     Luca Aceto   On ``Axiomatising Finite Concurrent
                                  Processes''  . . . . . . . . . . . . . . 852--863
                E. Dahlhaus and   
              D. S. Johnson and   
        C. H. Papadimitriou and   
              P. D. Seymour and   
                  M. Yannakakis   The Complexity of Multiterminal Cuts . . 864--894

SIAM Journal on Computing
Volume 23, Number 5, October, 1994

                     A. Das and   
            K. Thulasiraman and   
                  V. K. Agarwal   Diagnosis of $t / (t + 1)$-Diagnosable
                                  Systems  . . . . . . . . . . . . . . . . 895--905
          Ravindra K. Ahuja and   
             James B. Orlin and   
             Clifford Stein and   
               Robert E. Tarjan   Improved Algorithms for Bipartite
                                  Network Flow . . . . . . . . . . . . . . 906--933
                      V. Y. Pan   New Resultant Inequalities and Complex
                                  Polynomial Factorization . . . . . . . . 934--950
              Jeffery Westbrook   Randomized Algorithms for Multiprocessor
                                  Page Migration . . . . . . . . . . . . . 951--965
            Andrew Chi Chih Yao   Near-Optimal Time-Space Tradeoff for
                                  Element Distinctness . . . . . . . . . . 966--975
           Andrei Z. Broder and   
             Alan M. Frieze and   
                      Eli Upfal   Existence and Construction of
                                  Edge-Disjoint Paths on Expander Graphs   976--989
                  Avrim L. Blum   Separating Distribution-Free and
                                  Mistake-Bound Learning Models Over the
                                  Boolean Domain . . . . . . . . . . . . . 990--1000
                Uriel Feige and   
         Prabhakar Raghavan and   
                David Peleg and   
                      Eli Upfal   Computing with Noisy Information . . . . 1001--1018
                Ding Zhu Du and   
                    Haesun Park   On Competitive Group Testing . . . . . . 1019--1025
              Eric Allender and   
                     Vivek Gore   A Uniform Circuit Lower Bound For the
                                  Permanent  . . . . . . . . . . . . . . . 1026--1049
                William Lew and   
               Hosam M. Mahmoud   The Joint Distribution of Elastic
                                  Buckets in Multiway Search Trees . . . . 1050--1074
                   Richard Cole   Tight Bounds on the Complexity of the
                                  Boyer--Moore String Matching Algorithm   1075--1091

SIAM Journal on Computing
Volume 23, Number 6, December, 1994

               Marc Gyssens and   
              Jan Paredaens and   
                 Dirk Van Gucht   A Grammar-Based Approach Towards
                                  Unifying Hierarchical Data Models  . . . 1093--1137
           Bernard Chazelle and   
       Herbert Edelsbrunner and   
         Leonidas J. Guibas and   
        John E. Hershberger and   
             Raimund Seidel and   
                   Micha Sharir   Selecting Heavily Covered Points . . . . 1138--1151
                Yehuda Afek and   
                      Eli Gafni   Distributed Algorithms For
                                  Unidirectional Networks  . . . . . . . . 1152--1178
          Dorit S. Hochbaum and   
            Joseph (Seffi) Naor   Simple and Fast Algorithms for Linear
                                  and Integer Programs with Two Variables
                                  Per Inequality . . . . . . . . . . . . . 1179--1192
                 Sam M. Kim and   
              Robert McNaughton   Computing the Order of a Locally
                                  Testable Automaton . . . . . . . . . . . 1193--1215
             Richa Agarwala and   
    David Fernández-Baca   A Polynomial-Time Algorithm for the
                                  Perfect Phylogeny Problem When the
                                  Number of Character States is Fixed  . . 1216--1224
             M. D. Atkinson and   
                   Robert Beals   Priority Queues and Permutations . . . . 1225--1230
                Naomi Nishimura   A Model for Asynchronous Shared Memory
                                  Parallel Computation . . . . . . . . . . 1231--1252
                Shiva Chaudhuri   Tight Bounds on Oblivious Chaining . . . 1253--1265
              Robert Cypher and   
                   Luis Gravano   Requirements for Deadlock-Free, Adaptive
                                  Packet Routing . . . . . . . . . . . . . 1266--1274
                 Ronald V. Book   On Languages Reducible to
                                  Algorithmically Random Languages . . . . 1275--1282
        Lawrence L. Larmore and   
            Teresa M. Przytycka   A Fast Algorithm for Optimum
                                  Height-Limited Alphabetic Binary Trees   1283--1312
                Edith Cohen and   
                 Nimrod Megiddo   Improved Algorithms for Linear
                                  Inequalities with Two Variables Per
                                  Inequality . . . . . . . . . . . . . . . 1313--1347


SIAM Journal on Computing
Volume 24, Number 1, February, 1995

                      Anonymous   In Memoriam: Eugene L. Lawler  . . . . . 1--2
              Andreas Blass and   
                  Yuri Gurevich   Matrix Transformation Is Complete for
                                  the Average Case . . . . . . . . . . . . 3--29
               Richard Cole and   
           Ramesh Hariharan and   
              Mike Paterson and   
                      Uri Zwick   Tighter Lower Bounds on the Exact
                                  Complexity of String Matching  . . . . . 30--45
                  Ming-Yang Kao   Planar Strong Connectivity Helps in
                                  Parallel Depth-First Search  . . . . . . 46--62
                 Dario Bini and   
                 Luca Gemignani   Fast Parallel Computation of the
                                  Polynomial Remainder Sequence Via Bézout
                                  and Hankel Matrices  . . . . . . . . . . 63--77
                  Noga Alon and   
            Richard M. Karp and   
                David Peleg and   
                   Douglas West   A graph-theoretic game and its
                                  application to the $k$-server problem    78--100
                Huzur Saran and   
              Vijay V. Vazirani   Finding $k$ Cuts within Twice the
                                  Optimal  . . . . . . . . . . . . . . . . 101--108
          Maria Luisa Bonet and   
                 Samuel R. Buss   The Serial Transitive Closure Problem
                                  for Trees  . . . . . . . . . . . . . . . 109--122
            Oscar H. Ibarra and   
                  Tao Jiang and   
              Nicholas Tran and   
                       Hui Wang   New Decidability Results Concerning
                                  Two-Way Counter Machines . . . . . . . . 123--137
                   Yanjun Zhang   On the optimality of randomized
                                  $\alpha$-$\beta$ search  . . . . . . . . 138--147
               Israel Cidon and   
                Shay Kutten and   
             Yishay Mansour and   
                    David Peleg   Greedy Packet Scheduling . . . . . . . . 148--157
                  Moni Naor and   
                    Ron M. Roth   Optimal File Sharing in Distributed
                                  Networks . . . . . . . . . . . . . . . . 158--183
          Paul J. Heffernan and   
          Joseph S. B. Mitchell   An Optimal Algorithm for Computing
                                  Visibility in the Plane  . . . . . . . . 184--201

SIAM Journal on Computing
Volume 24, Number 2, April, 1995

            Joseph Cheriyan and   
                 Torben Hagerup   A Randomized Maximum-Flow Algorithm  . . 203--226
                B. K. Natarajan   Sparse Approximate Solutions to Linear
                                  Systems  . . . . . . . . . . . . . . . . 227--234
              Qingzhou Wang and   
                 Ernst L. Leiss   A Heuristic Scheduling of Independent
                                  Tasks with Bottleneck Resource
                                  Constraints  . . . . . . . . . . . . . . 235--241
             Dima Grigoriev and   
             Michael Singer and   
                     Andrew Yao   On Computing Algebraic Functions Using
                                  Logarithms and Exponentials  . . . . . . 242--246
              Sanjiv Kapoor and   
                      H. Ramesh   Algorithms for Enumerating All Spanning
                                  Trees of Undirected and Weighted Graphs  247--265
              Faith E. Fich and   
               J. Ian Munro and   
            Patricio V. Poblete   Permuting In Place . . . . . . . . . . . 266--278
            David W. Juedes and   
                   Jack H. Lutz   The Complexity and Distribution of Hard
                                  Problems . . . . . . . . . . . . . . . . 279--295
          Michel X. Goemans and   
            David P. Williamson   A General Approximation Technique for
                                  Constrained Forest Problems  . . . . . . 296--317
                Gilad Koren and   
                  Dennis Shasha   $\text{D}^{\textit{over}}$: An Optimal
                                  On-Line Scheduling Algorithm for
                                  Overloaded Uniprocessor Real-Time
                                  Systems  . . . . . . . . . . . . . . . . 318--339
     Pekka Kilpeläinen and   
                 Heikki Mannila   Ordered and Unordered Tree Inclusion . . 340--356
                 Yishay Mansour   Randomized Interpolation and
                                  Approximation of Sparse Polynomials  . . 357--368
              A. L. Delcher and   
                S. Rao Kosaraju   An $\mathcal{NC}$ Algorithm for
                                  Evaluating Monotone Planar Circuits  . . 369--375
                 Benny Chor and   
Mihály Geréb-Graus and   
               Eyal Kushilevitz   Private Computations Over the Integers   376--386
             Y. N. Lakshman and   
              B. David Saunders   Sparse Polynomial Interpolation in
                                  Nonstandard Bases  . . . . . . . . . . . 387--397
                    Ming Li and   
            Paul Vitányi   A New Approach to Formal Language Theory
                                  by Kolmogorov Complexity . . . . . . . . 398--410

SIAM Journal on Computing
Volume 24, Number 3, June, 1995

                   Wen Lian Hsu   $O(M\cdot N)$ algorithms for the
                                  recognition and isomorphism problems on
                                  circular-arc graphs  . . . . . . . . . . 411--439
               Ajit Agrawal and   
               Philip Klein and   
                        R. Ravi   When trees collide: an approximation
                                  algorithm for the generalized Steiner
                                  problem on networks  . . . . . . . . . . 440--456
              Chung-Do Yang and   
                  D. T. Lee and   
                     C. K. Wong   Rectilinear Path Problems among
                                  Rectilinear Obstacles Revisited  . . . . 457--472
                 Jürg Ganz   Evaluation of Polynomials Using the
                                  Structure of the Coefficients  . . . . . 473--483
                Alan Frieze and   
            Richard M. Karp and   
                     Bruce Reed   When Is the Assignment Bound Tight for
                                  the Asymmetric Traveling-Salesman
                                  Problem? . . . . . . . . . . . . . . . . 484--493
             Andrew V. Goldberg   Scaling Algorithms for the Shortest
                                  Paths Problem  . . . . . . . . . . . . . 494--504
András A. Benczúr   Counterexamples for Directed and Node
                                  Capacitated Cut-Trees  . . . . . . . . . 505--510
          Sampath K. Kannan and   
                Tandy J. Warnow   Tree Reconstruction from Partial Orders  511--519
             Raffaele Giancarlo   A Generalization of the Suffix Tree to
                                  Square Matrices, with Applications . . . 520--562
           Takeshi Tokuyama and   
                     Jun Nakano   Efficient Algorithms for the Hitchcock
                                  Transportation Problem . . . . . . . . . 563--578
                    Edith Cohen   Approximate Max-Flow on Small Depth
                                  Networks . . . . . . . . . . . . . . . . 579--597
            Richard A. Duke and   
              Hanno Lefmann and   
            Vojt\vech Rödl   A Fast Approximation Algorithm for
                                  Computing the Frequencies of Subgraphs
                                  in a Given Graph . . . . . . . . . . . . 598--620
     Henri-M. Méjean and   
                Henri Morel and   
          Gérard Reynaud   A Variational Method for Analysing Unit
                                  Clause Search  . . . . . . . . . . . . . 621--649
          Ioannis Z. Emiris and   
                  John F. Canny   A General Approach to Removing
                                  Degeneracies . . . . . . . . . . . . . . 650--664
         Timothy Law Snyder and   
              J. Michael Steele   A Priori Bounds on the Euclidean
                                  Traveling Salesman . . . . . . . . . . . 665--671

SIAM Journal on Computing
Volume 24, Number 4, June, 1995

              Harry Buhrman and   
         Edith Hemaspaandra and   
             Luc Longpré   SPARSE Reduces Conjunctively to TALLY    673--681
           Nader H. Bshouty and   
              Richard Cleve and   
                   Wayne Eberly   Size-Depth Tradeoffs for Algebraic
                                  Formulas . . . . . . . . . . . . . . . . 682--705
           Nader H. Bshouty and   
          Thomas R. Hancock and   
               Lisa Hellerstein   Learning Arithmetic Read-Once Formulas   706--735
         Tomás Feder and   
           Eyal Kushilevitz and   
                  Moni Naor and   
                     Noam Nisan   Amortized Communication Complexity . . . 736--750
     Håkan Lennerstad and   
                  Lars Lundberg   An Optimal Execution Time Estimate of
                                  Static Versus Dynamic Allocation in
                                  Multiprocessor Systems . . . . . . . . . 751--764
                   Kazuo Murota   Computing the Degree of Determinants Via
                                  Combinatorial Relaxation . . . . . . . . 765--796
          Donald W. Gillies and   
                 Jane W.-S. Liu   Scheduling Tasks with AND/OR Precedence
                                  Constraints  . . . . . . . . . . . . . . 797--810
              Victor Y. Pan and   
            Franco P. Preparata   Work-Preserving Speed-Up of Parallel
                                  Matrix Computations  . . . . . . . . . . 811--821
               Svatopluk Poljak   Integer Linear Programs and Local Search
                                  for Max-Cut  . . . . . . . . . . . . . . 822--839
       Lane A. Hemaspaandra and   
             Riccardo Silvestri   Easily Checked Generalized
                                  Self-Reducibility  . . . . . . . . . . . 840--858
              Samir Khuller and   
        Balaji Raghavachari and   
                     Neal Young   Approximating the Minimum Equivalent
                                  Digraph  . . . . . . . . . . . . . . . . 859--872
              Rod G. Downey and   
             Michael R. Fellows   Fixed-parameter tractability and
                                  completeness. I. Basic results . . . . . 873--921

SIAM Journal on Computing
Volume 24, Number 5, October, 1995

             Arthur W. Chou and   
                       Ker-I Ko   Computational Complexity of
                                  Two-Dimensional Regions  . . . . . . . . 923--947
                Mark Giesbrecht   Nearly Optimal Algorithms For Canonical
                                  Matrix Forms . . . . . . . . . . . . . . 948--969
            Robert F. Cohen and   
       Giuseppe Di Battista and   
           Roberto Tamassia and   
              Ioannis G. Tollis   Dynamic Graph Drawings: Trees,
                                  Series-Parallel Digraphs, and Planar
                                  ST-Digraphs  . . . . . . . . . . . . . . 970--1001
             Gary L. Miller and   
            Joseph (Seffi) Naor   Flow in Planar Graphs with Multiple
                                  Sources and Sinks  . . . . . . . . . . . 1002--1017
             Bernd Gärtner   A Subexponential Algorithm for Abstract
                                  Optimization Problems  . . . . . . . . . 1018--1035
               Suresh Chari and   
             Pankaj Rohatgi and   
             Aravind Srinivasan   Randomness-Optimal Unique Element
                                  Isolation with Applications to Perfect
                                  Matching and Related Problems  . . . . . 1036--1050
         Franz Höfting and   
                     Egon Wanke   Minimum Cost Paths in Periodic Graphs    1051--1067
              Mitsunori Ogihara   Polynomial-Time Membership Comparable
                                  Sets . . . . . . . . . . . . . . . . . . 1068--1081
                         Bin Fu   With Quasilinear Queries EXP Is Not
                                  Polynomial Time Turing Reducible to
                                  Sparse Sets  . . . . . . . . . . . . . . 1082--1090
             Arne Andersson and   
                 Thomas Ottmann   New Tight Bounds on Uniquely Represented
                                  Dictionaries . . . . . . . . . . . . . . 1091--1103
             Ching-Chih Han and   
               Kwei-Jay Lin and   
                 Jane W.-S. Liu   Scheduling Jobs with Temporal Distance
                                  Constraints  . . . . . . . . . . . . . . 1104--1121
                  Tao Jiang and   
                        Ming Li   On the Approximation of Shortest Common
                                  Supersequences and Longest Common
                                  Subsequences . . . . . . . . . . . . . . 1122--1139

SIAM Journal on Computing
Volume 24, Number 6, December, 1995

                Luc Devroye and   
            John Michael Robson   On the Generation of Random Binary
                                  Search Trees . . . . . . . . . . . . . . 1141--1156
                Luc Devroye and   
                     Bruce Reed   On the Variance of the Height of Random
                                  Binary Search Trees  . . . . . . . . . . 1157--1162
        Lawrence L. Larmore and   
            Teresa M. Przytycka   Constructing Huffman Trees in Parallel   1163--1169
                   Jack H. Lutz   Weakly Hard Problems . . . . . . . . . . 1170--1189
          Adam L. Buchsbaum and   
            Rajamani Sundar and   
               Robert E. Tarjan   Data-Structural Bootstrapping, Linear
                                  Path Compression, and Catenable
                                  Heap-Ordered Double-Ended Queues . . . . 1190--1206
                R. C. Sekar and   
                  R. Ramesh and   
             I. V. Ramakrishnan   Adaptive Pattern Matching  . . . . . . . 1207--1234
       Alberto O. Mendelzon and   
                  Peter T. Wood   Finding Regular Simple Paths in Graph
                                  Databases  . . . . . . . . . . . . . . . 1235--1258
                  Moni Naor and   
               Larry Stockmeyer   What Can Be Computed Locally?  . . . . . 1259--1277
               Thomas Eiter and   
                  Georg Gottlob   Identifying the Minimal Transversals of
                                  a Hypergraph and Related Problems  . . . 1278--1304
                   K. Kalorkoti   On the Reuse of Additions in Matrix
                                  Multiplication . . . . . . . . . . . . . 1305--1312
            David B. Shmoys and   
                  Joel Wein and   
            David P. Williamson   Scheduling Parallel Machines On-Line . . 1313--1331
               Xiaofeng Han and   
              Pierre Kelsen and   
        Vijaya Ramachandran and   
                  Robert Tarjan   Computing Minimal Spanning Subgraphs in
                                  Linear Time  . . . . . . . . . . . . . . 1332--1358


SIAM Journal on Computing
Volume 25, Number 1, February, 1996

              Adam J. Grove and   
          Joseph Y. Halpern and   
                  Daphne Koller   Asymptotic Conditional Probabilities:
                                  The Unary Case . . . . . . . . . . . . . 1--51
                      Yijie Han   A Fast Derandomization Scheme and Its
                                  Applications . . . . . . . . . . . . . . 52--82
             Richa Agarwala and   
    David Fernández-Baca   Weighted Multidimensional Search and Its
                                  Application to Convex Optimization . . . 83--99
          Pankaj K. Agarwal and   
                   Micha Sharir   Ray Shooting amidst Convex Polyhedra and
                                  Polyhedral Terrains in Three Dimensions  100--116
               B. M. Kapron and   
                     S. A. Cook   A new Characterization of Type-$2$
                                  Feasibility  . . . . . . . . . . . . . . 117--132
               Kenneth W. Regan   Linear Time and Memory-Efficient
                                  Computation  . . . . . . . . . . . . . . 133--168
             Oded Goldreich and   
                  Hugo Krawczyk   On the Composition of Zero-Knowledge
                                  Proof Systems  . . . . . . . . . . . . . 169--192
             Stephen Fenner and   
              Lance Fortnow and   
                Stuart A. Kurtz   The Isomorphism Conjecture Holds
                                  Relative to an Oracle  . . . . . . . . . 193--206
              Yi-Jen Chiang and   
        Franco P. Preparata and   
               Roberto Tamassia   A Unified Approach to Dynamic Point
                                  Location, Ray Shooting, and Shortest
                                  Paths in Planar Maps . . . . . . . . . . 207--233

SIAM Journal on Computing
Volume 25, Number 2, April, 1996

                Naveen Garg and   
          Vijay V. Vazirani and   
             Mihalis Yannakakis   Approximate Max-Flow Min-(Multi)Cut
                                  Theorems and Their Applications  . . . . 235--251
           Ronitt Rubinfeld and   
                    Madhu Sudan   Robust Characterizations of Polynomials
                                  with Applications to Program Testing . . 252--271
               Vineet Bafna and   
               Pavel A. Pevzner   Genome Rearrangements and Sorting by
                                  Reversals  . . . . . . . . . . . . . . . 272--289
           A. Satyanarayana and   
                 R. K. Wood and   
          L. Camarinopoulos and   
                   G. Pampoukis   Note on: ``A linear-time algorithm for
                                  computing $K$-terminal reliability in
                                  series-parallel networks'' [SIAM J.
                                  Comput. 14 (1985), no. 4, 818--832, MR
                                  86m:90069] by Satyanarayana and Wood . . 290--290
          Michael D. Hutton and   
                     Anna Lubiw   Upward planar drawing of single-source
                                  acyclic digraphs . . . . . . . . . . . . 291--311
        Vijaya Ramachandran and   
                   Honghua Yang   An Efficient Parallel Algorithm for the
                                  General Planar Monotone Circuit Value
                                  Problem  . . . . . . . . . . . . . . . . 312--339
              Richard Chang and   
                      Jim Kadin   The Boolean Hierarchy and the Polynomial
                                  Hierarchy: a Closer Connection . . . . . 340--354
              Samir Khuller and   
        Balaji Raghavachari and   
                     Neal Young   Low-Degree Spanning Trees of Small
                                  Weight . . . . . . . . . . . . . . . . . 355--368
               Hagit Attiya and   
              Amir Herzberg and   
                Sergio Rajsbaum   Optimal Clock Synchronization under
                                  Different Delay Assumptions  . . . . . . 369--389
               Xiaotie Deng and   
                 Pavol Hell and   
                     Jing Huang   Linear-Time Representation Algorithms
                                  for Proper Circular-Arc Graphs and
                                  Proper Interval Graphs . . . . . . . . . 390--403
                    C. Rhee and   
                Y. D. Liang and   
                S. K. Dhall and   
              S. Lakshmivarahan   An $O(N+M)$-Time Algorithm for Finding a
                                  Minimum-Weight Dominating Set in a
                                  Permutation Graph  . . . . . . . . . . . 404--419
               Anmol Mathur and   
             Edward M. Reingold   Generalized Kraft's inequality and
                                  discrete $k$-modal search  . . . . . . . 420--447
         Richard E. Stearns and   
             Harry B. Hunt, III   An Algebraic Model for Combinatorial
                                  Problems . . . . . . . . . . . . . . . . 448--476

SIAM Journal on Computing
Volume 25, Number 3, June, 1996

                Sandy Irani and   
             Anna R. Karlin and   
                Steven Phillips   Strongly competitive algorithms for
                                  paging with locality of reference  . . . 477--497
                Sandy Irani and   
                   Yuval Rabani   On the value of coordination in
                                  distributed decision making  . . . . . . 498--519
                Anne Condon and   
             Richard Ladner and   
               Jordan Lampe and   
                   Rakesh Sinha   Complexity of Sub-Bus Mesh Computations  520--539
                Haim Kaplan and   
                     Ron Shamir   Pathwidth, bandwidth, and completion
                                  problems to proper interval graphs with
                                  small cliques  . . . . . . . . . . . . . 540--561
                J. Friedman and   
             J. Hershberger and   
                    J. Snoeyink   Efficiently Planning Compliant Motion in
                                  the Plane  . . . . . . . . . . . . . . . 562--599
              Sanjeev Arora and   
             F. T. Leighton and   
                 Bruce M. Maggs   On-line algorithms for path selection in
                                  a nonblocking network  . . . . . . . . . 600--625
       Lefteris M. Kirousis and   
           Dimitris M. Thilikos   The Linkage of a Graph . . . . . . . . . 626--647
          Sampath K. Kannan and   
                Eugene W. Myers   An algorithm for locating nonoverlapping
                                  regions of maximum alignment score . . . 648--662
                 Trevor Jim and   
                Albert R. Meyer   Full Abstraction and the Context Lemma   663--696

SIAM Journal on Computing
Volume 25, Number 4, August, 1996

       Lane A. Hemaspaandra and   
             Ashish V. Naik and   
          Mitsunori Ogihara and   
                 Alan L. Selman   Computing Solutions Uniquely Collapses
                                  the Polynomial Hierarchy . . . . . . . . 697--708
                   S. Jimbo and   
                     A. Maruoka   A method of constructing selection
                                  networks with $O(\log n)$ depth  . . . . 709--739
         Johan Håstad and   
               Tom Leighton and   
                   Brian Rogoff   Analysis of Backoff Protocols for
                                  Multiple Access Channels . . . . . . . . 740--774
              Sanjiv Kapoor and   
                   Michiel Smid   New Techniques for Exact and Approximate
                                  Dynamic Closest-Point Problems . . . . . 775--796
                Philip N. Klein   Efficient Parallel Algorithms for
                                  Chordal Graphs . . . . . . . . . . . . . 797--827
        Maciej Li\'skiewicz and   
          Rüdiger Reischuk   The Sublogarithmic Alternating Space
                                  World  . . . . . . . . . . . . . . . . . 828--861
        Sanguthevar Rajasekaran   Tree-Adjoining Language Parsing in
                                  $O(n^6)$ Time  . . . . . . . . . . . . . 862--873
                Prakash Ramanan   An Efficient Parallel Algorithm for the
                                  Matrix-Chain-Product Problem . . . . . . 874--893
             Wansoo T. Rhee and   
               Michel Talagrand   Convergence in Distribution for Best-Fit
                                  Decreasing . . . . . . . . . . . . . . . 894--906

SIAM Journal on Computing
Volume 25, Number 5, October, 1996

                  Zvi Galil and   
                    Kunsoo Park   Alphabet-Independent Two-Dimensional
                                  Witness Computation  . . . . . . . . . . 907--935
                 Joseph Gil and   
Friedhelm Meyer auf der Heide and   
                  Avi Wigderson   The Tree Model for Hashing: Lower and
                                  Upper Bounds . . . . . . . . . . . . . . 936--955
       Giuseppe Di Battista and   
               Roberto Tamassia   On-Line Planarity Testing  . . . . . . . 956--997
               Zvi M. Kedem and   
              Gad M. Landau and   
               Krishna V. Palem   Parallel Suffix-Prefix-Matching
                                  Algorithm and Applications . . . . . . . 998--1023
               James Aspnes and   
                    Orli Waarts   Randomized consensus in expected
                                  $O(n\log^2 n)$ operations per processor  1024--1044
             Satoshi Fujita and   
             Masafumi Yamashita   Optimal Group Gossiping in Hypercubes
                                  under a Circuit- Switching Model . . . . 1045--1060
               Marco Pellegrini   On Point Location and Motion Planning
                                  among Simplices  . . . . . . . . . . . . 1061--1081
              Robert Cypher and   
        Smaragda Konstantinidou   Bounds on the Efficiency of
                                  Message-Passing Protocols for Parallel
                                  Computers  . . . . . . . . . . . . . . . 1082--1104
              Wei-Kuan Shih and   
                 Jane W. S. Liu   On-Line Scheduling of Imprecise
                                  Computations to Minimize Error . . . . . 1105--1121

SIAM Journal on Computing
Volume 25, Number 6, December, 1996

                  Martin Kummer   Kolmogorov Complexity and Instance
                                  Complexity of Recursively Enumerable
                                  Sets . . . . . . . . . . . . . . . . . . 1123--1143
            Joseph Cheriyan and   
             Torben Hagerup and   
                  Kurt Mehlhorn   An $o(n^3 )$-Time Maximum-Flow Algorithm 1144--1170
               Miklos Ajtai and   
                 Nimrod Megiddo   A Deterministic
                                  ${\operatorname{Poly}}(\log \log
                                  N)$-Time ${N}$-Processor Algorithm for
                                  Linear Programming in Fixed Dimension    1171--1195
      Martin Dietzfelbinger and   
      Miros\law Kuty\lowski and   
          Rüdiger Reischuk   Feasible Time-Optimal Algorithms for
                                  Boolean Functions on Exclusive-Write
                                  Parallel Random-Access Machines  . . . . 1196--1230
             Jürgen Sellen   Lower Bounds for Geometrical and
                                  Physical Problems  . . . . . . . . . . . 1231--1253
   Nechama Allenberg-Navony and   
                  Alon Itai and   
                   Shlomo Moran   Average and Randomized Complexity of
                                  Distributed Problems . . . . . . . . . . 1254--1267
        Francesco Bergadano and   
             Stefano Varricchio   Learning Behaviors of Automata from
                                  Multiplicity and Equivalence Queries . . 1268--1280
          Mordecai J. Golin and   
                     Neal Young   Prefix Codes: Equiprobable Words,
                                  Unequal Letter Costs . . . . . . . . . . 1281--1292
                David Zuckerman   On Unapproximable Versions of
                                  NP-Complete Problems . . . . . . . . . . 1293--1304
             Hans L. Bodlaender   A Linear-Time Algorithm for Finding
                                  Tree-Decompositions of Small Treewidth   1305--1317
         Alberto Apostolico and   
                 Dany Breslauer   An optimal $O(\log \log n)$-time
                                  parallel algorithm for detecting all
                                  squares in a string  . . . . . . . . . . 1318--1331
         Michael J. Fischer and   
               Shlomo Moran and   
              Steven Rudich and   
                Gadi Taubenfeld   The Wakeup Problem . . . . . . . . . . . 1332--1357
                 Dario Bini and   
                 Luca Gemignani   Erratum: ``Fast parallel computation of
                                  the polynomial remainder sequence via
                                  Bézout and Hankel matrices'' [SIAM J.
                                  Comput. \bf 24 (1995), no. 1, 63--77, MR
                                  95j:65048] . . . . . . . . . . . . . . . 1358--1358


SIAM Journal on Computing
Volume 26, Number 1, February, 1997

             Laurent Alonso and   
         Edward M. Reingold and   
             René Schott   The Average-Case Complexity of
                                  Determining the Majority . . . . . . . . 1--14
              Moshe Dubiner and   
                      Uri Zwick   Amplification by Read-Once Formulas  . . 15--38
              Maurice Nivat and   
               Andreas Podelski   Minimal Ascending and Descending Tree
                                  Automata . . . . . . . . . . . . . . . . 39--58
                  Yenjo Han and   
       Lane A. Hemaspaandra and   
                Thomas Thierauf   Threshold Computation and Cryptographic
                                  Security . . . . . . . . . . . . . . . . 59--78
                 Zhengyu Ge and   
                S. Louis Hakimi   Disjoint Rooted Spanning Trees with
                                  Small Depths in deBruijn and Kautz
                                  Graphs . . . . . . . . . . . . . . . . . 79--92
                Endre Boros and   
            Peter L. Hammer and   
          Toshihide Ibaraki and   
              Kazuhiko Kawakami   Polynomial-Time Recognition of
                                  $2$-Monotonic Positive Boolean Functions
                                  Given by an Oracle . . . . . . . . . . . 93--109
                 Avrim Blum and   
         Prabhakar Raghavan and   
                Baruch Schieber   Navigating in Unfamiliar Geometric
                                  Terrain  . . . . . . . . . . . . . . . . 110--137
             Martin Beaudry and   
            Pierre McKenzie and   
            Pierre Peladeau and   
                  Denis Therien   Finite Monoids: From Word to Circuit
                                  Evaluation . . . . . . . . . . . . . . . 138--152
                      Louis Mak   Parallelism Always Helps . . . . . . . . 153--172
                   Zhen Liu and   
                Eric Sanlaville   Stochastic Scheduling with Variable
                                  Profile and Precedence Constraints . . . 173--187
              Richard Chang and   
         William I. Gasarch and   
                   Carsten Lund   On Bounded Queries and Approximation . . 188--209
              Martin Farach and   
                  Mikkel Thorup   Sparse Dynamic Programming for
                                  Evolutionary-Tree Comparison . . . . . . 210--230
                  Ming-Yang Kao   Total Protection of Analytic-Invariant
                                  Information in Cross-Tabulated Tables    231--242
              Felipe Cucker and   
                 Dima Grigoriev   On the Power of Real Turing Machines
                                  Over Binary Inputs . . . . . . . . . . . 243--254
            David R. Karger and   
                 Rajeev Motwani   An ${\rm NC}$ Algorithm for Minimum Cuts 255--272
               Shlomi Dolev and   
               Amos Israeli and   
                   Shlomo Moran   Resource Bounds for Self-Stabilizing
                                  Message-Driven Protocols . . . . . . . . 273--290

SIAM Journal on Computing
Volume 26, Number 2, April, 1997

      Torben Pryds Pedersen and   
               Birgit Pfitzmann   Fail-Stop Signatures . . . . . . . . . . 291--330
      Heike Ripphausen-Lipa and   
            Dorothea Wagner and   
                  Karsten Weihe   The vertex-disjoint Menger problem in
                                  planar graphs  . . . . . . . . . . . . . 331--349
       Alessandro Panconesi and   
             Aravind Srinivasan   Randomized Distributed Edge Coloring via
                                  an Extension of the Chernoff--Hoeffding
                                  Bounds . . . . . . . . . . . . . . . . . 350--368
                Anne Condon and   
            Joan Feigenbaum and   
               Carsten Lund and   
                     Peter Shor   Random Debaters and the Hardness of
                                  Approximating Stochastic Functions . . . 369--400
                   A. Steinberg   A Strip-Packing Algorithm with Absolute
                                  Performance Bound $2$  . . . . . . . . . 401--409
             Shang-Hua Teng and   
                 Frances F. Yao   Approximating Shortest Superstrings  . . 410--417
                Danny Dolev and   
                     Nir Shavit   Bounded Concurrent Time-Stamping . . . . 418--455
    Paul Walton Purdom, Jr. and   
                  G. Neil Haven   Probe Order Backtracking . . . . . . . . 456--483
           Greg N. Frederickson   Ambivalent Data Structures for Dynamic
                                  $2$-Edge-Connectivity and $k$ Smallest
                                  Spanning Trees . . . . . . . . . . . . . 484--538
                Rajeev Alur and   
               Hagit Attiya and   
                Gadi Taubenfeld   Time-Adaptive Algorithms for
                                  Synchronization  . . . . . . . . . . . . 539--556
              Eric Allender and   
José Balcázar and   
                  Neil Immerman   A First-Order Isomorphism Theorem  . . . 557--567
                Rakesh M. Verma   General Techniques for Analyzing
                                  Recursive Algorithms with Applications   568--581
        András Sebö   Potentials in Undirected Graphs and
                                  Planar Multiflows  . . . . . . . . . . . 582--603

SIAM Journal on Computing
Volume 26, Number 3, June, 1997

        Pavel Pudlák and   
        Vojt\vech Rödl and   
            Ji\vrí Sgall   Boolean Circuits, Tensor Ranks, and
                                  Communication Complexity . . . . . . . . 605--633
       Lane A. Hemaspaandra and   
                Jörg Rothe   Unambiguous Computation: Boolean
                                  Hierarchies and Sparse Turing-Complete
                                  Sets . . . . . . . . . . . . . . . . . . 634--653
               Shai Mohaban and   
                   Micha Sharir   Ray Shooting Amidst Spheres in Three
                                  Dimensions and Related Problems  . . . . 654--674
              Carsten Thomassen   On the Complexity of Finding a Minimum
                                  Cycle Cover of a Graph . . . . . . . . . 675--677
           Akiyoshi Shioura and   
             Akihisa Tamura and   
                    Takeaki Uno   An Optimal Algorithm for Scanning All
                                  Spanning Trees of Undirected Graphs  . . 678--692
        Russell Impagliazzo and   
           Ramamohan Paturi and   
                Michael E. Saks   Size--Depth Tradeoffs for Threshold
                                  Circuits . . . . . . . . . . . . . . . . 693--707
                 Wolfgang Maass   Bounds for the Computational Power and
                                  Learning Complexity of Analog Neural
                                  Nets . . . . . . . . . . . . . . . . . . 708--732
                 Liming Cai and   
                    Jianer Chen   On the Amount of Nondeterminism and the
                                  Power of Verifying . . . . . . . . . . . 733--750
              Hans Ulrich Simon   Bounds on the Number of Examples Needed
                                  for Learning Functions . . . . . . . . . 751--763
             Stefano Varricchio   A Pumping Condition for Regular Sets . . 764--771
                   Gurdip Singh   Leader Election in Complete Networks . . 772--785
               Xiaotie Deng and   
                Sanjeev Mahajan   The Cost of Derandomization:
                                  Computability or Competitiveness . . . . 786--802
               Richard Cole and   
               Ramesh Hariharan   Tighter Upper Bounds on the Exact
                                  Complexity of String Matching  . . . . . 803--856
                Al Borchers and   
                    Ding-Zhu Du   The $k$-Steiner Ratio in Graphs  . . . . 857--869
          R. Chandrasekaran and   
                    Bo Chen and   
      Gábor Galambos and   
            P. R. Narayanan and   
     André Van Vliet and   
           Gerhard J. Woeginger   A note on: ``An on-line scheduling
                                  heuristic with better worst case ratio
                                  than Graham's list scheduling'' [SIAM J.
                                  Comput. \bf 22 (1993), no. 2, 349--355;
                                  MR 94b:90031] by Galambos and Woeginger  870--872

SIAM Journal on Computing
Volume 26, Number 4, August, 1997

             Pesech Feldman and   
                  Silvio Micali   An Optimal Probabilistic Protocol for
                                  Synchronous Byzantine Agreement  . . . . 873--933
            James A. Storer and   
                   John H. Reif   Error-Resilient Optimal Data Compression 934--949
          Maxime Crochemore and   
                  Zvi Galil and   
         Leszek G\casieniec and   
                Kunsoo Park and   
                Wojciech Rytter   Constant-Time Randomized Parallel String
                                  Matching . . . . . . . . . . . . . . . . 950--960
              Ganesh Baliga and   
                Sanjay Jain and   
                    Arun Sharma   Learning from Multiple Sources of
                                  Inaccurate Data  . . . . . . . . . . . . 961--990
             Michal Walicki and   
                  Sigurd Meldal   Singular and Plural Nondeterministic
                                  Parameters . . . . . . . . . . . . . . . 991--1005
                G. Louchard and   
              Claire Kenyon and   
                      R. Schott   Data Structures' Maxima  . . . . . . . . 1006--1042
             Stephen Fenner and   
               Steven Homer and   
          Mitsunori Ogihara and   
                    Alan Selman   Oracles That Compute Values  . . . . . . 1043--1065
             J. R. Driscoll and   
           D. M. Healy, Jr. and   
                 D. N. Rockmore   Fast Discrete Polynomial Transforms with
                                  Applications to Data Analysis for
                                  Distance Transitive Graphs . . . . . . . 1066--1099
        Leslie Ann Goldberg and   
                Mark Jerrum and   
               Tom Leighton and   
                     Satish Rao   Doubly Logarithmic Communication
                                  Algorithms for Optical-Communication
                                  Parallel Computers . . . . . . . . . . . 1100--1119
         Leonidas J. Guibas and   
             Rajeev Motwani and   
             Prabhakar Raghavan   The Robot Localization Problem . . . . . 1120--1138
                 Dalit Naor and   
               Dan Gusfield and   
                 Charles Martel   A Fast Algorithm for Optimally
                                  Increasing the Edge Connectivity . . . . 1139--1165
                  Dorit Dor and   
                  Michael Tarsi   Graph Decomposition is NP-Complete: a
                                  Complete Proof of Holyer's Conjecture    1166--1187
                  Bonnie Berger   The Fourth Moment Method . . . . . . . . 1188--1207
         Phillip B. Gibbons and   
                 Ephraim Korach   Testing Shared Memories  . . . . . . . . 1208--1244
      Alexander V. Karzanov and   
            S. Thomas McCormick   Polynomial Methods for Separable Convex
                                  Optimization in Unimodular Linear Spaces
                                  with Applications  . . . . . . . . . . . 1245--1275

SIAM Journal on Computing
Volume 26, Number 5, October, 1997

        Richard J. Anderson and   
                   Heather Woll   Algorithms for the Certified Write-All
                                  Problem  . . . . . . . . . . . . . . . . 1277--1283
                    Sam Myo Kim   Computational Modeling for Genetic
                                  Splicing Systems . . . . . . . . . . . . 1284--1309
 László Babai and   
             Eugene M. Luks and   
             Ákos Seress   Fast management of permutation groups. I 1310--1342
                Brenda S. Baker   Parameterized Duplication in Strings:
                                  Algorithms and an Application to
                                  Software Maintenance . . . . . . . . . . 1343--1362
            Kazuhisa Makino and   
              Toshihide Ibaraki   The Maximum Latency and Identification
                                  of Positive Boolean Functions  . . . . . 1363--1383
            Matthew J. Katz and   
                   Micha Sharir   An Expander-Based Approach to Geometric
                                  Optimization . . . . . . . . . . . . . . 1384--1408
                 Umesh Vazirani   Introduction to Special Section on
                                  Quantum Computation  . . . . . . . . . . 1409--1410
            Ethan Bernstein and   
                 Umesh Vazirani   Quantum Complexity Theory  . . . . . . . 1411--1473
                Daniel R. Simon   On the Power of Quantum Computation  . . 1474--1483
                  Peter W. Shor   Polynomial-Time Algorithms for Prime
                                  Factorization and Discrete Logarithms on
                                  a Quantum Computer . . . . . . . . . . . 1484--1509
         Charles H. Bennett and   
            Ethan Bernstein and   
            Gilles Brassard and   
                 Umesh Vazirani   Strengths and Weaknesses of Quantum
                                  Computing  . . . . . . . . . . . . . . . 1510--1523
         Leonard M. Adleman and   
         Jonathan Demarrais and   
              Ming-Deh A. Huang   Quantum Computability  . . . . . . . . . 1524--1540
            Adriano Barenco and   
           Andre Berthiaume and   
              David Deutsch and   
                Artur Ekert and   
              Richard Jozsa and   
            Chiara Macchiavello   Stabilization of Quantum Computations by
                                  Symmetrization . . . . . . . . . . . . . 1541--1557

SIAM Journal on Computing
Volume 26, Number 6, December, 1997

            Philip D. MacKenzie   The Random Adversary: a Lower-Bound
                                  Technique for Randomized Parallel
                                  Algorithms . . . . . . . . . . . . . . . 1559--1580
            Richard J. Cole and   
             Bruce M. Maggs and   
            Ramesh K. Sitaraman   Reconfiguring Arrays with Faults. Part
                                  I: Worst-Case Faults . . . . . . . . . . 1581--1611
           John Hershberger and   
                   Subhash Suri   Matrix Searching with the Shortest-Path
                                  Metric . . . . . . . . . . . . . . . . . 1612--1634
                Joseph Cheriyan   Randomized $\tilde{O}(M(|V|))$
                                  Algorithms for Problems in Matching
                                  Theory . . . . . . . . . . . . . . . . . 1635--1655
               Amihood Amir and   
                Dmitry Keselman   Maximum Agreement Subtree in a Set of
                                  Evolutionary Trees: Metrics and
                                  Efficient Algorithms . . . . . . . . . . 1656--1669
               Boris Aronov and   
               Micha Sharir and   
                  Boaz Tagansky   The Union of Convex Polyhedra in Three
                                  Dimensions . . . . . . . . . . . . . . . 1670--1688
          Pankaj K. Agarwal and   
               Boris Aronov and   
            Joseph O'Rourke and   
           Catherine A. Schevon   Star Unfolding of a Polytope with
                                  Applications . . . . . . . . . . . . . . 1689--1713
          Pankaj K. Agarwal and   
               Boris Aronov and   
                   Micha Sharir   Computing Envelopes in Four Dimensions
                                  with Applications  . . . . . . . . . . . 1714--1732
                  Noga Alon and   
                   Nabil Kahale   A Spectral Technique for Coloring Random
                                  $3$-Colorable Graphs . . . . . . . . . . 1733--1748
             Sampath Kannan and   
                   Tandy Warnow   A Fast Algorithm for the Computation and
                                  Enumeration of Perfect Phylogenies . . . 1749--1763
             Jehoshua Bruck and   
              Robert Cypher and   
                  Ching-Tien Ho   Fault-Tolerant Meshes with Small Degree  1764--1784
               Boris Aronov and   
                   Micha Sharir   On Translational Motion Planning of a
                                  Convex Polyhedron in $3$-Space . . . . . 1785--1803


SIAM Journal on Computing
Volume 27, Number 1, February, 1998

               Tom Leighton and   
                C. Greg Plaxton   Hypercubic Sorting Networks  . . . . . . 1--47
             Johan Håstad   The Shrinkage Exponent of de Morgan
                                  Formulas is $2$  . . . . . . . . . . . . 48--64
               Hagit Attiya and   
             Soma Chaudhuri and   
               Roy Friedman and   
              Jennifer L. Welch   Shared Memory Consistency Conditions for
                                  Nonsequential Execution: Definitions and
                                  Programming Strategies . . . . . . . . . 65--89
               Amihood Amir and   
                    Gary Benson   Two-Dimensional Periodicity in
                                  Rectangular Arrays . . . . . . . . . . . 90--106
                Martin L. Brady   A Fast Discrete Approximation Algorithm
                                  for the Radon Transform  . . . . . . . . 107--119
               Thomas W. Cusick   Value Sets of Some Polynomials Over
                                  Finite Fields ${\rm GF}(22m)$  . . . . . 120--131
           Paola Bertolazzi and   
       Giuseppe Di Battista and   
              Carlo Mannino and   
               Roberto Tamassia   Optimal Upward Planarity Testing of
                                  Single-Source Digraphs . . . . . . . . . 132--169
             Samuel R. Buss and   
              Peter N. Yianilos   Linear and $O(n\log n)$ Time
                                  Minimum-Cost Matching Algorithms for
                                  Quasi-Convex Tours . . . . . . . . . . . 170--201
          Robert D. Blumofe and   
           Charles E. Leiserson   Space-Efficient Scheduling of
                                  Multithreaded Computations . . . . . . . 202--229
            Mikael Goldmann and   
                Marek Karpinski   Simulating Threshold Circuits by
                                  Majority Circuits  . . . . . . . . . . . 230--246
              Juan A. Garay and   
                    Yoram Moses   Fully Polynomial Byzantine Agreement for
                                  $n > 3t$ Processors in $t + 1$ Rounds . . 247--290
             Yonatan Aumann and   
                   Yuval Rabani   An $O(\log k)$ Approximate Min-Cut
                                  Max-Flow Theorem and Approximation
                                  Algorithm  . . . . . . . . . . . . . . . 291--301
              Juan A. Garay and   
                Shay Kutten and   
                    David Peleg   A SubLinear Time Distributed Algorithm
                                  for Minimum-Weight Spanning Trees  . . . 302--316
           D. Stott Parker, Jr.   Erratum: Conditions for Optimality of
                                  the Huffman Algorithm  . . . . . . . . . 317--317

SIAM Journal on Computing
Volume 27, Number 2, April, 1998

               Hagit Attiya and   
                  Ophir Rachman   Atomic Snapshots in $O(n \log n)$
                                  Operations . . . . . . . . . . . . . . . 319--340
                 Liming Cai and   
                Jianer Chen and   
             Johan Håstad   Circuit Bottom Fan-in and Computational
                                  Power  . . . . . . . . . . . . . . . . . 341--355
                Martin Dyer and   
            Peter Gritzmann and   
             Alexander Hufnagel   On The Complexity of Computing Mixed
                                  Volumes  . . . . . . . . . . . . . . . . 356--400
           Nader H. Bshouty and   
                  Richard Cleve   Interpolating Arithmetic Read-Once
                                  Formulas in Parallel . . . . . . . . . . 401--413
                Rongheng Li and   
                      Lijie Shi   An On-Line Algorithm for Some Uniform
                                  Processor Scheduling . . . . . . . . . . 414--422
                  Moni Naor and   
                   Avishai Wool   The Load, Capacity, and Availability of
                                  Quorum Systems . . . . . . . . . . . . . 423--447
                Ioan I. Macarie   Space-Efficient Deterministic Simulation
                                  of Probabilistic Automata  . . . . . . . 448--465
        Phillip G. Bradford and   
      Gregory J. E. Rawlins and   
             Gregory E. Shannon   Efficient Matrix Chain Ordering in
                                  Polylog Time . . . . . . . . . . . . . . 466--490
          Pankaj K. Agarwal and   
     Ji\vrí Matousek and   
            Otfried Schwarzkopf   Computing Many Faces in Arrangements of
                                  Lines and Segments . . . . . . . . . . . 491--505
             Oded Goldreich and   
           Shafi Goldwasser and   
                  Nathan Linial   Fault-tolerant Computation in the Full
                                  Information Model  . . . . . . . . . . . 506--544
               Bernard Chazelle   A Spectral Approach to Lower Bounds with
                                  Applications to Geometric Searching  . . 545--556
              Gad M. Landau and   
            Eugene W. Myers and   
            Jeanette P. Schmidt   Incremental String Comparison  . . . . . 557--582
              Gregory Dudek and   
           Kathleen Romanik and   
                 Sue Whitesides   Localizing a Robot with Minimum Travel   583--604

SIAM Journal on Computing
Volume 27, Number 3, June, 1998

                   T. Kloks and   
                     D. Kratsch   Listing all Minimal Separators of a
                                  Graph  . . . . . . . . . . . . . . . . . 605--613
                   Hisao Tamaki   Efficient Self-Embedding of Butterfly
                                  Networks with Random Faults  . . . . . . 614--636
              Harry Buhrman and   
             Albrecht Hoene and   
                Leen Torenvliet   Splittings, Robustness, and Structure of
                                  Complete Sets  . . . . . . . . . . . . . 637--653
          Pankaj K. Agarwal and   
               Mark de Berg and   
     Ji\vrí Matousek and   
            Otfried Schwarzkopf   Constructing Levels in Arrangements and
                                  Higher Order Voronoi Diagrams  . . . . . 654--667
          Maxime Crochemore and   
           Leszek Gasieniec and   
           Ramesh Hariharan and   
           S. Muthukrishnan and   
                Wojciech Rytter   A Constant Time Optimal Parallel
                                  Algorithm for Two-Dimensional Pattern
                                  Matching . . . . . . . . . . . . . . . . 668--681
                 Susanne Albers   Improved Randomized On-Line Algorithms
                                  for the List Update Problem  . . . . . . 682--693
             Dima Grigoriev and   
                Marek Karpinski   Computing the Additive Complexity of
                                  Algebraic Circuits with Root Extracting  694--701
           Eyal Kushilevitz and   
                 Yishay Mansour   An $\Omega(D\log (N/D))$ Lower Bound for
                                  Broadcast in Radio Networks  . . . . . . 702--712
            Paolo Ferragina and   
                 Roberto Grossi   Optimal On-Line Search and Sublinear
                                  Time Update in String Matching . . . . . 713--736
               Shafi Goldwasser   Introduction to Special Section on
                                  Probabilistic Proof Systems  . . . . . . 737--738
                Anne Condon and   
           Lisa Hellerstein and   
              Samuel Pottle and   
                  Avi Wigderson   On the Power of Finite Automata with
                                  both Nondeterministic and Probabilistic
                                  States . . . . . . . . . . . . . . . . . 739--762
                        Ran Raz   A Parallel Repetition Theorem  . . . . . 763--803
              Mihir Bellare and   
             Oded Goldreich and   
                    Madhu Sudan   Free Bits, PCPs, and Nonapproximability
                                  --- Towards Tight Results  . . . . . . . 804--915

SIAM Journal on Computing
Volume 27, Number 4, August, 1998

        Jean-Claude Bermond and   
              Luisa Gargano and   
          Adele A. Rescigno and   
                    Ugo Vaccaro   Fast Gossiping by Short Messages . . . . 917--941
          Reuven Bar-Yehuda and   
                 Dan Geiger and   
        Joseph (Seffi) Naor and   
                    Ron M. Roth   Approximation Algorithms for the
                                  Feedback Vertex Set Problem with
                                  Applications to Constraint Satisfaction
                                  and Bayesian Inference . . . . . . . . . 942--959
           D. F. Shallcross and   
                  V. Y. Pan and   
                    Y. Lin-Kriz   Planar Integer Linear Programming is NC
                                  Equivalent to Euclidean GCD  . . . . . . 960--971
            Jeanette P. Schmidt   All Highest Scoring Paths in Weighted
                                  Grid Graphs and Their Application to
                                  Finding All Approximate Repeats in
                                  Strings  . . . . . . . . . . . . . . . . 972--992
                Ran Canetti and   
                    Sandy Irani   Bounding the Power of Preemption in
                                  Randomized Scheduling  . . . . . . . . . 993--1015
          Pankaj K. Agarwal and   
                   Subhash Suri   Surface Approximation and Geometric
                                  Partitions . . . . . . . . . . . . . . . 1016--1035
             Mordecai Golin and   
               Rajeev Raman and   
          Christian Schwarz and   
                   Michiel Smid   Randomized Data Structures for the
                                  Dynamic Closest-Pair Problem . . . . . . 1036--1072
                     Hing Leung   Separating Exponentially Ambiguous
                                  Finite Automata from Polynomially
                                  Ambiguous Finite Automata  . . . . . . . 1073--1082
        Leslie Ann Goldberg and   
                Mark Jerrum and   
            Philip D. MacKenzie   An ${\Omega}(\sqrt{ \log \log n})$ Lower
                                  Bound for Routing in Optical Networks    1083--1098
                 Dario Bini and   
                  Victor Y. Pan   Computing Matrix Eigenvalues and
                                  Polynomial Zeros Where the Output is
                                  Real . . . . . . . . . . . . . . . . . . 1099--1115
             Oded Goldreich and   
           Rafail Ostrovsky and   
                   Erez Petrank   Computational Complexity and Knowledge
                                  Complexity . . . . . . . . . . . . . . . 1116--1141
         Harry B. Hunt, III and   
          Madhav V. Marathe and   
    Venkatesh Radhakrishnan and   
             Richard E. Stearns   The Complexity of Planar Counting
                                  Problems . . . . . . . . . . . . . . . . 1142--1167
              Amotz Bar-Noy and   
                Alain Mayer and   
            Baruch Schieber and   
                    Madhu Sudan   Guaranteeing Fair Service to Persistent
                                  Dependent Tasks  . . . . . . . . . . . . 1168--1189
                Greg Barnes and   
                Jeff A. Edmonds   Time-Space Lower Bounds for Directed
                                  $st$-Connectivity on Graph Automata
                                  Models . . . . . . . . . . . . . . . . . 1190--1202
                  David Gillman   A Chernoff Bound for Random Walks on
                                  Expander Graphs  . . . . . . . . . . . . 1203--1220

SIAM Journal on Computing
Volume 27, Number 5, October, 1998

         E. G. Coffman, Jr. and   
               Nabil Kahale and   
                 F. T. Leighton   Processor-Ring Communication: a Tight
                                  Asymptotic Bound on Packet Waiting Times 1221--1236
          Madhav V. Marathe and   
          Harry B. Hunt III and   
         Richard E. Stearns and   
        Venkatesh Radhakrishnan   Approximation Algorithms for PSPACE-Hard
                                  Hierarchically and Periodically
                                  Specified Problems . . . . . . . . . . . 1237--1261
                Martin Dyer and   
                Alan Frieze and   
                    Mark Jerrum   Approximately Counting Hamilton Paths
                                  and Cycles in Dense Graphs . . . . . . . 1262--1272
                Greg Barnes and   
           Jonathan F. Buss and   
            Walter L. Ruzzo and   
                Baruch Schieber   A Sublinear Space, Polynomial Time
                                  Algorithm for Directed $s$-$t$
                                  Connectivity . . . . . . . . . . . . . . 1273--1282
            Mikael Goldmann and   
             Johan Håstad   Monotone Circuits for Connectivity Have
                                  Depth $(\log n)2-o(1)$ . . . . . . . . . 1283--1294
                 C. Heckler and   
                      L. Thiele   Complexity Analysis of a Parallel
                                  Lattice Basis Reduction Algorithm  . . . 1295--1302
        F. Thomson Leighton and   
             Bruce M. Maggs and   
            Ramesh K. Sitaraman   On the Fault Tolerance of Some Popular
                                  Bounded-Degree Networks  . . . . . . . . 1303--1333
               Robert Beals and   
            Tetsuro Nishino and   
                 Keisuke Tanaka   On the Complexity of Negation-Limited
                                  Boolean Networks . . . . . . . . . . . . 1334--1347
                 Joseph Gil and   
                   Yossi Matias   Simple Fast Parallel Hashing by
                                  Oblivious Execution  . . . . . . . . . . 1348--1375
Mariangiola Dezani-Ciancaglini and   
             Ugo de'Liguoro and   
                 Adolfo Piperno   A Filter Model for Concurrent
                                  $\lambda$-Calculus . . . . . . . . . . . 1376--1419
                  R. Beigel and   
                   J. Goldsmith   Downward Separation Fails
                                  Catastrophically for Limited
                                  Nondeterminism Classes . . . . . . . . . 1420--1429
              Mitsunori Ogihara   The PL Hierarchy Collapses . . . . . . . 1430--1437
               Guy Kortsarz and   
                    David Peleg   Generating Low-Degree $2$-Spanners . . . 1438--1456
              Cynthia Dwork and   
          Joseph Y. Halpern and   
                    Orli Waarts   Performing Work Efficiently in the
                                  Presence of Faults . . . . . . . . . . . 1457--1491
                Jeff A. Edmonds   Time-Space Tradeoffs For Undirected
                                  $st$-Connectivity on a Graph Automata    1492--1513

SIAM Journal on Computing
Volume 27, Number 6, December, 1998

          Howard Aizenstein and   
                 Avrim Blum and   
               Roni Khardon and   
           Eyal Kushilevitz and   
               Leonard Pitt and   
                       Dan Roth   On Learning Read-$k$-Satisfy-$j$ DNF . . 1515--1530
           Eyal Kushilevitz and   
           Rafail Ostrovsky and   
               Adi Rosén   Log-Space Polynomial End-to-End
                                  Communication  . . . . . . . . . . . . . 1531--1549
           Eyal Kushilevitz and   
             Yishay Mansour and   
           Michael O. Rabin and   
                David Zuckerman   Lower Bounds for Randomized Mutual
                                  Exclusion  . . . . . . . . . . . . . . . 1550--1563
                Tony W. Lai and   
                    Derick Wood   Adaptive Heuristics for Binary Search
                                  Trees and Constant Linkage Cost  . . . . 1564--1591
                  Ming-Yang Kao   Tree Contractions and Evolutionary Trees 1592--1616
                P. Krishnan and   
           Jeffrey Scott Vitter   Optimal Prediction for Prefetching in
                                  the Worst Case . . . . . . . . . . . . . 1617--1636
               Hagit Attiya and   
                   Roy Friedman   A Correctness Condition for
                                  High-Performance Multiprocessors . . . . 1637--1670
                Maw-Shang Chang   Efficient Algorithms for the Domination
                                  Problems on Interval and Circular-Arc
                                  Graphs . . . . . . . . . . . . . . . . . 1671--1694
             Sampath Kannan and   
               Tandy Warnow and   
                  Shibu Yooseph   Computing the Local Consensus of Trees   1695--1724
         Hans L. Bodlaender and   
                 Torben Hagerup   Parallel Algorithms with Optimal Speedup
                                  for Bounded Treewidth  . . . . . . . . . 1725--1746
              Jan Paredaens and   
        Jan Van den Bussche and   
                 Dirk Van Gucht   First-Order Queries on Finite Structures
                                  Over the Reals . . . . . . . . . . . . . 1747--1763
       Giuseppe Di Battista and   
            Giuseppe Liotta and   
               Francesco Vargiu   Spirality and Optimal Orthogonal
                                  Drawings . . . . . . . . . . . . . . . . 1764--1811


SIAM Journal on Computing
Volume 28, Number 1, February, 1998

      Haripriyan Hampapuram and   
             Michael L. Fredman   Optimal BiWeighted Binary Trees and the
                                  Complexity of Maintaining Partial Sums   1--9
Johannes A. La Poutré and   
              Jeffery Westbrook   Dynamic $2$-Connectivity with
                                  Backtracking . . . . . . . . . . . . . . 10--26
        Gregorio Malajovich and   
                     Klaus Meer   On the Structure of ${\cal
                                  NP}_{\mathbb{C}}$  . . . . . . . . . . . 27--35
                  Marius Zimand   Weighted NP Optimization Problems:
                                  Logical Definability and Approximation
                                  Properties . . . . . . . . . . . . . . . 36--56
         Tomás Feder and   
                 Moshe Y. Vardi   The Computational Structure of Monotone
                                  Monadic SNP and Constraint Satisfaction:
                                  a Study through Datalog and Group Theory 57--104
           Thomas H. Cormen and   
           Thomas Sundquist and   
          Leonard F. Wisniewski   Asymptotically Tight Bounds for
                                  Performing BMMC Permutations on Parallel
                                  Disk Systems . . . . . . . . . . . . . . 105--136
              Lance Fortnow and   
             Judy Goldsmith and   
            Matthew A. Levy and   
                Stephen Mahaney   $L$-Printable Sets . . . . . . . . . . . 137--151
         Dimitris Kavvadias and   
                  Martha Sideri   The Inverse Satisfiability Problem . . . 152--163
             Sanjeev Khanna and   
             Rajeev Motwani and   
                Madhu Sudan and   
                 Umesh Vazirani   On Syntactic versus Computational Views
                                  of Approximability . . . . . . . . . . . 164--191
             Stefan Felsner and   
                Lorenz Wernisch   Maximum $k$-Chains in Planar Point Sets:
                                  Combinatorial Structure and Algorithms   192--209
                    Edith Cohen   Fast algorithms for constructing
                                  $t$-spanners and paths with stretch $t$  210--236
         Uwe Schwiegelshohn and   
              Walter Ludwig and   
               Joel L. Wolf and   
                 John Turek and   
                   Philip S. Yu   Smart SMART Bounds for Weighted Response
                                  Time Scheduling  . . . . . . . . . . . . 237--253
            Baruch Awerbuch and   
                 Yossi Azar and   
                 Avrim Blum and   
                Santosh Vempala   New Approximation Guarantees for
                                  Minimum-Weight $k$-Trees and
                                  Prize-Collecting Salesmen  . . . . . . . 254--262
            Baruch Awerbuch and   
              Bonnie Berger and   
               Lenore Cowen and   
                    David Peleg   Near-Linear Time Construction of Sparse
                                  Neighborhood Covers  . . . . . . . . . . 263--277
                 David Avis and   
      Bryan Beresford-Smith and   
                Luc Devroye and   
             Hossam Elgindy and   
     Eric Guévremont and   
             Ferran Hurtado and   
                     Binhai Zhu   Unoriented $Theta$-Maxima in the Plane:
                                  Complexity and Algorithms  . . . . . . . 278--296
         Jonathan E. Atkins and   
              Erik G. Boman and   
              Bruce Hendrickson   A Spectral Algorithm for Seriation and
                                  the Consecutive Ones Problem . . . . . . 297--310
       Johannes Köbler and   
                 Osamu Watanabe   New Collapse Consequences of NP Having
                                  Small Circuits . . . . . . . . . . . . . 311--324
             Viliam Geffert and   
           Carlo Mereghetti and   
            Giovanni Pighizzini   Sublogarithmic Bounds on Space and
                                  Reversals  . . . . . . . . . . . . . . . 325--340
             David Eppstein and   
                  Zvi Galil and   
       Giuseppe F. Italiano and   
              Thomas H. Spencer   Separator-Based Sparsification II: Edge
                                  and Vertex Connectivity  . . . . . . . . 341--381

SIAM Journal on Computing
Volume 28, Number 2, April, 1998

         Edith Hemaspaandra and   
       Lane A. Hemaspaandra and   
                  Harald Hempel   A Downward Collapse within the
                                  Polynomial Hierarchy . . . . . . . . . . 383--393
                    Yongge Wang   Genericity, Randomness, and
                                  Polynomial-Time Approximations . . . . . 394--408
                    Luc Devroye   Universal Limit Laws for Depths in
                                  Random Trees . . . . . . . . . . . . . . 409--432
              William Evans and   
             Nicholas Pippenger   Average-Case Lower Bounds for Noisy
                                  Boolean Decision Trees . . . . . . . . . 433--446
                  Amos Fiat and   
             Dean P. Foster and   
             Howard Karloff and   
               Yuval Rabani and   
              Yiftach Ravid and   
            Sundar Vishwanathan   Competitive Algorithms for Layered Graph
                                  Traversal  . . . . . . . . . . . . . . . 447--462
                   D. Z. Du and   
                     B. Gao and   
                F. K. Hwang and   
                      J. H. Kim   On Multirate Rearrangeable Clos Networks 463--470
               Francis Chin and   
                    Cao An Wang   Finding the Constrained Delaunay
                                  Triangulation and Constrained Voronoi
                                  Diagram of a Simple Polygon in Linear
                                  Time . . . . . . . . . . . . . . . . . . 471--486
                   Sigal Ar and   
          Richard J. Lipton and   
           Ronitt Rubinfeld and   
                    Madhu Sudan   Reconstructing Algebraic Functions from
                                  Mixed Data . . . . . . . . . . . . . . . 487--510
            Baruch Awerbuch and   
               Israel Cidon and   
                Shay Kutten and   
             Yishay Mansour and   
                    David Peleg   Optimal Broadcast with Partial Knowledge 511--524
        Sridhar Rajagopalan and   
              Vijay V. Vazirani   Primal-Dual RNC Approximation Algorithms
                                  for Set Cover and Covering Integer
                                  Programs . . . . . . . . . . . . . . . . 525--540
           Andrei Z. Broder and   
             Alan M. Frieze and   
               Stephen Suen and   
                      Eli Upfal   Optimal Construction of Edge-Disjoint
                                  Paths in Random Graphs . . . . . . . . . 541--573
              Zoran Ivkovic and   
                 Errol L. Lloyd   Fully Dynamic Algorithms for Bin
                                  Packing: Being (Mostly) Myopic Helps . . 574--611
        Michael T. Goodrich and   
               Roberto Tamassia   Dynamic Trees and Dynamic Point Location 612--636
       Lane A. Hemaspaandra and   
              Harald Hempel and   
                  Gerd Wechsung   Query Order  . . . . . . . . . . . . . . 637--651
                 David Eppstein   Finding the $k$ Shortest Paths . . . . . 652--673
           Nader H. Bshouty and   
           Paul W. Goldberg and   
           Sally A. Goldman and   
               H. David Mathias   Exact Learning of Discretized Geometric
                                  Concepts . . . . . . . . . . . . . . . . 674--699
                   Yacov Yacobi   Fast Exponentiation Using Data
                                  Compression  . . . . . . . . . . . . . . 700--703
                    P. G. Walsh   A Polynomial Time Complexity Bound for
                                  Computations on Curves . . . . . . . . . 704--708
         Prabhakar Raghavan and   
                      Eli Upfal   Stochastic Contention Resolution With
                                  Short Delays . . . . . . . . . . . . . . 709--719
                Lisa Higham and   
               Teresa Przytycka   Asymptotically Optimal Election on
                                  Weighted Rings . . . . . . . . . . . . . 720--732
         Phillip B. Gibbons and   
               Yossi Matias and   
            Vijaya Ramachandran   The Queue-Read Queue-Write PRAM Model:
                                  Accounting for Contention in Parallel
                                  Algorithms . . . . . . . . . . . . . . . 733--769

SIAM Journal on Computing
Volume 28, Number 3, June, 1998

      Joseph S. B. Mitchell and   
                 Avrim Blum and   
           Prasad Chalasani and   
                Santosh Vempala   A Constant-Factor Approximation
                                  Algorithm for the Geometric $k$-MST
                                  Problem in the Plane . . . . . . . . . . 771--781
                 Prasad Jayanti   Solvability of Consensus: Composition
                                  Breaks Down for NonDeterministic Types   782--797
                 Stephen Ponzio   A Lower Bound for Integer Multiplication
                                  with Read-Once Branching Programs  . . . 798--815
                  Hugh Hind and   
             Michael Molloy and   
                     Bruce Reed   Total Coloring With ${\Delta} + {\rm
                                  poly}(\log \Delta)$ Colors . . . . . . . 816--821
     Joachim von zur Gathen and   
               Igor Shparlinski   Computing components and projections of
                                  curves over finite fields  . . . . . . . 822--840
            Alexander Schrijver   Bipartite Edge Coloring in $O(\Delta m)$
                                  Time . . . . . . . . . . . . . . . . . . 841--846
                  Jop F. Sibeyn   Row-Major Sorting on Meshes  . . . . . . 847--863
            Giuseppe Liotta and   
        Franco P. Preparata and   
               Roberto Tamassia   Robust Proximity Queries: An
                                  Illustration of Degree-Driven Algorithm
                                  Design . . . . . . . . . . . . . . . . . 864--889
    Marcos Kawazoe Aguilera and   
                      Sam Toueg   Failure Detection and Randomization: a
                                  Hybrid Approach to Solve Consensus . . . 890--903
               Guy Louchard and   
       Wojciech Szpankowski and   
                      Jing Tang   Average Profile of the Generalized
                                  Digital Search Tree and the Generalized
                                  Lempel--Ziv Algorithm  . . . . . . . . . 904--934
             Chi-Chang Chen and   
                    Jianer Chen   The Maximum Partition Matching Problem
                                  with Applications  . . . . . . . . . . . 935--954
              Ming-Yang Kao and   
                 Junfeng Qi and   
                        Lei Tan   Optimal Bidding Algorithms Against
                                  Cheating in Multiple-Object Auctions . . 955--969
                  Eli Gafni and   
              Elias Koutsoupias   Three-Processor Tasks Are Undecidable    970--983
             Bruce M. Maggs and   
            Ramesh K. Sitaraman   Simple Algorithms for Routing on
                                  Butterfly Networks with Bounded Queues   984--1003
               Wen-Lian Hsu and   
                    Tze-Heng Ma   Fast and Simple Algorithms for
                                  Recognizing Chordal Comparability Graphs
                                  and Interval Graphs  . . . . . . . . . . 1004--1020
            David R. Karger and   
                 Noam Nisan and   
                  Michal Parnas   Fast Connected Components Algorithms for
                                  the EREW PRAM  . . . . . . . . . . . . . 1021--1034
                 Noam Nisan and   
              Steven Rudich and   
                   Michael Saks   Products and Help Bits in Decision Trees 1035--1050
                 Paul Beame and   
              Allan Borodin and   
         Prabhakar Raghavan and   
            Walter L. Ruzzo and   
                   Martin Tompa   A Time-Space Tradeoff for Undirected
                                  Graph Traversal by Walking Automata  . . 1051--1072
             Richa Agarwala and   
               Vineet Bafna and   
              Martin Farach and   
              Mike Paterson and   
                  Mikkel Thorup   On the Approximability of Numerical
                                  Taxonomy (Fitting Distances by Tree
                                  Metrics) . . . . . . . . . . . . . . . . 1073--1085
               Carsten Lund and   
              Nick Reingold and   
          Jeffery Westbrook and   
                      Dicky Yan   Competitive On-Line Algorithms for
                                  Distributed Data Management  . . . . . . 1086--1111
           Riccardo Torlone and   
                   Paolo Atzeni   Efficient Database Updates with
                                  Independent Schemes  . . . . . . . . . . 1112--1135
           Nader H. Bshouty and   
             Jeffrey C. Jackson   Learning DNF over the Uniform
                                  Distribution Using a Quantum Example
                                  Oracle . . . . . . . . . . . . . . . . . 1136--1153

SIAM Journal on Computing
Volume 28, Number 4, August, 1999

              Hans Kellerer and   
              T. Tautenhahn and   
                   G. Woeginger   Approximability and Nonapproximability
                                  Results for Minimizing Total Flow Time
                                  on a Single Machine  . . . . . . . . . . 1155--1166
               D. Aingworth and   
                 C. Chekuri and   
                   P. Indyk and   
                     R. Motwani   Fast Estimation of Diameter and Shortest
                                  Paths (Without Matrix Multiplication)    1167--1181
               Sariel Har-Peled   Constructing Approximate Shortest Path
                                  Maps in Three Dimensions . . . . . . . . 1182--1197
                  Jeff Erickson   New Lower Bounds for Convex Hull
                                  Problems in Odd Dimensions . . . . . . . 1198--1214
                    Luc Devroye   The Height and Size of Random Hash Trees
                                  and Random Pebbled Hash Trees  . . . . . 1215--1224
                Guo-Hui Lin and   
                Ding-Zhu Du and   
               Xiao-Dong Hu and   
                   Guoliang Xue   On Rearrangeability of Multirate Clos
                                  Networks . . . . . . . . . . . . . . . . 1225--1231
                  Prasad Tetali   Design of On-Line Algorithms Using
                                  Hitting Times  . . . . . . . . . . . . . 1232--1246
              Edward G. Thurber   Efficient Generation of Minimal Length
                                  Addition Chains  . . . . . . . . . . . . 1247--1263
                       Jie Wang   Distributional Word Problem for Groups   1264--1283
           Derek G. Corneil and   
             Stephan Olariu and   
                  Lorna Stewart   Linear Time Algorithms for Dominating
                                  Pairs in Asteroidal Triple-free Graphs   1284--1297
          Joseph S. B. Mitchell   Guillotine Subdivisions Approximate
                                  Polygonal Subdivisions: a Simple
                                  Polynomial-Time Approximation Scheme for
                                  Geometric TSP, $k$-MST, and Related
                                  Problems . . . . . . . . . . . . . . . . 1298--1309
                 Jin-Yi Cai and   
                 Alan L. Selman   Fine Separation of Average-Time
                                  Complexity Classes . . . . . . . . . . . 1310--1325
        Boris V. Cherkassky and   
         Andrew V. Goldberg and   
              Craig Silverstein   Buckets, Heaps, Lists, and Monotone
                                  Priority Queues  . . . . . . . . . . . . 1326--1346
              Ichiro Suzuki and   
             Masafumi Yamashita   Distributed Anonymous Mobile Robots:
                                  Formation of Geometric Patterns  . . . . 1347--1363
         Johan Håstad and   
        Russell Impagliazzo and   
            Leonid A. Levin and   
                   Michael Luby   A Pseudorandom Generator from any
                                  One-way Function . . . . . . . . . . . . 1364--1396
               Hagit Attiya and   
             Hadas Shachnai and   
                     Tami Tamir   Local Labeling and Resource Allocation
                                  Using Preprocessing  . . . . . . . . . . 1397--1414
              Harry Buhrman and   
          Jaap-Henk Hoepman and   
            Paul Vitányi   Space-efficient Routing Tables for
                                  Almost All Networks and the
                                  Incompressibility Method . . . . . . . . 1414--1432
         Aravind Srinivasan and   
                David Zuckerman   Computing with Very Weak Random Sources  1433--1459
                 Ketan Mulmuley   Lower Bounds in a Parallel Model without
                                  Bit Operations . . . . . . . . . . . . . 1460--1509
           Lenwood S. Heath and   
        Sriram V. Pemmaraju and   
                   Ann N. Trenk   Stack and Queue Layouts of Directed
                                  Acyclic Graphs: Part I . . . . . . . . . 1510--1539

SIAM Journal on Computing
Volume 28, Number 5, October, 1999

                Weiping Shi and   
                Douglas B. West   Diagnosis of Wiring Networks: An Optimal
                                  Randomized Algorithm for Finding
                                  Connected Components of Unknown Graphs   1541--1551
Hervé Brönnimann and   
           Bernard Chazelle and   
                  Jiri Matousek   Product Range Spaces, Sensitive
                                  Sampling, and Derandomization  . . . . . 1552--1575
             Aart J. C. Bik and   
           Harry A. G. Wijshoff   Automatic Nonzero Structure Analysis . . 1576--1587
           Lenwood S. Heath and   
            Sriram V. Pemmaraju   Stack and Queue Layouts of Directed
                                  Acyclic Graphs: Part II  . . . . . . . . 1588--1626
             Andrej Brodnik and   
                   J. Ian Munro   Membership in Constant Time and
                                  Almost-Minimum Space . . . . . . . . . . 1627--1640
            Sanjeev Mahajan and   
                      H. Ramesh   Derandomizing Approximation Algorithms
                                  Based on Semidefinite Programming  . . . 1641--1663
             Gary L. Miller and   
                 Shang-Hua Teng   The Dynamic Parallel Complexity of
                                  Computational Circuits . . . . . . . . . 1664--1688
             Ueli M. Maurer and   
                    Stefan Wolf   The Relationship Between Breaking the
                                  Diffie--Hellman Protocol and Computing
                                  Discrete Logarithms  . . . . . . . . . . 1689--1721
                  Dorit Dor and   
                      Uri Zwick   Selecting the Median . . . . . . . . . . 1722--1758
        Pierluigi Crescenzi and   
                 Viggo Kann and   
         Riccardo Silvestri and   
                  Luca Trevisan   Structure in Approximation Classes . . . 1759--1782
            Maurizio Talamo and   
                    Paola Vocca   An Efficient Data Structure for Lattice
                                  Operations . . . . . . . . . . . . . . . 1783--1805
              Amotz Bar-Noy and   
                Ran Canetti and   
                Shay Kutten and   
             Yishay Mansour and   
                Baruch Schieber   Bandwidth Allocation with Preemption . . 1806--1828
        Leslie Ann Goldberg and   
               Yossi Matias and   
                     Satish Rao   An Optical Simulation of Shared Memory   1829--1847
              Cynthia Dwork and   
            Maurice Herlihy and   
              Serge Plotkin and   
                    Orli Waarts   Time-Lapse Snapshots . . . . . . . . . . 1848--1874
            D. Stott Parker and   
                     Prasad Ram   The Construction of Huffman Codes is a
                                  Submodular (``Convex'') Optimization
                                  Problem Over a Lattice of Binary Trees   1875--1905
                Haim Kaplan and   
                 Ron Shamir and   
               Robert E. Tarjan   Tractability of Parameterized Completion
                                  Problems on Chordal, Strongly Chordal,
                                  and Proper Interval Graphs . . . . . . . 1906--1922

SIAM Journal on Computing
Volume 28, Number 6, December, 1999

            Richard J. Anderson   Tree Data Structures for $N$-Body
                                  Simulation . . . . . . . . . . . . . . . 1923--1940
                      John Case   The Power of Vacillation in Language
                                  Learning . . . . . . . . . . . . . . . . 1941--1969
                  A. E. Brouwer   An Associative Block Design ABD$(8,5)$   1970--1971
               Ronitt Rubinfeld   On the Robustness of Functional
                                  Equations  . . . . . . . . . . . . . . . 1972--1997
              Barun Chandra and   
             Howard Karloff and   
                    Craig Tovey   New Results on the Old $k$-opt Algorithm
                                  for the Traveling Salesman Problem . . . 1998--2029
             Mauro Leoncini and   
           Giovanni Manzini and   
                Luciano Margara   Parallel Complexity of Numerically
                                  Accurate Linear System Solvers . . . . . 2030--2058
                   John H. Reif   Approximate Complex Polynomial
                                  Evaluation in Near Constant Work Per
                                  Point  . . . . . . . . . . . . . . . . . 2059--2089
             Yosi Ben-Asher and   
               Eitan Farchi and   
                    Ilan Newman   Optimal Search in Trees  . . . . . . . . 2090--2102
       Alexander E. Andreev and   
      Andrea E. F. Clementi and   
    José D. P. Rolim and   
                  Luca Trevisan   Weak Random Sources, Hitting Sets, and
                                  BPP Simulations  . . . . . . . . . . . . 2103--2116
            Stephen Alstrup and   
                  Dov Harel and   
         Peter W. Lauridsen and   
                  Mikkel Thorup   Dominators in Linear Time  . . . . . . . 2117--2132
           Prasad Chalasani and   
                 Rajeev Motwani   Approximating Capacitated Routing and
                                  Delivery Problems  . . . . . . . . . . . 2133--2149
                         Xin He   On Floor-Plan of Plane Graphs  . . . . . 2150--2167
            Kazuhisa Makino and   
          Ken-ichi Hatanaka and   
              Toshihide Ibaraki   Horn Extensions of a Partially Defined
                                  Boolean Function . . . . . . . . . . . . 2168--2186
                   Guy Even and   
        Joseph (Seffi) Naor and   
                 Satish Rao and   
                Baruch Schieber   Fast Approximate Graph Partitioning
                                  Algorithms . . . . . . . . . . . . . . . 2187--2214
           John Hershberger and   
                   Subhash Suri   An Optimal Algorithm for Euclidean
                                  Shortest Paths in the Plane  . . . . . . 2215--2256
               Jeff Edmonds and   
           Chung Keung Poon and   
            Dimitris Achlioptas   Tight Lower Bounds for $st$-Connectivity
                                  on the NNJAG Model . . . . . . . . . . . 2257--2284
                 Warwick Harvey   Computing Two-Dimensional Integer Hulls  2285--2299


SIAM Journal on Computing
Volume 29, Number 1, February, 1999

                Uriel Feige and   
               Dror Lapidot and   
                     Adi Shamir   Multiple NonInteractive Zero Knowledge
                                  Proofs Under General Assumptions . . . . 1--28
              Bhaskar Ghosh and   
             F. T. Leighton and   
             Bruce M. Maggs and   
           S. Muthukrishnan and   
            C. Greg Plaxton and   
               R. Rajaraman and   
     Andréa W. Richa and   
   newline Robert E. Tarjan and   
                David Zuckerman   Tight Analyses of Two Local Load
                                  Balancing Algorithms . . . . . . . . . . 29--64
                     Xin He and   
                 Zhi-Zhong Chen   An Algorithm for Shortest Paths in
                                  Bipartite Digraphs with Concave Weight
                                  Matrices and its Applications  . . . . . 65--80
           Eberhard Bertsch and   
              Mark-Jan Nederhof   Regular Closure of Deterministic
                                  Languages  . . . . . . . . . . . . . . . 81--102
                Maria Bonet and   
           Cynthia Phillips and   
               Tandy Warnow and   
                  Shibu Yooseph   Constructing Evolutionary Trees in the
                                  Presence of Polymorphic Characters . . . 103--131
           E. Allen Emerson and   
             Charanjit S. Jutla   The Complexity of Tree Automata and
                                  Logics of Programs . . . . . . . . . . . 132--158
                Naveen Garg and   
                Huzur Saran and   
              Vijay V. Vazirani   Finding Separator Cuts in Planar Graphs
                                  within Twice the Optimal . . . . . . . . 159--179
                 Yossi Azar and   
           Andrei Z. Broder and   
             Anna R. Karlin and   
                      Eli Upfal   Balanced Allocations . . . . . . . . . . 180--200
  Claudia Bertram-Kretzberg and   
                  Hanno Lefmann   The Algorithmic Aspects of Uncrowded
                                  Hypergraphs  . . . . . . . . . . . . . . 201--230
             Jerzy Marcinkowski   Achilles, Turtle, and Undecidable
                                  Boundedness Problems for Small DATALOG
                                  Programs . . . . . . . . . . . . . . . . 231--257
               Tom Leighton and   
                        Yuan Ma   Tight Bounds on the Size of
                                  Fault-Tolerant Merging and Sorting
                                  Networks with Destructive Faults . . . . 258--273
               Tibor Szkaliczki   Routing with Minimum Wire Length in the
                                  Dogleg-Free Manhattan Model is $\cal
                                  {NP}$-Complete . . . . . . . . . . . . . 274--287
                Weimin Chen and   
                   Volker Turau   On Regular Tree Embeddings . . . . . . . 288--301
        Josef M. Breutzmann and   
                   Jack H. Lutz   Equivalence of Measures of Complexity
                                  Classes  . . . . . . . . . . . . . . . . 302--326
             Shoshana Anily and   
            Michel Gendreau and   
                Gilbert Laporte   The Swapping Problem on a Line . . . . . 327--335
                 Howard Karloff   How Good is the Goemans--Williamson MAX
                                  CUT Algorithm? . . . . . . . . . . . . . 336--350

SIAM Journal on Computing
Volume 29, Number 2, April, 1999

                 Benny Chor and   
                Lee-Bath Nelson   Solvability in Asynchronous Environments
                                  II: Finite Interactive Tasks . . . . . . 351--377
              Elaine Eschen and   
            Ryan B. Hayward and   
             Jeremy Spinrad and   
                   R. Sritharan   Weakly Triangulated Comparability Graphs 378--386
                Russ Bubley and   
                Martin Dyer and   
        Catherine Greenhill and   
                    Mark Jerrum   On Approximately Counting Colorings of
                                  Small Degree Graphs  . . . . . . . . . . 387--400
      Stephen J. Bellantoni and   
               Karl-Heinz Niggl   Ranking Primitive Recursions: The Low
                                  Grzegorczyk Classes Revisited  . . . . . 401--415
            Michael T. Goodrich   Communication-Efficient Parallel Sorting 416--432
                   J. H. Rieger   Proximity in Arrangements of Algebraic
                                  Sets . . . . . . . . . . . . . . . . . . 433--458
                 Susanne Albers   Better Bounds for Online Scheduling  . . 459--473
              Sandeep Bhatt and   
            David Greenberg and   
               Tom Leighton and   
                   Pangfeng Liu   Tight Bounds for On-Line Tree Embeddings 474--491
                David R. Karger   A Randomized Fully Polynomial Time
                                  Approximation Scheme for the
                                  All-Terminal Network Reliability Problem 492--514
            Esther M. Arkin and   
              Yi-Jen Chiang and   
      Joseph S. B. Mitchell and   
           Steven S. Skiena and   
                 Tae-Cheon Yang   On the Maximum Scatter Traveling
                                  Salesperson Problem  . . . . . . . . . . 515--544
              Rod G. Downey and   
         Michael R. Fellows and   
            Alexander Vardy and   
                  Geoff Whittle   The Parametrized Complexity of Some
                                  Fundamental Problems in Coding Theory    545--570
  Juha Kärkkäinen and   
                   Esko Ukkonen   Two- and Higher-Dimensional Pattern
                                  Matching in Optimal Expected Time  . . . 571--589
              Harry Buhrman and   
                    Ming Li and   
                 John Tromp and   
            Paul Vitányi   Kolmogorov Random Graphs and the
                                  Incompressibility Method . . . . . . . . 590--599
           Steven C. Bruell and   
              Sukumar Ghosh and   
       Mehmet Hakan Karaata and   
            Sriram V. Pemmaraju   Self-Stabilizing Algorithms for Finding
                                  Centers and Medians of Trees . . . . . . 600--614
            Matthew Andrews and   
               Tom Leighton and   
           P. Takis Metaxas and   
                     Lisa Zhang   Automatic Methods for Hiding Latency in
                                  Parallel and Distributed Computation . . 615--647
             Aravind Srinivasan   Improved Approximation Guarantees for
                                  Packing and Covering Integer Programs    648--670
               Frank Ruskey and   
                     Joe Sawada   An Efficient Algorithm for Generating
                                  Necklaces with Fixed Density . . . . . . 671--684
          Zhivko Prodanov Nedev   Finding an Even Simple Path in a
                                  Directed Planar Graph  . . . . . . . . . 685--695

SIAM Journal on Computing
Volume 29, Number 3, June, 1999

              Alok Aggarwal and   
            Don Coppersmith and   
             Sanjeev Khanna and   
             Rajeev Motwani and   
                Baruch Schieber   The Angular-Metric Traveling Salesman
                                  Problem  . . . . . . . . . . . . . . . . 697--711
                   B. Natarajan   On Learning Functions from Noise-Free
                                  and Noisy Samples via Occam's Razor  . . 712--727
                Mark Levene and   
                  George Loizou   Navigation in Hypertext Is Easy Only
                                  Sometimes  . . . . . . . . . . . . . . . 728--760
                 Bang Ye Wu and   
            Giuseppe Lancia and   
               Vineet Bafna and   
               Kun-Mao Chao and   
                    R. Ravi and   
                  Chuan Yi Tang   A Polynomial-Time Approximation Scheme
                                  for Minimum Routing Cost Spanning Trees  761--778
                Paolo Boldi and   
               Sebastiano Vigna   Complexity of Deciding Sense of
                                  Direction  . . . . . . . . . . . . . . . 779--789
                  Amos Fiat and   
                      Moni Naor   Rigorous Time/Space Trade-offs for
                                  Inverting Functions  . . . . . . . . . . 790--803
               Shlomi Dolev and   
         Evangelos Kranakis and   
              Danny Krizanc and   
                    David Peleg   Bubbles: Adaptive Routing Scheme for
                                  High-Speed Dynamic Networks  . . . . . . 804--833
        Leslie Ann Goldberg and   
                    Mark Jerrum   Randomly Sampling Molecules  . . . . . . 834--853
           Scott E. Decatur and   
             Oded Goldreich and   
                       Dana Ron   Computational Sample Complexity  . . . . 854--879
                Haim Kaplan and   
                 Ron Shamir and   
               Robert E. Tarjan   A Faster and Simpler Algorithm for
                                  Sorting Signed Permutations by Reversals 880--892
            S. Rao Kosaraju and   
               Giovanni Manzini   Compression of Low Entropy Strings with
                                  Lempel--Ziv Algorithms . . . . . . . . . 893--911
          Pankaj K. Agarwal and   
                 Alon Efrat and   
                   Micha Sharir   Vertical Decomposition of Shallow Levels
                                  in $3$-Dimensional Arrangements and Its
                                  Applications . . . . . . . . . . . . . . 912--953
                     Z. Sweedyk   \boldmath $A 2\frac12$-Approximation
                                  Algorithm for Shortest Superstring . . . 954--986
                Ioan I. Macarie   On the Structure of Logspace
                                  Probabilistic Complexity Classes . . . . 987--1007
             F. K. Miyazawa and   
                 Y. Wakabayashi   Approximation Algorithms for the
                                  Orthogonal $Z$-Oriented
                                  Three-Dimensional Packing Problem  . . . 1008--1029
                 Dan E. Willard   Examining Computational Geometry, Van
                                  Emde Boas Trees, and Hashing from the
                                  Perspective of the Fusion Tree . . . . . 1030--1049

SIAM Journal on Computing
Volume 29, Number 4, August, 2000

              Tracy Kimbrel and   
                 Anna R. Karlin   Near-Optimal Parallel Prefetching and
                                  Caching  . . . . . . . . . . . . . . . . 1051--1082
           Leszek Pacholski and   
            Wies\law Szwast and   
                  Lidia Tendera   Complexity Results for First-Order
                                  Two-Variable Logic with Counting . . . . 1083--1117
            Klaus Reinhardt and   
                  Eric Allender   Making Nondeterminism Unambiguous  . . . 1118--1131
             Oded Goldreich and   
                   Shmuel Safra   A Combinatorial Consistency Lemma with
                                  Application to Proving the PCP Theorem   1132--1154
        Sridhar Rajagopalan and   
            Leonard J. Schulman   Verification of Identities . . . . . . . 1155--1163
             Susanne Albers and   
            Monika R. Henzinger   Exploring Unknown Environments . . . . . 1164--1188
                 Joe Kilian and   
           Eyal Kushilevitz and   
              Silvio Micali and   
               Rafail Ostrovsky   Reducibility and Completeness in Private
                                  Computations . . . . . . . . . . . . . . 1189--1208
             Vince Grolmusz and   
            Gábor Tardos   Lower Bounds for $({\rm MOD} p - {\rm
                                  MOD} m)$ Circuits  . . . . . . . . . . . 1209--1222
              Danny Z. Chen and   
             Kevin S. Klenk and   
                  Hung-Yi T. Tu   Shortest Path Queries Among Weighted
                                  Obstacles in the Rectilinear Plane . . . 1223--1246
             Zhi-Zhong Chen and   
                  Ming-Yang Kao   Reducing Randomness via Irrational
                                  Numbers  . . . . . . . . . . . . . . . . 1247--1256
              Wei-Liang Lin and   
            Amir H. Farrahi and   
                 M. Sarrafzadeh   On the Power of Logic Resynthesis  . . . 1257--1289
            Rakesh D. Barve and   
            Edward F. Grove and   
           Jeffrey Scott Vitter   Application-Controlled Paging for a
                                  Shared Cache . . . . . . . . . . . . . . 1290--1303
            Ravi B. Boppana and   
              Babu O. Narayanan   Perfect-Information Leader Election with
                                  Optimal Resilience . . . . . . . . . . . 1304--1320
              Alok Aggarwal and   
              Jon Kleinberg and   
            David P. Williamson   Node-Disjoint Paths on the Mesh and a
                                  New Trade-Off in VLSI Layout . . . . . . 1321--1333
          Scott A. Mitchell and   
             Stephen A. Vavasis   Quality Mesh Generation in Higher
                                  Dimensions . . . . . . . . . . . . . . . 1334--1370
          Edward P. F. Chan and   
             Ron van der Meyden   Containment and Optimization of
                                  Object-Preserving Conjunctive Queries    1371--1400

SIAM Journal on Computing
Volume 29, Number 5, October, 2000

     Jean-Daniel Boissonnat and   
            Franco P. Preparata   Robust Plane Sweep for Intersecting
                                  Segments . . . . . . . . . . . . . . . . 1401--1421
          Pankaj K. Agarwal and   
            Edward F. Grove and   
               T. M. Murali and   
           Jeffrey Scott Vitter   Binary Space Partitions for Fat
                                  Rectangles . . . . . . . . . . . . . . . 1422--1448
               Michael Saks and   
              Fotios Zaharoglou   Wait-Free $k$-Set Agreement is
                                  Impossible: The Topology of Public
                                  Knowledge  . . . . . . . . . . . . . . . 1449--1483
                 Paul Dagum and   
               Richard Karp and   
               Michael Luby and   
                   Sheldon Ross   An Optimal Algorithm for Monte Carlo
                                  Estimation . . . . . . . . . . . . . . . 1484--1496
              Harry Buhrman and   
              Lance Fortnow and   
       Dieter van Melkebeek and   
                Leen Torenvliet   Separating Complexity Classes Using
                                  Autoreducibility . . . . . . . . . . . . 1497--1520
           Han La Poutré   Maintenance of $2$- and
                                  $3$-Edge-Connected Components of Graphs
                                  II . . . . . . . . . . . . . . . . . . . 1521--1549
         Millist W. Vincent and   
                    Mark Levene   Restructuring Partitioned Normal Form
                                  Relations without Information Loss . . . 1550--1567
              Ming-Yang Kao and   
                       Jie Wang   Linear-Time Approximation Algorithms for
                                  Computing Numerical Summation with
                                  Provably Small Errors  . . . . . . . . . 1568--1576
         Jürgen Sellen and   
               Joonsoo Choi and   
                  Chee-Keng Yap   Precision-Sensitive Euclidean Shortest
                                  Path in $3$-Space  . . . . . . . . . . . 1577--1595
               Oren Etzioni and   
                Steve Hanks and   
                  Tao Jiang and   
                    Omid Madani   Optimal Information Gathering on the
                                  Internet with Time and Cost Constraints  1596--1620
            Ladislav Stacho and   
                    Imrich Vrto   Virtual Path Layouts in ATM Networks . . 1621--1629
           Funda Ergün and   
              S. Ravi Kumar and   
                   D. Sivakumar   Self-Testing without the Generator
                                  Bottleneck . . . . . . . . . . . . . . . 1630--1651
           Michael Benedikt and   
                  Leonid Libkin   Safe Constraint Queries  . . . . . . . . 1652--1682
             Sanjeev Khanna and   
            Vincenzo Liberatore   On Broadcast Disk Paging . . . . . . . . 1683--1702
               Artur Czumaj and   
Friedhelm Meyer auf der Heide and   
                 Volker Stemann   Contention Resolution in Hashing Based
                                  Shared Memory Simulations  . . . . . . . 1703--1739
                  Dorit Dor and   
              Shay Halperin and   
                      Uri Zwick   All-Pairs Almost Shortest Paths  . . . . 1740--1759

SIAM Journal on Computing
Volume 29, Number 6, December, 2000

            Monika R. Henzinger   Improved Data Structures for Fully
                                  Dynamic Biconnectivity . . . . . . . . . 1761--1815
     Håkan Lennerstad and   
                  Lars Lundberg   Optimal Combinatorial Functions
                                  Comparing Multiprocess Allocation
                                  Performance in Multiprocessor Systems    1816--1838
     Joachim von zur Gathen and   
            Igor E. Shparlinski   The CREW PRAM Complexity of Modular
                                  Inversion  . . . . . . . . . . . . . . . 1839--1857
                  Sanjiv Kapoor   Dynamic Maintenance of Maxima of $2$-d
                                  Point Sets . . . . . . . . . . . . . . . 1858--1877
                 Jin-yi Cai and   
          Richard J. Lipton and   
            Yechezkel Zalcstein   The Complexity of the $A B C$ Problem    1878--1888
              Dahlia Malkhi and   
          Michael K. Reiter and   
                   Avishai Wool   The Load and Availability of Byzantine
                                  Quorum Systems . . . . . . . . . . . . . 1889--1906
                 Avrim Blum and   
               Prasad Chalasani   An Online Algorithm for Improving
                                  Performance in Navigation  . . . . . . . 1907--1938
          Maria Luisa Bonet and   
            Toniann Pitassi and   
                        Ran Raz   On Interpolation and Automatization for
                                  Frege Systems  . . . . . . . . . . . . . 1939--1967
                  Jeff Erickson   Space-Time Tradeoffs for Emptiness
                                  Queries  . . . . . . . . . . . . . . . . 1968--1996
                Micah Adler and   
              John W. Byers and   
                Richard M. Karp   Parallel Sorting with Limited Bandwidth  1997--2015
               Sariel Har-Peled   Constructing Planar Cuttings in Theory
                                  and Practice . . . . . . . . . . . . . . 2016--2039
    Marcos Kawazoe Aguilera and   
                   Wei Chen and   
                      Sam Toueg   On Quiescent Reliable Communication  . . 2040--2073
              Luca Trevisan and   
          Gregory B. Sorkin and   
                Madhu Sudan and   
            David P. Williamson   Gadgets, Approximation, and Linear
                                  Programming  . . . . . . . . . . . . . . 2074--2097


SIAM Journal on Computing
Volume 30, Number 1, February, 2000

               Richard Cole and   
                 Bud Mishra and   
           Jeanette Schmidt and   
                    Alan Siegel   On the Dynamic Finger Conjecture for
                                  Splay Trees. Part I: Splay Sorting $\log
                                  n$-Block Sequences . . . . . . . . . . . 1--43
                   Richard Cole   On the Dynamic Finger Conjecture for
                                  Splay Trees. Part II: The Proof  . . . . 44--85
                  Mikkel Thorup   On RAM Priority Queues . . . . . . . . . 86--109
               Dana Angluin and   
          Jeffery Westbrook and   
                    Wenhong Zhu   Robot Navigation with Distance Queries   110--144
               Xiaotie Deng and   
                    Nian Gu and   
                 Tim Brecht and   
                    KaiCheng Lu   Preemptive Scheduling of Parallel Jobs
                                  on Multiprocessors . . . . . . . . . . . 145--160
               John H. Reif and   
                   Hongyan Wang   Nonuniform Discretization for
                                  Kinodynamic Motion Planning and its
                                  Applications . . . . . . . . . . . . . . 161--190
              Jon Kleinberg and   
               Yuval Rabani and   
              Éva Tardos   Allocating Bandwidth for Bursty
                                  Connections  . . . . . . . . . . . . . . 191--217
     Jean-Daniel Boissonnat and   
          Olivier Devillers and   
                 Sylvain Lazard   Motion Planning of Legged Robots . . . . 218--246
                Shay Kutten and   
                    David Peleg   Tight Fault Locality . . . . . . . . . . 247--268
           David Greenhalgh and   
               Stephen Marshall   Convergence Criteria for Genetic
                                  Algorithms . . . . . . . . . . . . . . . 269--282
               Lusheng Wang and   
                  Tao Jiang and   
                   Dan Gusfield   A More Efficient Approximation Scheme
                                  for Tree Alignment . . . . . . . . . . . 283--299
          Elias Koutsoupias and   
      Christos H. Papadimitriou   Beyond Competitive Analysis  . . . . . . 300--317
        Michelangelo Grigni and   
            Vincent Mirelli and   
      Christos H. Papadimitriou   On the Difficulty of Designing Good
                                  Classifiers  . . . . . . . . . . . . . . 318--323
                Uriel Feige and   
                     Joe Kilian   Two-Prover Protocols --- Low Error at
                                  Affordable Rates . . . . . . . . . . . . 324--346

SIAM Journal on Computing
Volume 30, Number 2, April, 2000

              Amotz Bar-Noy and   
               Sudipto Guha and   
        Joseph (Seffi) Naor and   
                Baruch Schieber   Message Multicasting in Heterogeneous
                                  Networks . . . . . . . . . . . . . . . . 347--358
           Clifford Bergman and   
                  Giora Slutzki   Complexity of Some Problems Concerning
                                  Varieties and Quasi-Varieties of
                                  Algebras . . . . . . . . . . . . . . . . 359--382
 Claudia Bertram--Kretzberg and   
          Thomas Hofmeister and   
                  Hanno Lefmann   An Algorithm for Heilbronn's Problem . . 383--390
                Danny Dolev and   
              Cynthia Dwork and   
                      Moni Naor   Nonmalleable Cryptography  . . . . . . . 391--437
             Prasad Jayanti and   
                   King Tan and   
                      Sam Toueg   Time and Space Lower Bounds for
                                  Nonblocking Implementations  . . . . . . 438--456
           Eyal Kushilevitz and   
           Rafail Ostrovsky and   
                   Yuval Rabani   Efficient Search for Approximate Nearest
                                  Neighbor in High Dimensional Spaces  . . 457--474
                  Luca Trevisan   When Hamming Meets Euclid: The
                                  Approximability of Geometric TSP and
                                  Steiner Tree . . . . . . . . . . . . . . 475--485
                George Varghese   Self-Stabilization by Counter Flushing   486--510
                Gilad Koren and   
                Emanuel Dar and   
                   Amihood Amir   The Power of Migration in Multiprocessor
                                  Scheduling of Real-Time Systems  . . . . 511--527
            Joseph Cheriyan and   
         Ramakrishna Thurimella   Approximating Minimum-Size $k$-Connected
                                  Spanning Subgraphs via Matching  . . . . 528--560
                Timothy M. Chan   Random Sampling, Halfspace Range
                                  Reporting, and Construction of $(\leq
                                  k)$-Levels in Three Dimensions . . . . . 561--575
              Harry Buhrman and   
       Dieter van Melkebeek and   
           Kenneth W. Regan and   
               D. Sivakumar and   
                 Martin Strauss   A Generalization of Resource-Bounded
                                  Measure, with Application to the BPP vs.
                                  EXP Problem  . . . . . . . . . . . . . . 576--601
              Ming-Yang Kao and   
                Tak-Wah Lam and   
              Wing-Kin Sung and   
                 Hing-Fung Ting   Cavity Matchings, Label Compressions,
                                  and Unrooted Evolutionary Trees  . . . . 602--624
       Andrea Pietracaprina and   
              Geppino Pucci and   
                  Jop F. Sibeyn   Constructive, Deterministic
                                  Implementation of Shared Memory on
                                  Meshes . . . . . . . . . . . . . . . . . 625--648
            Harold N. Gabow and   
            Tibor Jordán   How to Make a Square Grid Framework with
                                  Cables Rigid . . . . . . . . . . . . . . 649--680
               Nah-Oak Song and   
         Demosthenis Teneketzis   On a Conjecture by Coffman, Flatto, and
                                  Wright on Stochastic Machine
                                  Minimization . . . . . . . . . . . . . . 681--687

SIAM Journal on Computing
Volume 30, Number 3, June, 2000

                 Wai-Kau Lo and   
              Vassos Hadzilacos   All of Us Are Smarter than Any of Us:
                                  Nondeterministic Wait-Free Hierarchies
                                  Are Not Robust . . . . . . . . . . . . . 689--728
                     Bin Ma and   
                    Ming Li and   
                   Louxin Zhang   From Gene Trees to Species Trees . . . . 729--752
               Yefim Dinitz and   
                Alek Vainshtein   The General Structure of
                                  Edge-Connectivity of a Vertex Subset in
                                  a Graph and its Incremental Maintenance.
                                  Odd Case . . . . . . . . . . . . . . . . 753--808
              Chris Barrett and   
                 Riko Jacob and   
                 Madhav Marathe   Formal-Language-Constrained Path
                                  Problems . . . . . . . . . . . . . . . . 809--837
                     Xin He and   
              Ming-Yang Kao and   
                     Hsueh-I Lu   A Fast General Methodology for
                                  Information-Theoretically Optimal
                                  Encodings of Graphs  . . . . . . . . . . 838--846
              Sanjiv Kapoor and   
               S. N. Maheshwari   Efficiently Constructing the Visibility
                                  Graph of a Simple Polygon with Obstacles 847--871
     Håkan Lennerstad and   
                  Lars Lundberg   Optimal Worst Case Formulas Comparing
                                  Cache Memory Associativity . . . . . . . 872--905
             Anna R. Karlin and   
         Steven J. Phillips and   
             Prabhakar Raghavan   Markov Paging  . . . . . . . . . . . . . 906--922
             Charles Knessl and   
           Wojciech Szpankowski   Asymptotic Behavior of the Height in a
                                  Digital Search Tree and the Longest
                                  Phrase of the Lempel--Ziv Scheme . . . . 923--964
                Haim Kaplan and   
              Chris Okasaki and   
               Robert E. Tarjan   Simple Confluently Persistent Catenable
                                  Lists  . . . . . . . . . . . . . . . . . 965--977
            Giri Narasimhan and   
                   Michiel Smid   Approximating the Stretch Factor of
                                  Euclidean Graphs . . . . . . . . . . . . 978--989
           Manindra Agrawal and   
                Thomas Thierauf   The Formula Isomorphism Problem  . . . . 990--1009
           Peter Bürgisser   The Computational Complexity to Evaluate
                                  Representations of General Linear Groups 1010--1022
           Peter Bürgisser   The Computational Complexity of
                                  Immanants  . . . . . . . . . . . . . . . 1023--1040

SIAM Journal on Computing
Volume 30, Number 4, August, 2000

          Andrzej Czygrinow and   
              Vojtech Rödl   An Algorithmic Regularity Lemma for
                                  Hypergraphs  . . . . . . . . . . . . . . 1041--1066
             Assaf Natanzon and   
                 Ron Shamir and   
                   Roded Sharan   A Polynomial Approximation Algorithm for
                                  the Minimum Fill-In Problem  . . . . . . 1067--1079
                  Victor Y. Pan   Parallel Complexity of Computations with
                                  General and Toeplitz-Like Matrices
                                  Filled with Integers and Extensions  . . 1080--1125
       Christian Scheideler and   
          Berthold Vöcking   From Static to Dynamic Routing:
                                  Efficient Transformations of
                                  Store-and-Forward Protocols  . . . . . . 1126--1155
                   Eric Ruppert   Determining Consensus Numbers  . . . . . 1156--1168
              Amir Herzberg and   
                    Shay Kutten   Early Detection of Message Forwarding
                                  Faults . . . . . . . . . . . . . . . . . 1169--1196
               Jack H. Lutz and   
                      Yong Zhao   The Density of Weakly Complete Problems
                                  under Adaptive Reductions  . . . . . . . 1197--1210
Frédérique Bassino and   
   Marie-Pierre Béal and   
               Dominique Perrin   A Finite State Version of the
                                  Kraft--McMillan Theorem  . . . . . . . . 1211--1230
                   Guy Even and   
        Joseph (Seffi) Naor and   
                   Leonid Zosin   An $8$-Approximation Algorithm for the
                                  Subset Feedback Vertex Set Problem . . . 1231--1252
                  Silvio Micali   Computationally Sound Proofs . . . . . . 1253--1298
                  V. Arvind and   
                  R. Beigel and   
                      A. Lozano   The Complexity of Modular Graph
                                  Automorphism . . . . . . . . . . . . . . 1299--1320
     Kasturi R. Varadarajan and   
              Pankaj K. Agarwal   Approximating Shortest Paths on a
                                  Nonconvex Polyhedron . . . . . . . . . . 1321--1340
               Sariel Har-Peled   Taking a Walk in a Planar Arrangement    1341--1367
                 Xiaoxu Han and   
             Suely Oliveira and   
                  David Stewart   Finding Sets Covering a Point with
                                  Application to Mesh-Free Galerkin
                                  Methods  . . . . . . . . . . . . . . . . 1368--1383

SIAM Journal on Computing
Volume 30, Number 5, October, 2000

               Richard Cole and   
       Martin Farach-Colton and   
           Ramesh Hariharan and   
           Teresa Przytycka and   
                  Mikkel Thorup   An $O(n\log n)$ Algorithm for the
                                  Maximum Agreement Subtree Problem for
                                  Binary Trees . . . . . . . . . . . . . . 1385--1404
    Ruy Luiz Milidiú and   
             Eduardo Sany Laber   The WARM-UP Algorithm: a Lagrangian
                                  Construction of Length Restricted
                                  Huffman Codes  . . . . . . . . . . . . . 1405--1426
                David Peleg and   
              Vitaly Rubinovich   A Near-Tight Lower Bound on the Time
                                  Complexity of Distributed Minimum-Weight
                                  Spanning Tree Construction . . . . . . . 1427--1442
             Martin E. Dyer and   
                    Sandeep Sen   Fast and Optimal Parallel
                                  Multidimensional Search in PRAMs with
                                  Applications to Linear Programming and
                                  Related Problems . . . . . . . . . . . . 1443--1461
          Maria Luisa Bonet and   
          Juan Luis Esteban and   
              Nicola Galesi and   
                  Jan Johannsen   On the Relative Complexity of Resolution
                                  Refinements and Cutting Planes Proof
                                  Systems  . . . . . . . . . . . . . . . . 1462--1484
              Harry Buhrman and   
                Leen Torenvliet   Randomness is Hard . . . . . . . . . . . 1485--1501
          Adam L. Buchsbaum and   
         Raffaele Giancarlo and   
           Jeffery R. Westbrook   On the Determinization of Weighted
                                  Finite Automata  . . . . . . . . . . . . 1502--1531
            Giorgio Gambosi and   
        Alberto Postiglione and   
                Maurizio Talamo   Algorithms for the Relaxed Online
                                  Bin-Packing Model  . . . . . . . . . . . 1532--1551
             Arne Andersson and   
             Torben Hagerup and   
         Johan Håstad and   
                  Ola Petersson   Tight Bounds for Searching a Sorted
                                  Array of Strings . . . . . . . . . . . . 1552--1578
                  M. Brazil and   
               D. A. Thomas and   
                     J. F. Weng   Minimum Networks in Uniform Orientation
                                  Metrics  . . . . . . . . . . . . . . . . 1579--1593
            Matthew Andrews and   
   Antonio Fernández and   
         Mor Harchol-Balter and   
               Tom Leighton and   
                     Lisa Zhang   General Dynamic Routing with Per-Packet
                                  Delay Guarantees of $O({\rm Distance} +
                                  1/{\rm Session Rate})$ . . . . . . . . . 1594--1623
                 Avrim Blum and   
             Howard Karloff and   
               Yuval Rabani and   
                   Michael Saks   A Decomposition Theorem for Task Systems
                                  and Bounds for Randomized Server
                                  Problems . . . . . . . . . . . . . . . . 1624--1661
    Andreas Brandstädt and   
           Feodor F. Dragan and   
           Ekkehard Köhler   Linear Time Algorithms for Hamiltonian
                                  Problems on (Claw,Net)-Free Graphs . . . 1662--1677
                Luc Devroye and   
               Jean Jabbour and   
             Carlos Zamora-Cura   Squarish $k$--$d$ Trees  . . . . . . . . 1678--1700
               Bruno Gaujal and   
           Alain Jean-Marie and   
                  Jean Mairesse   Computations of Uniform Recurrence
                                  Equations Using Minimal Memory Size  . . 1701--1738

SIAM Journal on Computing
Volume 30, Number 6, December, 2001

          Pankaj K. Agarwal and   
                   Hongyan Wang   Approximation Algorithms for
                                  Curvature-Constrained Shortest Paths . . 1739--1772
           Farhad Shahrokhi and   
       Ondrej Sýkora and   
László A. Székely and   
                    Imrich Vrto   On Bipartite Drawings and the Linear
                                  Arrangement Problem  . . . . . . . . . . 1773--1789


SIAM Journal on Computing
Volume 31, Number 1, February, 2001

                Jianer Chen and   
                Antonio Miranda   A Polynomial Time Approximation Scheme
                                  for General Multiprocessor Job
                                  Scheduling . . . . . . . . . . . . . . . 1--17
              Ming-Yang Kao and   
                Tak-Wah Lam and   
              Wing-Kin Sung and   
                 Hing-Fung Ting   A Decomposition Theorem for Maximum
                                  Weight Bipartite Matchings . . . . . . . 18--26
              Ernst Althaus and   
                  Kurt Mehlhorn   Traveling Salesman-Based Curve
                                  Reconstruction in Polynomial Time  . . . 27--66
               Pangfeng Liu and   
             William Aiello and   
                  Sandeep Bhatt   Tree Search on an Atomic Model for
                                  Message Passing  . . . . . . . . . . . . 67--85
           Stefano Leonardi and   
Alberto Marchetti-Spaccamela and   
         Alessio Presciutti and   
               Adi Rosén   On-line Randomized Call Control
                                  Revisited  . . . . . . . . . . . . . . . 86--112
             Jörg Flum and   
                   Martin Grohe   Fixed-Parameter Tractability,
                                  Definability, and Model-Checking . . . . 113--145
                 C. Chekuri and   
                 R. Motwani and   
               B. Natarajan and   
                       C. Stein   Approximation Techniques for Average
                                  Completion Time Scheduling . . . . . . . 146--166
               Michael Luby and   
               Dana Randall and   
              Alistair Sinclair   Markov Chain Algorithms for Planar
                                  Lattice Structures . . . . . . . . . . . 167--192
              Felipe Cucker and   
                 Dima Grigoriev   There are No Sparse NP$_w$-Hard Sets . . 193--198
      Antonín Kucera and   
                      T. Slaman   Randomness and Recursive Enumerability   199--211
   Vincent Bouchitté and   
                   Ioan Todinca   Treewidth and Minimum Fill-in: Grouping
                                  the Minimal Separators . . . . . . . . . 212--232
                 Joan Boyar and   
              Kim S. Larsen and   
              Morten N. Nielsen   The Accommodating Function: a
                                  Generalization of the Competitive Ratio  233--258
                     Joe Sawada   Generating Bracelets in Constant
                                  Amortized Time . . . . . . . . . . . . . 259--268
               Thomas Eiter and   
          Toshihide Ibaraki and   
                Kazuhisa Makino   Disjunctions of Horn Theories and Their
                                  Cores  . . . . . . . . . . . . . . . . . 269--288
                 Pavol Hell and   
                 Ron Shamir and   
                   Roded Sharan   A Fully Dynamic Algorithm for
                                  Recognizing and Representing Proper
                                  Interval Graphs  . . . . . . . . . . . . 289--305
  Miklós Csurös and   
                  Ming-Yang Kao   Provably Fast and Accurate Recovery of
                                  Evolutionary Trees through Harmonic
                                  Greedy Triplets  . . . . . . . . . . . . 306--322
                 Jing-Chao Chen   Proportion Extend Sort . . . . . . . . . 323--330

SIAM Journal on Computing
Volume 31, Number 2, April, 2001

              Amotz Bar-Noy and   
               Sudipto Guha and   
        Joseph (Seffi) Naor and   
                Baruch Schieber   Approximating the Throughput of Multiple
                                  Machines in Real-Time Scheduling . . . . 331--352
                    Rasmus Pagh   Low Redundancy in Static Dictionaries
                                  with Constant Query Time . . . . . . . . 353--363
        Monika R. Henzinger and   
                   Valerie King   Maintaining Minimum Spanning Forests in
                                  Dynamic Graphs . . . . . . . . . . . . . 364--374
                 Mary Cryan and   
        Leslie Ann Goldberg and   
               Paul W. Goldberg   Evolutionary Trees Can be Learned in
                                  Polynomial Time in the Two-State General
                                  Markov Model . . . . . . . . . . . . . . 375--397
                Salil P. Vadhan   The Complexity of Counting in Sparse,
                                  Regular, and Planar Graphs . . . . . . . 398--427
          Vojtech Rödl and   
           Andrzej Rucinski and   
                Michelle Wagner   Matchings Meeting Quotas and Their
                                  Impact on the Blow-Up Lemma  . . . . . . 428--446
              Gen-Huey Chen and   
              Ming-Yang Kao and   
              Yuh-Dauh Lyuu and   
                 Hsing-Kuo Wong   Optimal Buy-and-Hold Strategies for
                                  Financial Markets with Bounded Daily
                                  Returns  . . . . . . . . . . . . . . . . 447--459
      Vwani P. Roychowdhury and   
                  Farrokh Vatan   Quantum Formulas: a Lower Bound and
                                  Simulation . . . . . . . . . . . . . . . 460--476
        Joseph (Seffi) Naor and   
                   Leonid Zosin   A $2$-Approximation Algorithm for the
                                  Directed Multiway Cut Problem  . . . . . 477--482
                Wolfgang Merkle   The Global Power of Additional Queries
                                  to ${P}$-Random Oracles  . . . . . . . . 483--495
          Ketan D. Mulmuley and   
                  Milind Sohoni   Geometric Complexity Theory I: An
                                  Approach to the \em P vs. \em NP and
                                  Related Problems . . . . . . . . . . . . 496--526
              Amotz Bar-Noy and   
                 Ari Freund and   
            Joseph (Seffi) Naor   On-Line Load Balancing in a Hierarchical
                                  Server Topology  . . . . . . . . . . . . 527--549
           Funda Ergün and   
              S. Ravi Kumar and   
               Ronitt Rubinfeld   Checking Approximate Computations of
                                  Polynomials and Functional Equations . . 550--576
             Frank Hoffmann and   
           Christian Icking and   
                 Rolf Klein and   
                  Klaus Kriegel   The Polygon Exploration Problem  . . . . 577--600
                 Ashim Garg and   
               Roberto Tamassia   On the Computational Complexity of
                                  Upward and Rectilinear Planarity Testing 601--625
               Tom Leighton and   
                 Chi-Jen Lu and   
                 Satish Rao and   
             Aravind Srinivasan   New Algorithmic Aspects of the Local
                                  Lemma with Applications to Routing and
                                  Partitioning . . . . . . . . . . . . . . 626--641
               Hagit Attiya and   
                    Arie Fouren   Adaptive and Efficient Algorithms for
                                  Lattice Agreement and Renaming . . . . . 642--664

SIAM Journal on Computing
Volume 31, Number 3, June, 2001

             Moses Charikar and   
              Samir Khuller and   
            Balaji Raghavachari   Algorithms for Capacitated Vehicle
                                  Routing  . . . . . . . . . . . . . . . . 665--682
    Conrado Martínez and   
                 Salvador Roura   Optimal Sampling Strategies in Quicksort
                                  and Quickselect  . . . . . . . . . . . . 683--705
             Cyril Gavoille and   
                    David Peleg   The Compactness of Interval Routing for
                                  Almost All Graphs  . . . . . . . . . . . 706--721
          Amir M. Ben-Amram and   
                      Zvi Galil   Topological Lower Bounds on Algebraic
                                  Random Access Machines . . . . . . . . . 722--761
               J. Ian Munro and   
                Venkatesh Raman   Succinct Representation of Balanced
                                  Parentheses and Static Trees . . . . . . 762--776
       Denis Thérien and   
                         Thomas   Temporal Logic and Semidirect Products:
                                  An Effective Characterization of the
                                  Until Hierarchy  . . . . . . . . . . . . 777--798
           Cristopher Moore and   
                 Martin Nilsson   Parallel Quantum Computation and Quantum
                                  Codes  . . . . . . . . . . . . . . . . . 799--815
                  Eli Gafni and   
           Michael Mitzenmacher   Analysis of Timing-Based Mutual
                                  Exclusion with Random Times  . . . . . . 816--837
          Joseph Y. Halpern and   
                Yoram Moses and   
                    Orli Waarts   A Characterization of Eventual Byzantine
                                  Agreement  . . . . . . . . . . . . . . . 838--865
           Amit Chakrabarti and   
               Subhash Khot and   
                     Yaoyun Shi   Evasiveness of Subgraph Containment and
                                  Related Properties . . . . . . . . . . . 866--875
              Harry Buhrman and   
             Luc Longpré   Compressibility and Resource Bounded
                                  Measure  . . . . . . . . . . . . . . . . 876--886
              Harry Buhrman and   
              Lance Fortnow and   
                Sophie Laplante   Resource-Bounded Kolmogorov Complexity
                                  Revisited  . . . . . . . . . . . . . . . 887--905
                   A. Pavan and   
                 Alan L. Selman   Separation of NP-Completeness Notions    906--918
    Stavros G. Kolliopoulos and   
                 Clifford Stein   Approximation Algorithms for
                                  Single-Source Unsplittable Flow  . . . . 919--946
            Michele Boreale and   
            Rocco De Nicola and   
               Rosario Pugliese   Proof Techniques for Cryptographic
                                  Processes  . . . . . . . . . . . . . . . 947--986
                   J. H. Rieger   Corrigendum: Proximity in Arrangements
                                  of Algebraic Sets  . . . . . . . . . . . 987--987
                    Alan Frieze   Corrigendum: Edge-Disjoint Paths in
                                  Expander Graphs  . . . . . . . . . . . . 988--988

SIAM Journal on Computing
Volume 31, Number 4, August, 2002

                Yoram Moses and   
                Sergio Rajsbaum   A Layered Analysis of Consensus  . . . . 989--1021
           Eduardo S. Laber and   
      Ruy L. Milidiú and   
                Artur A. Pessoa   On Binary Searching with Nonuniform
                                  Costs  . . . . . . . . . . . . . . . . . 1022--1047
                 Paul Beame and   
               Richard Karp and   
            Toniann Pitassi and   
                   Michael Saks   The Efficiency of Resolution and
                                  Davis--Putnam Procedures . . . . . . . . 1048--1075
        Christoph Dürr and   
                  Miklos Santha   A Decision Procedure for Unitary Linear
                                  Quantum Cellular Automata  . . . . . . . 1076--1089
                Uriel Feige and   
             Robert Krauthgamer   A Polylogarithmic Approximation of the
                                  Minimum Bisection  . . . . . . . . . . . 1090--1118
                Wolfgang Merkle   Lattice Embeddings for Abstract Bounded
                                  Reducibilities . . . . . . . . . . . . . 1119--1155
                   Alfons Geser   Decidability of Termination of Grid
                                  String Rewriting Rules . . . . . . . . . 1156--1168
              Rod G. Downey and   
       Denis R. Hirschfeldt and   
              André Nies   Randomness, Computability, and Density   1169--1183
        Michael Alekhnovich and   
             Eli Ben-Sasson and   
      Alexander A. Razborov and   
                  Avi Wigderson   Space Complexity in Propositional
                                  Calculus . . . . . . . . . . . . . . . . 1184--1211
              Thorsten Theobald   An Enumerative Geometry Framework for
                                  Algorithmic Line Problems in $\mathbb
                                  {R}^3$ . . . . . . . . . . . . . . . . . 1212--1228
              Leslie G. Valiant   Quantum Circuits That Can Be Simulated
                                  Classically in Polynomial Time . . . . . 1229--1254
             Zhi-Zhong Chen and   
                     Xin He and   
                 Chun-Hsi Huang   Finding Double Euler Trails of Planar
                                  Graphs in Linear Time  . . . . . . . . . 1255--1285
               Hagit Attiya and   
                Sergio Rajsbaum   The Combinatorial Structure of Wait-Free
                                  Solvable Tasks . . . . . . . . . . . . . 1286--1313

SIAM Journal on Computing
Volume 31, Number 5, October, 2002

          V. Chvátal and   
                 J. Fonlupt and   
                     L. Sun and   
                   A. Zemirline   Recognizing Dart-Free Perfect Graphs . . 1315--1338
               Yunhong Zhou and   
                   Subhash Suri   Algorithms for a Minimum Volume
                                  Enclosing Simplex in Three Dimensions    1339--1357
              Rocco A. Servedio   Perceptron, Winnow, and PAC Learning . . 1358--1369
            Baruch Awerbuch and   
                 Yossi Azar and   
           Stefano Leonardi and   
                     Oded Regev   Minimizing the Flow Time Without
                                  Migration  . . . . . . . . . . . . . . . 1370--1382
                  Moni Naor and   
              Omer Reingold and   
                     Alon Rosen   Pseudorandom Functions and Factoring . . 1383--1404
                R. Hiptmair and   
                   J. Ostrowski   Generators of
                                  $H_1(\Gamma_{h},\mathbb{Z})$ for
                                  Triangulated Surfaces: Construction and
                                  Classification . . . . . . . . . . . . . 1405--1423
            Anna Gál and   
               Adi Rosén   A Theorem on Sensitivity and
                                  Applications in Private Computation  . . 1424--1437
           F. M. Malvestuto and   
                     M. Mezzini   A Linear Algorithm for Finding the
                                  Invariant Edges of an Edge-Weighted
                                  Graph  . . . . . . . . . . . . . . . . . 1438--1455
               Alex Brodsky and   
             Nicholas Pippenger   Characterizations of $1$-Way Quantum
                                  Finite Automata  . . . . . . . . . . . . 1456--1478
        Joachim Gudmundsson and   
       Christos Levcopoulos and   
                Giri Narasimhan   Fast Greedy Algorithms for Constructing
                                  Sparse Geometric Spanners  . . . . . . . 1479--1500
            Adam R. Klivans and   
           Dieter van Melkebeek   Graph Nonisomorphism Has Subexponential
                                  Size Proofs Unless the Polynomial-Time
                                  Hierarchy Collapses  . . . . . . . . . . 1501--1526
                Martin Dyer and   
                Alan Frieze and   
                    Mark Jerrum   On Counting Independent Sets in Sparse
                                  Graphs . . . . . . . . . . . . . . . . . 1527--1541
                  Dieter Spreen   Safe Weak Minimization Revisited . . . . 1542--1556
                    Ilan Newman   Testing Membership in Languages that
                                  Have Small Width Branching Programs  . . 1557--1570
                Alain Mayer and   
           Rafail Ostrovsky and   
                 Yoram Ofek and   
                      Moti Yung   Self-Stabilizing Symmetry Breaking in
                                  Constant Space . . . . . . . . . . . . . 1571--1595
         Tomás Feder and   
             Rajeev Motwani and   
                    Carlos Subi   Approximating the Longest Cycle Problem
                                  in Sparse Graphs . . . . . . . . . . . . 1596--1607
                  Eran Halperin   Improved Approximation Algorithms for
                                  the Vertex Cover Problem in Graphs and
                                  Hypergraphs  . . . . . . . . . . . . . . 1608--1623
                   E. Boros and   
              K. Elbassioni and   
                 V. Gurvich and   
               L. Khachiyan and   
                      K. Makino   Dual-Bounded Generating Problems: All
                                  Minimal Integer Solutions for a Monotone
                                  System of Linear Inequalities  . . . . . 1624--1643

SIAM Journal on Computing
Volume 31, Number 6, December, 2002

          Alexander Russell and   
               Michael Saks and   
                David Zuckerman   Lower Bounds for Leader Election and
                                  Collective Coin-Flipping in the Perfect
                                  Information Model  . . . . . . . . . . . 1645--1662
       Venkatesan Guruswami and   
         Johan Håstad and   
                    Madhu Sudan   Hardness of Approximate Hypergraph
                                  Coloring . . . . . . . . . . . . . . . . 1663--1686
           Hsien-Kuei Hwang and   
                Ralph Neininger   Phase Change of Limit Laws in the
                                  Quicksort Recurrence under Varying Toll
                                  Functions  . . . . . . . . . . . . . . . 1687--1722
                 H. Buhrman and   
            P. B. Miltersen and   
           J. Radhakrishnan and   
                   S. Venkatesh   Are Bitvectors Optimal?  . . . . . . . . 1723--1744
          János Pach and   
            Gábor Tardos   On the Boundary Complexity of the Union
                                  of Fat Triangles . . . . . . . . . . . . 1745--1760
               Richard Cole and   
               Ramesh Hariharan   Approximate String Matching: a Simpler
                                  Faster Algorithm . . . . . . . . . . . . 1761--1782
           J. Könemann and   
                        R. Ravi   A Matter of Degree: Improved
                                  Approximation Algorithms for
                                  Degree-Bounded Minimum Spanning Trees    1783--1793
                Mayur Datar and   
           Aristides Gionis and   
                Piotr Indyk and   
                 Rajeev Motwani   Maintaining Stream Statistics over
                                  Sliding Windows  . . . . . . . . . . . . 1794--1813
          Pankaj K. Agarwal and   
              Therese Biedl and   
             Sylvain Lazard and   
              Steve Robbins and   
               Subhash Suri and   
                 Sue Whitesides   Curvature-Constrained Shortest Paths in
                                  a Convex Polygon . . . . . . . . . . . . 1814--1851
                  Yijie Han and   
                   Xiaojun Shen   Parallel Integer Sorting Is More
                                  Efficient Than Parallel Comparison
                                  Sorting on Exclusive Write PRAMs . . . . 1852--1878
                Seth Pettie and   
            Vijaya Ramachandran   A Randomized Time-Work Optimal Parallel
                                  Algorithm for Finding a Minimum Spanning
                                  Forest . . . . . . . . . . . . . . . . . 1879--1895
                    Martin Kutz   Lower Bounds for Lucas Chains  . . . . . 1896--1908
           Nader H. Bshouty and   
                 Yishay Mansour   Simple Learning Algorithms for Decision
                                  Trees and Multivariate Polynomials . . . 1909--1925
              Hanno Lefmann and   
                  Niels Schmitt   A Deterministic Polynomial-Time
                                  Algorithm for Heilbronn's Problem in
                                  Three Dimensions . . . . . . . . . . . . 1926--1947
         Edith Hemaspaandra and   
                  Gerd Wechsung   The Minimization Problem for Boolean
                                  Formulas . . . . . . . . . . . . . . . . 1948--1958


SIAM Journal on Computing
Volume 32, Number 1, February, 2002

                Ran Canetti and   
                 Joe Kilian and   
               Erez Petrank and   
                     Alon Rosen   Black-Box Concurrent Zero-Knowledge
                                  Requires (Almost) Logarithmically Many
                                  Rounds . . . . . . . . . . . . . . . . . 1--47
                 Peter Auer and   
      Nicol\`o Cesa-Bianchi and   
                Yoav Freund and   
             Robert E. Schapire   The Nonstochastic Multiarmed Bandit
                                  Problem  . . . . . . . . . . . . . . . . 48--77
                Idit Keidar and   
                   Roger Khazan   A Virtually Synchronous Group Multicast
                                  Algorithm for WANs: Formal Approach  . . 78--130
            Joan Feigenbaum and   
             Sampath Kannan and   
          Martin J. Strauss and   
             Mahesh Viswanathan   An Approximate $L^1$-Difference
                                  Algorithm for Massive Data Streams . . . 131--151
                    Luc Devroye   Limit Laws for Sums of Functions of
                                  Subtrees of Random Binary Search Trees   152--171
                Uriel Feige and   
Magnús M. Halldórsson and   
               Guy Kortsarz and   
             Aravind Srinivasan   Approximating the Domatic Number . . . . 172--195
          Etienne Grandjean and   
              Thomas Schwentick   Machine-Independent Characterizations
                                  and Complete Problems for Deterministic
                                  Linear Time  . . . . . . . . . . . . . . 196--230
                   Guy Even and   
               Sudipto Guha and   
                Baruch Schieber   Improved Approximations of Crossings in
                                  Graph Drawings and VLSI Layout Areas . . 231--252
                  Narayan Vikas   Computational Complexity of Compaction
                                  to Reflexive Cycles  . . . . . . . . . . 253--280

SIAM Journal on Computing
Volume 32, Number 2, April, 2003

               P. Flocchini and   
                 A. Roncato and   
                     N. Santoro   Backward Consistency and Sense of
                                  Direction in Advanced Distributed
                                  Systems  . . . . . . . . . . . . . . . . 281--306
           Csaba D. Tóth   Binary Space Partitions for Line
                                  Segments with a Limited Number of
                                  Directions . . . . . . . . . . . . . . . 307--325
                 Tom Bohman and   
                    Alan Frieze   Arc-Disjoint Paths in Expander Digraphs  326--344
                Uriel Feige and   
             Robert Krauthgamer   The Probable Value of the
                                  Lovász--Schrijver Relaxations for Maximum
                                  Independent Set  . . . . . . . . . . . . 345--370
                 David Gamarnik   Stability of Adaptive and Nonadaptive
                                  Packet Routing Policies in Adversarial
                                  Queueing Networks  . . . . . . . . . . . 371--385
                 John Ellis and   
              Stirling Chow and   
                   Dennis Manke   Many to One Embeddings from Grids into
                                  Cylinders, Tori, and Hypercubes  . . . . 386--407
             Zhi-Zhong Chen and   
                     Xin He and   
                  Ming-Yang Kao   Common-Face Embeddings of Planar Graphs  408--434
                B. Mourrain and   
                  V. Y. Pan and   
                      O. Ruatta   Accelerated Solution of Multivariate
                                  Polynomial Systems of Equations  . . . . 435--454
           Steven S. Seiden and   
               Rob van Stee and   
                   Leah Epstein   New Bounds for Variable-Sized Online Bin
                                  Packing  . . . . . . . . . . . . . . . . 455--469
              Samir Khuller and   
             Randeep Bhatia and   
                   Robert Pless   On Local Search and Placement of Meters
                                  in Networks  . . . . . . . . . . . . . . 470--487
                    Ran Raz and   
                   Amir Shpilka   Lower Bounds for Matrix Product in
                                  Bounded Depth Circuits with Arbitrary
                                  Gates  . . . . . . . . . . . . . . . . . 488--513
               Thomas Eiter and   
              Georg Gottlob and   
                Kazuhisa Makino   New Results on Monotone Dualization and
                                  Generating Hypergraph Transversals . . . 514--537
         Tomás Feder and   
             Rajeev Motwani and   
             Rina Panigrahy and   
               Chris Olston and   
                 Jennifer Widom   Computing the Median with Uncertainty    538--547
                Xinmao Wang and   
                  Victor Y. Pan   Acceleration of Euclidean Algorithm and
                                  Rational Number Reconstruction . . . . . 548--556

SIAM Journal on Computing
Volume 32, Number 3, June, 2003

               Hasan Çam   Rearrangeability of $(2n-1)$-Stage
                                  Shuffle-Exchange Networks  . . . . . . . 557--585
                  Dan Boneh and   
               Matthew Franklin   Identity-Based Encryption from the Weil
                                  Pairing  . . . . . . . . . . . . . . . . 586--615
             Vladlen Koltun and   
                   Micha Sharir   3-Dimensional Euclidean Voronoi Diagrams
                                  of Lines with a Fixed Number of
                                  Orientations . . . . . . . . . . . . . . 616--642
                 David Eppstein   Setting Parameters by Example  . . . . . 643--653
       Stephan J. Eidenbenz and   
                 Peter Widmayer   An Approximation Algorithm for Minimum
                                  Convex Cover with Logarithmic
                                  Performance Guarantee  . . . . . . . . . 654--670
               Oliver Braun and   
            Günter Schmidt   Parallel Processor Scheduling with
                                  Limited Number of Preemptions  . . . . . 671--680
                 Ronald de Wolf   Nondeterministic Quantum Query and
                                  Communication Complexities . . . . . . . 681--699
                Timothy M. Chan   Semi-Online Maintenance of Geometric
                                  Optima and Measures  . . . . . . . . . . 700--716
          John F. Rudin III and   
              R. Chandrasekaran   Improved Bounds for the Online
                                  Scheduling Problem . . . . . . . . . . . 717--735
             Thore Husfeldt and   
                    Theis Rauhe   New Lower Bound Techniques for Dynamic
                                  Partial Sums and Related Problems  . . . 736--753
           Nadia El-Mabrouk and   
                  David Sankoff   The Reconstruction of Doubled Genomes    754--792
                 Sunil Arya and   
                 Ho-Yam Addy Fu   Expected-Case Complexity of Approximate
                                  Nearest Neighbor Searching . . . . . . . 793--815
          Ramgopal R. Mettu and   
                C. Greg Plaxton   The Online Median Problem  . . . . . . . 816--832

SIAM Journal on Computing
Volume 32, Number 4, August, 2003

                   Satoru Iwata   A Faster Scaling Algorithm for
                                  Minimizing Submodular Functions  . . . . 833--840
             Vladlen Koltun and   
                   Micha Sharir   The Partition Technique for Overlays of
                                  Envelopes  . . . . . . . . . . . . . . . 841--863
             Zhi-Zhong Chen and   
                  Tao Jiang and   
                     Guohui Lin   Computing Phylogenetic Roots with
                                  Bounded Degrees and Errors . . . . . . . 864--879
             Jens Liebehenschel   Lexicographical Generation of a
                                  Generalized Dyck Language  . . . . . . . 880--903
             Hua-Huai Chern and   
               Hsien-Kuei Hwang   Partial Match Queries in Random
                                  Quadtrees  . . . . . . . . . . . . . . . 904--915
              Sean Hallgren and   
          Alexander Russell and   
                  Amnon Ta-Shma   The Hidden Subgroup Problem and Quantum
                                  Computation Using Group Representations  916--934
                 Michael Molloy   Models for Random Constraint
                                  Satisfaction Problems  . . . . . . . . . 935--949
           Joost Engelfriet and   
               Sebastian Maneth   Macro Tree Translations of Linear Size
                                  Increase are MSO Definable . . . . . . . 950--1006
                Injong Rhee and   
              Jennifer L. Welch   The Impact of Timing Knowledge on the
                                  Session Problem  . . . . . . . . . . . . 1007--1039
                Hung Q. Ngo and   
                      Van H. Vu   Multirate Rearrangeable Clos Networks
                                  and a Generalized Edge-Coloring Problem
                                  on Bipartite Graphs  . . . . . . . . . . 1040--1049
            Joseph Cheriyan and   
            Santosh Vempala and   
                   Adrian Vetta   An Approximation Algorithm for the
                                  Minimum-Cost $k$-Vertex Connected
                                  Subgraph . . . . . . . . . . . . . . . . 1050--1055
               Richard Cole and   
               Ramesh Hariharan   Tree Pattern Matching to Subset Matching
                                  in Linear Time . . . . . . . . . . . . . 1056--1066
           Mario Valencia-Pabon   Revisiting Tucker's Algorithm to Color
                                  Circular Arc Graphs  . . . . . . . . . . 1067--1072
               Xiaotie Deng and   
                  Guojun Li and   
                   Zimao Li and   
                     Bin Ma and   
                   Lusheng Wang   Genetic Design of Drugs Without
                                  Side-Effects . . . . . . . . . . . . . . 1073--1090
              Amotz Bar-Noy and   
              Richard E. Ladner   Windows Scheduling Problems for
                                  Broadcast Systems  . . . . . . . . . . . 1091--1113

SIAM Journal on Computing
Volume 32, Number 5, October, 2003

David Fernández-Baca and   
                 Jens Lagergren   A Polynomial-Time Algorithm for
                                  Near-Perfect Phylogeny . . . . . . . . . 1115--1127
              Martin Kochol and   
                Vadim Lozin and   
                 Bert Randerath   The 3-Colorability Problem on Graphs
                                  with Maximum Degree Four . . . . . . . . 1128--1139
                 Scott Aaronson   Algorithms for Boolean Function Query
                                  Properties . . . . . . . . . . . . . . . 1140--1157
              Michal Parnas and   
                   Dana Ron and   
               Ronitt Rubinfeld   On Testing Convexity and Submodularity   1158--1184
                   Amir Shpilka   Lower Bounds for Matrix Product  . . . . 1185--1200
                  Jian Shen and   
                   Li Sheng and   
                         Jie Wu   Searching for Sorted Sequences of Kings
                                  in Tournaments . . . . . . . . . . . . . 1201--1209
              Y. Kohayakawa and   
               V. Rödl and   
                       L. Thoma   An Optimal Algorithm for Checking
                                  Regularity . . . . . . . . . . . . . . . 1210--1235
                   Jack H. Lutz   Dimension in Complexity Classes  . . . . 1236--1259
           Petra Berenbrink and   
             Tom Friedetzky and   
            Leslie Ann Goldberg   The Natural Work-Stealing Algorithm is
                                  Stable . . . . . . . . . . . . . . . . . 1260--1279
        Markus Püschel and   
        José M. F. Moura   The Algebraic Approach to the Discrete
                                  Cosine and Sine Transforms and Their
                                  Fast Algorithms  . . . . . . . . . . . . 1280--1316
              Sanjeev Arora and   
              George Karakostas   Approximation Schemes for Minimum
                                  Latency Problems . . . . . . . . . . . . 1317--1337
                Edith Cohen and   
              Eran Halperin and   
                Haim Kaplan and   
                      Uri Zwick   Reachability and Distance Queries via
                                  $2$-Hop Labels . . . . . . . . . . . . . 1338--1355
                        Ran Raz   On the Complexity of Matrix Product  . . 1356--1369
         Joseph Y.-T. Leung and   
                 Michael Pinedo   Minimizing Total Completion Time on
                                  Parallel Machines with Deadline
                                  Constraints  . . . . . . . . . . . . . . 1370--1388
                   Oliver Glier   Kolmogorov Complexity and Deterministic
                                  Context-Free Languages . . . . . . . . . 1389--1394

SIAM Journal on Computing
Volume 32, Number 6, December, 2003

     Andreas Björklund and   
                 Thore Husfeldt   Finding a Path of Superlogarithmic
                                  Length . . . . . . . . . . . . . . . . . 1395--1402
                  Amos Fiat and   
                   Manor Mendel   Better Algorithms for Unfair Metrical
                                  Task Systems and Applications  . . . . . 1403--1422
               Tetsuo Asano and   
                Naoki Katoh and   
               Koji Obokata and   
               Takeshi Tokuyama   Matrix Rounding under the
                                  $L_p$-Discrepancy Measure and Its
                                  Application to Digital Halftoning  . . . 1423--1435
     Joachim von zur Gathen and   
           Igor Shparlinski and   
              Alistair Sinclair   Finding Points on Curves over Finite
                                  Fields . . . . . . . . . . . . . . . . . 1436--1448
               John H. Reif and   
                      Zheng Sun   On Frictional Mechanical Systems and
                                  Their Computational Power  . . . . . . . 1449--1474
                 Vince Grolmusz   Computing Elementary Symmetric
                                  Polynomials with a Subpolynomial Number
                                  of Multiplications . . . . . . . . . . . 1475--1487
                  Lars Arge and   
           Jeffrey Scott Vitter   Optimal External Memory Interval
                                  Management . . . . . . . . . . . . . . . 1488--1508


SIAM Journal on Computing
Volume 33, Number 1, February, 2003

    Fabián A. Chudak and   
                David B. Shmoys   Improved Approximation Algorithms for
                                  the Uncapacitated Facility Location
                                  Problem  . . . . . . . . . . . . . . . . 1--25
               Richard Cole and   
               Ramesh Hariharan   Faster Suffix Tree Construction with
                                  Missing Suffix Links . . . . . . . . . . 26--42
            Juraj Hromkovic and   
                Georg Schnitger   Nondeterministic Communication with a
                                  Limited Number of Advice Bits  . . . . . 43--68
             Siu-Wing Cheng and   
                   Tamal K. Dey   Quality Meshing with Weighted Delaunay
                                  Refinement . . . . . . . . . . . . . . . 69--93
                   Guy Even and   
                 Zvi Lotker and   
                   Dana Ron and   
            Shakhar Smorodinsky   Conflict-Free Colorings of Simple
                                  Geometric Regions with Applications to
                                  Frequency Assignment in Cellular
                                  Networks . . . . . . . . . . . . . . . . 94--136
 László Babai and   
            Anna Gál and   
            Peter G. Kimmel and   
         Satyanarayana V. Lokam   Communication Complexity of Simultaneous
                                  Messages . . . . . . . . . . . . . . . . 137--166
              Ronald Cramer and   
                   Victor Shoup   Design and Analysis of Practical
                                  Public-Key Encryption Schemes Secure
                                  against Adaptive Chosen Ciphertext
                                  Attack . . . . . . . . . . . . . . . . . 167--226
       Peter Bürgisser and   
                  Felipe Cucker   Counting Complexity Classes for Numeric
                                  Computations I: Semilinear Sets  . . . . 227--260

SIAM Journal on Computing
Volume 33, Number 2, April, 2004

              Refael Hassin and   
                     Asaf Levin   An Efficient Polynomial Time
                                  Approximation Scheme for the Constrained
                                  Minimum Spanning Tree Problem Using
                                  Matroid Intersection . . . . . . . . . . 261--268
           Sariel Har-Peled and   
                      Yusu Wang   Shape Fitting with Outliers  . . . . . . 269--285
                 Zvi Lotker and   
           Boaz Patt-Shamir and   
               Adi Rosén   New Stability Results for Adversarial
                                  Queuing  . . . . . . . . . . . . . . . . 286--303
               Iiro Honkala and   
                  Tero Laihonen   On Identifying Codes in the Triangular
                                  and Square Grids . . . . . . . . . . . . 304--312
        Leslie Ann Goldberg and   
                Mark Jerrum and   
             Sampath Kannan and   
                  Mike Paterson   A Bound on the Capacity of Backoff and
                                  Acknowledgment-Based Protocols . . . . . 313--331
                Tim Roughgarden   Stackelberg Scheduling Strategies  . . . 332--350
              Georg Gottlob and   
               Reinhard Pichler   Hypergraphs in Model Checking:
                                  Acyclicity and Hypertree-Width versus
                                  Clique-Width . . . . . . . . . . . . . . 351--378
         William Y. C. Chen and   
                Xueliang Li and   
                  Chao Wang and   
                  Xiaoyan Zhang   The Minimum All-Ones Problem for Trees   379--392
       Rolf H. Möhring and   
            Martin Skutella and   
                 Frederik Stork   Scheduling with AND/OR Precedence
                                  Constraints  . . . . . . . . . . . . . . 393--415
        Leslie Ann Goldberg and   
                Steven Kelk and   
                  Mike Paterson   The Complexity of Choosing an
                                  ${H}$-Coloring (Nearly) Uniformly at
                                  Random . . . . . . . . . . . . . . . . . 416--432
             Kazuyuki Amano and   
                  Akira Maruoka   The Potential of the Approximation
                                  Method . . . . . . . . . . . . . . . . . 433--447
              Samir Khuller and   
                 Yoo-Ah Kim and   
         Yung-Chun (Justin) Wan   Algorithms for Data Migration with
                                  Cloning  . . . . . . . . . . . . . . . . 448--461
           Christian Icking and   
                 Rolf Klein and   
            Elmar Langetepe and   
             Sven Schuierer and   
                    Ines Semrau   An Optimal Competitive Strategy for
                                  Walking in Streets . . . . . . . . . . . 462--486
                  Noga Alon and   
             Richard Beigel and   
                Simon Kasif and   
              Steven Rudich and   
                  Benny Sudakov   Learning a Hidden Matching . . . . . . . 487--501
              Victor Y. Pan and   
                    Xinmao Wang   On Rational Number Reconstruction and
                                  Approximation  . . . . . . . . . . . . . 502--503

SIAM Journal on Computing
Volume 33, Number 3, June, 2004

                    Alan Siegel   On Universal Classes of Extremely Random
                                  Constant-Time Hash Functions . . . . . . 505--543
                 Vijay Arya and   
                Naveen Garg and   
            Rohit Khandekar and   
              Adam Meyerson and   
            Kamesh Munagala and   
                Vinayaka Pandit   Local Search Heuristics for $k$-Median
                                  and Facility Location Problems . . . . . 544--562
        Alexander Kesselman and   
                 Zvi Lotker and   
             Yishay Mansour and   
           Boaz Patt-Shamir and   
            Baruch Schieber and   
               Maxim Sviridenko   Buffer Overflow Management in QoS
                                  Switches . . . . . . . . . . . . . . . . 563--583
                  Xiao Chen and   
                      Jian Shen   On the Frame--Stewart Conjecture about
                                  the Towers of Hanoi  . . . . . . . . . . 584--589
                Itsik Pe'er and   
                  Tal Pupko and   
                 Ron Shamir and   
                   Roded Sharan   Incomplete Directed Perfect Phylogeny    590--607
              Michael Elkin and   
                    David Peleg   $(1 + \epsilon,\beta)$-Spanner
                                  Constructions for General Graphs . . . . 608--631
          Adam L. Buchsbaum and   
             Howard Karloff and   
              Claire Kenyon and   
              Nick Reingold and   
                  Mikkel Thorup   \em OPT Versus \em LOAD in Dynamic
                                  Storage Allocation . . . . . . . . . . . 632--646
                Luc Devroye and   
                Ralph Neininger   Distances and Finger Search in Random
                                  Binary Search Trees  . . . . . . . . . . 647--658
            Matthew Andrews and   
                     Lisa Zhang   The Effects of Temporary Sessions on
                                  Network Performance  . . . . . . . . . . 659--673
          Joseph Y. Halpern and   
         Ron van der Meyden and   
                 Moshe Y. Vardi   Complete Axiomatizations for Reasoning
                                  about Knowledge and Time . . . . . . . . 674--703
               Guy Kortsarz and   
         Robert Krauthgamer and   
                   James R. Lee   Hardness of Approximation for
                                  Vertex-Connectivity Network Design
                                  Problems . . . . . . . . . . . . . . . . 704--720
                 Michael Molloy   The Glauber Dynamics on Colorings of a
                                  Graph with High Girth and Maximum Degree 721--737
                     Oded Regev   Quantum Computation and Lattice Problems 738--760

SIAM Journal on Computing
Volume 33, Number 4, August, 2004

                  Narayan Vikas   Compaction, Retraction, and Constraint
                                  Satisfaction . . . . . . . . . . . . . . 761--782
                 Boaz Barak and   
                 Yehuda Lindell   Strict Polynomial-Time in Simulation and
                                  Extraction . . . . . . . . . . . . . . . 783--818
             Jesus De Loera and   
                     Shmuel Onn   The Complexity of Three-Way Statistical
                                  Tables . . . . . . . . . . . . . . . . . 819--836
            Chandra Chekuri and   
                 Sanjeev Khanna   On Multidimensional Packing Problems . . 837--851
            N. V. Vinodchandran   Counting Complexity of Solvable
                                  Black-Box Group Problems . . . . . . . . 852--869
        Dariusz R. Kowalski and   
                   Andrzej Pelc   Time of Deterministic Broadcasting in
                                  Radio Networks with Local Knowledge  . . 870--891
             Jörg Flum and   
                   Martin Grohe   The Parameterized Complexity of Counting
                                  Problems . . . . . . . . . . . . . . . . 892--922
                Luc Devroye and   
                  Pat Morin and   
                  Alfredo Viola   On Worst-Case Robin Hood Hashing . . . . 923--936
             Prosenjit Bose and   
                      Pat Morin   Online Routing in Triangulations . . . . 937--951
             Werner Schachinger   Distributional Results for Costs of
                                  Partial Match Queries in Asymmetric
                                  ${K}$-Dimensional Tries  . . . . . . . . 952--983
                 Jin-Yi Cai and   
                 Osamu Watanabe   On Proving Circuit Lower Bounds against
                                  the Polynomial-Time Hierarchy  . . . . . 984--1009

SIAM Journal on Computing
Volume 33, Number 5, October, 2004

              Amotz Bar-Noy and   
              Richard E. Ladner   Efficient Algorithms for Optimal Stream
                                  Merging for Media-on-Demand  . . . . . . 1011--1034
    György Dósa and   
                        Yong He   Better Online Algorithms for Scheduling
                                  with Machine Cost  . . . . . . . . . . . 1035--1051
             Joachim Biskup and   
              Jan Paredaens and   
          Thomas Schwentick and   
            Jan Van den Bussche   Solving Equations in the Relational
                                  Algebra  . . . . . . . . . . . . . . . . 1052--1066
          Rocco A. Servedio and   
              Steven J. Gortler   Equivalences and Separations Between
                                  Quantum and Classical Learnability . . . 1067--1092
            Jacobo Torán   On the Hardness of Graph Isomorphism . . 1093--1108
        André van Tonder   A Lambda Calculus for Quantum
                                  Computation  . . . . . . . . . . . . . . 1109--1135
               Guantao Chen and   
                     Jun Xu and   
                    Xingxing Yu   Circumference of Graphs with Bounded
                                  Degree . . . . . . . . . . . . . . . . . 1136--1170
           Nathan Segerlind and   
                   Sam Buss and   
            Russell Impagliazzo   A Switching Lemma for Small Restrictions
                                  and Lower Bounds for $k$-DNF Resolution  1171--1200
             James B. Orlin and   
          Abraham P. Punnen and   
              Andreas S. Schulz   Approximate Local Search in
                                  Combinatorial Optimization . . . . . . . 1201--1214
                  John Havlicek   A Note on the Homotopy Type of Wait-Free
                                  Atomic Snapshot Protocol Complexes . . . 1215--1222
             Paul W. Purdom and   
             Dirk Van Gucht and   
                Dennis P. Groth   Average-Case Performance of the Apriori
                                  Algorithm  . . . . . . . . . . . . . . . 1223--1260

SIAM Journal on Computing
Volume 33, Number 6, December, 2004

                Yair Bartal and   
              John W. Byers and   
                      Danny Raz   Fast, Distributed Approximation
                                  Algorithms for Positive Linear
                                  Programming with Applications to Flow
                                  Control  . . . . . . . . . . . . . . . . 1261--1279
             Uwe Schwiegelshohn   Preemptive Weighted Completion Time
                                  Scheduling of Parallel Jobs  . . . . . . 1280--1308
       Lane A. Hemaspaandra and   
              Harald Hempel and   
                Arfst Nickelsen   Algebraic Properties for Selector
                                  Functions  . . . . . . . . . . . . . . . 1309--1337
                Uriel Feige and   
           Michael Langberg and   
              Gideon Schechtman   Graphs with Tiny Vector Chromatic
                                  Numbers and Huge Chromatic Numbers . . . 1338--1368
          Christian Glasser and   
             Alan L. Selman and   
             Samik Sengupta and   
                     Liyu Zhang   Disjoint NP-Pairs  . . . . . . . . . . . 1369--1416
             Moses Charikar and   
            Chandra Chekuri and   
                Tomas Feder and   
                 Rajeev Motwani   Incremental Clustering and Dynamic
                                  Information Retrieval  . . . . . . . . . 1417--1440
               Tali Kaufman and   
        Michael Krivelevich and   
                       Dana Ron   Tight Bounds for Testing Bipartiteness
                                  in General Graphs  . . . . . . . . . . . 1441--1483
           Marek Piotrów   Depth Optimal Sorting Networks Resistant
                                  to $k$ Passive Faults  . . . . . . . . . 1484--1512
            Pierre McKenzie and   
           Heribert Vollmer and   
                Klaus W. Wagner   Arithmetic Circuits and Polynomial
                                  Replacement Systems  . . . . . . . . . . 1513--1531


SIAM Journal on Computing
Volume 34, Number 1, February, 2004

             Karhan Akcoglu and   
             Petros Drineas and   
                  Ming-Yang Kao   Fast Universalization of Investment
                                  Strategies . . . . . . . . . . . . . . . 1--22
                Michal Katz and   
                Nir A. Katz and   
                Amos Korman and   
                    David Peleg   Labeling Schemes for Flow and
                                  Connectivity . . . . . . . . . . . . . . 23--40
            Carme \`Alvarez and   
                Maria Blesa and   
                    Maria Serna   A Characterization of Universal
                                  Stability in the Adversarial Queuing
                                  Model  . . . . . . . . . . . . . . . . . 41--66
        Michael Alekhnovich and   
             Eli Ben-Sasson and   
      Alexander A. Razborov and   
                  Avi Wigderson   Pseudorandom Generators in Propositional
                                  Proof Complexity . . . . . . . . . . . . 67--88
              Lars Ivansson and   
                 Jens Lagergren   Algorithms for RH Mapping: New Ideas and
                                  Improved Analysis  . . . . . . . . . . . 89--108
            Stefan Hougardy and   
                Annegret Wagler   Perfectness is an Elusive Graph Property 109--117
             Daniele Micciancio   Almost Perfect Lattices, the Covering
                                  Radius Problem, and Applications to
                                  Ajtai's Connection Factor  . . . . . . . 118--169
              John M. Hitchcock   Small Spans in Scaled Dimension  . . . . 170--194
                 Ben Morris and   
              Alistair Sinclair   Random Walks on Truncated Cubes and
                                  Sampling $0$-$1$ Knapsack Solutions  . . 195--226
                Edith Cohen and   
                    Haim Kaplan   Balanced-Replication Algorithms for
                                  Distribution Trees . . . . . . . . . . . 227--247
                Yair Bartal and   
                   Manor Mendel   Multiembedding of Metric Spaces  . . . . 248--259

SIAM Journal on Computing
Volume 34, Number 2, April, 2004

    Joshua Buresh-Oppenheim and   
                 Paul Beame and   
            Toniann Pitassi and   
                    Ran Raz and   
               Ashish Sabharwal   Bounded-Depth Frege Lower Bounds for
                                  Weaker Pigeonhole Principles . . . . . . 261--276
             Markus Bläser   A Complete Characterization of the
                                  Algebras of Minimal Bilinear Complexity  277--298
                 Benjamin Doerr   Nonindependent Randomized Rounding and
                                  an Application to Digital Halftoning . . 299--317
        Rajat Bhattacharjee and   
                Ashish Goel and   
                     Zvi Lotker   Instability of FIFO at Arbitrarily Low
                                  Rates in the Adversarial Queueing Model  318--332
             Tushar Chandra and   
          Vassos Hadzilacos and   
             Prasad Jayanti and   
                      Sam Toueg   Generalized Irreducibility of Consensus
                                  and the Equivalence of $t$-Resilient and
                                  Wait-Free Implementations of Consensus   333--357
            Gruia Calinescu and   
             Howard Karloff and   
                   Yuval Rabani   Approximation Algorithms for the
                                  $0$-Extension Problem  . . . . . . . . . 358--372
              Kai-min Chung and   
                     Hsueh-I Lu   An Optimal Algorithm for the
                                  Maximum-Density Segment Problem  . . . . 373--387
                 Satish Rao and   
         Andréa W. Richa   New Approximation Techniques for Some
                                  Linear Ordering Problems . . . . . . . . 388--404
                  Mikkel Thorup   Quick $k$-Median, $k$-Center, and
                                  Facility Location for Sparse Graphs  . . 405--432
           S. Muthukrishnan and   
         Rajmohan Rajaraman and   
            Anthony Shaheen and   
             Johannes E. Gehrke   Online Scheduling to Minimize Average
                                  Stretch  . . . . . . . . . . . . . . . . 433--452
               Anupam Gupta and   
                 Amit Kumar and   
                 Rajeev Rastogi   Traveling with a Pez Dispenser (or,
                                  Routing Issues in MPLS)  . . . . . . . . 453--474
              Volker Kaibel and   
             Rafael Mechtel and   
               Micha Sharir and   
         Günter M. Ziegler   The Simplex Algorithm in Dimension Three 475--497
          Yasunori Ishihara and   
                 Shin Ishii and   
              Hiroyuki Seki and   
                     Minoru Ito   Temporal Reasoning about Two Concurrent
                                  Sequences of Events  . . . . . . . . . . 498--513

SIAM Journal on Computing
Volume 34, Number 3, June, 2005

             Raimund Seidel and   
                   Micha Sharir   Top-Down Analysis of Path Compression    515--525
          Pankaj K. Agarwal and   
                   Micha Sharir   Pseudo-Line Arrangements: Duality,
                                  Algorithms, and Applications . . . . . . 526--552
              Vida Dujmovic and   
                  Pat Morin and   
                  David R. Wood   Layout of Graphs with Bounded Tree-Width 553--579
               Artur Czumaj and   
               Christian Sohler   Abstract Combinatorial Programs and
                                  Efficient Property Testers . . . . . . . 580--615
       Aris Anagnostopoulos and   
                Adam Kirsch and   
                      Eli Upfal   Load Balancing in Arbitrary Network
                                  Topologies with Stochastic Adversarial
                                  Input  . . . . . . . . . . . . . . . . . 616--639
      Nicol\`o Cesa-Bianchi and   
               Alex Conconi and   
                Claudio Gentile   A Second-Order Perceptron Algorithm  . . 640--668
              Ho-Leung Chan and   
                Tak-Wah Lam and   
                   Kar-Keung To   Nonmigratory Online Deadline Scheduling
                                  on Multiprocessors . . . . . . . . . . . 669--682
              Huaming Zhang and   
                         Xin He   On Even Triangulations of $2$-Connected
                                  Embedded Graphs  . . . . . . . . . . . . 683--696
       Bala Kalyanasundaram and   
                  Kirk R. Pruhs   Fault-Tolerant Scheduling  . . . . . . . 697--719
             Andrei Bulatov and   
              Peter Jeavons and   
                 Andrei Krokhin   Classifying the Complexity of
                                  Constraints Using Finite Algebras  . . . 720--742
                  Yumei Huo and   
             Joseph Y.-T. Leung   Online Scheduling of Precedence
                                  Constrained Tasks  . . . . . . . . . . . 743--762
           J. Könemann and   
                        R. Ravi   Primal-Dual Meets Local Search:
                                  Approximating MSTs With Nonuniform
                                  Degree Bounds  . . . . . . . . . . . . . 763--773

SIAM Journal on Computing
Volume 34, Number 4, August, 2005

                     Alon Efrat   The Complexity of the Union of
                                  $(\alpha,\beta)$-Covered Objects . . . . 775--787
            Martin Skutella and   
                      Marc Uetz   Stochastic Machine Scheduling with
                                  Precedence Constraints . . . . . . . . . 788--802
             Moses Charikar and   
                   Sudipto Guha   Improved Combinatorial Algorithms for
                                  Facility Location Problems . . . . . . . 803--824
           Derek G. Corneil and   
                     Udi Rotics   On the Relationship Between Clique-Width
                                  and Treewidth  . . . . . . . . . . . . . 825--847
          Chryssis Georgiou and   
          Alexander Russell and   
        Alexander A. Shvartsman   Work-Competitive Scheduling for
                                  Cooperative Computing with Dynamic
                                  Groups . . . . . . . . . . . . . . . . . 848--862
             Vladlen Koltun and   
                   Micha Sharir   Curve-Sensitive Cuttings . . . . . . . . 863--878
                Timothy M. Chan   Low-Dimensional Linear Programming with
                                  Violations . . . . . . . . . . . . . . . 879--893
               Richard Cole and   
               Ramesh Hariharan   Dynamic LCA Queries on Trees . . . . . . 894--923
             Yi-Ting Chiang and   
              Ching-Chi Lin and   
                     Hsueh-I Lu   Orderly Spanning Trees with Applications 924--945
            Anna Gál and   
               Adi Rosén   $\Omega(\log n)$ Lower Bounds on the
                                  Amount of Randomness in $2$-Private
                                  Computation  . . . . . . . . . . . . . . 946--959
               Michael Kaminski   A Lower Bound on the Complexity of
                                  Polynomial Multiplication over Finite
                                  Fields . . . . . . . . . . . . . . . . . 960--992
              Grzegorz Malewicz   A Work-Optimal Deterministic Algorithm
                                  for the Certified Write-All Problem with
                                  a Nontrivial Number of Asynchronous
                                  Processors . . . . . . . . . . . . . . . 993--1024

SIAM Journal on Computing
Volume 34, Number 5, October, 2005

Géraud Sénizergues   The Bisimulation Problem for Equational
                                  Graphs of Finite Out-Degree  . . . . . . 1025--1106
         Jeffrey C. Jackson and   
              Rocco A. Servedio   Learning Random Log-Depth Decision Trees
                                  under Uniform Distribution . . . . . . . 1107--1128
                 Irit Dinur and   
       Venkatesan Guruswami and   
               Subhash Khot and   
                     Oded Regev   A New Multilayered PCP and the Hardness
                                  of Hypergraph Vertex Cover . . . . . . . 1129--1146
                  Eldar Fischer   The Difficulty of Testing for
                                  Isomorphism against a Graph That Is
                                  Given in Advance . . . . . . . . . . . . 1147--1158
            Kousha Etessami and   
               Thomas Wilke and   
            Rebecca A. Schuller   Fair Simulation Relations, Parity Games,
                                  and State Space Reduction for Büchi
                                  Automata . . . . . . . . . . . . . . . . 1159--1175
            Arfst Nickelsen and   
                    Till Tantau   The Complexity of Finding Paths in
                                  Graphs with Bounded Independence Number  1176--1195
                Amos Beimel and   
                   Enav Weinreb   Separating the Power of Monotone Span
                                  Programs over Different Fields . . . . . 1196--1215
         Panagiota Fatourou and   
        Marios Mavronicolas and   
                  Paul Spirakis   Efficiency of Oblivious versus
                                  Nonoblivious Schedulers for Optimistic,
                                  Rate-based Flow Control  . . . . . . . . 1216--1252
          Annalisa De Bonis and   
           Leszek Gasieniec and   
                    Ugo Vaccaro   Optimal Two-Stage Algorithms for Group
                                  Testing Problems . . . . . . . . . . . . 1253--1270
             Frank K. Hwang and   
                    Yong He and   
                      Yang Wang   Strictly Nonblocking Multirate
                                  $\log_d(N,m,p)$ Networks . . . . . . . . 1271--1278

SIAM Journal on Computing
Volume 34, Number 6, December, 2005

                Mark McCann and   
             Nicholas Pippenger   SRT Division Algorithms as Dynamical
                                  Systems  . . . . . . . . . . . . . . . . 1279--1301
            Thomas Erlebach and   
               Klaus Jansen and   
                    Eike Seidel   Polynomial-Time Approximation Schemes
                                  for Geometric Intersection Graphs  . . . 1302--1323
              Harry Buhrman and   
        Christoph Dürr and   
             Mark Heiligman and   
         Peter Hòyer and   
Frédéric Magniez and   
              Miklos Santha and   
                 Ronald de Wolf   Quantum Algorithms for Element
                                  Distinctness . . . . . . . . . . . . . . 1324--1330
                Esther Ezra and   
                   Micha Sharir   Output-Sensitive Construction of the
                                  Union of Triangles . . . . . . . . . . . 1331--1351
         Edith Hemaspaandra and   
       Lane A. Hemaspaandra and   
                  Harald Hempel   Extending Downward Collapse from
                                  $1$-versus-$2$ Queries to $m$-versus-$m
                                  + 1$ Queries . . . . . . . . . . . . . . 1352--1369
           Bernard Chazelle and   
           Ronitt Rubinfeld and   
                  Luca Trevisan   Approximating the Minimum Spanning Tree
                                  Weight in Sublinear Time . . . . . . . . 1370--1379
           John Hershberger and   
               Subhash Suri and   
           Csaba D. Tóth   Binary Space Partitions of Orthogonal
                                  Subdivisions . . . . . . . . . . . . . . 1380--1397
                Seth Pettie and   
            Vijaya Ramachandran   A Shortest Path Algorithm for
                                  Real-Weighted Undirected Graphs  . . . . 1398--1431
                       Qi Cheng   On the Bounded Sum-of-Digits Discrete
                                  Logarithm Problem in Finite Fields . . . 1432--1442
        David A. Hutchinson and   
              Peter Sanders and   
           Jeffrey Scott Vitter   Duality Between Prefetching and Queued
                                  Writing with Parallel Disks  . . . . . . 1443--1463
         Vincent D. Blondel and   
           Emmanuel Jeandel and   
              Pascal Koiran and   
                Natacha Portier   Decidable and Undecidable Problems about
                                  Quantum Automata . . . . . . . . . . . . 1464--1473
                Qingmin Shi and   
                    Joseph JaJa   Novel Transformation Techniques Using
                                  Q-Heaps with Applications to
                                  Computational Geometry . . . . . . . . . 1474--1492
             Gagan Aggarwal and   
                   Qi Cheng and   
      Michael H. Goldwasser and   
              Ming-Yang Kao and   
   Pablo Moisset de Espanes and   
            Robert T. Schweller   Complexities for Generalized Models of
                                  Self-Assembly  . . . . . . . . . . . . . 1493--1515
               Reuven Cohen and   
                    David Peleg   Convergence Properties of the
                                  Gravitational Algorithm in Asynchronous
                                  Robot Systems  . . . . . . . . . . . . . 1516--1528


SIAM Journal on Computing
Volume 35, Number 1, 2005

             Eli Ben-Sasson and   
            Prahladh Harsha and   
            Sofya Raskhodnikova   Some 3CNF Properties Are Hard to Test    1--21
         Michael Lindenbaum and   
                Hanan Samet and   
             Gisli R. Hjaltason   A Probabilistic Analysis of Trie-Based
                                  Sorting of Large Collections of Line
                                  Segments in Spatial Databases  . . . . . 22--58
       Dieter van Melkebeek and   
                Rahul Santhanam   Holographic Proofs and Derandomization   59--90
               Artur Czumaj and   
           Funda Ergün and   
              Lance Fortnow and   
                Avner Magen and   
                Ilan Newman and   
           Ronitt Rubinfeld and   
               Christian Sohler   Approximating the Weight of the
                                  Euclidean Minimum Spanning Tree in
                                  Sublinear Time . . . . . . . . . . . . . 91--109
               Klaus Jansen and   
            Marek Karpinski and   
             Andrzej Lingas and   
                    Eike Seidel   Polynomial Time Approximation Schemes
                                  for MAX-BISECTION on Planar and
                                  Geometric Graphs . . . . . . . . . . . . 110--119
                 Zvi Lotker and   
           Boaz Patt-Shamir and   
                Elan Pavlov and   
                    David Peleg   Minimum-Weight Spanning Tree
                                  Construction in $O(\log \log n)$
                                  Communication Rounds . . . . . . . . . . 120--131
                Tugkan Batu and   
            Sanjoy Dasgupta and   
                 Ravi Kumar and   
               Ronitt Rubinfeld   The Complexity of Approximating the
                                  Entropy  . . . . . . . . . . . . . . . . 132--150
                    Jie Gao and   
                       Li Zhang   Well-Separated Pair Decomposition for
                                  the Unit-Disk Graph Metric and Its
                                  Applications . . . . . . . . . . . . . . 151--169
                 Greg Kuperberg   A Subexponential-Time Quantum Algorithm
                                  for the Dihedral Hidden Subgroup Problem 170--188
              Refael Hassin and   
                     Asaf Levin   A Better-Than-Greedy Approximation
                                  Algorithm for the Minimum Set Cover
                                  Problem  . . . . . . . . . . . . . . . . 189--200
             Kazuyuki Amano and   
                  Akira Maruoka   A Superpolynomial Lower Bound for a
                                  Circuit Computing the Clique Function
                                  with at most (1/6)log log n Negation
                                  Gates  . . . . . . . . . . . . . . . . . 201--216
            Rosario Gennaro and   
               Yael Gertner and   
              Jonathan Katz and   
                  Luca Trevisan   Bounds on the Efficiency of Generic
                                  Cryptographic Constructions  . . . . . . 217--246
               Guy Kortsarz and   
                     Zeev Nutov   Approximating $k$-node Connected
                                  Subgraphs via Critical Graphs  . . . . . 247--257

SIAM Journal on Computing
Volume 35, Number 2, 2005

            Petr Hlinený   A Parametrized Algorithm for Matroid
                                  Branch-Width . . . . . . . . . . . . . . 259--277
             Susanne Albers and   
                 Markus Schmidt   On the Performance of Greedy Algorithms
                                  in Packet Buffering  . . . . . . . . . . 278--304
               Costas Busch and   
            Srikanta Tirthapura   Analysis of Link Reversal Routing
                                  Algorithms . . . . . . . . . . . . . . . 305--326
                Ketan Dalal and   
                Luc Devroye and   
            Ebrahim Malalla and   
                   Erin McLeish   Two-Way Chaining with Reassignment . . . 327--340
          Michael A. Bender and   
            Erik D. Demaine and   
           Martin Farach-Colton   Cache-Oblivious B-Trees  . . . . . . . . 341--358
               Gyung-Ok Lee and   
                 Kwang-Moo Choe   A Powerful LL(k) Covering Transformation 359--377
             Roberto Grossi and   
           Jeffrey Scott Vitter   Compressed Suffix Arrays and Suffix
                                  Trees with Applications to Text Indexing
                                  and String Matching  . . . . . . . . . . 378--407
              Joel Friedman and   
             Andreas Goerdt and   
            Michael Krivelevich   Recognizing More Unsatisfiable Random
                                  $k$-SAT Instances Efficiently  . . . . . 408--430
               Leah Epstein and   
                   Rob van Stee   Optimal Online Algorithms for
                                  Multidimensional Packing Problems  . . . 431--448
               April Rasala and   
                 Gordon Wilfong   Strictly Nonblocking WDM Cross-connects  449--485
        Leslie Ann Goldberg and   
             Russell Martin and   
                  Mike Paterson   Strong Spatial Mixing with Fewer Colors
                                  for Lattice Graphs . . . . . . . . . . . 486--517

SIAM Journal on Computing
Volume 35, Number 3, 2005

               Klaus Jansen and   
                Lorant Porkolab   General Multiprocessor Task Scheduling:
                                  Approximate Solutions in Linear Time . . 519--530
            Esther M. Arkin and   
          Michael A. Bender and   
            Erik D. Demaine and   
    Sándor P. Fekete and   
      Joseph S. B. Mitchell and   
                 Saurabh Sethia   Optimal Covering Tours with Turn Costs   531--566
            Darin Goldstein and   
               Kojiro Kobayashi   On the Complexity of Network
                                  Synchronization  . . . . . . . . . . . . 567--589
           Ernst-Erich Doberkat   Stochastic Relations: Congruences,
                                  Bisimulations and the Hennessy--Milner
                                  Theorem  . . . . . . . . . . . . . . . . 590--626
           Bernard Chazelle and   
                   Ding Liu and   
                    Avner Magen   Sublinear Geometric Algorithms . . . . . 627--646
         Bjorn Kjos-Hanssen and   
          André Nies and   
                  Frank Stephan   Lowness for the Class of Schnorr Random
                                  Reals  . . . . . . . . . . . . . . . . . 647--657
                 Minming Li and   
                 Frances F. Yao   An Efficient Algorithm for Computing
                                  Optimal Discrete Voltage Schedules . . . 658--671
              Michael Elkin and   
                   Guy Kortsarz   A Combinatorial Logarithmic
                                  Approximation Algorithm for the Directed
                                  Telephone Broadcast Problem  . . . . . . 672--689
                  Dirk Vertigan   The Computational Complexity of Tutte
                                  Invariants for Planar Graphs . . . . . . 690--712
            Chandra Chekuri and   
                 Sanjeev Khanna   A Polynomial Time Approximation Scheme
                                  for the Multiple Knapsack Problem  . . . 713--728
                Weiping Shi and   
                        Chen Su   The Rectilinear Steiner Arborescence
                                  Problem Is NP-Complete . . . . . . . . . 729--740
           Meghanad D. Wagh and   
                   Osman Guzide   Mapping Cycles and Trees on Wrap-Around
                                  Butterfly Graphs . . . . . . . . . . . . 741--765
                    Hung Q. Ngo   WDM Switching Networks, Rearrangeable
                                  and Nonblocking [w,f]-connectors . . . . 766--785

SIAM Journal on Computing
Volume 35, Number 4, 2006

                  Noga Alon and   
                     Assaf Naor   Approximating the Cut-Norm via
                                  Grothendieck's Inequality  . . . . . . . 787--803
                 Scott Aaronson   Lower Bounds for Local Search by Quantum
                                  Arguments  . . . . . . . . . . . . . . . 804--824
               D. Bienstock and   
                     G. Iyengar   Approximating Fractional Packings and
                                  Coverings in $O(1/\epsilon)$ Iterations  825--854
                 Rene Beier and   
          Berthold Vöcking   Typical Properties of Winners and Losers
                                  [0.2ex] in Discrete Optimization . . . . 855--881
             Jonathan A. Kelner   Spectral Partitioning, Eigenvalue
                                  Bounds, and Circle Packings for Graphs
                                  of Bounded Genus . . . . . . . . . . . . 882--902
            Alexander Healy and   
               Salil Vadhan and   
                 Emanuele Viola   Using Nondeterminism to Amplify Hardness 903--931
             Mihai Patrascu and   
                Erik D. Demaine   Logarithmic Lower Bounds in the
                                  Cell-Probe Model . . . . . . . . . . . . 932--963
                    Uriel Feige   On Sums of Independent Random Variables
                                  with Unbounded Variance and Estimating
                                  the Average Degree in a Graph  . . . . . 964--984
László Lovász and   
                Santosh Vempala   Hit-and-Run from a Corner  . . . . . . . 985--1005
     László Babai   Special Issue Dedicated to the
                                  Thirty-Sixth Annual ACM Symposium on
                                  Theory of Computing (STOC 2004)  . . . . ix--x

SIAM Journal on Computing
Volume 35, Number 5, 2006

               Amihood Amir and   
             Yonatan Aumann and   
           Moshe Lewenstein and   
                      Ely Porat   Function Matching  . . . . . . . . . . . 1007--1022
                Sean Curran and   
                Orlando Lee and   
                    Xingxing Yu   Finding Four Independent Trees . . . . . 1023--1058
            Holger Petersen and   
            John Michael Robson   Efficient Simulations by Queue Machines  1059--1069
                Julia Kempe and   
              Alexei Kitaev and   
                     Oded Regev   The Complexity of the Local Hamiltonian
                                  Problem  . . . . . . . . . . . . . . . . 1070--1097
             Jesper Jansson and   
          Nguyen Bao Nguyen and   
                  Wing-Kin Sung   Algorithms for Combining Rooted Triplets
                                  into a Galled Phylogenetic Network . . . 1098--1121
           Karl-Heinz Niggl and   
             Henning Wunderlich   Certifying Polynomial Time and
                                  Linear/Polynomial Space for Imperative
                                  Programs . . . . . . . . . . . . . . . . 1122--1147
           Sariel Har-Peled and   
                   Manor Mendel   Fast Construction of Nets in
                                  Low-Dimensional Metrics and Their
                                  Applications . . . . . . . . . . . . . . 1148--1184
              Omer Reingold and   
             Ronen Shaltiel and   
                  Avi Wigderson   Extracting Randomness via Repeated
                                  Condensing . . . . . . . . . . . . . . . 1185--1209
                  Markus Lohrey   Word Problems and Membership Problems on
                                  Compressed Words . . . . . . . . . . . . 1210--1240
          Maurice Queyranne and   
              Andreas S. Schulz   Approximation Bounds for a General Class
                                  of Precedence Constrained Parallel
                                  Machine Scheduling Problems  . . . . . . 1241--1253
                  Moni Naor and   
                   Benny Pinkas   Oblivious Polynomial Evaluation  . . . . 1254--1281

SIAM Journal on Computing
Volume 35, Number 6, 2006

            Klaus Weihrauch and   
                     Ning Zhong   An Algorithm for Computing Fundamental
                                  Solutions  . . . . . . . . . . . . . . . 1283--1294
            Serge Abiteboul and   
            Stephen Alstrup and   
                Haim Kaplan and   
                  Tova Milo and   
                    Theis Rauhe   Compact Labeling Scheme for Ancestor
                                  Queries  . . . . . . . . . . . . . . . . 1295--1309
        Christoph Dürr and   
             Mark Heiligman and   
                Peter HOyer and   
                   Mehdi Mhalla   Quantum Query Complexity of Some Graph
                                  Problems . . . . . . . . . . . . . . . . 1310--1328
              Peter Jonsson and   
             Mikael Klasson and   
                 Andrei Krokhin   The Approximability of Three-valued MAX
                                  CSP  . . . . . . . . . . . . . . . . . . 1329--1349
           Petra Berenbrink and   
               Artur Czumaj and   
            Angelika Steger and   
          Berthold Vöcking   Balanced Allocations: The Heavily Loaded
                                  Case . . . . . . . . . . . . . . . . . . 1350--1385
              Floris Geerts and   
              Bart Kuijpers and   
            Jan Van den Bussche   Linearization and Completeness Results
                                  for Terminating Transitive Closure
                                  Queries on Spatial Databases . . . . . . 1386--1439
             Hua-Huai Chern and   
               Hsien-Kuei Hwang   Partial Match Queries in Random $k$-$d$
                                  Trees  . . . . . . . . . . . . . . . . . 1440--1466
              Eric Allender and   
              Harry Buhrman and   
       Michal Koucký and   
       Dieter van Melkebeek and   
             Detlef Ronneburger   Power from Random Strings  . . . . . . . 1467--1493
       Christian Worm Mortensen   Fully Dynamic Orthogonal Range Reporting
                                  on RAM . . . . . . . . . . . . . . . . . 1494--1525


SIAM Journal on Computing
Volume 36, Number 1, 2006

              R. Bar-Yehuda and   
   M. M. Halldórsson and   
              J. (S. ) Naor and   
                H. Shachnai and   
                     I. Shapira   Scheduling Split Intervals . . . . . . . 1--15
             Andrei Bulatov and   
           Víctor Dalmau   A Simple Algorithm for Mal'tsev
                                  Constraints  . . . . . . . . . . . . . . 16--27
                  John Case and   
                Sanjay Jain and   
                Eric Martin and   
                Arun Sharma and   
                  Frank Stephan   Identifying Clusters from Positive Data  28--55
                  Noa Agmon and   
                    David Peleg   Fault-Tolerant Gathering Algorithms for
                                  Autonomous Mobile Robots . . . . . . . . 56--82
                   Stasys Jukna   Disproving the Single Level Conjecture   83--98
                Li-San Wang and   
                   Tandy Warnow   Reconstructing Chromosomal Evolution . . 99--131
             Petros Drineas and   
                Ravi Kannan and   
             Michael W. Mahoney   Fast Monte Carlo Algorithms for Matrices
                                  I: Approximating Matrix Multiplication   132--157
             Petros Drineas and   
                Ravi Kannan and   
             Michael W. Mahoney   Fast Monte Carlo Algorithms for Matrices
                                  II: Computing a Low-Rank Approximation
                                  to a Matrix  . . . . . . . . . . . . . . 158--183
             Petros Drineas and   
                Ravi Kannan and   
             Michael W. Mahoney   Fast Monte Carlo Algorithms for Matrices
                                  III: Computing a Compressed Approximate
                                  Matrix Decomposition . . . . . . . . . . 184--206
             Nadia Creignou and   
                Bruno Zanuttini   A Complete Classification of the
                                  Complexity of Propositional Abduction    207--229
         Tomás Feder and   
                     Pavol Hell   Full Constraint Satisfaction Problems    230--246
                 Mary Cryan and   
                Martin Dyer and   
        Leslie Ann Goldberg and   
                Mark Jerrum and   
                 Russell Martin   Rapidly Mixing Markov Chains for
                                  Sampling Contingency Tables with a
                                  Constant Number of Rows  . . . . . . . . 247--278
              Ichiro Suzuki and   
             Masafumi Yamashita   Erratum: Distributed Anonymous Mobile
                                  Robots: Formation of Geometric Patterns  279--280

SIAM Journal on Computing
Volume 36, Number 2, 2006

             Fedor V. Fomin and   
          Dimitrios M. Thilikos   Dominating Sets in Planar Graphs:
                                  Branch-Width and Exponential Speed-Up    281--309
             Dieter Kratsch and   
                 Jeremy Spinrad   Between $O(nm)$ and $O(n \alpha)$  . . . 310--325
             Dieter Kratsch and   
          Ross M. McConnell and   
              Kurt Mehlhorn and   
              Jeremy P. Spinrad   Certifying Algorithms for Recognizing
                                  Interval Graphs and Permutation Graphs   326--353
                Yair Bartal and   
                  Amos Fiat and   
               Stefano Leonardi   Lower Bounds for On-line Graph Problems
                                  with Application to On-line Circuit and
                                  Optical Routing  . . . . . . . . . . . . 354--393
               Yossi Matias and   
                 Eran Segal and   
           Jeffrey Scott Vitter   Efficient Bundle Sorting . . . . . . . . 394--410
           Mohammad Mahdian and   
                   Yinyu Ye and   
                   Jiawei Zhang   Approximation Algorithms for Metric
                                  Facility Location Problems . . . . . . . 411--432
                  Michael Elkin   An Unconditional Lower Bound on the
                                  Time-Approximation Trade-off for the
                                  Distributed Minimum Spanning Tree
                                  Problem  . . . . . . . . . . . . . . . . 433--456
               Gunnar Hoest and   
                     Nir Shavit   Toward a Topological Characterization of
                                  Asynchronous Complexity  . . . . . . . . 457--497
              Julia Chuzhoy and   
            Joseph (Seffi) Naor   Covering Problems with Hard Capacities   498--515
     Christian Glaßer and   
                   A. Pavan and   
             Alan L. Selman and   
                 Samik Sengupta   Properties of NP-Complete Sets . . . . . 516--542
                Jon Feldman and   
                  Matthias Ruhl   The Directed Steiner Network Problem is
                                  Tractable for a Constant Number of
                                  Terminals  . . . . . . . . . . . . . . . 543--561

SIAM Journal on Computing
Volume 36, Number 3, 2006

                Scott Diehl and   
           Dieter van Melkebeek   Time-Space Lower Bounds for the
                                  Polynomial-Time Hierarchy on Randomized
                                  Machines . . . . . . . . . . . . . . . . 563--594
             Richard Beigel and   
              Lance Fortnow and   
                  Frank Stephan   Infinitely-Often Autoreducible Sets  . . 595--608
             Aravind Srinivasan   An Extension of the Lovász Local Lemma,
                                  and its Applications to Integer
                                  Programming  . . . . . . . . . . . . . . 609--634
               Guantao Chen and   
               Zhicheng Gao and   
                Xingxing Yu and   
                     Wenan Zang   Approximating Longest Cycles in Graphs
                                  with Bounded Degrees . . . . . . . . . . 635--656
                 Amit Kumar and   
                  Jon Kleinberg   Fairness Measures for Resource
                                  Allocation . . . . . . . . . . . . . . . 657--680
                Timothy M. Chan   Dynamic Subgraph Connectivity with
                                  Geometric Applications . . . . . . . . . 681--694
               Micha Sharir and   
                      Emo Welzl   On the Number of Crossing-Free
                                  Matchings, Cycles, and Partitions  . . . 695--720
Hervé Brönnimann and   
               Lutz Kettner and   
           Michel Pocchiola and   
                  Jack Snoeyink   Counting and Enumerating Pointed
                                  Pseudotriangulations with the Greedy
                                  Flip Algorithm . . . . . . . . . . . . . 721--739
        Dimitris Achlioptas and   
               Cristopher Moore   Random $k$-SAT: Two Moments Suffice to
                                  Cross a Sharp Threshold  . . . . . . . . 740--762
                Wim van Dam and   
              Sean Hallgren and   
                    Lawrence Ip   Quantum Algorithms for Some Hidden Shift
                                  Problems . . . . . . . . . . . . . . . . 763--778
               Tali Kaufman and   
                       Dana Ron   Testing Polynomials over General Fields  779--802
                   Shmuel Safra   Exponential Determinization for
                                  $\omega$-Automata with a Strong Fairness
                                  Acceptance Condition . . . . . . . . . . 803--814
          Pankaj K. Agarwal and   
              Mark Overmars and   
                   Micha Sharir   Computing Maximally Separated Sets in
                                  the Plane  . . . . . . . . . . . . . . . 815--834
             Tomasz \Luczak and   
          Jaroslav Ne\vset\vril   A Probabilistic Approach to the
                                  Dichotomy Problem  . . . . . . . . . . . 835--843

SIAM Journal on Computing
Volume 36, Number 4, 2006

            Benny Applebaum and   
                Yuval Ishai and   
               Eyal Kushilevitz   Cryptography in ${NC}^0$ . . . . . . . . 845--888
             Eli Ben-Sasson and   
             Oded Goldreich and   
            Prahladh Harsha and   
                Madhu Sudan and   
                   Salil Vadhan   Robust PCPs of Proximity, Shorter PCPs,
                                  and Applications to Coding . . . . . . . 889--974
                 Irit Dinur and   
                  Omer Reingold   Assignment Testers: Towards a
                                  Combinatorial Proof of the PCP Theorem   975--1024
                   Subhash Khot   Ruling Out PTAS for Graph Min-Bisection,
                                  Dense $k$-Subgraph, and Bipartite Clique 1025--1071
              Ariel Gabizon and   
                    Ran Raz and   
                 Ronen Shaltiel   Deterministic Extractors for Bit-Fixing
                                  Sources by Obtaining an Independent Seed 1072--1094
                 Boaz Barak and   
        Russell Impagliazzo and   
                  Avi Wigderson   Extracting Randomness Using Few
                                  Independent Sources  . . . . . . . . . . 1095--1118
            Andrej Bogdanov and   
                  Luca Trevisan   On Worst-Case to Average-Case Reductions
                                  for NP Problems  . . . . . . . . . . . . 1119--1159
                Salil P. Vadhan   An Unconditional Study of Computational
                                  Zero Knowledge . . . . . . . . . . . . . 1160--1214
               Amir Shpilka and   
                  Avi Wigderson   Derandomizing Homomorphism Testing in
                                  General Groups . . . . . . . . . . . . . 1215--1230
             Oded Goldreich and   
                    Madhu Sudan   Special Issue on Randomness and
                                  Complexity . . . . . . . . . . . . . . . ix--xi

SIAM Journal on Computing
Volume 36, Number 5, 2007

                 Jesse Kamp and   
                David Zuckerman   Deterministic Extractors for Bit-Fixing
                                  Sources and Exposure-Resilient
                                  Cryptography . . . . . . . . . . . . . . 1231--1247
        Mikhail Alekhnovich and   
                 Eli Ben-Sasson   Linear Upper Bounds for Random Walk on
                                  Small Density Random $3$-CNFs  . . . . . 1248--1263
       Lane A. Hemaspaandra and   
       Christopher M. Homan and   
                 Sven Kosub and   
                Klaus W. Wagner   The Complexity of Computing the Size of
                                  an Interval  . . . . . . . . . . . . . . 1264--1300
                  Dan Boneh and   
                Ran Canetti and   
                Shai Halevi and   
                  Jonathan Katz   Chosen-Ciphertext Security from
                                  Identity-Based Encryption  . . . . . . . 1301--1328
               Yoko Kamidoi and   
          Noriyoshi Yoshida and   
              Hiroshi Nagamochi   A Deterministic Algorithm for Finding
                                  All Minimum $k$-Way Cuts . . . . . . . . 1329--1341
                    Ke Chen and   
                  Amos Fiat and   
                Haim Kaplan and   
                Meital Levy and   
     Ji í Matou\vsek and   
            Elchanan Mossel and   
          János Pach and   
               Micha Sharir and   
        Shakhar Smorodinsky and   
                 Uli Wagner and   
                      Emo Welzl   Online Conflict-Free Coloring for
                                  Intervals  . . . . . . . . . . . . . . . 1342--1359
             David Eppstein and   
        Michael T. Goodrich and   
           Daniel S. Hirschberg   Improved Combinatorial Group Testing
                                  Algorithms for Real-World Problem Sizes  1360--1375
              Julia Chuzhoy and   
            Joseph (Seffi) Naor   The Hardness of Metric Labeling  . . . . 1376--1386
                 Emanuele Viola   Pseudorandom Bits for Constant-Depth
                                  Circuits with Few Arbitrary Symmetric
                                  Gates  . . . . . . . . . . . . . . . . . 1387--1403
                  Zeev Dvir and   
                   Amir Shpilka   Locally Decodable Codes with Two Queries
                                  and Polynomial Identity Testing for
                                  Depth 3 Circuits . . . . . . . . . . . . 1404--1434
                Alan Frieze and   
              Gregory B. Sorkin   The Probabilistic Relationship Between
                                  the Assignment and Asymmetric Traveling
                                  Salesman Problems  . . . . . . . . . . . 1435--1452
              Marek Chrobak and   
         Leszek G\kasieniec and   
            Dariusz R. Kowalski   The Wake-Up Problem in Multihop Radio
                                  Networks . . . . . . . . . . . . . . . . 1453--1471
             Hartmut Klauck and   
            Robert \vSpalek and   
                 Ronald de Wolf   Quantum and Classical Strong Direct
                                  Product Theorems and Optimal Time-Space
                                  Tradeoffs  . . . . . . . . . . . . . . . 1472--1493
              Eran Halperin and   
               Guy Kortsarz and   
         Robert Krauthgamer and   
         Aravind Srinivasan and   
                       Nan Wang   Integrality Ratio for Group Steiner
                                  Trees and Directed Steiner Trees . . . . 1494--1511

SIAM Journal on Computing
Volume 36, Number 6, 2007

              Cynthia Dwork and   
                      Moni Naor   Zaps and Their Applications  . . . . . . 1513--1543
          David Soloveichik and   
                   Erik Winfree   Complexity of Self-Assembled Shapes  . . 1544--1569
              Bart Kuijpers and   
              Gabriel Kuper and   
              Jan Paredaens and   
                 Luc Vandeurzen   First-Order Languages Expressing
                                  Constructible Spatial Database Queries   1570--1599
             Lisa Fleischer and   
                Martin Skutella   Quickest Flows Over Time . . . . . . . . 1600--1630
             Boaz Ben-Moshe and   
            Matthew J. Katz and   
          Joseph S. B. Mitchell   A Constant-Factor Approximation
                                  Algorithm for Optimal $1.5$D Terrain
                                  Guarding . . . . . . . . . . . . . . . . 1631--1647
                Harold N. Gabow   Finding Paths and Cycles of
                                  Superpolylogarithmic Length  . . . . . . 1648--1671
                  Lars Arge and   
          Michael A. Bender and   
            Erik D. Demaine and   
      Bryan Holland-Minkley and   
                   J. Ian Munro   An Optimal Cache-Oblivious Priority
                                  Queue and Its Application to Graph
                                  Algorithms . . . . . . . . . . . . . . . 1672--1695
              John M. Hitchcock   Online Learning and Resource-Bounded
                                  Dimension: Winnow Yields New Lower
                                  Bounds for Hard Sets . . . . . . . . . . 1696--1708
              Marek Chrobak and   
             Wojciech Jawor and   
        Ji\vrí Sgall and   
    Tomá\vs Tichý   Online Scheduling of Equal-Length Jobs:
                                  Randomization and Restarts Help  . . . . 1709--1728
        Leonard J. Schulman and   
                    Tal Mor and   
                Yossi Weinstein   Physical Limits of Heat-Bath Algorithmic
                                  Cooling  . . . . . . . . . . . . . . . . 1729--1747
           Max A. Alekseyev and   
               Pavel A. Pevzner   Whole Genome Duplications and Contracted
                                  Breakpoint Graphs  . . . . . . . . . . . 1748--1763
        Kasturi Varadarajan and   
               S. Venkatesh and   
                   Yinyu Ye and   
                   Jiawei Zhang   Approximating the Radii of Point Sets    1764--1776
                Alin Bostan and   
            Pierrick Gaudry and   
             Éric Schost   Linear Recurrences with Polynomial
                                  Coefficients and Application to Integer
                                  Factorization and Cartier--Manin
                                  Operator . . . . . . . . . . . . . . . . 1777--1806


SIAM Journal on Computing
Volume 37, Number 1, 2007

               Frank Harary and   
             Wolfgang Slany and   
                 Oleg Verbitsky   On the Computational Complexity of the
                                  Forcing Chromatic Number . . . . . . . . 1--19
                 Hartmut Klauck   Lower Bounds for Quantum Communication
                                  Complexity . . . . . . . . . . . . . . . 20--46
             Dorit Aharonov and   
                  Amnon Ta-Shma   Adiabatic Quantum State Generation . . . 47--82
        Phillip G. Bradford and   
           Michael N. Katehakis   A Probabilistic Study on Combinatorial
                                  Expanders and Hashing  . . . . . . . . . 83--111
            Matthew Andrews and   
                     Lisa Zhang   Hardness of the Undirected Congestion
                                  Minimization Problem . . . . . . . . . . 112--131
          Florent Madelaine and   
                Iain A. Stewart   Constraint Satisfaction, Logic and
                                  Forbidden Patterns . . . . . . . . . . . 132--163
        Dimitris Achlioptas and   
                 Vladlen Koltun   Special Section on Foundations of
                                  Computer Science . . . . . . . . . . . . 165--165
             Dorit Aharonov and   
                Wim van Dam and   
                Julia Kempe and   
                Zeph Landau and   
                 Seth Lloyd and   
                     Oded Regev   Adiabatic Quantum Computation is
                                  Equivalent to Standard Quantum
                                  Computation  . . . . . . . . . . . . . . 166--194
                   Qi Cheng and   
                     Daqing Wan   On the List and Bounded Distance
                                  Decodability of Reed--Solomon Codes  . . 195--209
                Andris Ambainis   Quantum Walk Algorithm for Element
                                  Distinctness . . . . . . . . . . . . . . 210--239
            Erik D. Demaine and   
                Dion Harmon and   
                John Iacono and   
             Mihai P\uatra\cscu   Dynamic Optimality --- Almost  . . . . . 240--251
                Steve Chien and   
              Alistair Sinclair   Algebras with Polynomial Identities and
                                  Computing the Determinant  . . . . . . . 252--266
         Daniele Micciancio and   
                     Oded Regev   Worst-Case to Average-Case Reductions
                                  Based on Gaussian Measures . . . . . . . 267--302
                     Kamal Jain   A Polynomial Time Algorithm for
                                  Computing an Arrow--Debreu Market
                                  Equilibrium for Linear Utilities . . . . 303--318
               Subhash Khot and   
                Guy Kindler and   
            Elchanan Mossel and   
                 Ryan O'Donnell   Optimal Inapproximability Results for
                                  MAX-CUT and Other 2-Variable CSPs? . . . 319--357

SIAM Journal on Computing
Volume 37, Number 2, 2007

                   A. Pavan and   
            Srikanta Tirthapura   Range-Efficient Counting of Distinct
                                  Elements in a Massive Data Stream  . . . 359--379
                 Boaz Barak and   
              Shien Jin Ong and   
                   Salil Vadhan   Derandomization in Cryptography  . . . . 380--400
             Gregory Mounie and   
          Christophe Rapine and   
                 Denis Trystram   A $\frac32$-Approximation Algorithm for
                                  Scheduling Independent Monotonic
                                  Malleable Tasks  . . . . . . . . . . . . 401--412
Frédéric Magniez and   
              Miklos Santha and   
                  Mario Szegedy   Quantum Algorithms for the Triangle
                                  Problem  . . . . . . . . . . . . . . . . 413--424
              Yuri Gurevich and   
                    Paul Schupp   Membership Problem for the Modular Group 425--459
                    A. Moss and   
                      Y. Rabani   Approximation Algorithms for Constrained
                                  Node Weighted Steiner Tree Problems  . . 460--481
              Eldar Fischer and   
                    Ilan Newman   Testing versus Estimation of Graph
                                  Properties . . . . . . . . . . . . . . . 482--501
               Amitabha Roy and   
               Howard Straubing   Definability of Languages by Generalized
                                  First-Order Formulas over
                                  $(\mathbb{N},+)$ . . . . . . . . . . . . 502--521
Hervé Brönnimann and   
          Olivier Devillers and   
            Vida Dujmovi\'c and   
              Hazel Everett and   
                Marc Glisse and   
               Xavier Goaoc and   
             Sylvain Lazard and   
               Hyeon-Suk Na and   
                 Sue Whitesides   Lines and Free Line Segments Tangent to
                                  Arbitrary Three-Dimensional Convex
                                  Polyhedra  . . . . . . . . . . . . . . . 522--551
                 Hartmut Klauck   One-Way Communication Complexity and the
                                  Ne\vciporuk Lower Bound on Formula Size  552--583
                 Sunil Arya and   
       Theocharis Malamatos and   
             David M. Mount and   
                   Ka Chun Wong   Optimal Expected-Case Planar Point
                                  Location . . . . . . . . . . . . . . . . 584--610
                Wim van Dam and   
Frédéric Magniez and   
              Michele Mosca and   
                  Miklos Santha   Self-Testing of Universal and
                                  Fault-Tolerant Sets of Quantum Gates . . 611--629
                Naveen Garg and   
           Jochen Könemann   Faster and Simpler Algorithms for
                                  Multicommodity Flow and Other Fractional
                                  Packing Problems . . . . . . . . . . . . 630--652
                 Avrim Blum and   
              Shuchi Chawla and   
            David R. Karger and   
                Terran Lane and   
              Adam Meyerson and   
                  Maria Minkoff   Approximation Algorithms for
                                  Orienteering and Discounted-Reward TSP   653--670

SIAM Journal on Computing
Volume 37, Number 3, 2007

         Krishna B. Athreya and   
          John M. Hitchcock and   
               Jack H. Lutz and   
               Elvira Mayordomo   Effective Strong Dimension in
                                  Algorithmic Information and
                                  Computational Complexity . . . . . . . . 671--705
       Friedrich Eisenbrand and   
          Fabrizio Grandoni and   
           Gianpaolo Oriolo and   
                Martin Skutella   New Approaches for Virtual Private
                                  Network Design . . . . . . . . . . . . . 706--721
               Partha Dutta and   
           Rachid Guerraoui and   
                 Bastian Pochon   The Time-Complexity of Local Decision in
                                  Distributed Agreement  . . . . . . . . . 722--756
    Stavros G. Kolliopoulos and   
                     Satish Rao   A Nearly Linear-Time Approximation
                                  Scheme for the Euclidean $k$-Median
                                  Problem  . . . . . . . . . . . . . . . . 757--782
             William Aiello and   
                 F. T. Leighton   Hamming Codes, Hypercube Embeddings, and
                                  Fault Tolerance  . . . . . . . . . . . . 783--803
                 Assaf Naor and   
              Gideon Schechtman   Planar Earthmover Is Not in $L_1$  . . . 804--826
             Ryan O'Donnell and   
              Rocco A. Servedio   Learning Monotone Decision Trees in
                                  Polynomial Time  . . . . . . . . . . . . 827--844
                 Paul Beame and   
            Toniann Pitassi and   
               Nathan Segerlind   Lower Bounds for Lovász--Schrijver
                                  Systems and Beyond Follow from
                                  Multiparty Communication Complexity  . . 845--869
      José R. Correa and   
              Michel X. Goemans   Improved Bounds on Nonblocking 3-Stage
                                  Clos Networks  . . . . . . . . . . . . . 870--894
             Michael Molloy and   
       Mohammad R. Salavatipour   The Resolution Complexity of Random
                                  Constraint Satisfaction Problems . . . . 895--922
                 Xujin Chen and   
                Xiaodong Hu and   
                     Wenan Zang   A Min-Max Theorem on Tournaments . . . . 923--937
           Cristopher Moore and   
            Daniel Rockmore and   
          Alexander Russell and   
            Leonard J. Schulman   The Power of Strong Fourier Sampling:
                                  Quantum Algorithms for Affine Groups and
                                  Hidden Shifts  . . . . . . . . . . . . . 938--958
                  Noga Alon and   
              Eldar Fischer and   
                    Ilan Newman   Efficient Testing of Bipartite Graphs
                                  for Forbidden Induced Subgraphs  . . . . 959--976

SIAM Journal on Computing
Volume 37, Number 4, 2007

                Nancy Lynch and   
             Roberto Segala and   
               Frits Vaandrager   Observing Branching Structure through
                                  Probabilistic Contexts . . . . . . . . . 977--1013
                     Bin Fu and   
                       Wei Wang   Geometric Separators and Their
                                  Applications to Protein Folding in the
                                  HP-Model . . . . . . . . . . . . . . . . 1014--1029
           David J. Abraham and   
           Robert W. Irving and   
        Telikepalli Kavitha and   
                  Kurt Mehlhorn   Popular Matchings  . . . . . . . . . . . 1030--1045
             David Woodruff and   
                Sergey Yekhanin   A Geometric Approach to
                                  Information-Theoretic Private
                                  Information Retrieval  . . . . . . . . . 1046--1056
           Lior Davidovitch and   
               Shlomi Dolev and   
                Sergio Rajsbaum   Stability of Multivalued Continuous
                                  Consensus  . . . . . . . . . . . . . . . 1057--1076
                Jianer Chen and   
             Henning Fernau and   
               Iyad A. Kanj and   
                         Ge Xia   Parametric Duality and Kernelization:
                                  Lower Bounds and Upper Bounds on Kernel
                                  Size . . . . . . . . . . . . . . . . . . 1077--1106
             Shirley Halevy and   
               Eyal Kushilevitz   Distribution-Free Property-Testing . . . 1107--1138
               Costas Busch and   
        Malik Magdon-Ismail and   
            Marios Mavronicolas   Universal Bufferless Packet Switching    1139--1162
           Petra Berenbrink and   
             Tom Friedetzky and   
        Leslie Ann Goldberg and   
           Paul W. Goldberg and   
                Zengjian Hu and   
                 Russell Martin   Distributed Selfish Load Balancing . . . 1163--1181
               Tetsuo Asano and   
   Ji\vrÍ Matou\vsek and   
               Takeshi Tokuyama   Zone Diagrams: Existence, Uniqueness,
                                  and Algorithmic Challenge  . . . . . . . 1182--1198
             Siu-Wing Cheng and   
               Tamal K. Dey and   
             Edgar A. Ramos and   
                  Tathagata Ray   Sampling and Meshing a Surface with
                                  Guaranteed Topology and Geometry . . . . 1199--1227
                 Yijia Chen and   
                   Martin Grohe   An Isomorphism Between Subexponential
                                  and Parameterized Complexity Theory  . . 1228--1258
            Baruch Awerbuch and   
     Mohammad T. Hajiaghayi and   
           Robert Kleinberg and   
                   Tom Leighton   Localized Client-Server Load Balancing
                                  without Global Information . . . . . . . 1259--1279
             Guey-Yun Chang and   
                  Gen-Huey Chen   ($t$,$k$)-Diagnosability of
                                  Multiprocessor Systems with Applications
                                  to Grids and Tori  . . . . . . . . . . . 1280--1298

SIAM Journal on Computing
Volume 37, Number 5, 2008

           Camil Demetrescu and   
              Mikkel Thorup and   
      Rezaul Alam Chowdhury and   
            Vijaya Ramachandran   Oracles for Distances Avoiding a Failed
                                  Node or Link . . . . . . . . . . . . . . 1299--1318
       Jochen Könemann and   
           Stefano Leonardi and   
         Guido Schäfer and   
          Stefan H. M. van Zwam   A Group-Strategyproof Cost Sharing
                                  Mechanism for the Steiner Forest Game    1319--1341
                 Ofer Dekel and   
        Shai Shalev-Shwartz and   
                   Yoram Singer   The Forgetron: a Kernel-Based Perceptron
                                  on a Budget  . . . . . . . . . . . . . . 1342--1372
      Bradford G. Nickerson and   
                    Qingxiu Shi   On $k$-d Range Search with Patricia
                                  Tries  . . . . . . . . . . . . . . . . . 1373--1386
              Harry Buhrman and   
              Lance Fortnow and   
                Ilan Newman and   
               Hein Röhrig   Quantum Property Testing . . . . . . . . 1387--1400
                   K. Rubin and   
                  A. Silverberg   Compression in Finite Fields and
                                  Torus-Based Cryptography . . . . . . . . 1401--1428
Ivona Bezáková and   
     Daniel \vStefankovi\vc and   
          Vijay V. Vazirani and   
                    Eric Vigoda   Accelerating Simulated Annealing for the
                                  Permanent and Combinatorial Counting
                                  Problems . . . . . . . . . . . . . . . . 1429--1454
               Liam Roditty and   
                      Uri Zwick   Improved Dynamic Reachability Algorithms
                                  for Directed Graphs  . . . . . . . . . . 1455--1471
               Aaron Archer and   
                 Asaf Levin and   
            David P. Williamson   A Faster, Better Approximation Algorithm
                                  for the Minimum Latency Problem  . . . . 1472--1498
             John Augustine and   
                Sandy Irani and   
                Chaitanya Swamy   Optimal Power-Down Strategies  . . . . . 1499--1516
     Christian Glaßer and   
                   A. Pavan and   
             Alan L. Selman and   
                     Liyu Zhang   Splitting NP-Complete Sets . . . . . . . 1517--1535
                Jon Feldman and   
             Ryan O'Donnell and   
              Rocco A. Servedio   Learning Mixtures of Product
                                  Distributions over Discrete Domains  . . 1536--1564
              Leslie G. Valiant   Holographic Algorithms . . . . . . . . . 1565--1594
              Ho-Leung Chan and   
                Tak-Wah Lam and   
                  Kin-Shing Liu   Extra Unit-Speed Machines Are Almost as
                                  Powerful as Speedy Machines for Flow
                                  Time Scheduling  . . . . . . . . . . . . 1595--1612
               Hagit Attiya and   
                      David Hay   Randomization Does Not Reduce the
                                  Average Delay in Parallel Packet
                                  Switches . . . . . . . . . . . . . . . . 1613--1636
             Andrew V. Goldberg   A Practical Shortest Path Algorithm with
                                  Linear Expected Time . . . . . . . . . . 1637--1655
         Elliot Anshelevich and   
                David Kempe and   
                  Jon Kleinberg   Stability of Load Balancing Algorithms
                                  in Dynamic Adversarial Systems . . . . . 1656--1673
                     Hubie Chen   The Complexity of Quantified Constraint
                                  Satisfaction: Collapsibility, Sink
                                  Algebras, and the Three-Element Case . . 1674--1701

SIAM Journal on Computing
Volume 37, Number 6, 2008

                  Noga Alon and   
                   Asaf Shapira   A Characterization of the (Natural)
                                  Graph Properties Testable with One-Sided
                                  Error  . . . . . . . . . . . . . . . . . 1703--1727
               P. E. Haxell and   
                   B. Nagle and   
                   V. Rödl   An Algorithmic Version of the Hypergraph
                                  Regularity Method  . . . . . . . . . . . 1728--1776
          Adam Tauman Kalai and   
            Adam R. Klivans and   
             Yishay Mansour and   
              Rocco A. Servedio   Agnostically Learning Halfspaces . . . . 1777--1805
                Navin Goyal and   
                Guy Kindler and   
                   Michael Saks   Lower Bounds for the Noisy Broadcast
                                  Problem  . . . . . . . . . . . . . . . . 1806--1841
           Cristopher Moore and   
          Alexander Russell and   
            Leonard J. Schulman   The Symmetric Group Defies Strong
                                  Fourier Sampling . . . . . . . . . . . . 1842--1864
      Ivan B. Damgård and   
                 Serge Fehr and   
              Louis Salvail and   
            Christian Schaffner   Cryptography in the
                                  Bounded-Quantum-Storage Model  . . . . . 1865--1890
                Rafael Pass and   
                     Alon Rosen   Concurrent Nonmalleable Commitments  . . 1891--1925
                Philip N. Klein   A Linear-Time Approximation Scheme for
                                  TSP in Undirected Planar Graphs with
                                  Edge-Weights . . . . . . . . . . . . . . 1926--1952
                 Irit Dinur and   
                     Eva Tardos   Special Issue on Foundations of Computer
                                  Science  . . . . . . . . . . . . . . . . vii--vii


SIAM Journal on Computing
Volume 38, Number 1, 2008

                     Nir Halman   On the Algorithmic Aspects of Discrete
                                  and Lexicographic Helly-Type Theorems
                                  and the Discrete LP-Type Model . . . . . 1--45
            Sophie Laplante and   
 Frédéric Magniez   Lower Bounds for Randomized and Quantum
                                  Query Complexity Using Kolmogorov
                                  Arguments  . . . . . . . . . . . . . . . 46--62
              Eric Allender and   
           Lisa Hellerstein and   
                Paul McCabe and   
            Toniann Pitassi and   
                   Michael Saks   Minimizing Disjunctive Normal Form
                                  Formulas and ${AC}^0$ Circuits Given a
                                  Truth Table  . . . . . . . . . . . . . . 63--84
                  Anna Pagh and   
                    Rasmus Pagh   Uniform Hashing in Constant Time and
                                  Optimal Space  . . . . . . . . . . . . . 85--96
             Yevgeniy Dodis and   
           Rafail Ostrovsky and   
              Leonid Reyzin and   
                     Adam Smith   Fuzzy Extractors: How to Generate Strong
                                  Keys from Biometrics and Other Noisy
                                  Data . . . . . . . . . . . . . . . . . . 97--139
            Dana Moshkovitz and   
                        Ran Raz   Sub-Constant Error Low Degree Test of
                                  Almost-Linear Size . . . . . . . . . . . 140--180
                   Bodo Manthey   On Approximating Restricted Cycle Covers 181--206
              Eldar Fischer and   
                  Arie Matsliah   Testing Graph Isomorphism  . . . . . . . 207--225
            Mohammad Farshi and   
         Panos Giannopoulos and   
            Joachim Gudmundsson   Improving the Stretch Factor of a
                                  Geometric Network by Edge Augmentation   226--240
                 Kamal Jain and   
              Vijay V. Vazirani   Equitable Cost Allocations via
                                  Primal--Dual-Type Algorithms . . . . . . 241--256
               Mark de Berg and   
                     Chris Gray   Vertical Ray Shooting and Computing
                                  Depth Orders for Fat Objects . . . . . . 257--275
               Reuven Cohen and   
                    David Peleg   Convergence of Autonomous Mobile Robots
                                  with Inaccurate Sensors and Movements    276--302
                  Vasco Brattka   Plottable Real Number Functions and the
                                  Computable Graph Theorem . . . . . . . . 303--328
              Peter Jonsson and   
           Fredrik Kuivinen and   
                   Gustav Nordh   MAX ONES Generalized to Larger Domains   329--365
             Ziv Bar-Yossef and   
               T. S. Jayram and   
             Iordanis Kerenidis   Exponential Separation of Quantum and
                                  Classical One-Way Communication
                                  Complexity . . . . . . . . . . . . . . . 366--384
                    Ke Chen and   
               Sariel Har-Peled   The Euclidean Orienteering Problem
                                  Revisited  . . . . . . . . . . . . . . . 385--397
        János Balogh and   
József Békési and   
      Gábor Galambos and   
                Gerhard Reinelt   Lower Bound for the Online Bin Packing
                                  Problem with Restricted Repacking  . . . 398--410
               Leah Epstein and   
                     Asaf Levin   An APTAS for Generalized Cost
                                  Variable-Sized Bin Packing . . . . . . . 411--428
           Csaba D. Tóth   Binary Space Partitions for Axis-Aligned
                                  Fat Rectangles . . . . . . . . . . . . . 429--447

SIAM Journal on Computing
Volume 38, Number 2, 2008

              Vladimir Trifonov   An $O(\log n \log \log n)$ Space
                                  Algorithm for Undirected
                                  $st$-Connectivity  . . . . . . . . . . . 449--483
                     Ben Morris   The Mixing Time of the Thorp Shuffle . . 484--504
                  Noga Alon and   
                   Asaf Shapira   Every Monotone Graph Property Is
                                  Testable . . . . . . . . . . . . . . . . 505--522
            Saurabh Sanghvi and   
                   Salil Vadhan   The Round Complexity of Two-Party Random
                                  Selection  . . . . . . . . . . . . . . . 523--550
             Eli Ben-Sasson and   
                    Madhu Sudan   Short PCPs with Polylog Query Complexity 551--607
              Michael Elkin and   
                 Yuval Emek and   
         Daniel A. Spielman and   
                 Shang-Hua Teng   Lower-Stretch Spanning Trees . . . . . . 608--628
                Uriel Feige and   
   MohammadTaghi Hajiaghayi and   
                   James R. Lee   Improved Approximation Algorithms for
                                  Minimum Weight Vertex Separators . . . . 629--657
        Miko aj Boja\'nczyk and   
               Thomas Colcombet   Tree-Walking Automata Do Not Recognize
                                  All Regular Languages  . . . . . . . . . 658--701
                Rafael Pass and   
                     Alon Rosen   New and Improved Constructions of
                                  Nonmalleable Cryptographic Protocols . . 702--752
               Ronald Fagin and   
               Anupam Gupta and   
                 Ravi Kumar and   
                 Ryan O'Donnell   Special Issue Dedicated to the
                                  Thirty-Seventh Annual ACM Symposium on
                                  Theory of Computing (STOC 2005)  . . . . vii--vii

SIAM Journal on Computing
Volume 38, Number 3, 2008

                 Yaoyun Shi and   
                      Yufan Zhu   Tensor Norms and the Classical
                                  Communication Complexity of Nonlocal
                                  Quantum Measurement  . . . . . . . . . . 753--766
            Anil Maheshwari and   
                    Norbert Zeh   I/O-Efficient Planar Separators  . . . . 767--801
             Siu-Wing Cheng and   
               Hyeon-Suk Na and   
           Antoine Vigneron and   
                     Yajun Wang   Approximate Shortest Paths in
                                  Anisotropic Regions  . . . . . . . . . . 802--824
                F. Grandoni and   
           J. Könemann and   
               A. Panconesi and   
                       M. Sozio   A Primal-Dual Bicriteria Distributed
                                  Algorithm for Capacitated Vertex Cover   825--840
             Marcelo Arenas and   
                 Wenfei Fan and   
                  Leonid Libkin   On the Complexity of Verifying
                                  Consistency of XML Specifications  . . . 841--880
           Rudolf Fleischer and   
               Tom Kamphans and   
                 Rolf Klein and   
            Elmar Langetepe and   
                Gerhard Trippen   Competitive Online Approximation of the
                                  Optimal Search Ratio . . . . . . . . . . 881--898
               Boris Aronov and   
               Sariel Har-Peled   On Approximating the Depth and Related
                                  Problems . . . . . . . . . . . . . . . . 899--921
        Ángel J. Gil and   
               Miki Hermann and   
              Gernot Salzer and   
                Bruno Zanuttini   Efficient Algorithms for Description
                                  Problems over Finite Totally Ordered
                                  Domains  . . . . . . . . . . . . . . . . 922--945
            C. Thach Nguyen and   
                  Jian Shen and   
                 Minmei Hou and   
                   Li Sheng and   
                Webb Miller and   
                   Louxin Zhang   Approximating the Spanning Star Forest
                                  Problem and Its Application to Genomic
                                  Sequence Alignment . . . . . . . . . . . 946--962
             Igor L. Markov and   
                     Yaoyun Shi   Simulating Quantum Computation by
                                  Contracting Tensor Networks  . . . . . . 963--981
                Haim Kaplan and   
                Natan Rubin and   
               Micha Sharir and   
                    Elad Verbin   Efficient Colored Orthogonal Range
                                  Counting . . . . . . . . . . . . . . . . 982--1011
      Petr Hlin\uený and   
                    Sang-il Oum   Finding Branch-Decompositions and
                                  Rank-Decompositions  . . . . . . . . . . 1012--1032
              Parikshit Gopalan   Query-Efficient Algorithms for
                                  Polynomial Interpolation over Composites 1033--1057
             Fedor V. Fomin and   
             Dieter Kratsch and   
               Ioan Todinca and   
                Yngve Villanger   Exact Algorithms for Treewidth and
                                  Minimum Fill-In  . . . . . . . . . . . . 1058--1079
               Jack H. Lutz and   
               Elvira Mayordomo   Dimensions of Points in Self-Similar
                                  Fractals . . . . . . . . . . . . . . . . 1080--1112
                 Jordi Levy and   
Manfred Schmidt-Schauß and   
                 Mateu Villaret   The Complexity of Monadic Second-Order
                                  Unification  . . . . . . . . . . . . . . 1113--1140
           Ravindran Kannan and   
             Hadi Salmasian and   
                Santosh Vempala   The Spectral Method for General Mixture
                                  Models . . . . . . . . . . . . . . . . . 1141--1156
              Nikhil Bansal and   
            Don Coppersmith and   
               Maxim Sviridenko   Improved Approximation Algorithms for
                                  Broadcast Scheduling . . . . . . . . . . 1157--1174
          Ketan D. Mulmuley and   
                  Milind Sohoni   Geometric Complexity Theory II: Towards
                                  Explicit Obstructions for Embeddings
                                  among Class Varieties  . . . . . . . . . 1175--1206

SIAM Journal on Computing
Volume 38, Number 4, 2008

             Dorit Aharonov and   
                 Michael Ben-Or   Fault-Tolerant Quantum Computation with
                                  Constant Error Rate  . . . . . . . . . . 1207--1282
                Sanjay Jain and   
                  Frank Stephan   Mitotic Classes in Inductive Inference   1283--1299
          Alfredo De Santis and   
      Giovanni Di Crescenzo and   
          Giuseppe Persiano and   
                      Moti Yung   On Monotone Formula Composition of
                                  Perfect Zero-Knowledge Languages . . . . 1300--1329
              Jon Kleinberg and   
               Mark Sandler and   
            Aleksandrs Slivkins   Network Failure Detection and Graph
                                  Connectivity . . . . . . . . . . . . . . 1330--1346
        Michael Alekhnovich and   
          Alexander A. Razborov   Resolution Is Not Automatizable Unless
                                  $W[P]$ Is Tractable  . . . . . . . . . . 1347--1363
            Albert Atserias and   
                 Anuj Dawar and   
                   Martin Grohe   Preservation under Extensions on
                                  Well-Behaved Finite Structures . . . . . 1364--1381
             Dániel Marx   Closest Substring Problems with Small
                                  Distances  . . . . . . . . . . . . . . . 1382--1410
                  Ivan Baev and   
         Rajmohan Rajaraman and   
                Chaitanya Swamy   Approximation Algorithms for Data
                                  Placement Problems . . . . . . . . . . . 1411--1429
           Ramesh Hariharan and   
        Telikepalli Kavitha and   
                  Kurt Mehlhorn   Faster Algorithms for Minimum Cycle
                                  Basis in Directed Graphs . . . . . . . . 1430--1447
               Subhash Khot and   
                     Assaf Naor   Linear Equations Modulo $2$ and the
                                  $L_1$ Diameter of Convex Bodies  . . . . 1448--1463
            Erik D. Demaine and   
                Uriel Feige and   
   MohammadTaghi Hajiaghayi and   
       Mohammad R. Salavatipour   Combination Can Be Hard: Approximability
                                  of the Unique Coverage Problem . . . . . 1464--1483
                  S. Kijima and   
                      T. Matsui   Approximation Algorithm and Perfect
                                  Sampler for Closed Jackson Networks with
                                  Single Servers . . . . . . . . . . . . . 1484--1503
               Lusheng Wang and   
                     Yu Lin and   
                    Xiaowen Liu   Approximation Algorithms for
                                  Biclustering Problems  . . . . . . . . . 1504--1518
        Marcin Jurdzi\'nski and   
              Mike Paterson and   
                      Uri Zwick   A Deterministic Subexponential Algorithm
                                  for Solving Parity Games . . . . . . . . 1519--1532
          Adam L. Buchsbaum and   
          Loukas Georgiadis and   
                Haim Kaplan and   
                Anne Rogers and   
           Robert E. Tarjan and   
           Jeffery R. Westbrook   Linear-Time Algorithms for Dominators
                                  and Other Path-Evaluation Problems . . . 1533--1573
          Achour Mostefaoui and   
            Sergio Rajsbaum and   
              Michel Raynal and   
               Corentin Travers   The Combined Power of Conditions and
                                  Information on Failures to Solve
                                  Asynchronous Set Agreement . . . . . . . 1574--1601
         Elliot Anshelevich and   
           Anirban Dasgupta and   
              Jon Kleinberg and   
          Éva Tardos and   
                 Tom Wexler and   
                Tim Roughgarden   The Price of Stability for Network
                                  Design with Fair Cost Allocation . . . . 1602--1623
                    Ran Raz and   
               Amir Shpilka and   
                Amir Yehudayoff   A Lower Bound for the Size of
                                  Syntactically Multilinear Arithmetic
                                  Circuits . . . . . . . . . . . . . . . . 1624--1647
              Adam Meyerson and   
            Kamesh Munagala and   
                  Serge Plotkin   Cost-Distance: Two Metric Network Design 1648--1659

SIAM Journal on Computing
Volume 38, Number 5, 2009

                 Boaz Barak and   
                 Oded Goldreich   Universal Arguments and their
                                  Applications . . . . . . . . . . . . . . 1661--1694
            Dmitry Gavinsky and   
                Julia Kempe and   
         Iordanis Kerenidis and   
                    Ran Raz and   
                 Ronald de Wolf   Exponential Separation for One-Way
                                  Quantum Communication Complexity, with
                                  Applications to Cryptography . . . . . . 1695--1708
            Joan Feigenbaum and   
             Sampath Kannan and   
            Andrew McGregor and   
             Siddharth Suri and   
                     Jian Zhang   Graph Distances in the Data-Stream Model 1709--1727
                Amos Beimel and   
                  Paz Carmi and   
               Kobbi Nissim and   
                   Enav Weinreb   Private Approximation of Search Problems 1728--1760
                 Yuval Emek and   
                    David Peleg   Approximating Minimum Max-Stretch
                                  Spanning Trees on Unweighted Graphs  . . 1761--1781
                Libor Barto and   
               Marcin Kozik and   
                     Todd Niven   The CSP Dichotomy Holds for Digraphs
                                  with No Sources and No Sinks (a Positive
                                  Answer to a Conjecture of Bang-Jensen
                                  and Hell)  . . . . . . . . . . . . . . . 1782--1802
             Prosenjit Bose and   
                  Paz Carmi and   
            Mathieu Couture and   
            Anil Maheshwari and   
                  Pat Morin and   
                   Michiel Smid   Spanners of Complete $k$-Partite
                                  Geometric Graphs . . . . . . . . . . . . 1803--1820
                Gahyun Park and   
           Hsien-Kuei Hwang and   
          Pierre Nicod\`eme and   
           Wojciech Szpankowski   Profiles of Tries  . . . . . . . . . . . 1821--1880
           Umberto Straccia and   
        Manuel Ojeda-Aciego and   
       Carlos V. Damásio   On Fixed-Points of Multivalued Functions
                                  on Complete Lattices and Their
                                  Application to Generalized Logic
                                  Programs . . . . . . . . . . . . . . . . 1881--1911
              Ulrich Schmid and   
              Bettina Weiss and   
                    Idit Keidar   Impossibility Results and Lower Bounds
                                  for Consensus under Link Failures  . . . 1912--1951
           Kiran S. Kedlaya and   
                Sergey Yekhanin   Locally Decodable Codes from Nice
                                  Subsets of Finite Fields and Prime
                                  Factors of Mersenne Numbers  . . . . . . 1952--1969
                Martin Dyer and   
        Leslie Ann Goldberg and   
                    Mark Jerrum   The Complexity of Weighted Boolean CSP   1970--1986
              Eric Allender and   
       Peter Bürgisser and   
  Johan Kjeldgaard-Pedersen and   
            Peter Bro Miltersen   On the Complexity of Numerical Analysis  1987--2006
            Yngve Villanger and   
            Pinar Heggernes and   
            Christophe Paul and   
                 Jan Arne Telle   Interval Completion Is Fixed Parameter
                                  Tractable  . . . . . . . . . . . . . . . 2007--2020
              Wouter Gelade and   
                Wim Martens and   
                    Frank Neven   Optimizing Schema Languages for XML:
                                  Numerical Constraints and Interleaving   2021--2043
               Sudipto Guha and   
                Andrew McGregor   Stream Order and Order Statistics:
                                  Quantile Estimation in Random-Order
                                  Streams  . . . . . . . . . . . . . . . . 2044--2059
           Anirban Dasgupta and   
             Petros Drineas and   
                Boulos Harb and   
                 Ravi Kumar and   
             Michael W. Mahoney   Sampling Algorithms and Coresets for
                                  $\ell_p$ Regression  . . . . . . . . . . 2060--2078
           Holger Spakowski and   
                 Rahul Tripathi   Hierarchical Unambiguity . . . . . . . . 2079--2112

SIAM Journal on Computing
Volume 38, Number 6, 2009

          Alexander A. Sherstov   Separating ${AC}^0$ from Depth-2
                                  Majority Circuits  . . . . . . . . . . . 2113--2129
                   Amir Shpilka   Interpolation of Depth-3 Arithmetic
                                  Circuits with Two Multiplication Gates   2130--2161
               Wing-Kai Hon and   
          Kunihiko Sadakane and   
                  Wing-Kin Sung   Breaking a Time-and-Space Barrier in
                                  Constructing Full-Text Indices . . . . . 2162--2178
               Mee Yee Chan and   
               Wun-Tat Chan and   
         Francis Y. L. Chin and   
         Stanley P. Y. Fung and   
                  Ming-Yang Kao   Linear-Time Haplotype Inference on
                                  Pedigrees without Recombinations and
                                  Mating Loops . . . . . . . . . . . . . . 2179--2197
                  Jing Xiao and   
                    Lan Liu and   
                 Lirong Xia and   
                      Tao Jiang   Efficient Algorithms for Reconstructing
                                  Zero-Recombinant Haplotypes on a
                                  Pedigree Based on Fast Elimination of
                                  Redundant Linear Equations . . . . . . . 2198--2219
              Louay M. J. Bazzi   Polylogarithmic Independence Can Fool
                                  DNF Formulas . . . . . . . . . . . . . . 2220--2272
                 Susanne Albers   On the Value of Coordination in Network
                                  Design . . . . . . . . . . . . . . . . . 2273--2302
          T.-H. Hubert Chan and   
            Kedar Dhamdhere and   
               Anupam Gupta and   
              Jon Kleinberg and   
            Aleksandrs Slivkins   Metric Embeddings with Relaxed
                                  Guarantees . . . . . . . . . . . . . . . 2303--2329
          Parikshit Gopalan and   
        Phokion G. Kolaitis and   
              Elitza Maneva and   
      Christos H. Papadimitriou   The Connectivity of Boolean
                                  Satisfiability: Computational and
                                  Structural Dichotomies . . . . . . . . . 2330--2355
            Leonard Adleman and   
                Jarkko Kari and   
                  Lila Kari and   
             Dustin Reishus and   
                     Petr Sosik   The Undecidability of the Infinite
                                  Ribbon Problem: Implications for
                                  Computing by Self-Assembly . . . . . . . 2356--2381
            David J. Aldous and   
          Charles Bordenave and   
                   Marc Lelarge   Dynamic Programming Optimization over
                                  Random Data: The Scaling Exponent for
                                  Near-Optimal Solutions . . . . . . . . . 2382--2410
                Luc Devroye and   
                 James King and   
                Colin McDiarmid   Random Hyperplane Search Trees . . . . . 2411--2425
               Sudipto Guha and   
              Adam Meyerson and   
                Kamesh Munagala   A Constant Factor Approximation for the
                                  Single Sink Edge Installation Problem    2426--2442
                   Marcin Kozik   A 2EXPTIME Complete Varietal Membership
                                  Problem  . . . . . . . . . . . . . . . . 2443--2467
            Baruch Awerbuch and   
                Rohit Khandekar   Stateless Distributed Gradient Descent
                                  for Positive Linear Programs . . . . . . 2468--2486
         Robert Krauthgamer and   
                   Yuval Rabani   Improved Lower Bounds for Embeddings
                                  into $L_1$ . . . . . . . . . . . . . . . 2487--2498
               Artur Czumaj and   
               Asaf Shapira and   
               Christian Sohler   Testing Hereditary Properties of
                                  Nonexpanding Bounded-Degree Graphs . . . 2499--2510
                 Eli Ben-Sasson   Size-Space Tradeoffs for Resolution  . . 2511--2525
                Jianer Chen and   
              Joachim Kneis and   
                Songjian Lu and   
          Daniel Mölle and   
             Stefan Richter and   
           Peter Rossmanith and   
               Sing-Hoi Sze and   
                  Fenghui Zhang   Randomized Divide-and-Conquer: Improved
                                  Path, Matching, and Packing Algorithms   2526--2547


SIAM Journal on Computing
Volume 39, Number 1, 2009

            Dmitry Gavinsky and   
                Julia Kempe and   
                 Oded Regev and   
                 Ronald de Wolf   Bounded-Error Quantum State
                                  Identification and Exponential
                                  Separations in Communication Complexity  1--24
                   John Watrous   Zero-Knowledge against Quantum Attacks   25--58
           Jakob Nordström   Narrow Proofs May Be Spacious:
                                  Separating Space and Width in Resolution 59--121
                    Uriel Feige   On Maximizing Welfare When Utility
                                  Functions Are Subadditive  . . . . . . . 122--142
                  Noga Alon and   
              Eldar Fischer and   
                Ilan Newman and   
                   Asaf Shapira   A Combinatorial Characterization of the
                                  Testable Graph Properties: It's All
                                  About Regularity . . . . . . . . . . . . 143--167
                       Anup Rao   Extractors for a Constant Number of
                                  Polynomially Small Min-Entropy
                                  Independent Sources  . . . . . . . . . . 168--194
    Constantinos Daskalakis and   
           Paul W. Goldberg and   
      Christos H. Papadimitriou   The Complexity of Computing a Nash
                                  Equilibrium  . . . . . . . . . . . . . . 195--259
        Dimitris Achlioptas and   
       Federico Ricci-Tersenghi   Random Formulas Have Frozen Variables    260--280
            Chandra Chekuri and   
             Sanjeev Khanna and   
              F. Bruce Shepherd   Edge-Disjoint Paths in Planar Graphs
                                  with Constant Congestion . . . . . . . . 281--301
                  Nir Ailon and   
               Bernard Chazelle   The Fast Johnson--Lindenstrauss
                                  Transform and Approximate Nearest
                                  Neighbors  . . . . . . . . . . . . . . . 302--322
         Alex Samorodnitsky and   
                  Luca Trevisan   Gowers Uniformity, Influence of
                                  Variables, and PCPs  . . . . . . . . . . 323--360
             Scott Aaronson and   
               Sudipto Guha and   
              Jon Kleinberg and   
             Frank McSherry and   
       Dieter van Melkebeek and   
                     Amit Sahai   Special Issue on the Thirty-Eighth
                                  Annual ACM Symposium On Theory Of
                                  Computing (STOC 2006)  . . . . . . . . . vii--vii

SIAM Journal on Computing
Volume 39, Number 2, 2009

                  Noga Alon and   
            Baruch Awerbuch and   
                 Yossi Azar and   
             Niv Buchbinder and   
            Joseph (Seffi) Naor   The Online Set Cover Problem . . . . . . 361--370
             Howard Karloff and   
               Subhash Khot and   
              Aranyak Mehta and   
                   Yuval Rabani   On Earthmover Distance, Metric Labeling,
                                  and $0$-Extension  . . . . . . . . . . . 371--387
                    Igor Semaev   Sparse Algebraic Equations over Finite
                                  Fields . . . . . . . . . . . . . . . . . 388--409
            Andreas Maletti and   
            Jonathan Graehl and   
               Mark Hopkins and   
                   Kevin Knight   The Power of Extended Top-Down Tree
                                  Transducers  . . . . . . . . . . . . . . 410--430
               Artur Czumaj and   
                 Andrzej Lingas   Finding a Heaviest Vertex-Weighted
                                  Triangle Is not Harder than Matrix
                                  Multiplication . . . . . . . . . . . . . 431--444
                 Zvi Lotker and   
           Boaz Patt-Shamir and   
               Adi Rosén   Distributed Approximate Matching . . . . 445--460
                Sven Koenig and   
      Joseph S. B. Mitchell and   
              Apurva Mudgal and   
                    Craig Tovey   A Near-Tight Approximation Algorithm for
                                  the Robot Localization Problem . . . . . 461--490
                        Or Meir   Combinatorial Construction of Locally
                                  Testable Codes . . . . . . . . . . . . . 491--544
             Matthew Andrew and   
               Ashwin Nayak and   
             Rajmohan Rajaraman   Special Section on Foundations of
                                  Computer Science . . . . . . . . . . . . 545--545
     Andreas Björklund and   
             Thore Husfeldt and   
                 Mikko Koivisto   Set Partitioning via Inclusion-Exclusion 546--563
        Russell Impagliazzo and   
             Ragesh Jaiswal and   
             Valentine Kabanets   Approximate List-Decoding of Direct
                                  Product Codes and Uniform Hardness
                                  Amplification  . . . . . . . . . . . . . 564--605
             Vitaly Feldman and   
          Parikshit Gopalan and   
               Subhash Khot and   
         Ashok Kumar Ponnuswami   On Agnostic Learning of Parities,
                                  Monomials, and Halfspaces  . . . . . . . 606--645
                Roman Vershynin   Beyond Hirsch Conjecture: Walks on
                                  Random Polytopes and Smoothed Complexity
                                  of the Simplex Method  . . . . . . . . . 646--678
          Nicholas J. A. Harvey   Algebraic Algorithms for Matching and
                                  Matroid Problems . . . . . . . . . . . . 679--702
            Timothy M. Chan and   
             Mihai P\uatra\cscu   Transdichotomous Results in
                                  Computational Geometry, I: Point
                                  Location in Sublogarithmic Time  . . . . 703--729
         Mihai P\uatra\cscu and   
                  Mikkel Thorup   Higher Lower Bounds for Near-Neighbor
                                  and Further Rich Problems  . . . . . . . 730--741
       Venkatesan Guruswami and   
             Prasad Raghavendra   Hardness of Learning Halfspaces with
                                  Noise  . . . . . . . . . . . . . . . . . 742--765
               David Arthur and   
           Sergei Vassilvitskii   Worst-Case and Smoothed Analysis of the
                                  ICP Algorithm, with an Application to
                                  the $k$-Means Method . . . . . . . . . . 766--782

SIAM Journal on Computing
Volume 39, Number 3, 2009

             Kevin L. Chang and   
                    Ravi Kannan   Pass-Efficient Algorithms for Learning
                                  Mixtures of Uniform Distributions  . . . 783--812
        Sofya Raskhodnikova and   
                   Dana Ron and   
               Amir Shpilka and   
                     Adam Smith   Strong Lower Bounds for Approximating
                                  Distribution Support Size and the
                                  Distinct Elements Problem  . . . . . . . 813--842
                 Irit Dinur and   
            Elchanan Mossel and   
                     Oded Regev   Conditional Hardness for Approximate
                                  Coloring . . . . . . . . . . . . . . . . 843--873
            Phong Q. Nguyen and   
           Damien Stehlé   An LLL Algorithm with Quadratic
                                  Complexity . . . . . . . . . . . . . . . 874--903
               Artur Czumaj and   
               Christian Sohler   Estimating the Weight of Metric Minimum
                                  Spanning Trees in Sublinear Time . . . . 904--922
                        Ke Chen   On Coresets for $k$-Median and $k$-Means
                                  Clustering in Metric and Euclidean
                                  Spaces and Their Applications  . . . . . 923--947
                  Shengyu Zhang   Tight Bounds for Randomized and Quantum
                                  Local Search . . . . . . . . . . . . . . 948--977
              Eric Allender and   
             Vladlen Koltun and   
               Maxim Sviridenko   Special Section On The Thirty-Ninth
                                  Annual ACM Symposium On Theory Of
                                  Computing (STOC 2007)  . . . . . . . . . 978--978
              Martin Fürer   Faster Integer Multiplication  . . . . . 979--1005
             Ronen Shaltiel and   
              Christopher Umans   Low-End Uniform Hardness versus
                                  Randomness Tradeoffs for AM  . . . . . . 1006--1037
                Rahul Santhanam   Circuit Lower Bounds for Merlin--Arthur
                                  Classes  . . . . . . . . . . . . . . . . 1038--1061
                Lap Chi Lau and   
        Joseph (Seffi) Naor and   
   Mohammad R. Salavatipour and   
                    Mohit Singh   Survivable Network Design with Degree or
                                  Order Constraints  . . . . . . . . . . . 1062--1087
             Sham M. Kakade and   
          Adam Tauman Kalai and   
                 Katrina Ligett   Playing Games with Approximation
                                  Algorithms . . . . . . . . . . . . . . . 1088--1106
                  Anna Pagh and   
                Rasmus Pagh and   
                Milan Ru\vzi\'c   Linear Probing with Constant
                                  Independence . . . . . . . . . . . . . . 1107--1120
                Yuval Ishai and   
           Eyal Kushilevitz and   
           Rafail Ostrovsky and   
                     Amit Sahai   Zero-Knowledge Proofs from Secure
                                  Multiparty Computation . . . . . . . . . 1121--1152
             Iftach Haitner and   
          Minh-Huyen Nguyen and   
              Shien Jin Ong and   
              Omer Reingold and   
                   Salil Vadhan   Statistically Hiding Commitments and
                                  Statistical Zero-Knowledge Arguments
                                  from Any One-Way Function  . . . . . . . 1153--1218

SIAM Journal on Computing
Volume 39, Number 4, 2010

          Mohammad Ali Abam and   
               Mark de Berg and   
              Bettina Speckmann   Kinetic $kd$-Trees and Longest-Side
                                  $kd$-Trees . . . . . . . . . . . . . . . 1219--1232
           Andrei Z. Broder and   
                Adam Kirsch and   
                 Ravi Kumar and   
       Michael Mitzenmacher and   
                  Eli Upfal and   
           Sergei Vassilvitskii   The Hiring Problem and Lake Wobegon
                                  Strategies . . . . . . . . . . . . . . . 1233--1255
              Nikhil Bansal and   
            Alberto Caprara and   
               Maxim Sviridenko   A New Approximation Method for Set
                                  Covering Problems, with Applications to
                                  Multidimensional Bin Packing . . . . . . 1256--1278
                  Zeev Dvir and   
               Amir Shpilka and   
                Amir Yehudayoff   Hardness-Randomness Tradeoffs for
                                  Bounded Depth Arithmetic Circuits  . . . 1279--1293
              Nikhil Bansal and   
                 Kirk Pruhs and   
                    Cliff Stein   Speed Scaling for Weighted Flow Time . . 1294--1308
             Graham Cormode and   
        Srikanta Tirthapura and   
                      Bojian Xu   Time-decaying Sketches for Robust
                                  Aggregation of Sensor Data . . . . . . . 1309--1339
         Ilias Diakonikolas and   
             Mihalis Yannakakis   Small Approximate Pareto Sets for
                                  Biobjective Shortest Paths and Other
                                  Problems . . . . . . . . . . . . . . . . 1340--1371
             Liad Blumrosen and   
                     Noam Nisan   On the Computational Power of Demand
                                  Queries  . . . . . . . . . . . . . . . . 1372--1391
                   Klaus Jansen   Parameterized Approximation Scheme for
                                  the Multiple Knapsack Problem  . . . . . 1392--1412
              Nikhil Bansal and   
            Rohit Khandekar and   
            Viswanath Nagarajan   Additive Guarantees for Degree-Bounded
                                  Directed Network Design  . . . . . . . . 1413--1431
                     Bin Ma and   
                   Xiaoming Sun   More Efficient Algorithms for Closest
                                  String and Substring Problems  . . . . . 1432--1443
               Amihood Amir and   
             Tzvika Hartman and   
                 Oren Kapah and   
                Avivit Levy and   
                      Ely Porat   On the Cost of Interchange Rearrangement
                                  in Strings . . . . . . . . . . . . . . . 1444--1461
              Sergey Bravyi and   
                 Barbara Terhal   Complexity of Stoquastic
                                  Frustration-Free Hamiltonians  . . . . . 1462--1485
                Wim Martens and   
                Frank Neven and   
              Thomas Schwentick   Complexity of Decision Problems for XML
                                  Schemas and Chain Regular Expressions    1486--1530
                Libor Barto and   
                   Marcin Kozik   Congruence Distributivity Implies
                                  Bounded Width  . . . . . . . . . . . . . 1531--1542
                Adam Kirsch and   
       Michael Mitzenmacher and   
                     Udi Wieder   More Robust Hashing: Cuckoo Hashing with
                                  a Stash  . . . . . . . . . . . . . . . . 1543--1561
                 Oded Regev and   
                      Ben Toner   Simulating Quantum Correlations with
                                  Finite Communication . . . . . . . . . . 1562--1580
           Rebecca Schulman and   
                   Erik Winfree   Programmable Control of Nucleation for
                                  Algorithmic Self-Assembly  . . . . . . . 1581--1616
              Claire Kenyon and   
               Yuval Rabani and   
              Alistair Sinclair   Low Distortion Maps Between Point Sets   1617--1636
        Russell Impagliazzo and   
             Ragesh Jaiswal and   
         Valentine Kabanets and   
                  Avi Wigderson   Uniform Direct Product Theorems:
                                  Simplified, Optimized, and Derandomized  1637--1665

SIAM Journal on Computing
Volume 39, Number 5, 2010

               Danny Harnik and   
                      Moni Naor   On the Compressibility of $\mathcal{NP}$
                                  Instances and Cryptographic Applications 1667--1713
           Markus Kirschmer and   
                    John Voight   Algorithmic Enumeration of Ideal Classes
                                  for Quaternion Orders  . . . . . . . . . 1714--1747
              Sanjeev Arora and   
                 Elad Hazan and   
                    Satyen Kale   $O(\sqrt{\log n})$ Approximation to
                                  SPARSEST CUT in $\tilde{O}(n^2)$ Time    1748--1771
                 C. Chekuri and   
           M. T. Hajiaghayi and   
                G. Kortsarz and   
             M. R. Salavatipour   Approximation Algorithms for Nonuniform
                                  Buy-at-Bulk Network Design . . . . . . . 1772--1798
                Ho-Lin Chen and   
            Tim Roughgarden and   
                Gregory Valiant   Designing Network Protocols for Good
                                  Equilibria . . . . . . . . . . . . . . . 1799--1832
      Alexander A. Razborov and   
          Alexander A. Sherstov   The Sign-Rank of AC$^0$  . . . . . . . . 1833--1855
                 Satish Rao and   
                   Shuheng Zhou   Edge Disjoint Paths in Moderately
                                  Connected Graphs . . . . . . . . . . . . 1856--1887
             Siu-Wing Cheng and   
               Hyeon-Suk Na and   
           Antoine Vigneron and   
                     Yajun Wang   Querying Approximate Shortest Paths in
                                  Anisotropic Regions  . . . . . . . . . . 1888--1918
           Amit Chakrabarti and   
                     Oded Regev   An Optimal Randomized Cell Probe Lower
                                  Bound for Approximate Nearest Neighbor
                                  Searching  . . . . . . . . . . . . . . . 1919--1940
             Fedor V. Fomin and   
           Petr A. Golovach and   
          Daniel Lokshtanov and   
                  Saket Saurabh   Intractability of Clique-Width
                                  Parameterizations  . . . . . . . . . . . 1941--1956
               Artur Czumaj and   
               Piotr Krysta and   
          Berthold Vöcking   Selfish Traffic Allocation for Server
                                  Farms  . . . . . . . . . . . . . . . . . 1957--1987
               Tali Kaufman and   
               Simon Litsyn and   
                       Ning Xie   Breaking the $\epsilon$-Soundness Bound
                                  of the Linearity Test over GF(2) . . . . 1988--2003
              Kevin Matulef and   
             Ryan O'Donnell and   
           Ronitt Rubinfeld and   
              Rocco A. Servedio   Testing Halfspaces . . . . . . . . . . . 2004--2047
                Edith Cohen and   
                Haim Kaplan and   
                      Tova Milo   Labeling Dynamic XML Trees . . . . . . . 2048--2074
                Timothy M. Chan   More Algorithms for All-Pairs Shortest
                                  Paths in Weighted Graphs . . . . . . . . 2075--2089
           Eyal Kushilevitz and   
             Yehuda Lindell and   
                      Tal Rabin   Information-Theoretically Secure
                                  Protocols and Security under Composition 2090--2112

SIAM Journal on Computing
Volume 39, Number 6, 2010

         Vladimir Braverman and   
               Rafail Ostrovsky   Effective Computations on Sliding
                                  Windows  . . . . . . . . . . . . . . . . 2113--2131
               Iyad A. Kanj and   
        Ljubomir Perkovi\'c and   
                         Ge Xia   On Spanners and Lightweight Spanners of
                                  Geometric Graphs . . . . . . . . . . . . 2132--2161
              Gianluca De Marco   Distributed Broadcast in Unknown Radio
                                  Networks . . . . . . . . . . . . . . . . 2162--2175
            Elchanan Mossel and   
                 Sebastien Roch   Submodularity of Influence in Social
                                  Networks: From Local to Global . . . . . 2176--2188
      Deeparnab Chakrabarty and   
                     Gagan Goel   On the Approximability of Budgeted
                                  Allocations and Improved Lower Bounds
                                  for Submodular Welfare Maximization and
                                  GAP  . . . . . . . . . . . . . . . . . . 2189--2211
             Jaroslaw Byrka and   
                   Karen Aardal   An Optimal Bifactor Approximation
                                  Algorithm for the Metric Uncapacitated
                                  Facility Location Problem  . . . . . . . 2212--2231
        Flavio Chierichetti and   
                 Andrea Vattani   The Local Nature of List Colorings for
                                  Graphs of High Girth . . . . . . . . . . 2232--2250
              Eldar Fischer and   
Frédéric Magniez and   
            Michel de Rougemont   Approximate Satisfiability and
                                  Equivalence  . . . . . . . . . . . . . . 2251--2281
             Javier Esparza and   
              Stefan Kiefer and   
           Michael Luttenberger   Computing the Least Fixed Point of
                                  Positive Polynomial Systems  . . . . . . 2282--2335
                  Noga Alon and   
           Amin Coja-Oghlan and   
           Hiêp H\`an and   
                Mihyun Kang and   
        Vojt\uech Rödl and   
                Mathias Schacht   Quasi-Randomness and Algorithmic
                                  Regularity for Graphs with General
                                  Degree Distributions . . . . . . . . . . 2336--2362
                   Liam Roditty   On the $k$ Shortest Simple Paths Problem
                                  in Weighted Directed Graphs  . . . . . . 2363--2376
           Cristopher Moore and   
          Alexander Russell and   
                 Piotr \'Sniady   On the Impossibility of a Quantum Sieve
                                  Algorithm for Graph Isomorphism  . . . . 2377--2396
               James R. Lee and   
                    Chris Umans   Special Section On Foundations of
                                  Computer Science . . . . . . . . . . . . 2397--2397
            Alexandr Andoni and   
             Robert Krauthgamer   The Computational Hardness of Estimating
                                  Edit Distance  . . . . . . . . . . . . . 2398--2429
                    Per Austrin   Towards Sharp Inapproximability for Any
                                  2-CSP  . . . . . . . . . . . . . . . . . 2430--2463
            Andrej Bogdanov and   
                 Emanuele Viola   Pseudorandom Bits for Polynomials  . . . 2464--2486
             Moses Charikar and   
      Konstantin Makarychev and   
                Yury Makarychev   Local Global Tradeoffs in Metric
                                  Embeddings . . . . . . . . . . . . . . . 2487--2512
                A. Ambainis and   
               A. M. Childs and   
            B. W. Reichardt and   
                R. \vSpalek and   
                       S. Zhang   Any AND-OR Formula of Size $N$ Can Be
                                  Evaluated in Time $N^{1/2+o(1)}$ on a
                                  Quantum Computer . . . . . . . . . . . . 2513--2530
            Kousha Etessami and   
             Mihalis Yannakakis   On the Complexity of Nash Equilibria and
                                  Other Fixed Points . . . . . . . . . . . 2531--2597
          Parikshit Gopalan and   
               Subhash Khot and   
                    Rishi Saket   Hardness of Reconstructing Multivariate
                                  Polynomials over Finite Fields . . . . . 2598--2621
             Philipp Hertel and   
                Toniann Pitassi   The PSPACE-Completeness of Black-White
                                  Pebbling . . . . . . . . . . . . . . . . 2622--2682

SIAM Journal on Computing
Volume 39, Number 7, 2010

                 Mary Cryan and   
                Martin Dyer and   
                   Dana Randall   Approximately Counting Integral Flows
                                  and Cell-Bounded Contingency Tables  . . 2683--2703
               Boris Aronov and   
                   Micha Sharir   Approximate Halfspace Range Counting . . 2704--2725
             Wojciech Golab and   
              Danny Hendler and   
                Philipp Woelfel   An $O(1)$ RMRs Leader Election Algorithm 2726--2760
             Oded Goldreich and   
           Shafi Goldwasser and   
                  Asaf Nussboim   On the Implementation of Huge Random
                                  Objects  . . . . . . . . . . . . . . . . 2761--2822
               Amin Coja-Oghlan   A Better Algorithm for Random $k$-SAT    2823--2864
           Surender Baswana and   
            Telikepalli Kavitha   Faster Algorithms for All-pairs
                                  Approximate Shortest Paths in Undirected
                                  Graphs . . . . . . . . . . . . . . . . . 2865--2896
               Michael Saks and   
                   C. Seshadhri   Local Monotonicity Reconstruction  . . . 2897--2926
              Jean Cardinal and   
             Samuel Fiorini and   
         Gwenaël Joret and   
    Raphaël M. Jungers and   
                   J. Ian Munro   An Efficient Algorithm for Partial Order
                                  Production . . . . . . . . . . . . . . . 2927--2940
            Akinori Kawachi and   
              Tomoyuki Yamakami   Quantum Hardcore Functions by
                                  Complexity-Theoretical Quantum List
                                  Decoding . . . . . . . . . . . . . . . . 2941--2969
             Arash Asadpour and   
                    Amin Saberi   An Approximation Algorithm for Max-Min
                                  Fair Allocation of Indivisible Goods . . 2970--2989
           Marc van Kreveld and   
       Maarten Löffler and   
          Joseph S. B. Mitchell   Preprocessing Imprecise Points and
                                  Splitting Triangulations . . . . . . . . 2990--3000
                     Zeev Nutov   Approximating Steiner Networks with
                                  Node-Weights . . . . . . . . . . . . . . 3001--3022
                Pawe Idziak and   
           Petar Markovi\'c and   
             Ralph McKenzie and   
          Matthew Valeriote and   
                   Ross Willard   Tractability and Learnability Arising
                                  from Algebras with Few Subpowers . . . . 3023--3037
           Julián Mestre   Adaptive Local Ratio . . . . . . . . . . 3038--3057
                 Alon Rosen and   
                      Gil Segev   Chosen-Ciphertext Security via
                                  Correlated Products  . . . . . . . . . . 3058--3088
                  Itai Arad and   
                    Zeph Landau   Quantum Computation and the Evaluation
                                  of Tensor Networks . . . . . . . . . . . 3089--3121
             Ronen Shaltiel and   
                 Emanuele Viola   Hardness Amplification Proofs Require
                                  Majority . . . . . . . . . . . . . . . . 3122--3154
              Eldar Fischer and   
              Arie Matsliah and   
                   Asaf Shapira   Approximate Hypergraph Partitioning and
                                  Applications . . . . . . . . . . . . . . 3155--3185
            Pierre McKenzie and   
             Michael Thomas and   
               Heribert Vollmer   Extensional Uniformity for Boolean
                                  Circuits . . . . . . . . . . . . . . . . 3186--3206
                Julia Kempe and   
                 Oded Regev and   
                      Ben Toner   Unique Games with Entangled Provers Are
                                  Easy . . . . . . . . . . . . . . . . . . 3207--3229
             Eli Ben-Sasson and   
       Venkatesan Guruswami and   
               Tali Kaufman and   
                Madhu Sudan and   
               Michael Viderman   Locally Testable Codes Require Redundant
                                  Testers  . . . . . . . . . . . . . . . . 3230--3247
               Boris Aronov and   
                Esther Ezra and   
                   Micha Sharir   Small-Size $\epsilon$-Nets for
                                  Axis-Parallel Rectangles and Boxes . . . 3248--3282
                Haim Kaplan and   
                Natan Rubin and   
                   Micha Sharir   Line Transversals of Convex Polyhedra in
                                  $\mathbb{R}^3$ . . . . . . . . . . . . . 3283--3310
              Nikhil Bansal and   
                  Kirk R. Pruhs   Server Scheduling to Balance Priorities,
                                  Fairness, and Average Quality of Service 3311--3335
        Leslie Ann Goldberg and   
               Martin Grohe and   
                Mark Jerrum and   
                   Marc Thurley   A Complexity Dichotomy for Partition
                                  Functions with Mixed Signs . . . . . . . 3336--3402
                 S. Chechik and   
                M. Langberg and   
                   D. Peleg and   
                     L. Roditty   Fault Tolerant Spanners for General
                                  Graphs . . . . . . . . . . . . . . . . . 3403--3423
                Endre Boros and   
          Khaled Elbassioni and   
                Kazuhisa Makino   Left-to-Right Multiplication for
                                  Monotone Boolean Dualization . . . . . . 3424--3439

SIAM Journal on Computing
Volume 39, Number 8, 2010

         Ilias Diakonikolas and   
          Parikshit Gopalan and   
             Ragesh Jaiswal and   
          Rocco A. Servedio and   
                 Emanuele Viola   Bounded Independence Fools Halfspaces    3441--3462
            Anna Gál and   
              Parikshit Gopalan   Lower Bounds on Streaming Algorithms for
                                  Approximating the Length of the Longest
                                  Increasing Subsequence . . . . . . . . . 3463--3479
              Robert M. Hierons   Reaching and Distinguishing States of
                                  Distributed Systems  . . . . . . . . . . 3480--3500
               Yuval Rabani and   
                   Amir Shpilka   Explicit Construction of a Small
                                  $\epsilon$-Net for Linear Threshold
                                  Functions  . . . . . . . . . . . . . . . 3501--3520
                     David Doty   Randomized Self-Assembly for Exact
                                  Shapes . . . . . . . . . . . . . . . . . 3521--3552
      Konstantinos Georgiou and   
                Avner Magen and   
            Toniann Pitassi and   
               Iannis Tourlakis   Integrality Gaps of $2-o(1)$ for Vertex
                                  Cover SDPs in the Lovász--Schrijver
                                  Hierarchy  . . . . . . . . . . . . . . . 3553--3570
               Klaus Jansen and   
                Ralf Thöle   Approximation Algorithms for Scheduling
                                  Parallel Jobs  . . . . . . . . . . . . . 3571--3615
             Lisa Fleischer and   
       Jochen Könemann and   
           Stefano Leonardi and   
             Guido Schäfer   Strict Cost Sharing Schemes for Steiner
                                  Forest . . . . . . . . . . . . . . . . . 3616--3632
                Guolong Lin and   
   Chandrashekhar Nagarajan and   
         Rajmohan Rajaraman and   
            David P. Williamson   A General Approach for Incremental
                                  Approximation and Hierarchical
                                  Clustering . . . . . . . . . . . . . . . 3633--3669
                    David Duris   Extension Preservation Theorems on
                                  Classes of Acyclic Finite Structures . . 3670--3681
            Manuel Bodirsky and   
                     Hubie Chen   Quantified Equality Constraints  . . . . 3682--3699
              Simon Fischer and   
          Harald Räcke and   
          Berthold Vöcking   Fast Convergence to Wardrop Equilibria
                                  by Adaptive Sampling Methods . . . . . . 3700--3735
       Gábor Ivanyos and   
            Marek Karpinski and   
                   Nitin Saxena   Deterministic Polynomial Time Algorithms
                                  for Matrix Completion Problems . . . . . 3736--3751
               Partha Dutta and   
           Rachid Guerraoui and   
                Ron R. Levy and   
                Marko Vukoli\'c   Fast Access to Distributed Atomic Memory 3752--3783
Éric Colin de Verdi\`ere and   
                  Jeff Erickson   Tightening Nonsimple Paths and Cycles on
                                  Surfaces . . . . . . . . . . . . . . . . 3784--3813
             David Eppstein and   
        Michael T. Goodrich and   
                  Darren Strash   Linear-Time Algorithms for Geometric
                                  Graphs with Sublinearly Many Edge
                                  Crossings  . . . . . . . . . . . . . . . 3814--3829
             Maxim Gurevich and   
                    Idit Keidar   Correctness of Gossip-Based Membership
                                  under Message Loss . . . . . . . . . . . 3830--3859
               Julia Lipman and   
               Quentin F. Stout   Analysis of Delays Caused by Local
                                  Synchronization  . . . . . . . . . . . . 3860--3884
               Hagit Attiya and   
            Keren Censor-Hillel   Lower Bounds for Randomized Consensus
                                  under a Weak Adversary . . . . . . . . . 3885--3904


SIAM Journal on Computing
Volume 40, Number 1, 2011

                Per Austrin and   
             Johan Håstad   Randomly Supported Independence and
                                  Resistance . . . . . . . . . . . . . . . 1--27
                 Cheng Shao and   
          Jennifer L. Welch and   
              Evelyn Pierce and   
                  Hyunyoung Lee   Multiwriter Consistency Conditions for
                                  Shared Memory Registers  . . . . . . . . 28--62
                  Eli Gafni and   
           Rachid Guerraoui and   
                 Bastian Pochon   The Complexity of Early Deciding Set
                                  Agreement  . . . . . . . . . . . . . . . 63--78
                 Elad Hazan and   
             Robert Krauthgamer   How Hard Is It to Approximate the Best
                                  Nash Equilibrium?  . . . . . . . . . . . 79--91
           Heiner Ackermann and   
           Paul W. Goldberg and   
          Vahab S. Mirrokni and   
          Heiko Röglin and   
          Berthold Vöcking   Uncoordinated Two-Sided Matching Markets 92--106
              Alasdair Urquhart   A Near-Optimal Separation of Regular and
                                  General Resolution . . . . . . . . . . . 107--121
                Yuval Ishai and   
              Jonathan Katz and   
           Eyal Kushilevitz and   
             Yehuda Lindell and   
                   Erez Petrank   On Achieving the ``Best of Both Worlds''
                                  in Secure Multiparty Computation . . . . 122--141
Frédéric Magniez and   
               Ashwin Nayak and   
Jérémie Roland and   
                  Miklos Santha   Search via Quantum Walk  . . . . . . . . 142--164
             Ryan O'Donnell and   
              Rocco A. Servedio   The Chow Parameters Problem  . . . . . . 165--199
               Nitin Saxena and   
                   C. Seshadhri   An Almost Optimal Rank Bound for Depth-3
                                  Identities . . . . . . . . . . . . . . . 200--224

SIAM Journal on Computing
Volume 40, Number 2, 2011

             Iftach Haitner and   
                Yuval Ishai and   
           Eyal Kushilevitz and   
             Yehuda Lindell and   
                   Erez Petrank   Black-Box Constructions of Protocols for
                                  Secure Computation . . . . . . . . . . . 225--266
          Avraham Ben-Aroya and   
                  Amnon Ta-Shma   A Combinatorial Construction of
                                  Almost-Ramanujan Graphs Using the
                                  Zig-Zag Product  . . . . . . . . . . . . 267--290
                Alan Frieze and   
        Páll Melsted and   
           Michael Mitzenmacher   An Analysis of Random-Walk Cuckoo
                                  Hashing  . . . . . . . . . . . . . . . . 291--308
               Aaron Archer and   
     MohammadHossein Bateni and   
   MohammadTaghi Hajiaghayi and   
                 Howard Karloff   Improved Approximation Algorithms for
                                  Prize-Collecting Steiner Tree and TSP    309--332
            Timothy M. Chan and   
           Mihai P\vatrascu and   
                   Liam Roditty   Dynamic Connectivity: Connecting to
                                  Networks and Geometry  . . . . . . . . . 333--349
                  Nir Ailon and   
           Bernard Chazelle and   
        Kenneth L. Clarkson and   
                   Ding Liu and   
            Wolfgang Mulzer and   
                   C. Seshadhri   Self-Improving Algorithms  . . . . . . . 350--375
             Oded Goldreich and   
                       Dana Ron   Algorithmic Aspects of Property Testing
                                  in the Dense Graphs Model  . . . . . . . 376--445
        Omer Giménez and   
              Guillem Godoy and   
               Sebastian Maneth   Deciding Regularity of the Set of
                                  Instances of a Set of Terms with Regular
                                  Constraints is EXPTIME-Complete  . . . . 446--464
           Johannes Fischer and   
                    Volker Heun   Space-Efficient Preprocessing Schemes
                                  for Range Minimum Queries on Static
                                  Arrays . . . . . . . . . . . . . . . . . 465--492
           Christian Cachin and   
                Idit Keidar and   
               Alexander Shraer   Fail-Aware Untrusted Storage . . . . . . 493--533
             Oded Goldreich and   
                       Dana Ron   On Proximity-Oblivious Testing . . . . . 534--566
      Christoph Ambühl and   
        Monaldo Mastrolilli and   
                   Ola Svensson   Inapproximability Results for Maximum
                                  Edge Biclique, Minimum Linear
                                  Arrangement, and Sparsest Cut  . . . . . 567--596

SIAM Journal on Computing
Volume 40, Number 3, 2011

    Constantinos Daskalakis and   
            Richard M. Karp and   
            Elchanan Mossel and   
     Samantha J. Riesenfeld and   
                    Elad Verbin   Sorting and Selection in Posets  . . . . 597--622
                  Ning Chen and   
               Arpita Ghosh and   
           Sergei Vassilvitskii   Optimal Envy-Free Pricing with Metric
                                  Substitutability . . . . . . . . . . . . 623--645
                  P. Niyogi and   
                   S. Smale and   
                  S. Weinberger   A Topological View of Unsupervised
                                  Learning from Noisy Data . . . . . . . . 646--663
                  Amnon Ta-Shma   Short Seed Extractors against Quantum
                                  Storage  . . . . . . . . . . . . . . . . 664--677
         Elliot Anshelevich and   
            Adriana Karagiozova   Terminal Backup, $3$D Matching, and
                                  Covering Cubic Graphs  . . . . . . . . . 678--708
                Satyen Kale and   
                   C. Seshadhri   An Expansion Tester for Bounded Degree
                                  Graphs . . . . . . . . . . . . . . . . . 709--720
            Manuel Bodirsky and   
           Éric Fusy and   
                Mihyun Kang and   
                Stefan Vigerske   Boltzmann Samplers, Pólya Theory, and
                                  Cycle Pointing . . . . . . . . . . . . . 721--769
             Scott Aaronson and   
              Jeff Erickson and   
           Mohammad Mahdian and   
                    R. Ravi and   
                 Emanuele Viola   Special Section on Foundations of
                                  Computer Science . . . . . . . . . . . . 770--770
                        Ran Raz   A Counterexample to Strong Parallel
                                  Repetition . . . . . . . . . . . . . . . 771--777
                  Zeev Dvir and   
                  Avi Wigderson   Kakeya Sets, New Mergers, and Old
                                  Extractors . . . . . . . . . . . . . . . 778--792
Shiva Prasad Kasiviswanathan and   
               Homin K. Lee and   
               Kobbi Nissim and   
        Sofya Raskhodnikova and   
                     Adam Smith   What Can We Learn Privately? . . . . . . 793--826
             Mihai P\uatra\cscu   Unifying the Landscape of Cell-Probe
                                  Lower Bounds . . . . . . . . . . . . . . 827--847
                Julia Kempe and   
         Hirotada Kobayashi and   
            Keiji Matsumoto and   
                  Ben Toner and   
                  Thomas Vidick   Entangled Games Are Hard to Approximate  848--877
       Venkatesan Guruswami and   
         Johan Håstad and   
         Rajsekar Manokaran and   
         Prasad Raghavendra and   
                 Moses Charikar   Beating the Random Ordering Is Hard:
                                  Every Ordering CSP Is Approximation
                                  Resistant  . . . . . . . . . . . . . . . 878--914
    Peerapong Dhangwatnotai and   
           Shahar Dobzinski and   
             Shaddin Dughmi and   
                Tim Roughgarden   Truthful Approximation Schemes for
                                  Single-Parameter Agents  . . . . . . . . 915--933
              Ehud Friedgut and   
                  Gil Kalai and   
              Nathan Keller and   
                     Noam Nisan   A Quantitative Version of the
                                  Gibbard--Satterthwaite Theorem for Three
                                  Alternatives . . . . . . . . . . . . . . 934--952

SIAM Journal on Computing
Volume 40, Number 4, 2011

               Yuk Hei Chan and   
             Wai Shing Fung and   
                Lap Chi Lau and   
                 Chun Kong Yung   Degree Bounded Network Design with
                                  Metric Costs . . . . . . . . . . . . . . 953--980
         Daniel A. Spielman and   
                 Shang-Hua Teng   Spectral Sparsification of Graphs  . . . 981--1025
               Tamal K. Dey and   
             Anil N. Hirani and   
            Bala Krishnamoorthy   Optimal Homologous Cycles, Total
                                  Unimodularity, and Linear Programming    1026--1044
               Micha Sharir and   
                    Hayim Shaul   Semialgebraic Range Reporting and
                                  Emptiness Searching with Applications    1045--1074
          Parikshit Gopalan and   
             Ryan O'Donnell and   
          Rocco A. Servedio and   
               Amir Shpilka and   
                    Karl Wimmer   Testing Fourier Dimensionality and
                                  Sparsity . . . . . . . . . . . . . . . . 1075--1100
                 Jin-Yi Cai and   
                  Pinyan Lu and   
                     Mingji Xia   Computational Complexity of Holant
                                  Problems . . . . . . . . . . . . . . . . 1101--1132
                Uriel Feige and   
          Vahab S. Mirrokni and   
             Jan Vondrák   Maximizing Non-monotone Submodular
                                  Functions  . . . . . . . . . . . . . . . 1133--1153
                  Zeev Dvir and   
          Parikshit Gopalan and   
                Sergey Yekhanin   Matching Vector Codes  . . . . . . . . . 1154--1178
       Peter Bürgisser and   
            J. M. Landsberg and   
            Laurent Manivel and   
                   Jerzy Weyman   An Overview of Mathematical Issues
                                  Arising in the Geometric Complexity
                                  Theory Approach to $\mathbf{VP} \neq
                                  \mathbf{VNP}$  . . . . . . . . . . . . . 1179--1209

SIAM Journal on Computing
Volume 40, Number 5, 2011

            Sebastian Aland and   
            Dominic Dumrauf and   
             Martin Gairing and   
            Burkhard Monien and   
             Florian Schoppmann   Exact Price of Anarchy for Polynomial
                                  Congestion Games . . . . . . . . . . . . 1211--1233
         George B. Mertzios and   
                 Ignasi Sau and   
                    Shmuel Zaks   The Recognition of Tolerance and Bounded
                                  Tolerance Graphs . . . . . . . . . . . . 1234--1257
                   Ola Svensson   Hardness of Precedence Constrained
                                  Scheduling on Identical Machines . . . . 1258--1274
                  Nir Ailon and   
                 Moses Charikar   Fitting Tree Metrics: Hierarchical
                                  Clustering and Phylogeny . . . . . . . . 1275--1291
       Johannes Köbler and   
          Sebastian Kuhnert and   
            Bastian Laubner and   
                 Oleg Verbitsky   Interval Graphs: Canonical
                                  Representations in Logspace  . . . . . . 1292--1315
                 James King and   
                     Erik Krohn   Terrain Guarding is NP-Hard  . . . . . . 1316--1339
                  Tao Jiang and   
                Zevi Miller and   
                   Dan Pritikin   Near Optimal Bounds for Steiner Trees in
                                  the Hypercube  . . . . . . . . . . . . . 1340--1360
               Anupam Gupta and   
          Martin Pál and   
                    R. Ravi and   
                  Amitabh Sinha   Sampling and Cost-Sharing: Approximation
                                  Algorithms for Stochastic Optimization
                                  Problems . . . . . . . . . . . . . . . . 1361--1401
                Edith Cohen and   
              Nick Duffield and   
                Haim Kaplan and   
               Carsten Lund and   
                  Mikkel Thorup   Efficient Stream Sampling for
                                  Variance-Optimal Estimation of Subset
                                  Sums . . . . . . . . . . . . . . . . . . 1402--1431
          Parikshit Gopalan and   
       Venkatesan Guruswami and   
             Prasad Raghavendra   List Decoding Tensor Products and
                                  Interleaved Codes  . . . . . . . . . . . 1432--1462

SIAM Journal on Computing
Volume 40, Number 6, 2011

          Bernhard Haeupler and   
             Siddhartha Sen and   
               Robert E. Tarjan   Rank-Pairing Heaps . . . . . . . . . . . 1463--1485
             Iftach Haitner and   
               Danny Harnik and   
                  Omer Reingold   On the Power of the Randomized Iterate   1486--1528
                Rafael Pass and   
      Wei-Lung Dustin Tseng and   
          Douglas Wikström   On the Composition of Public-Coin
                                  Zero-Knowledge Protocols . . . . . . . . 1529--1553
             Patrick Briest and   
                   Piotr Krysta   Buying Cheap Is Expensive:
                                  Approximability of Combinatorial Pricing
                                  Problems . . . . . . . . . . . . . . . . 1554--1586
             Patrick Briest and   
               Piotr Krysta and   
          Berthold Vöcking   Approximation Techniques for Utilitarian
                                  Mechanism Design . . . . . . . . . . . . 1587--1622
        Shai Shalev-Shwartz and   
                Ohad Shamir and   
              Karthik Sridharan   Learning Kernel-Based Halfspaces with
                                  the $0$-$1$ Loss . . . . . . . . . . . . 1623--1646
                Haim Kaplan and   
            Matthew J. Katz and   
           Gila Morgenstern and   
                   Micha Sharir   Optimal Cover of Points by Disks in a
                                  Simple Polygon . . . . . . . . . . . . . 1647--1661
                 Norm Ferns and   
         Prakash Panangaden and   
                   Doina Precup   Bisimulation Metrics for Continuous
                                  Markov Decision Processes  . . . . . . . 1662--1714
              Zoya Svitkina and   
                 Lisa Fleischer   Submodular Approximation: Sampling-based
                                  Algorithms and Lower Bounds  . . . . . . 1715--1737
              Shuchi Chawla and   
              Cynthia Dwork and   
               Venkat Guruswami   Special Section on the Fortieth Annual
                                  ACM Symposium On Theory Of Computing
                                  (STOC 2008)  . . . . . . . . . . . . . . 1738--1738
            Gruia Calinescu and   
            Chandra Chekuri and   
          Martin Pál and   
             Jan Vondrák   Maximizing a Monotone Submodular
                                  Function Subject to a Matroid Constraint 1740--1766
           Kiran S. Kedlaya and   
              Christopher Umans   Fast Polynomial Factorization and
                                  Modular Composition  . . . . . . . . . . 1767--1802
              Chris Peikert and   
                   Brent Waters   Lossy Trapdoor Functions and Their
                                  Applications . . . . . . . . . . . . . . 1803--1844
               Ilya Mironov and   
                  Moni Naor and   
                      Gil Segev   Sketching in Adversarial Environments    1845--1870
                       Anup Rao   Parallel Repetition in Projection Games
                                  and a Concentration Bound  . . . . . . . 1871--1891
                Hagay Levin and   
           Michael Schapira and   
                     Aviv Zohar   Interdomain Routing and Games  . . . . . 1892--1912
         Daniel A. Spielman and   
              Nikhil Srivastava   Graph Sparsification by Effective
                                  Resistances  . . . . . . . . . . . . . . 1913--1926
                   Paul Valiant   Testing Symmetric Properties of
                                  Distributions  . . . . . . . . . . . . . 1927--1968
          Alexander A. Sherstov   The Pattern Matrix Method  . . . . . . . 1969--2000


SIAM Journal on Computing
Volume 41, Number 1, 2012

                    Luc Devroye   Simulating Size-constrained
                                  Galton--Watson Trees . . . . . . . . . . 1--11
                Edith Cohen and   
             Michal Feldman and   
                  Amos Fiat and   
                Haim Kaplan and   
             Svetlana Olonetsky   Envy-Free Makespan Approximation . . . . 12--25
              Taisuke Izumi and   
              Samia Souissi and   
          Yoshiaki Katayama and   
           Nobuhiro Inuzuka and   
       Xavier Défago and   
                Koichi Wada and   
             Masafumi Yamashita   The Gathering Problem for Two Oblivious
                                  Robots with Unreliable Compasses . . . . 26--46
                Matt Gibson and   
              Gaurav Kanade and   
                 Erik Krohn and   
           Imran A. Pirwani and   
            Kasturi Varadarajan   On Clustering to Minimize the Sum of
                                  Radii  . . . . . . . . . . . . . . . . . 47--60
            Harold N. Gabow and   
           Suzanne R. Gallagher   Iterated Rounding Algorithms for the
                                  Smallest $k$-Edge Connected Spanning
                                  Subgraph . . . . . . . . . . . . . . . . 61--103
          Pankaj K. Agarwal and   
                  Lars Arge and   
                Haim Kaplan and   
                 Eyal Molad and   
           Robert E. Tarjan and   
                          Ke Yi   An Optimal Dynamic Data Structure for
                                  Stabbing-Semigroup Queries . . . . . . . 104--127
            Toniann Pitassi and   
               Nathan Segerlind   Exponential Lower Bounds and Integrality
                                  Gaps for Tree-Like Lovász--Schrijver
                                  Procedures . . . . . . . . . . . . . . . 128--159
              Wouter Gelade and   
               Marc Gyssens and   
                    Wim Martens   Regular Expressions with Counting: Weak
                                  versus Strong Determinism  . . . . . . . 160--190
                 Emanuele Viola   The Complexity of Distributions  . . . . 191--218
            Zohar S. Karnin and   
               Yuval Rabani and   
                   Amir Shpilka   Explicit Dimension Reduction and Its
                                  Applications . . . . . . . . . . . . . . 219--249
              Sanjeev Arora and   
László Lovász and   
                Ilan Newman and   
               Yuval Rabani and   
            Yuri Rabinovich and   
                Santosh Vempala   Local Versus Global Properties of Metric
                                  Spaces . . . . . . . . . . . . . . . . . 250--271
             Jesper Jansson and   
         Richard S. Lemence and   
                 Andrzej Lingas   The Complexity of Inferring a Minimally
                                  Resolved Phylogenetic Supertree  . . . . 272--291

SIAM Journal on Computing
Volume 41, Number 2, 2012

              Mikkel Thorup and   
                      Yin Zhang   Tabulation-Based 5-Independent Hashing
                                  with Applications to Linear Probing and
                                  Second Moment Estimation . . . . . . . . 293--331
           Cristopher Moore and   
              Alexander Russell   Approximating the Permanent via
                                  Nonabelian Determinants  . . . . . . . . 332--355
         Daniel Stefankovic and   
            Santosh Vempala and   
                    Eric Vigoda   A Deterministic Polynomial-Time
                                  Approximation Scheme for Counting
                                  Knapsack Solutions . . . . . . . . . . . 356--366
                Natan Rubin and   
                Haim Kaplan and   
                   Micha Sharir   Improved Bounds for Geometric
                                  Permutations . . . . . . . . . . . . . . 367--390
              Nikhil Bansal and   
             Niv Buchbinder and   
            Joseph (Seffi) Naor   Randomized Competitive Algorithms for
                                  Generalized Caching  . . . . . . . . . . 391--414
                Danny Dolev and   
               Ezra N. Hoch and   
                    Yoram Moses   An Optimal Self-Stabilizing Firing Squad 415--435
            Anna C. Gilbert and   
                      Yi Li and   
                  Ely Porat and   
              Martin J. Strauss   Approximate Sparse Recovery: Optimizing
                                  Time and Measurements  . . . . . . . . . 436--453

SIAM Journal on Computing
Volume 41, Number 3, 2012

               Jen-Yeu Chen and   
              Gopal Pandurangan   Almost-Optimal Gossip-Based Aggregate
                                  Computation  . . . . . . . . . . . . . . 455--483
                 Paul Beame and   
                    Trinh Huynh   Multiparty Communication Complexity and
                                  Threshold Circuit Size of $o{\sf AC}^0$  484--518
                Faith Ellen and   
              Danny Hendler and   
                     Nir Shavit   On the Inherent Sequentiality of
                                  Concurrent Objects . . . . . . . . . . . 519--536
             David Eppstein and   
              Elena Mumford and   
          Bettina Speckmann and   
                  Kevin Verbeek   Area-Universal and Constrained
                                  Rectangular Layouts  . . . . . . . . . . 537--564
               Leah Epstein and   
                 Asaf Levin and   
Alberto Marchetti-Spaccamela and   
               Nicole Megow and   
       Julián Mestre and   
            Martin Skutella and   
                   Leen Stougie   Universal Sequencing on an Unreliable
                                  Machine  . . . . . . . . . . . . . . . . 565--586
          T.-H. Hubert Chan and   
                   Anupam Gupta   Approximating TSP on Metrics with
                                  Bounded Global Growth  . . . . . . . . . 587--617
            Darin Goldstein and   
               Kojiro Kobayashi   On Minimal-Time Solutions of Firing
                                  Squad Synchronization Problems for
                                  Networks . . . . . . . . . . . . . . . . 618--669
               Liam Roditty and   
                      Uri Zwick   Dynamic Approximate All-Pairs Shortest
                                  Paths in Undirected Graphs . . . . . . . 670--683
          Mordecai J. Golin and   
             Claire Mathieu and   
                  Neal E. Young   Huffman Coding with Letter Costs: a
                                  Linear-Time Approximation Scheme . . . . 684--713
           Markus Kirschmer and   
                    John Voight   Corrigendum: Algorithmic Enumeration of
                                  Ideal Classes for Quaternion Orders  . . 714--714

SIAM Journal on Computing
Volume 41, Number 4, 2012

                  Victor Chepoi   Nice Labeling Problem for Event
                                  Structures: a Counterexample . . . . . . 715--727
                 Yuval Emek and   
Magnús M. Halldórsson and   
             Yishay Mansour and   
           Boaz Patt-Shamir and   
     Jaikumar Radhakrishnan and   
                    Dror Rawitz   Online Set Packing . . . . . . . . . . . 728--746
           Tobias Friedrich and   
             Martin Gairing and   
               Thomas Sauerwald   Quasirandom Load Balancing . . . . . . . 747--771
                  Moni Naor and   
                      Gil Segev   Public-Key Cryptosystems Resilient to
                                  Key Leakage  . . . . . . . . . . . . . . 772--814
                Marek Cygan and   
           Marcin Pilipczuk and   
           Michal Pilipczuk and   
       Jakub Onufry Wojtaszczyk   A Polynomial Algorithm for
                                  $3$-Compatible Coloring and the Stubborn
                                  List Partition Problem (The Stubborn
                                  Problem Is Stubborn No More) . . . . . . 815--828
             Mark Cieliebak and   
            Paola Flocchini and   
          Giuseppe Prencipe and   
                 Nicola Santoro   Distributed Computing by Mobile Robots:
                                  Gathering  . . . . . . . . . . . . . . . 829--879
             Eli Ben-Sasson and   
               Swastik Kopparty   Affine Dispersers from Subspace
                                  Polynomials  . . . . . . . . . . . . . . 880--914
                 Anindya De and   
       Christopher Portmann and   
              Thomas Vidick and   
                  Renato Renner   Trevisan's Extractor in the Presence of
                                  Quantum Side Information . . . . . . . . 915--940
       Maarten Löffler and   
                Wolfgang Mulzer   Triangulating the Square and Squaring
                                  the Triangle: Quadtrees and Delaunay
                                  Triangulations are Equivalent  . . . . . 941--974
            Chaitanya Swamy and   
                David B. Shmoys   Sampling-Based Approximation Algorithms
                                  for Multistage Stochastic Optimization   975--1004
           Mashhood Ishaque and   
          Bettina Speckmann and   
           Csaba D. Tóth   Shooting Permanent Rays among Disjoint
                                  Polygons in the Plane  . . . . . . . . . 1005--1027
            Sevag Gharibian and   
                    Julia Kempe   Approximation Algorithms for
                                  QMA-Complete Problems  . . . . . . . . . 1028--1050
            Harish Chandran and   
       Nikhil Gopalkrishnan and   
                      John Reif   Tile Complexity of Linear Assemblies . . 1051--1073
             Yuichi Yoshida and   
            Masaki Yamamoto and   
                       Hiro Ito   Improved Constant-Time Approximation
                                  Algorithms for Maximum Matchings and
                                  Other Optimization Problems  . . . . . . 1074--1093

SIAM Journal on Computing
Volume 41, Number 5, 2012

      Jittat Fakcharoenphol and   
             Bundit Laekhanukit   An $O(\log^2{k})$-Approximation
                                  Algorithm for the $k$-Vertex Connected
                                  Spanning Subgraph Problem  . . . . . . . 1095--1109
                  Nir Ailon and   
       Noa Avigdor-Elgrabli and   
                Edo Liberty and   
                Anke van Zuylen   Improved Approximation Algorithms for
                                  Bipartite Correlation Clustering . . . . 1110--1121
          Alexander A. Sherstov   Strong Direct Product Theorems for
                                  Quantum Communication and Query
                                  Complexity . . . . . . . . . . . . . . . 1122--1165
           Matthias Englert and   
            Matthias Westermann   Considering Suppressed Packets Improves
                                  Buffer Management in Quality of Service
                                  Switches . . . . . . . . . . . . . . . . 1166--1192
                 Jens Groth and   
                     Amit Sahai   Efficient Noninteractive Proof Systems
                                  for Bilinear Groups  . . . . . . . . . . 1193--1232
            Kousha Etessami and   
       Dieter van Melkebeek and   
                Seth Pettie and   
               John Watrous and   
                   Salil Vadhan   Special Section on the Forty-Third
                                  Annual ACM Symposium on Theory of
                                  Computing (STOC 2011)  . . . . . . . . . 1233--1234
            Atish Das Sarma and   
             Stephan Holzer and   
                   Liah Kor and   
                Amos Korman and   
          Danupon Nanongkai and   
          Gopal Pandurangan and   
                David Peleg and   
              Roger Wattenhofer   Distributed Verification and Hardness of
                                  Distributed Approximation  . . . . . . . 1235--1265
               Ankur Moitra and   
                 Ryan O'Donnell   Pareto Optimal Solutions for Smoothed
                                  Analysts . . . . . . . . . . . . . . . . 1266--1284
               Nitin Saxena and   
                   C. Seshadhri   Blackbox Identity Testing for Bounded
                                  Top-Fanin Depth-$3$ Circuits: The Field
                                  Doesn't Matter . . . . . . . . . . . . . 1285--1298
           Amit Chakrabarti and   
                     Oded Regev   An Optimal Lower Bound on the
                                  Communication Complexity of
                                  Gap-Hamming-Distance . . . . . . . . . . 1299--1317
                   Ola Svensson   Santa Claus Schedules Jobs on Unrelated
                                  Machines . . . . . . . . . . . . . . . . 1318--1341

SIAM Journal on Computing
Volume 41, Number 6, 2012

           Rachid Guerraoui and   
          Vassos Hadzilacos and   
             Petr Kuznetsov and   
                      Sam Toueg   The Weakest Failure Detectors to Solve
                                  Quittable Consensus and Nonblocking
                                  Atomic Commit  . . . . . . . . . . . . . 1343--1379
        Arnab Bhattacharyya and   
           Elena Grigorescu and   
                Kyomin Jung and   
        Sofya Raskhodnikova and   
              David P. Woodruff   Transitive-Closure Spanners  . . . . . . 1380--1425
           Andrew M. Childs and   
                  Robin Kothari   Quantum Query Complexity of Minor-Closed
                                  Graph Properties . . . . . . . . . . . . 1426--1450
        Keren Censor-Hillel and   
                 Hadas Shachnai   Fast Information Spreading in Graphs
                                  with Large Weak Conductance  . . . . . . 1451--1465
                  Sagi Snir and   
                 Raphael Yuster   Reconstructing Approximate Phylogenetic
                                  Trees from Quartet Samples . . . . . . . 1466--1480
           Matthew Anderson and   
       Dieter van Melkebeek and   
         Nicole Schweikardt and   
                   Luc Segoufin   Locality from Circuit Lower Bounds . . . 1481--1523
              Jean Bourgain and   
         Moubariz Z. Garaev and   
         Sergei V. Konyagin and   
            Igor E. Shparlinski   On the Hidden Shifted Power Problem  . . 1524--1557
             Vitaly Feldman and   
       Venkatesan Guruswami and   
         Prasad Raghavendra and   
                          Yi Wu   Agnostic Learning of Monomials by
                                  Halfspaces Is Hard . . . . . . . . . . . 1558--1590
           Nicole Immorlica and   
              Jonathan Katz and   
       Michael Mitzenmacher and   
             Rocco Servedio and   
                    Chris Umans   Special Section on the Forty-First
                                  Annual ACM Symposium on Theory of
                                  Computing (STOC 2009)  . . . . . . . . . 1591--1592
                 Emanuele Viola   Bit-Probe Lower Bounds for Succinct Data
                                  Structures . . . . . . . . . . . . . . . 1593--1604
           Erin W. Chambers and   
              Jeff Erickson and   
                   Amir Nayyeri   Homology Flows, Cohomology Cuts  . . . . 1605--1634
            Alexandr Andoni and   
                 Krzysztof Onak   Approximating Edit Distance in
                                  Near-Linear Time . . . . . . . . . . . . 1635--1648
               Anupam Gupta and   
   Ravishankar Krishnaswamy and   
                        R. Ravi   Online and Stochastic Survivable Network
                                  Design . . . . . . . . . . . . . . . . . 1649--1672
               Arpita Ghosh and   
            Tim Roughgarden and   
            Mukund Sundararajan   Universally Utility-maximizing Privacy
                                  Mechanisms . . . . . . . . . . . . . . . 1673--1693
                 Klim Efremenko   $3$-Query Locally Decodable Codes of
                                  Subexponential Length  . . . . . . . . . 1694--1703
              Joshua Batson and   
         Daniel A. Spielman and   
              Nikhil Srivastava   Twice-Ramanujan Sparsifiers  . . . . . . 1704--1721
        Russell Impagliazzo and   
         Valentine Kabanets and   
                  Avi Wigderson   New Direct-Product Testers and $2$-Query
                                  PCPs . . . . . . . . . . . . . . . . . . 1722--1768
                  Luca Trevisan   Max Cut and the Smallest Eigenvalue  . . 1769--1786


SIAM Journal on Computing
Volume 42, Number 1, 2013

         Daniel A. Spielman and   
                 Shang-Hua Teng   A Local Clustering Algorithm for Massive
                                  Graphs and Its Application to Nearly
                                  Linear Time Graph Partitioning . . . . . 1--26
                Siu On Chan and   
                 Michael Molloy   A Dichotomy Theorem for the Resolution
                                  Complexity of Random Constraint
                                  Satisfaction Problems  . . . . . . . . . 27--60
           Amit Chakrabarti and   
             Graham Cormode and   
       Ranganath Kondapally and   
                Andrew McGregor   Information Cost Tradeoffs for Augmented
                                  Index and Streaming Language Recognition 61--83
                Victor Chen and   
           Elena Grigorescu and   
                 Ronald de Wolf   Error-Correcting Data Structures . . . . 84--111
            Albert Atserias and   
                  Elitza Maneva   Sherali--Adams Relaxations and
                                  Indistinguishability in Counting Logics  112--137
           Sariel Har-Peled and   
                   Nirman Kumar   Approximate Nearest Neighbor Search for
                                  Low-Dimensional Queries  . . . . . . . . 138--159
            Baruch Awerbuch and   
                 Yossi Azar and   
                   Amir Epstein   The Price of Routing Unsplittable Flow   160--177
            José A. Soto   Matroid Secretary Problem in the
                                  Random-Assignment Model  . . . . . . . . 178--211
                Elad Verbin and   
                      Qin Zhang   The Limits of Buffering: a Tight Lower
                                  Bound for Dynamic Membership in the
                                  External Memory Model  . . . . . . . . . 212--229
       Maria-Florina Balcan and   
                 Avrim Blum and   
                 Yishay Mansour   Circumventing the Price of Anarchy:
                                  Leading Dynamics to Good Behavior  . . . 230--264
             Jan Vondrák   Symmetry and Approximability of
                                  Submodular Maximization Problems . . . . 265--304
                Satyen Kale and   
                Yuval Peres and   
                   C. Seshadhri   Noise Tolerance of Expanders and
                                  Sublinear Expansion Reconstruction . . . 305--323
                   Heng Guo and   
                  Pinyan Lu and   
              Leslie G. Valiant   The Complexity of Symmetric Boolean
                                  Parity Holant Problems . . . . . . . . . 324--356
                    Jon Lee and   
           Maxim Sviridenko and   
             Jan Vondrák   Matroid Matching: The Power of Local
                                  Search . . . . . . . . . . . . . . . . . 357--379
                        Or Meir   IP = PSPACE Using Error-Correcting Codes 380--403

SIAM Journal on Computing
Volume 42, Number 2, 2013

           Hsien-Kuei Hwang and   
             Tsung-Hsi Tsai and   
                   Wei-Mei Chen   Threshold Phenomena in $k$-Dominant
                                  Skylines of Random Samples . . . . . . . 405--441
          Pankaj K. Agarwal and   
           Sariel Har-Peled and   
                         Hai Yu   Embeddings of Surfaces, Curves, and
                                  Moving Points in Euclidean Space . . . . 442--458
                  Noga Alon and   
                 Eric Blais and   
         Sourav Chakraborty and   
David García-Soriano and   
                  Arie Matsliah   Nearly Tight Bounds for Testing Function
                                  Isomorphism  . . . . . . . . . . . . . . 459--493
                Jens M. Schmidt   Contractions, Removals, and Certifying
                                  $3$-Connectivity in Linear Time  . . . . 494--535
              Elad Haramaty and   
               Amir Shpilka and   
                    Madhu Sudan   Optimal Testing of Multivariate
                                  Polynomials over Small Prime Fields  . . 536--562
                Guy Bresler and   
            Elchanan Mossel and   
                      Allan Sly   Reconstruction of Markov Random Fields
                                  from Samples: Some Observations and
                                  Algorithms . . . . . . . . . . . . . . . 563--578
              Nikhil Bansal and   
                    Xin Han and   
                Kazuo Iwama and   
           Maxim Sviridenko and   
                 Guochuan Zhang   A Harmonic Algorithm for the $3$D Strip
                                  Packing Problem  . . . . . . . . . . . . 579--592
                R. D. Somma and   
                       S. Boixo   Spectral Gap Amplification . . . . . . . 593--610
              Ayelet Butman and   
             Peter Clifford and   
      Raphaël Clifford and   
           Markus Jalsenius and   
             Noa Lewenstein and   
                Benny Porat and   
                  Ely Porat and   
                  Benjamin Sach   Pattern Matching under Polynomial
                                  Transformation . . . . . . . . . . . . . 611--633
    Bernadette Charron-Bost and   
           Antoine Gaillard and   
          Jennifer L. Welch and   
                   Josef Widder   Link Reversal Routing with Binary Link
                                  Labels: Work Complexity  . . . . . . . . 634--661
               Xavier Goaoc and   
                Hyo-Sil Kim and   
                 Sylvain Lazard   Bounded-Curvature Shortest Paths through
                                  a Sequence of Points Using Convex
                                  Optimization . . . . . . . . . . . . . . 662--684
                 Anindya De and   
            Piyush P. Kurur and   
               Chandan Saha and   
          Ramprasad Saptharishi   Fast Integer Multiplication Using
                                  Modular Arithmetic . . . . . . . . . . . 685--699
                 Madhav Jha and   
            Sofya Raskhodnikova   Testing and Reconstruction of Lipschitz
                                  Functions with Applications to Data
                                  Privacy  . . . . . . . . . . . . . . . . 700--731

SIAM Journal on Computing
Volume 42, Number 3, 2013

              Ho Yee Cheung and   
                Lap Chi Lau and   
                  Kai Man Leung   Graph Connectivities, Network Coding,
                                  and Expander Graphs  . . . . . . . . . . 733--751
               Subhash Khot and   
                Dana Moshkovitz   $ \mathcal {NP} $-Hardness of
                                  Approximately Solving Linear Equations
                                  over Reals . . . . . . . . . . . . . . . 752--791
           Derek G. Corneil and   
             Barnaby Dalton and   
                   Michel Habib   LDFS-Based Certifying Algorithm for the
                                  Minimum Path Cover Problem on
                                  Cocomparability Graphs . . . . . . . . . 792--807
          Fabrizio Grandoni and   
               Anupam Gupta and   
           Stefano Leonardi and   
            Pauli Miettinen and   
            Piotr Sankowski and   
                    Mohit Singh   Set Covering with Our Eyes Closed  . . . 808--830
Virginia Vassilevska Williams and   
                  Ryan Williams   Finding, Minimizing, and Counting
                                  Weighted Subgraphs . . . . . . . . . . . 831--854
                Ilan Newman and   
                Yuri Rabinovich   On Multiplicative $ \lambda
                                  $-Approximations and Some Geometric
                                  Applications . . . . . . . . . . . . . . 855--883
         Stefan Göller and   
                  Markus Lohrey   Branching-Time Model Checking of
                                  One-Counter Processes and Timed Automata 884--923
                 Jin-Yi Cai and   
                    Xi Chen and   
                      Pinyan Lu   Graph Homomorphisms with Complex Values:
                                  a Dichotomy Theorem  . . . . . . . . . . 924--1029
             L. Elisa Celis and   
              Omer Reingold and   
                  Gil Segev and   
                     Udi Wieder   Balls and Bins: Smaller Hash Families
                                  and Faster Evaluation  . . . . . . . . . 1030--1050
          Parikshit Gopalan and   
                 Raghu Meka and   
              Omer Reingold and   
                David Zuckerman   Pseudorandom Generators for
                                  Combinatorial Shapes . . . . . . . . . . 1051--1076
           Hsien-Chih Chang and   
                     Hsueh-I Lu   Computing the Girth of a Planar Graph in
                                  Linear Time  . . . . . . . . . . . . . . 1077--1094
                Ilan Newman and   
               Christian Sohler   Every Property of Hyperfinite Graphs Is
                                  Testable . . . . . . . . . . . . . . . . 1095--1112
                   Viresh Patel   Determining Edge Expansion and Other
                                  Connectivity Measures of Graphs of
                                  Bounded Genus  . . . . . . . . . . . . . 1113--1131
        Leslie Ann Goldberg and   
                    Mark Jerrum   A Polynomial-Time Algorithm for
                                  Estimating the Partition Function of the
                                  Ferromagnetic Ising Model on a Regular
                                  Matroid  . . . . . . . . . . . . . . . . 1132--1157
              Danny Z. Chen and   
           John Hershberger and   
                    Haitao Wang   Computing Shortest Paths amid Convex
                                  Pseudodisks  . . . . . . . . . . . . . . 1158--1184
                Lap Chi Lau and   
                 Chun Kong Yung   Efficient Edge Splitting-Off Algorithms
                                  Maintaining All-Pairs
                                  Edge-Connectivities  . . . . . . . . . . 1185--1200
         Benjamin A. Burton and   
                  Mathias Hiron   Locating Regions in a Sequence under
                                  Density Constraints  . . . . . . . . . . 1201--1215
              Chris Peikert and   
           Robert Kleinberg and   
         Aravind Srinivasan and   
                Alan Frieze and   
          Alexander Russell and   
               Leonard Schulman   Special Section on the Forty-Second
                                  Annual ACM Symposium on Theory of
                                  Computing (STOC 2010)  . . . . . . . . . 1216--1217
                  Ryan Williams   Improving Exhaustive Search Implies
                                  Superpolynomial Lower Bounds . . . . . . 1218--1244
                Martin Dyer and   
                 David Richerby   An Effective Dichotomy for the Counting
                                  Constraint Satisfaction Problem  . . . . 1245--1274
                 Raghu Meka and   
                David Zuckerman   Pseudorandom Generators for Polynomial
                                  Threshold Functions  . . . . . . . . . . 1275--1301
           Swastik Kopparty and   
                Shubhangi Saraf   Local List-Decoding and Testing of
                                  Random Linear Codes from High Error  . . 1302--1326
                 Boaz Barak and   
             Mark Braverman and   
                    Xi Chen and   
                       Anup Rao   How to Compress Interactive
                                  Communication  . . . . . . . . . . . . . 1327--1363
         Daniele Micciancio and   
           Panagiotis Voulgaris   A Deterministic Single Exponential Time
                                  Algorithm for Most Lattice Problems
                                  Based on Voronoi Cell Computations . . . 1364--1391
                Ashish Goel and   
           Michael Kapralov and   
                 Sanjeev Khanna   Perfect Matchings in $ O(n \log n) $
                                  Time in Regular Bipartite Graphs . . . . 1392--1404
             Iftach Haitner and   
              Omer Reingold and   
                   Salil Vadhan   Efficiency Improvements in Constructing
                                  Pseudorandom Generators from One-Way
                                  Functions  . . . . . . . . . . . . . . . 1405--1430

SIAM Journal on Computing
Volume 42, Number 4, 2013

              Chris Whidden and   
            Robert G. Beiko and   
                    Norbert Zeh   Fixed-Parameter Algorithms for Maximum
                                  Agreement Forests  . . . . . . . . . . . 1431--1466
            Chandra Chekuri and   
             Sanjeev Khanna and   
              F. Bruce Shepherd   The All-or-Nothing Multicommodity Flow
                                  Problem  . . . . . . . . . . . . . . . . 1467--1493
               Anupam Gupta and   
               Moritz Hardt and   
                 Aaron Roth and   
                Jonathan Ullman   Privately Releasing Conjunctions and the
                                  Statistical Query Barrier  . . . . . . . 1494--1520
            Paolo Ferragina and   
                 Igor Nitto and   
              Rossano Venturini   On the Bit-Complexity of Lempel--Ziv
                                  Compression  . . . . . . . . . . . . . . 1521--1541
             Sergio Cabello and   
           Erin W. Chambers and   
                  Jeff Erickson   Multiple-Source Shortest Paths in
                                  Embedded Graphs  . . . . . . . . . . . . 1542--1571
       George Christodoulou and   
 Annamária Kovács   A Deterministic Truthful PTAS for
                                  Scheduling Related Machines  . . . . . . 1572--1595
          Zachary Friggstad and   
   Mohammad R. Salavatipour and   
                  Zoya Svitkina   Asymmetric Traveling Salesman Path and
                                  Directed Latency Problems  . . . . . . . 1596--1619
                         Ge Xia   The Stretch Factor of the Delaunay
                                  Triangulation Is Less than $ 1.998 $ . . 1620--1659
                Haim Kaplan and   
           Robert E. Tarjan and   
                      Uri Zwick   Soft Heaps Simplified  . . . . . . . . . 1660--1673
             Rajesh Chitnis and   
   MohammadTaghi Hajiaghayi and   
             Dániel Marx   Fixed-Parameter Tractability of Directed
                                  Multiway Cut Parameterized by the Size
                                  of the Cutset  . . . . . . . . . . . . . 1674--1696
              Martin Tancer and   
                Dmitry Tonkonog   Nerves of Good Covers Are
                                  Algorithmically Unrecognizable . . . . . 1697--1719
             Prosenjit Bose and   
            Vida Dujmovi\'c and   
                  Pat Morin and   
                   Michiel Smid   Robust Geometric Spanners  . . . . . . . 1720--1736
            Albert Atserias and   
               Martin Grohe and   
             Dániel Marx   Size Bounds and Query Plans for
                                  Relational Joins . . . . . . . . . . . . 1737--1767
                Simone Linz and   
         Katherine St. John and   
                 Charles Semple   Counting Trees in a Phylogenetic Network
                                  Is #P-Complete . . . . . . . . . . . . . 1768--1776

SIAM Journal on Computing
Volume 42, Number 5, 2013

        Flavio Chierichetti and   
                 Ravi Kumar and   
            Silvio Lattanzi and   
       Alessandro Panconesi and   
             Prabhakar Raghavan   Models for the Compressible Web  . . . . 1777--1802
             Sergio Cabello and   
                    Bojan Mohar   Adding One Edge to Planar Graphs Makes
                                  Crossing Number and $1$-Planarity Hard   1803--1829
               Anne Driemel and   
               Sariel Har-Peled   Jaywalking Your Dog: Computing the
                                  Fréchet Distance with Shortcuts . . . . . 1830--1866
          Pankaj K. Agarwal and   
               Boris Aronov and   
           Marc van Kreveld and   
       Maarten Löffler and   
            Rodrigo I. Silveira   Computing Correlation between
                                  Piecewise-Linear Functions . . . . . . . 1867--1887
           Mahdi Cheraghchi and   
       Venkatesan Guruswami and   
                Ameya Velingker   Restricted Isometry of Fourier Matrices
                                  and List Decodability of Random Linear
                                  Codes  . . . . . . . . . . . . . . . . . 1888--1914
             David A. Cohen and   
           Martin C. Cooper and   
  Páidí Creed and   
           Peter G. Jeavons and   
         Stanislav Zivný   An Algebraic Theory of Complexity for
                                  Discrete Optimization  . . . . . . . . . 1915--1939
                  Ting Deng and   
                 Wenfei Fan and   
                  Floris Geerts   On the Complexity of Package
                                  Recommendation Problems  . . . . . . . . 1940--1986
              Thomas Decker and   
       Gábor Ivanyos and   
              Miklos Santha and   
                   Pawel Wocjan   Hidden Symmetry Subgroup Problems  . . . 1987--2007
                Benny Applebaum   Pseudorandom Generators with Long
                                  Stretch and Low Locality from Random
                                  Local One-Way Functions  . . . . . . . . 2008--2037

SIAM Journal on Computing
Volume 42, Number 6, 2013

          Pankaj K. Agarwal and   
       Jirí Matousek and   
                   Micha Sharir   On Range Searching with Semialgebraic
                                  Sets. II . . . . . . . . . . . . . . . . 2039--2062
              Shiva Kintali and   
         Laura J. Poplawski and   
         Rajmohan Rajaraman and   
              Ravi Sundaram and   
                 Shang-Hua Teng   Reducibility among Fractional Stability
                                  Problems . . . . . . . . . . . . . . . . 2063--2113
            Zohar S. Karnin and   
        Partha Mukhopadhyay and   
               Amir Shpilka and   
                 Ilya Volkovich   Deterministic Identity Testing of
                                  Depth-$4$ Multilinear Circuits with
                                  Bounded Top Fan-in . . . . . . . . . . . 2114--2131
 Karthekeyan Chandrasekaran and   
                Navin Goyal and   
              Bernhard Haeupler   Deterministic Algorithms for the Lovász
                                  Local Lemma  . . . . . . . . . . . . . . 2132--2155
      Nikolaos Fountoulakis and   
    Konstantinos Panagiotou and   
                Angelika Steger   On the Insertion Time of Cuckoo Hashing  2156--2181
             Shachar Lovett and   
                      Ely Porat   A Space Lower Bound for Dynamic
                                  Approximate Membership Data Structures   2182--2196
             Fedor V. Fomin and   
                Yngve Villanger   Subexponential Parameterized Algorithm
                                  for Minimum Fill-In  . . . . . . . . . . 2197--2216
                Lap Chi Lau and   
                    Mohit Singh   Additive Approximation for Bounded
                                  Degree Survivable Network Design . . . . 2217--2242
       Giuseppe Di Battista and   
             Fabrizio Frati and   
              János Pach   On the Queue Number of Planar Graphs . . 2243--2285
       Maria Florina Balcan and   
             Mark Braverman and   
             Daniel A. Spielman   Special Section on the Fiftieth Annual
                                  IEEE Symposium on Foundations of
                                  Computer Science (FOCS 2009) . . . . . . 2286--2286
           Shahar Dobzinski and   
                 Shaddin Dughmi   On the Power of Randomization in
                                  Algorithmic Mechanism Design . . . . . . 2287--2304
                  Zeev Dvir and   
           Swastik Kopparty and   
            Shubhangi Saraf and   
                    Madhu Sudan   Extensions to the Method of
                                  Multiplicities, with Applications to
                                  Kakeya Sets and Mergers  . . . . . . . . 2305--2328
          Alexander A. Sherstov   The Intersection of Two Halfspaces Has
                                  High Threshold Degree  . . . . . . . . . 2329--2374
             Ryan O'Donnell and   
                    Karl Wimmer   KKL, Kruskal--Katona, and Monotone Nets  2375--2399
                   Ankur Moitra   Vertex Sparsification and Oblivious
                                  Reductions . . . . . . . . . . . . . . . 2400--2423
         Tanmoy Chakraborty and   
                Zhiyi Huang and   
                 Sanjeev Khanna   Dynamic and Nonuniform Pricing
                                  Strategies for Revenue Maximization  . . 2424--2451
                 Irit Dinur and   
                Prahladh Harsha   Composition of Low-Error $2$-Query PCPs
                                  Using Decodable PCPs . . . . . . . . . . 2452--2486
                 Iftach Haitner   A Parallel Repetition Theorem for Any
                                  Interactive Argument . . . . . . . . . . 2487--2501


SIAM Journal on Computing
Volume 43, Number 1, 2014

             Katalin Friedl and   
       Gábor Ivanyos and   
Frédéric Magniez and   
              Miklos Santha and   
                     Pranab Sen   Hidden Translation and Translating Coset
                                  in Quantum Computing . . . . . . . . . . 1--24
              Arman Yousefi and   
                  Neal E. Young   On a Linear Program for Minimum-Weight
                                  Triangulation  . . . . . . . . . . . . . 25--51
            Telikepalli Kavitha   A Size-Popularity Tradeoff in the Stable
                                  Marriage Problem . . . . . . . . . . . . 52--71
           Leonid Barenboim and   
              Michael Elkin and   
                    Fabian Kuhn   Distributed $ (\Delta + 1) $-Coloring in
                                  Linear (in $ \Delta $) Time  . . . . . . 72--95
            René Sitters   The Generalized Work Function Algorithm
                                  Is Competitive for the Generalized
                                  $2$-Server Problem . . . . . . . . . . . 96--125
                 Sungjin Im and   
           Benjamin Moseley and   
                     Kirk Pruhs   Online Scheduling with General Cost
                                  Functions  . . . . . . . . . . . . . . . 126--143
                J. M. Landsberg   New Lower Bounds for the Rank of Matrix
                                  Multiplication . . . . . . . . . . . . . 144--149
              Harry Buhrman and   
          Nishanth Chandran and   
                 Serge Fehr and   
                 Ran Gelles and   
                Vipul Goyal and   
           Rafail Ostrovsky and   
            Christian Schaffner   Position-Based Quantum Cryptography:
                                  Impossibility and Constructions  . . . . 150--178
             Johan Håstad   On the NP-Hardness of Max-Not-$2$  . . . 179--193
             Moshe Babaioff and   
           Yogeshwer Sharma and   
            Aleksandrs Slivkins   Characterizing Truthful Multi-armed
                                  Bandit Mechanisms  . . . . . . . . . . . 194--230
         Ilias Diakonikolas and   
         Prasad Raghavendra and   
          Rocco A. Servedio and   
                    Li-Yang Tan   Average Sensitivity and Noise
                                  Sensitivity of Polynomial Threshold
                                  Functions  . . . . . . . . . . . . . . . 231--253
            J. Håstad and   
                    B. Just and   
             J. C. Lagarias and   
                  C. P. Schnorr   Erratum: Polynomial Time Algorithms for
                                  Finding Integer Relations Among Real
                                  Numbers  . . . . . . . . . . . . . . . . 254--254
                Lap Chi Lau and   
                 Tal Malkin and   
             Ryan O'Donnell and   
                  Luca Trevisan   Special Section on the Fifty-First
                                  Annual IEEE Symposium on Foundations of
                                  Computer Science (FOCS 2010) . . . . . . 255--255
               Benjamin Rossman   The Monotone Complexity of $k$-Clique on
                                  Random Graphs  . . . . . . . . . . . . . 256--279
         Andreas Björklund   Determinant Sums for Undirected
                                  Hamiltonicity  . . . . . . . . . . . . . 280--299
           Mihai P\uatrascu and   
                   Liam Roditty   Distance Oracles beyond the
                                  Thorup--Zwick Bound  . . . . . . . . . . 300--311
             Shaddin Dughmi and   
                Tim Roughgarden   Black-Box Randomized Reductions in
                                  Algorithmic Mechanism Design . . . . . . 312--336
             Ioannis Koutis and   
             Gary L. Miller and   
                   Richard Peng   Approaching Optimality for Solving SDD
                                  Linear Systems . . . . . . . . . . . . . 337--354

SIAM Journal on Computing
Volume 43, Number 2, 2014

         Dániel Marx and   
                    Igor Razgon   Fixed-Parameter Tractability of Multicut
                                  Parameterized by the Size of the Cutset  355--388
             Iftach Haitner and   
                      Eran Omri   Coin Flipping with Constant Bias Implies
                                  One-Way Functions  . . . . . . . . . . . 389--409
             Siu-Wing Cheng and   
                   Jiongxin Jin   Approximate Shortest Descending Paths    410--428
          Pankaj K. Agarwal and   
          Rinat Ben Avraham and   
                Haim Kaplan and   
                   Micha Sharir   Computing the Discrete Fréchet Distance
                                  in Subquadratic Time . . . . . . . . . . 429--449
                  Gil Cohen and   
                    Ran Raz and   
                      Gil Segev   Nonmalleable Extractors with Short Seeds
                                  and Applications to Privacy
                                  Amplification  . . . . . . . . . . . . . 450--476
                     Hsueh-I Lu   Linear-Time Compression of Bounded-Genus
                                  Graphs into Information-Theoretically
                                  Optimal Number of Bits . . . . . . . . . 477--496
                Alan Frieze and   
                Navin Goyal and   
            Luis Rademacher and   
                Santosh Vempala   Expanders via Random Spanning Trees  . . 497--513
               Yuval Filmus and   
                    Justin Ward   Monotone Submodular Maximization over a
                                  Matroid via Non-Oblivious Local Search   514--542
               Boris Aronov and   
               Mark de Berg and   
                Esther Ezra and   
                   Micha Sharir   Improved Bounds for the Union of Locally
                                  Fat Objects in the Plane . . . . . . . . 543--572
          Andrei A. Bulatov and   
             Dániel Marx   Constraint Satisfaction Parameterized by
                                  Solution Size  . . . . . . . . . . . . . 573--616
        Kenneth L. Clarkson and   
            Wolfgang Mulzer and   
                   C. Seshadhri   Self-Improving Algorithms for
                                  Coordinatewise Maxima and Convex Hulls   617--653
             Eli Ben-Sasson and   
               Rafail Ostrovsky   Special Section on the Fifty-Second IEEE
                                  Annual Symposium on Foundations of
                                  Computer Science (FOCS 2011) . . . . . . 654--654
                 Emanuele Viola   Extractors for Circuit Sources . . . . . 655--672
            Kasper Green Larsen   On Range Searching in the Group Model
                                  and Combinatorial Discrepancy  . . . . . 673--686
         Christos Boutsidis and   
             Petros Drineas and   
            Malik Magdon-Ismail   Near-Optimal Column-Based Matrix
                                  Reconstruction . . . . . . . . . . . . . 687--717
                   Timon Hertli   $3$-SAT Faster and Simpler ---
                                  Unique-SAT Bounds for PPSZ Hold in
                                  General  . . . . . . . . . . . . . . . . 718--729
            Madhur Tulsiani and   
                     Julia Wolf   Quadratic Goldreich--Levin Theorems  . . 730--766
                Paul Bonsma and   
                Jens Schulz and   
                  Andreas Wiese   A Constant-Factor Approximation
                                  Algorithm for Unsplittable Flow on Paths 767--799
             Yevgeniy Dodis and   
                     Xin Li and   
           Trevor D. Wooley and   
                David Zuckerman   Privacy Amplification and Nonmalleable
                                  Extractors Via Character Sums  . . . . . 800--830
            Zvika Brakerski and   
           Vinod Vaikuntanathan   Efficient Fully Homomorphic Encryption
                                  from (Standard) $ \mathsf {LWE} $  . . . 831--871
              Nikhil Bansal and   
                Uriel Feige and   
         Robert Krauthgamer and   
      Konstantin Makarychev and   
        Viswanath Nagarajan and   
          Joseph Seffi Naor and   
                   Roy Schwartz   Min-Max Graph Partitioning and Small Set
                                  Expansion  . . . . . . . . . . . . . . . 872--904
            Benny Applebaum and   
                Yuval Ishai and   
               Eyal Kushilevitz   How to Garble Arithmetic Circuits  . . . 905--929
                    Saeed Alaei   Bayesian Combinatorial Auctions:
                                  Expanding Single Buyer Mechanisms to
                                  Many Buyers  . . . . . . . . . . . . . . 930--972

SIAM Journal on Computing
Volume 43, Number 3, 2014

             Mark Braverman and   
                   Anup Rao and   
                    Ran Raz and   
                Amir Yehudayoff   Pseudorandom Generators for Regular
                                  Branching Programs . . . . . . . . . . . 973--986
             Michael Ben-Or and   
          Avinatan Hassidim and   
                   Haran Pilpel   Quantum Multiprover Interactive Proofs
                                  with Communicating Provers . . . . . . . 987--1011
        Emanuel Kiero\'nski and   
          Jakub Michaliszyn and   
         Ian Pratt-Hartmann and   
                  Lidia Tendera   Two-Variable First-Order Logic with
                                  Equivalence Closure  . . . . . . . . . . 1012--1063
                 Anna Huber and   
             Andrei Krokhin and   
                  Robert Powell   Skew Bisubmodularity and Valued CSPs . . 1064--1084
       Pablo Barceló and   
              Leonid Libkin and   
                  Miguel Romero   Efficient Approximations of Conjunctive
                                  Queries  . . . . . . . . . . . . . . . . 1085--1130
             Scott Aaronson and   
                 Andrew Drucker   A Full Characterization of Quantum
                                  Advice . . . . . . . . . . . . . . . . . 1131--1183
            Subhash A. Khot and   
               Preyas Popat and   
            Nisheeth K. Vishnoi   Almost Polynomial Factor Hardness for
                                  Closest Vector Problem with
                                  Preprocessing  . . . . . . . . . . . . . 1184--1205
               Ben W. Reichardt   Span Programs are Equivalent to Quantum
                                  Query Algorithms . . . . . . . . . . . . 1206--1219
           Matthias Englert and   
           Deniz Özmen and   
            Matthias Westermann   The Power of Reordering for Online
                                  Minimum Makespan Scheduling  . . . . . . 1220--1237

SIAM Journal on Computing
Volume 43, Number 4, 2014

           Matthias Englert and   
               Anupam Gupta and   
         Robert Krauthgamer and   
          Harald Räcke and   
         Inbal Talgam-Cohen and   
                   Kunal Talwar   Vertex Sparsifiers: New Results from Old
                                  Techniques . . . . . . . . . . . . . . . 1239--1262
          Fabrizio Grandoni and   
               Piotr Krysta and   
           Stefano Leonardi and   
                 Carmine Ventre   Utilitarian Mechanism Design for
                                  Multiobjective Optimization  . . . . . . 1263--1290
          Nishanth Chandran and   
                Vipul Goyal and   
              Ryan Moriarty and   
               Rafail Ostrovsky   Position-Based Cryptography  . . . . . . 1291--1341
            Joseph Cheriyan and   
László A. Végh   Approximating Minimum-Cost $k$-Node
                                  Connected Subgraphs via
                                  Independence-Free Graphs . . . . . . . . 1342--1362
                 Dror Aiger and   
                Haim Kaplan and   
                   Micha Sharir   Reporting Neighbors in High-Dimensional
                                  Euclidean Space  . . . . . . . . . . . . 1363--1395
               Amihood Amir and   
        Gianni Franceschini and   
             Roberto Grossi and   
            Tsvi Kopelowitz and   
           Moshe Lewenstein and   
                 Noa Lewenstein   Managing Unbounded-Length Keys in
                                  Comparison-Driven Data Structures with
                                  Applications to Online Indexing  . . . . 1396--1416
               Hamed Hatami and   
                 Shachar Lovett   Correlation Testing for Affine Invariant
                                  Properties on $ \mathbb {F}_p^n $ in the
                                  High Error Regime  . . . . . . . . . . . 1417--1455
           Amin Coja-Oghlan and   
                    Alan Frieze   Analyzing \tt Walksat on Random Formulas 1456--1485
           Sariel Har-Peled and   
                   Nirman Kumar   Down the Rabbit Hole: Robust Proximity
                                  Search and Density Estimation in
                                  Sublinear Space  . . . . . . . . . . . . 1486--1511

SIAM Journal on Computing
Volume 43, Number 5, 2014

                Hai Brenner and   
                   Kobbi Nissim   Impossibility of Differentially Private
                                  Universally Optimal Mechanisms . . . . . 1513--1540
             Fedor V. Fomin and   
           Petr A. Golovach and   
          Daniel Lokshtanov and   
                  Saket Saurabh   Almost Optimal Lower Bounds for Problems
                                  Parameterized by Clique-Width  . . . . . 1541--1563
            Sebastian Faust and   
                  Tal Rabin and   
              Leonid Reyzin and   
                Eran Tromer and   
           Vinod Vaikuntanathan   Protecting Circuits from Computationally
                                  Bounded and Noisy Leakage  . . . . . . . 1564--1614
        Flavio Chierichetti and   
                  Jon Kleinberg   Voting with Limited Information and Many
                                  Alternatives . . . . . . . . . . . . . . 1615--1653
          Abhishek Bhowmick and   
                  Zeev Dvir and   
                 Shachar Lovett   New Bounds for Matching Vector Families  1654--1683
              Nikhil Bansal and   
                     Kirk Pruhs   The Geometry of Scheduling . . . . . . . 1684--1698
             Johan Håstad   On the Correlation of Parity and
                                  Small-Depth Circuits . . . . . . . . . . 1699--1708
                  Thomas Watson   Time Hierarchies for Sampling
                                  Distributions  . . . . . . . . . . . . . 1709--1727
               Martin Cadek and   
         Marek Krcál and   
       Jirí Matousek and   
Lukás Vokrínek and   
                     Uli Wagner   Polynomial-Time Computation of Homotopy
                                  Groups and Postnikov Systems in Fixed
                                  Dimension  . . . . . . . . . . . . . . . 1728--1780
            Gonzalo Navarro and   
                  Yakov Nekrich   Optimal Dynamic Sequence Representations 1781--1806
             Michael Dinitz and   
                   Guy Kortsarz   Matroid Secretary for Regular and
                                  Decomposable Matroids  . . . . . . . . . 1807--1830

SIAM Journal on Computing
Volume 43, Number 6, 2014

            Chandra Chekuri and   
         Jan Vondrák and   
                 Rico Zenklusen   Submodular Function Maximization via the
                                  Multilinear Relaxation and Contention
                                  Resolution Schemes . . . . . . . . . . . 1831--1879
Frédéric Magniez and   
             Claire Mathieu and   
                   Ashwin Nayak   Recognizing Well-Parenthesized
                                  Expressions in the Streaming Model . . . 1880--1905
        Flavio Chierichetti and   
              Jon Kleinberg and   
           Alessandro Panconesi   How to Schedule a Cascade in an
                                  Arbitrary Graph  . . . . . . . . . . . . 1906--1920
        Leslie Ann Goldberg and   
                    Mark Jerrum   The Complexity of Computing the Sign of
                                  the Tutte Polynomial . . . . . . . . . . 1921--1952


SIAM Journal on Computing
Volume 44, Number 1, 2015

        Vladimir Kolmogorov and   
              Johan Thapper and   
         Stanislav Zivný   The Power of Linear Programming for
                                  General-Valued CSPs  . . . . . . . . . . 1--36
          T.-H. Hubert Chan and   
                 Mingfei Li and   
                    Li Ning and   
                   Shay Solomon   New Doubling Spanners: Better and
                                  Simpler  . . . . . . . . . . . . . . . . 37--53
             Fedor V. Fomin and   
               Ioan Todinca and   
                Yngve Villanger   Large Induced Subgraphs via
                                  Triangulations and CMSO  . . . . . . . . 54--87
           Surender Baswana and   
                Manoj Gupta and   
                    Sandeep Sen   Fully Dynamic Maximal Matching in $
                                  O(\log n) $ Update Time  . . . . . . . . 88--113
               Martin Grohe and   
             Dániel Marx   Structure Theorem and Isomorphism Test
                                  for Graphs with Excluded Topological
                                  Subgraphs  . . . . . . . . . . . . . . . 114--159
              Ittai Abraham and   
                Yair Bartal and   
                    Ofer Neiman   Embedding Metrics into Ultrametrics and
                                  Graphs into Spanning Trees with Constant
                                  Average Distortion . . . . . . . . . . . 160--192
             Iftach Haitner and   
           Jonathan J. Hoch and   
              Omer Reingold and   
                      Gil Segev   Finding Collisions in Interactive
                                  Protocols --- Tight Lower Bounds on the
                                  Round and Communication Complexities of
                                  Statistically Hiding Commitments . . . . 193--242

SIAM Journal on Computing
Volume 44, Number 2, 2015

         Hirotada Kobayashi and   
    François Le Gall and   
            Harumichi Nishimura   Stronger Methods of Making Quantum
                                  Interactive Proofs Perfectly Complete    243--289
András A. Benczúr and   
                David R. Karger   Randomized Approximation Schemes for
                                  Cuts and Flows in Capacitated Graphs . . 290--319
            David R. Karger and   
              Matthew S. Levine   Fast Augmenting Paths by Random Sampling
                                  from Residual Graphs . . . . . . . . . . 320--339
               Pavel Hrubes and   
                  Iddo Tzameret   Short Proofs for the Determinant
                                  Identities . . . . . . . . . . . . . . . 340--383
David Fernández-Baca and   
          Sylvain Guillemot and   
              Brad Shutters and   
                 Sudheer Vakati   Fixed-Parameter Algorithms for Finding
                                  Agreement Supertrees . . . . . . . . . . 384--410
                 Eric Blais and   
             Amit Weinstein and   
                 Yuichi Yoshida   Partially Symmetric Functions Are
                                  Efficiently Isomorphism Testable . . . . 411--432
            Benny Applebaum and   
                Yuval Ishai and   
           Eyal Kushilevitz and   
                   Brent Waters   Encoding Functions with Constant Online
                                  Rate, or How to Compress Garbled Circuit
                                  Keys . . . . . . . . . . . . . . . . . . 433--466
     Jean-Daniel Boissonnat and   
            Camille Wormser and   
                Mariette Yvinec   Anisotropic Delaunay Mesh Generation . . 467--512

SIAM Journal on Computing
Volume 44, Number 3, 2015

               Philip Bille and   
              Gad M. Landau and   
               Rajeev Raman and   
          Kunihiko Sadakane and   
        Srinivasa Rao Satti and   
                   Oren Weimann   Random Access to Grammar-Compressed
                                  Strings and Trees  . . . . . . . . . . . 513--539
  Clément L. Canonne and   
                   Dana Ron and   
              Rocco A. Servedio   Testing Probability Distributions using
                                  Conditional Samples  . . . . . . . . . . 540--616
              Ittai Abraham and   
              Shiri Chechik and   
                David Kempe and   
            Aleksandrs Slivkins   Low-Distortion Inference of Latent
                                  Similarities from a Multiplex Social
                                  Network  . . . . . . . . . . . . . . . . 617--668
           Manindra Agrawal and   
               Rohit Gurjar and   
              Arpita Korwar and   
                   Nitin Saxena   Hitting-Sets for ROABP and Sum of
                                  Set-Multilinear Circuits . . . . . . . . 669--697
            David B. Wilson and   
                      Uri Zwick   A Forward-Backward Single-Source
                                  Shortest Paths Algorithm . . . . . . . . 698--739
               Nao Fujinaga and   
            Yukiko Yamauchi and   
               Hirotaka Ono and   
               Shuji Kijima and   
             Masafumi Yamashita   Pattern Formation by Oblivious
                                  Asynchronous Mobile Robots . . . . . . . 740--785
          Eryk Kopczy\'nski and   
                       Tony Tan   Regular Graphs and the Spectra of
                                  Two-Variable Logic with Counting . . . . 786--818
              Nikhil Bansal and   
               Kang-Won Lee and   
        Viswanath Nagarajan and   
                  Murtaza Zafer   Minimum Congestion Mapping in a Cloud    819--843
     Yoann Dieudonné and   
               Andrzej Pelc and   
                Vincent Villain   How to Meet Asynchronously at Polynomial
                                  Cost . . . . . . . . . . . . . . . . . . 844--867
          Gianluca De Marco and   
            Dariusz R. Kowalski   Fast Nonadaptive Deterministic Algorithm
                                  for Conflict Resolution in a Dynamic
                                  Multiple-Access Channel  . . . . . . . . 868--888

SIAM Journal on Computing
Volume 44, Number 4, 2015

             Mikhail Belkin and   
                  Kaushik Sinha   Polynomial Learning of Distribution
                                  Families . . . . . . . . . . . . . . . . 889--911
            Chandra Chekuri and   
             Sreeram Kannan and   
                 Adnan Raja and   
               Pramod Viswanath   Multicommodity Flows and Cuts in
                                  Polymatroidal Networks . . . . . . . . . 912--943
           Sariel Har-Peled and   
                   Nirman Kumar   Approximating Minimization Diagrams and
                                  Generalized Proximity Search . . . . . . 944--974
                 Lior Kamma and   
         Robert Krauthgamer and   
          Huy L. Nguy\~ên   Cutting Corners Cheaply, or How to
                                  Remove Steiner Points  . . . . . . . . . 975--995
              Michael Elkin and   
                   Shay Solomon   Steiner Shallow-Light Trees Are
                                  Exponentially Lighter than Spanning Ones 996--1025
            Violetta Lonati and   
             Dino Mandrioli and   
           Federica Panella and   
                Matteo Pradella   Operator Precedence Languages: Their
                                  Automata-Theoretic and Logic
                                  Characterization . . . . . . . . . . . . 1026--1088
         Andreas Göbel and   
        Leslie Ann Goldberg and   
            Colin McQuillan and   
             David Richerby and   
              Tomoyuki Yamakami   Counting List Matrix Partitions of
                                  Graphs . . . . . . . . . . . . . . . . . 1089--1118
               Yuval Filmus and   
             Massimo Lauria and   
       Jakob Nordström and   
              Noga Ron-Zewi and   
                    Neil Thapen   Space Complexity in Polynomial Calculus  1119--1153
               Philip Klein and   
                  Neal E. Young   On the Number of Iterations for
                                  Dantzig--Wolfe Optimization and
                                  Packing-Covering Approximation
                                  Algorithms . . . . . . . . . . . . . . . 1154--1172

SIAM Journal on Computing
Volume 44, Number 5, 2015

      Hervé Fournier and   
               Nutan Limaye and   
            Guillaume Malod and   
            Srikanth Srinivasan   Lower Bounds for Depth-$4$ Formulas
                                  Computing Iterated Matrix Multiplication 1173--1201
            Takuro Fukunaga and   
                 Zeev Nutov and   
                        R. Ravi   Iterative Rounding Approximation
                                  Algorithms for Degree-Bounded
                                  Node-Connectivity Network Design . . . . 1202--1229
             Dorit Aharonov and   
                     Lior Eldar   Quantum Locally Testable Codes . . . . . 1230--1262
              Felix Fischer and   
                      Max Klimm   Optimal Impartial Selection  . . . . . . 1263--1285
                Tim Roughgarden   Special Section on the Fifty-Third IEEE
                                  Annual Symposium on Foundations of
                                  Computer Science (FOCS 2012) . . . . . . 1286--1286
                 Boaz Barak and   
          Parikshit Gopalan and   
         Johan Håstad and   
                 Raghu Meka and   
         Prasad Raghavendra and   
                  David Steurer   Making the Long Code Shorter . . . . . . 1287--1324
               Nir Bitansky and   
                    Omer Paneth   On Non-Black-Box Simulation and the
                                  Impossibility of Approximate Obfuscation 1325--1383
             Niv Buchbinder and   
              Moran Feldman and   
          Joseph Seffi Naor and   
                   Roy Schwartz   A Tight Linear Time ($ 1 /
                                  2$)-Approximation for Unconstrained
                                  Submodular Maximization  . . . . . . . . 1384--1402
               Bernard Chazelle   Diffusive Influence Systems  . . . . . . 1403--1442
                 Andrew Drucker   New Limits to Classical and Quantum
                                  Instance Compression . . . . . . . . . . 1443--1479
           Shafi Goldwasser and   
                Guy N. Rothblum   How to Compute in the Presence of
                                  Leakage  . . . . . . . . . . . . . . . . 1480--1549
         Iordanis Kerenidis and   
            Sophie Laplante and   
            Virginie Lerays and   
Jérémie Roland and   
                     David Xiao   Lower Bounds on Information Complexity
                                  via Zero-Communication Protocols and
                                  Applications . . . . . . . . . . . . . . 1550--1572
             Shachar Lovett and   
                     Raghu Meka   Constructive Discrepancy Minimization by
                                  Walking on the Edges . . . . . . . . . . 1573--1582

SIAM Journal on Computing
Volume 44, Number 6, 2015

                 Eric Blais and   
                    Li-Yang Tan   Approximating Boolean Functions with
                                  Depth-2 Circuits . . . . . . . . . . . . 1583--1600
               Mrinal Kumar and   
                Shubhangi Saraf   The Limits of Depth Reduction for
                                  Arithmetic Formulas: It's All About the
                                  Top Fan-In . . . . . . . . . . . . . . . 1601--1625
             Prosenjit Bose and   
             Rolf Fagerberg and   
   André van Renssen and   
             Sander Verdonschot   Optimal Local Routing on Delaunay
                                  Triangulations Defined by Empty
                                  Equilateral Triangles  . . . . . . . . . 1626--1649
           Nabil H. Mustafa and   
                Rajiv Raman and   
                    Saurabh Ray   Quasi-Polynomial Time Approximation
                                  Scheme for Weighted Geometric Set Cover
                                  on Pseudodisks and Halfspaces  . . . . . 1650--1669
             Eli Ben-Sasson and   
                  Noga Ron-Zewi   From Affine to Two-Source Extractors via
                                  Approximate Duality  . . . . . . . . . . 1670--1697
                 Mark Braverman   Interactive Information Complexity . . . 1698--1739
             Vitaly Feldman and   
                     David Xiao   Sample Complexity Bounds on
                                  Differentially Private Learning via
                                  Communication Complexity . . . . . . . . 1740--1764
         Jan Bulánek and   
       Michal Koucký and   
                   Michael Saks   Tight Lower Bounds for the Online
                                  Labeling Problem . . . . . . . . . . . . 1765--1797
             Tobias Brunsch and   
         Kamiel Cornelissen and   
               Bodo Manthey and   
          Heiko Röglin and   
            Clemens Rösner   Smoothed Analysis of the Successive
                                  Shortest Path Algorithm  . . . . . . . . 1798--1819
                 Jugal Garg and   
                 Ruta Mehta and   
              Milind Sohoni and   
              Vijay V. Vazirani   A Complementary Pivot Algorithm for
                                  Market Equilibrium under Separable,
                                  Piecewise-Linear Concave Utilities . . . 1820--1847


SIAM Journal on Computing
Volume 45, Number 1, 2016

                  Albert Gu and   
               Anupam Gupta and   
                     Amit Kumar   The Power of Deferral: Maintaining a
                                  Constant-Competitive Steiner Tree Online 1--28
             Michal Feldman and   
                Nick Gravin and   
                 Brendan Lucier   Combinatorial Walrasian Equilibrium  . . 29--48
            Matthew Andrews and   
    Spyridon Antonakopoulos and   
                     Lisa Zhang   Minimum-Cost Network Design with
                                  (Dis)economies of Scale  . . . . . . . . 49--66
                Marek Cygan and   
           Marcin Pilipczuk and   
               Michal Pilipczuk   Known Algorithms for Edge Clique Cover
                                  are Probably Optimal . . . . . . . . . . 67--83
                    Esther Ezra   A Size-Sensitive Discrepancy Bound for
                                  Set Systems of Bounded Primal Shatter
                                  Dimension  . . . . . . . . . . . . . . . 84--101
       Maria Florina Balcan and   
                   Yingyu Liang   Clustering under Perturbation Resilience 102--155
                   Ankur Moitra   An Almost Optimal Algorithm for
                                  Computing Nonnegative Rank . . . . . . . 156--173
           Jeff M. Phillips and   
                Elad Verbin and   
                      Qin Zhang   Lower Bounds for Number-in-Hand
                                  Multiparty Communication Complexity,
                                  Made Easy  . . . . . . . . . . . . . . . 174--196

SIAM Journal on Computing
Volume 45, Number 2, 2016

                Rishi Gupta and   
            Tim Roughgarden and   
                   C. Seshadhri   Decompositions of Triangle-Dense Graphs  197--215
          Fabrizio Grandoni and   
           Thomas Rothvoß   Pricing on Paths: a PTAS for the Highway
                                  Problem  . . . . . . . . . . . . . . . . 216--231
             Roee Engelberg and   
              Joseph Seffi Naor   Equilibria in Online Games . . . . . . . 232--267
                Toby Cubitt and   
               Ashley Montanaro   Complexity Classification of Local
                                  Hamiltonian Problems . . . . . . . . . . 268--316
         Hans L. Bodlaender and   
Pål Grònås Drange and   
            Markus S. Dregi and   
             Fedor V. Fomin and   
          Daniel Lokshtanov and   
               Michal Pilipczuk   A $ c^k n$ $5$-Approximation Algorithm
                                  for Treewidth  . . . . . . . . . . . . . 317--378
  Armando Castanñeda and   
                Damien Imbs and   
            Sergio Rajsbaum and   
                  Michel Raynal   Generalized Symmetry Breaking Tasks and
                                  Nondeterminism in Concurrent Objects . . 379--414
              Kai-Min Chung and   
                Rafael Pass and   
                      Karn Seth   Non-Black-Box Simulation from One-Way
                                  Functions and Applications to Resettable
                                  Security . . . . . . . . . . . . . . . . 415--458
               James Aspnes and   
                Yuval Ishai and   
            Peter Bro Miltersen   Special Section on the Forty-Fifth
                                  Annual ACM Symposium on the Theory of
                                  Computing (STOC 2013)  . . . . . . . . . 459--460
             D. Chakrabarty and   
                   C. Seshadhri   An $ o(n) $ Monotonicity Tester for
                                  Boolean Functions over the Hypercube . . 461--472
                Jonathan Ullman   Answering $ n^2 + o(1) $ Counting
                                  Queries with Differential Privacy is
                                  Hard . . . . . . . . . . . . . . . . . . 473--496
               R. Ryan Williams   Natural Proofs versus Derandomization    497--529
                     Shi Li and   
                   Ola Svensson   Approximating $k$-Median via
                                  Pseudo-Approximation . . . . . . . . . . 530--547
                Aaron Bernstein   Maintaining Shortest Paths Under
                                  Deletions in Weighted Directed Graphs    548--574
         Aleksandar