%%% ====================================================================
%%%  BibTeX-file{
%%%   filename  = "sicomp.bib",
%%%   version   = "2.01",
%%%   url = "http://theory.lcs.mit.edu/~dmjones/hbp/sicomp/sicomp.bib",
%%%   date      = "10 June 1997",
%%%   time      = "18:08:47 EDT",
%%%   author    = "David M. Jones",
%%%   address   = "MIT Laboratory for Computer Science
%%%                Room NE43-316
%%%                545 Technology Square
%%%                Cambridge, MA 02139
%%%                USA",
%%%   telephone = "(617) 253-5936",
%%%   FAX       = "(617) 253-3480",
%%%   checksum  = "42111 18716 34995 349891",
%%%   email     = "dmjones at theory.lcs.mit.edu",
%%%   codetable = "ISO/ASCII",
%%%   keywords  = "",
%%%   supported = "yes",
%%%   abstract  = "",
%%%   docstring = "The checksum field above contains a CRC-16 checksum
%%%                as the first value, followed by the equivalent of
%%%                the standard UNIX wc (word count) utility output of
%%%                lines, words, and characters.  This is produced by
%%%                Robert Solovay's checksum utility.",
%%%  }
%%% ====================================================================

                      SIAM Journal on Computing
                      March 1992 -- October 1996
                            Volumes 1--25

This is BibTeX bibliography containing all papers published in the
SIAM Journal on Computing.  There are undoubtably numerous small
errors left in it.  Please report any errors you find to dmjones at
theory.lcs.mit.edu.  For documentation on using this file, see Chapter
13 of "The LaTeX Companion" by Michel Goossens and Frank Mittelbach
and Alexander Samarin, Addison-Wesley, 1993, or Section 4.3 and
Appendix B of "LaTeX: A Document Preparation System" by Leslie
Lamport.

The entries for volumes previous to 1996 were prepared with the aid of
Joel Seiferas's extensive list of references.

                          Volume 1, Number 1
                              March 1972

@Article{Lewis72,
title={Preface},
author={Lewis II, Philip M.},
pages={v--vi},
journal=sicomp,
year=1972,
month=mar,
volume=1,
number=1
}

@Article{AhoU72,
title={Optimization of Straight Line Programs},
author={Alfred V. Aho and Jeffrey D. Ullman},
pages={1--19},
journal=sicomp,
year=1972,
month=mar,
volume=1,
number=1
}

@Article{Book72:20,
title={Terminal Context in Context-Sensitive Grammars},
author={Ronald V. Book},
pages={20--30},
journal=sicomp,
year=1972,
month=mar,
volume=1,
number=1
}

@Article{HwangL72,
title={A Simple Algorithm for Merging Two Disjoint Linearly Ordered
Sets},
author={F. K. Hwang and S. Lin},
pages={31--39},
journal=sicomp,
year=1972,
month=mar,
volume=1,
number=1
}

@Article{Rosenberg72,
title={Symmetries in Data Graphs},
author={Arnold L. Rosenberg},
pages={40--65},
journal=sicomp,
year=1972,
month=mar,
volume=1,
number=1
}

@Article{ConstableG72,
title={On Classes of Program Schemata},
author={Robert L. Constable and David Gries},
pages={66--118},
journal=sicomp,
year=1972,
month=mar,
volume=1,
number=1
}

@Article{Miller72,
title={Some Undecidability Results for Parallel Program Schemata},
author={Raymond E. Miller},
pages={119--129},
journal=sicomp,
year=1972,
month=mar,
volume=1,
number=1
}

                          Volume 1, Number 2
                              June 1972

@Article{AhoGU72,
title={The Transitive Reduction of a Directed Graph},
author={A. V. Aho and M. R. Garey and J. D. Ullman},
pages={131--137},
journal=sicomp,
year=1972,
month=jun,
volume=1,
number=2
}

@Article{Gaver72,
title={Asymptotic Service System Output, with Application to
Multiprogramming},
author={Donald P. Gaver},
pages={138--145},
journal=sicomp,
year=1972,
month=jun,
volume=1,
number=2
}

@Article{Tarjan72,
title={Depth-First Search and Linear Graph Algorithms},
author={Robert Tarjan},
pages={146--160},
journal=sicomp,
year=1972,
month=jun,
volume=1,
number=2
}

@Article{Konheim72,
title={A Note on Merging},
author={Alan G. Konheim},
pages={161--166},
journal=sicomp,
year=1972,
month=jun,
volume=1,
number=2
}

@Article{Traub72,
title={Computational Complexity of Iterative Processes},
author={J. F. Traub},
pages={167--179},
journal=sicomp,
year=1972,
month=jun,
volume=1,
number=2
}

@Article{Gavril72,
title={Algorithms for Minimum Coloring, Maximum Clique, Minimum
Covering by Cliques, and Maximum Independent Set of a Chordal Graph},
author={Fanica Gavril},
pages={180--187},
journal=sicomp,
year=1972,
month=jun,
volume=1,
number=2
}

@Article{HechtU72,
title={Flow Graph Reducibility},
author={Matthew S. Hecht and Jeffrey D. Ullman},
pages={188--???},
journal=sicomp,
year=1972,
month=jun,
volume=1,
number=2
}

                          Volume 1, Number 3
                            September 1972

@Article{Jackson72,
title={Expectations of Functions of Sequences over Finite Alphabets
with Given Transition Probabilities by Methods Independent of Sequence
Length},
author={D. M. Jackson},
pages={203--217},
journal=sicomp,
year=1972,
month=sep,
volume=1,
number=3
}

@Article{ShedlerT72,
title={Locality in Page Reference Strings},
author={G. S. Shedler and C. Tung},
pages={218--241},
journal=sicomp,
year=1972,
month=sep,
volume=1,
number=3
}

@Article{BrownGS72,
title={Program Schemes with Pushdown Stores},
author={Steven Brown and David Gries and Thomas Szymanski},
pages={242--268},
journal=sicomp,
year=1972,
month=sep,
volume=1,
number=3
}

@Article{CoffmanKR72,
title={Analysis of Scanning Policies for Reducing Disk Seek Times},
author={E. G. Coffman and L. A. Klimko and Barbara Ryan},
pages={269--279},
journal=sicomp,
year=1972,
month=sep,
volume=1,
number=3
}

                          Volume 1, Number 4
                            December 1972

@Article{Book72:281,
title={On Languages Accepted in Polynomial Time},
author={Ronald V. Book},
pages={281--287},
journal=sicomp,
year=1972,
month=dec,
volume=1,
number=4
}

@Article{Bass72,
title={A Note on the Intersection of Complexity Classes of Functions},
author={Leonard J. Bass},
pages={288--289},
journal=sicomp,
year=1972,
month=dec,
volume=1,
number=4
}

@Article{Liu72,
title={Analysis and Synthesis of Sorting Algorithms},
author={C. L. Liu},
pages={290--304},
journal=sicomp,
year=1972,
month=dec,
volume=1,
number=4
}

@Article{AhoP72,
title={A Minimum Distance Error-Correcting Parser for Context-Free
Languages},
author={Alfred V. Aho and Thomas G. Peterson},
pages={305--312},
journal=sicomp,
year=1972,
month=dec,
volume=1,
number=4
}

@Article{KieburtzL72,
title={Compatibility and Complexity of Refinements of the Resolution
Principle},
author={Richard B. Kieburtz and David Luckham},
pages={313--332},
journal=sicomp,
year=1972,
month=dec,
volume=1,
number=4
}

@Article{HarrisonH72,
title={Real-Time Strict Deterministic Languages},
author={Michael A. Harrison and Ivan M. Havel},
pages={333--349},
journal=sicomp,
year=1972,
month=dec,
volume=1,
number=4
}

@Article{Reingold72,
title={Infix to Prefix Translation: The Insufficiency of a Pushdown
Stack},
author={Edward M. Reingold},
pages={350--353},
journal=sicomp,
year=1972,
month=dec,
volume=1,
number=4
}


                          Volume 2, Number 1
                              March 1973

@Article{Akkoyunlu73,
title={The Enumeration of Maximal Cliques of Large Graphs},
author={E. A. Akkoyunlu},
pages={1--6},
journal=sicomp,
year=1973,
month=mar,
volume=2,
number=1
}

@Article{ChangLD73,
title={The Specialization of Programs by Theorem Proving},
author={C. L. Chang and R. C. T. Lee and J. K. Dixon},
pages={7--15},
journal=sicomp,
year=1973,
month=mar,
volume=2,
number=1
}

@Article{GoodmanH73,
title={Eulerian Walks in Graphs},
author={S. Goodman and S. Hedetniemi},
pages={16--27},
journal=sicomp,
year=1973,
month=mar,
volume=2,
number=1
}

@Article{Spira73,
title={A New Algorithm for Finding All Shortest Paths in a Graph of
Positive Arcs in Average Time {$O(n^2 \log^2 n)$}},
author={P. M. Spira},
pages={28--32},
journal=sicomp,
year=1973,
month=mar,
volume=2,
number=1
}

@Article{NievergeltR73,
title={Binary Search Trees of Bounded Balance},
author={J. Nievergelt and E. M. Reingold},
pages={33--43},
journal=sicomp,
year=1973,
month=mar,
volume=2,
number=1
}

@Article{Williamson73,
title={Isomorph Rejection and a Theorem of {de~Bruijn}},
author={S. G. Williamson},
pages={44--59},
journal=sicomp,
year=1973,
month=mar,
volume=2,
number=1
}

@Article{PatersonS73,
title={On the Number of Nonscalar Multiplications Necessary to
Evaluate Polynomials},
author={Michael S. Paterson and Larry J. Stockmeyer},
pages={60--66},
journal=sicomp,
year=1973,
month=mar,
volume=2,
number=1
}

                          Volume 2, Number 2
                              June 1973

@Article{JumpT73,
title={On the Equivalence of Asynchronous Control Structures},
author={J. Robert Jump and P. S. Thiagarajan},
pages={67--87},
journal=sicomp,
year=1973,
month=jun,
volume=2,
number=2
}

@Article{Holland73,
title={Genetic Algorithms and the Optimal Allocation of Trials},
author={John H. Holland},
pages={88--105},
journal=sicomp,
year=1973,
month=jun,
volume=2,
number=2
}

@Article{AhoU73,
title={A Technique for Speeding Up {LR($k$)} Parsers},
author={A. V. Aho and J. D. Ullman},
pages={106--127},
journal=sicomp,
year=1973,
month=jun,
volume=2,
number=2
}

@Article{Chase73,
title={Transposition Graphs},
author={Phillip J. Chase},
pages={128--133},
journal=sicomp,
year=1973,
month=jun,
volume=2,
number=2
}

                          Volume 2, Number 3
                            September 1973

@Article{HopcroftT73,
title={Dividing a Graph into Triconnected Components},
author={J. E. Hopcroft and R. E. Tarjan},
pages={135--158},
journal=sicomp,
year=1973,
month=sep,
volume=2,
number=3
}

@Article{HopcroftM73,
title={Duality Applied to the Complexity of Matrix Multiplication and
Other Bilinear Forms},
author={J. Hopcroft and J. Musinski},
pages={159--173},
journal=sicomp,
year=1973,
month=sep,
volume=2,
number=3
}

@Article{Savitch73,
title={How to Make Arbitrary Grammars Look Like Context-Free
Grammars},
author={Walter J. Savitch},
pages={174--182},
journal=sicomp,
year=1973,
month=sep,
volume=2,
number=3
}

@Article{GaverS73,
title={Approximate Models for Processor Utilization in Multiprogrammed
Computer Systems},
author={D. P. Gaver and G. S. Shedler},
pages={183--192},
journal=sicomp,
year=1973,
month=sep,
volume=2,
number=3
}

@Article{Ibaraki73,
title={Finite State Representations of Discrete Optimization
Problems},
author={Toshihide Ibaraki},
pages={193--210},
journal=sicomp,
year=1973,
month=sep,
volume=2,
number=3
}

@Article{Tarjan73,
title={Enumeration of the Elementary Circuits of a Directed Graph},
author={Robert Tarjan},
pages={211--216},
journal=sicomp,
year=1973,
month=sep,
volume=2,
number=3
}

                          Volume 2, Number 4
                            December 1973

@Article{HaskinsR73,
title={Toward Characterization of Perfect Elimination Digraphs},
author={Loren Haskins and Donald J. Rose},
pages={217--224},
journal=sicomp,
year=1973,
month=dec,
volume=2,
number=4
}

@Article{HopcroftK73,
title={An {$n^{5/2}$} Algorithm for Maximum Matchings in Bipartite
Graphs},
author={John E. Hopcroft and Richard M. Karp},
pages={225--231},
journal=sicomp,
year=1973,
month=dec,
volume=2,
number=4
}

@Article{Lavenberg73,
title={Queuing Analysis of a Multiprogrammed Computer System Having a
Multilevel Storage Hierarchy},
author={Stephen S. Lavenberg},
pages={232--252},
journal=sicomp,
year=1973,
month=dec,
volume=2,
number=4
}

@Article{Dunn73,
title={Continuous Group Averaging and Pattern Classification
Problems},
author={J. C. Dunn},
pages={253--272},
journal=sicomp,
year=1973,
month=dec,
volume=2,
number=4
}

@Article{Bass73,
title={On Optimal Processor Scheduling for Multiprogramming},
author={L. J. Bass},
pages={273--280},
journal=sicomp,
year=1973,
month=dec,
volume=2,
number=4
}

@Article{McRaeD73,
title={An Algorithm for the Extreme Rays of a Pointed Convex
Polyhedral Cone},
author={Walter B. McRae and Ernest R. Davidson},
pages={281--293},
journal=sicomp,
year=1973,
month=dec,
volume=2,
number=4
}

@Article{HopcroftU73,
title={Set Merging Algorithms},
author={J. E. Hopcroft and J. D. Ullman},
pages={294--303},
journal=sicomp,
year=1973,
month=dec,
volume=2,
number=4
}

@Article{Greibach73,
title={The Hardest Context-Free Language},
author={Sheila A. Greibach},
pages={304--310},
journal=sicomp,
year=1973,
month=dec,
volume=2,
number=4
}

@Article{CorneilG73,
title={An Algorithm for Determining the Chromatic Number of a Graph},
author={D. G. Corneil and B. Graham},
pages={311--318},
journal=sicomp,
year=1973,
month=dec,
volume=2,
number=4
}
                          Volume 3, Number 1
                              March 1974

@Article{Collins74,
title={The Computing Time of the {Euclidean} Algorithm},
author={George E. Collins},
pages={1--10},
journal=sicomp,
year=1974,
month=mar,
volume=3,
number=1
}

@Article{MuntzO74,
title={Stack Replacement Algorithms for Two-Level Directly Addressable
Paged Memories},
author={R. R. Muntz and H. Opderbeck},
pages={11--22},
journal=sicomp,
year=1974,
month=mar,
volume=3,
number=1
}

@Article{OsteenL74,
title={Picture Skeletons Based on Eccentricities of Points of Minimum
Spanning Trees},
author={R. E. Osteen and P. P. Lin},
pages={23--40},
journal=sicomp,
year=1974,
month=mar,
volume=3,
number=1
}

@Article{FillmoreW74,
title={On Backtracking: A Combinatorial Description of the Algorithm},
author={Jay P. Fillmore and S. G. Williamson},
pages={41--55},
journal=sicomp,
year=1974,
month=mar,
volume=3,
number=1
}

@Article{Pecault74,
title={Computing the Weak Components of a Directed Graph},
author={Jean Francois Pecault},
pages={56--61},
journal=sicomp,
year=1974,
month=mar,
volume=3,
number=1
}

@Article{Tarjan74,
title={Finding Dominators in Directed Graphs},
author={Robert Tarjan},
pages={62--89},
journal=sicomp,
year=1974,
month=mar,
volume=3,
number=1
}

@Article{Cook74,
title={First Order Graph Grammars},
author={Curtis R. Cook},
pages={90--99},
journal=sicomp,
year=1974,
month=mar,
volume=3,
number=1
}

                          Volume 3, Number 2
                              June 1974

@Article{Garey74,
title={Optimal Binary Search Trees with Restricted Maximal Depth},
author={M. R. Garey},
pages={101--110},
journal=sicomp,
year=1974,
month=jun,
volume=3,
number=2
}

@Article{Greibach74,
title={Jump {PDA's} and Hierarchies of Deterministic Context-Free
Languages},
author={S. A. Greibach},
pages={111--127},
journal=sicomp,
year=1974,
month=jun,
volume=3,
number=2
}

@Article{Strassen74,
title={Polynomials with Rational Coefficients Which Are Hard to
Compute},
author={Volker Strassen},
pages={128--149},
journal=sicomp,
year=1974,
month=jun,
volume=3,
number=2
}

@Article{Savage74,
title={An Algorithm for the Computation of Linear Forms},
author={John E. Savage},
pages={150--158},
journal=sicomp,
year=1974,
month=jun,
volume=3,
number=2
}

                          Volume 3, Number 3
                            September 1974

@Article{ChuaB74,
title={Analysis of a Feedback Scheduler},
author={Y. S. Chua and A. J. Bernstein},
pages={159--176},
journal=sicomp,
year=1974,
month=sep,
volume=3,
number=3
}

@Article{Perlman74,
title={Isomorph Rejection on Power Sets},
author={David M. Perlman},
pages={177--183},
journal=sicomp,
year=1974,
month=sep,
volume=3,
number=3
}

@Article{Ibarra74,
title={A Hierarchy Theorem for Polynomial-Space Recognition},
author={Oscar H. Ibarra},
pages={184--187},
journal=sicomp,
year=1974,
month=sep,
volume=3,
number=3
}

@Article{Hu74,
title={Optimum Communication Spanning Trees},
author={T. C. Hu},
pages={188--195},
journal=sicomp,
year=1974,
month=sep,
volume=3,
number=3
}

@Article{Fateman74,
title={Polynomial Multiplication, Powers and Asymptotic Analysis: Some
Comments},
author={Richard J. Fateman},
pages={196--213},
journal=sicomp,
year=1974,
month=sep,
volume=3,
number=3
}

@Article{GoodmanH74,
title={On {Hamiltonian} Walks in Graphs},
author={S. E. Goodman and S. T. Hedetniemi},
pages={214--221},
journal=sicomp,
year=1974,
month=sep,
volume=3,
number=3
}

@Article{AdamsPS74,
title={A Note on the {Hecht-Ullman} Characterization of Nonreducible
Flow Graphs},
author={J. M. Adams and J. M. Phelan and R. H. Stark},
pages={222--223},
journal=sicomp,
year=1974,
month=sep,
volume=3,
number=3
}

@Article{Graham74,
title={On Bounded Right Context Languages and Grammars},
author={Susan L. Graham},
pages={224--254},
journal=sicomp,
year=1974,
month=sep,
volume=3,
number=3,
preliminary={FOCS::Graham1970:175}
}

                          Volume 3, Number 4
                            December 1974

@Article{McIlroy74,
title={The Number of 1's in Binary Integers: Bounds and Extremal
Properties},
author={M. D. McIlroy},
pages={255--261},
journal=sicomp,
year=1974,
month=dec,
volume=3,
number=4
}

@Article{Sahni74,
title={Computationally Related Problems},
author={Sartaj Sahni},
pages={262--279},
journal=sicomp,
year=1974,
month=dec,
volume=3,
number=4,
preliminary={FOCS::Sahni1972:130}
}

@Article{Kleitman74,
title={A Note on Perfect Elimination Digraphs},
author={D. J. Kleitman},
pages={280--282},
journal=sicomp,
year=1974,
month=dec,
volume=3,
number=4
}

@Article{BookNP74,
title={Reversal-Bounded Acceptors and Intersections of Linear
Languages},
author={Ronald Book and Maurice Nivat and Michael Paterson},
pages={283--295},
journal=sicomp,
year=1974,
month=dec,
volume=3,
number=4,
preliminary={STOC::BookNP1974:290}
}

@Article{Kundu74,
title={Existence of Graphs with Three Spanning Trees and Given Degree
Sequence},
author={Sukhamay Kundu},
pages={296--298},
journal=sicomp,
year=1974,
month=dec,
volume=3,
number=4
}

@Article{JohnsonDUGG74,
title={Worst-Case Performance Bounds for Simple One-Dimensional
Packing Algorithms},
author={D. S. Johnson and A. Demers and J. D. Ullman and M. R. Garey
and R. L. Graham},
pages={299--325},
journal=sicomp,
year=1974,
month=dec,
volume=3,
number=4
}

@Article{Holland74,
title={Erratum: Genetic Algorithms and the Optimal Allocation of
Trials},
author={John H. Holland},
pages={326},
journal=sicomp,
year=1974,
month=dec,
volume=3,
number=4
}

                          Volume 4, Number 1
                              March 1975

@Article{HartmanisB75,
title={On Simple Goedel Numberings and Translations},
author={J. Hartmanis and T. P. Baker},
pages={1--11},
journal=sicomp,
year=1975,
month=mar,
volume=4,
number=1
}

@Article{Geller75:12,
title={Realization with Feedback Encoding. {I}: Analogues of the
Classical Theory},
author={Dennis P. Geller},
pages={12--33},
journal=sicomp,
year=1975,
month=mar,
volume=4,
number=1
}

@Article{Geller75:34,
title={Realization with Feedback Encoding. {II}: Applications to
Distinguishing Sequences},
author={Dennis P. Geller},
pages={34--48},
journal=sicomp,
year=1975,
month=mar,
volume=4,
number=1
}

@Article{MandlV75,
title={Computational Complexity of Inner Products of Vectors (And That
of Other Bilinear Forms) Over a Noncommutative Ring (Auxiliary
Functions Allowed)},
author={Robert Mandl and Thomas Vari},
pages={49--55},
journal=sicomp,
year=1975,
month=mar,
volume=4,
number=1
}

@Article{Eswaran75,
title={Faithful Representation of a Family of Sets By a Set of
Intervals},
author={Kapali P. Eswaran},
pages={56--68},
journal=sicomp,
year=1975,
month=mar,
volume=4,
number=1
}

@Article{FerranteR75,
title={A Decision Procedure for the First Order Theory of Real Addition
with Order},
author={Jeanne Ferrante and Charles Rackoff},
pages={69--76},
journal=sicomp,
year=1975,
month=mar,
volume=4,
number=1
}

@Article{Johnson75,
title={Finding All the Elementary Circuits of a Directed Graph},
author={Donald B. Johnson},
pages={77--84},
journal=sicomp,
year=1975,
month=mar,
volume=4,
number=1
}

@Article{Santos75,
title={State-Splitting for Stochastic Machines},
author={Eugene S. Santos},
pages={85--96},
journal=sicomp,
year=1975,
month=mar,
volume=4,
number=1
}

                          Volume 4, Number 2
                              June 1975

@Article{Miller75,
title={Computational Complexity and Numerical Stability},
author={Webb Miller},
pages={97--107},
journal=sicomp,
year=1975,
month=jun,
volume=4,
number=2
}

@Article{LavenbergS75,
title={Derivation of Confidence Intervals for Work Rate Estimators in a
Closed Queuing Network},
author={S. S. Lavenberg and G. S. Shedler},
pages={108--124},
journal=sicomp,
year=1975,
month=jun,
volume=4,
number=2
}

@Article{AshcroftM75,
title={Translating Program Schemas to While-Schemas},
author={Edward Ashcroft and Zohar Manna},
pages={125--146},
journal=sicomp,
year=1975,
month=jun,
volume=4,
number=2
}

@Article{KuckM75,
title={Time Bounds on the Parallel Evaluation of Arithmetic
Expressions},
author={D. J. Kuck and K. Maruyama},
pages={147--162},
journal=sicomp,
year=1975,
month=jun,
volume=4,
number=2
}

@Article{Hall75,
title={Solving a Problem in Eigenvalue Approximation with a Symbolic
Algebra System},
author={Hall, Jr., Andrew D. },
pages={163--174},
journal=sicomp,
year=1975,
month=jun,
volume=4,
number=2
}

@Article{Lempel75,
title={Matrix Factorization Over {$GF(2)$} and Trace-Orthogonal Bases
on {$GF(2^n)$}},
author={Abraham Lempel},
pages={175--186},
journal=sicomp,
year=1975,
month=jun,
volume=4,
number=2
}

@Article{GareyG75,
title={Bounds for Multiprocessor Scheduling with Resource Constraints},
author={M. R. Garey and R. L. Graham},
pages={187--200},
journal=sicomp,
year=1975,
month=jun,
volume=4,
number=2
}

@Article{HorowitzS75,
title={The Computation of Powers of Symbolic Polynomials},
author={Ellis Horowitz and Sartaj Sahni},
pages={201--208},
journal=sicomp,
year=1975,
month=jun,
volume=4,
number=2
}

                          Volume 4, Number 3
                            September 1975

@Article{WhiteW75,
title={Computational Algorithms for the Enumeration of Group Invariant
Partitions},
author={D. E. White and S. G. Williamson},
pages={209--213},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{Pratt75:214,
title={Every Prime Has a Succinct Certificate},
author={Vaughan R. Pratt},
pages={214--220},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{Hadlock75,
title={Finding a Maximum Cut of a Planar Graph in Polynomial Time},
author={F. Hadlock},
pages={221--225},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{Sethi75,
title={Complete Register Allocation Problems},
author={Ravi Sethi},
pages={226--248},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{ChandraW75,
title={Worst-Case Analysis of a Placement Algorithm Related to Storage
Allocation},
author={Ashok K. Chandra and C. K. Wong},
pages={249--263},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{DrysdaleY75,
title={Improved Divide/Sort/Merge Sorting Networks},
author={R. L. (Scot) {Drysdale III} and Frank H. Young},
pages={264--270},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{KarpMW75,
title={Near-Optimal Solutions to a 2-Dimensional Placement Problem},
author={R. M. Karp and A. C. McKellar and C. K. Wong},
pages={271--286},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{Rosenberg75:287,
title={Managing Storage for Extendible Arrays},
author={Arnold L. Rosenberg},
pages={287--306},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{StrongMR75,
title={Recursion Structure Simplification},
author={Strong, Jr., H. R.  and A. Maggiolo-Schettini and B. K.
Rosen},
pages={307--320},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{BumbyCL75,
title={Interactive Computation of Homology of Finite Partially Ordered
Sets},
author={R. Bumby and E. Cooper and D. Latch},
pages={321--325},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{Pratt75:326,
title={The Power of Negative Thinking in Multiplying {Boolean}
Matrices},
author={Vaughan R. Pratt},
pages={326--330},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{Kosaraju75,
title={Speed of Recognition of Context-Free Languages by Array
Automata},
author={S. Rao Kosaraju},
pages={331--340},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{Hosken75,
title={Optimum Partitions of Tree Addressing Structures},
author={W. H. Hosken},
pages={341--347},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{Valiant75,
title={Parallelism in Comparison Problems},
author={Leslie G. Valiant},
pages={348--355},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{OpderbeckC75,
title={The Renewal Model for Program Behavior},
author={H. Opderbeck and W. W. Chu},
pages={356--374},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{SpiraP75,
title={On Finding and Updating Spanning Trees and Shortest Paths},
author={P. M. Spira and A. Pan},
pages={375--380},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{Revah75,
title={On the Number of Multiplications/Divisions Evaluating a
Polynomial with Auxiliary Functions},
author={L. Revah},
pages={381--392},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

@Article{Even75,
title={An Algorithm for Determining Whether the Connectivity of a
Graph is at Least {$k$}},
author={Shimon Even},
pages={393--396},
journal=sicomp,
year=1975,
month=sep,
volume=4,
number=3
}

                          Volume 4, Number 4
                            December 1975

@Article{GareyJ75,
title={Complexity Results for Multiprocessor Scheduling under Resource
Constraints},
author={M. R. Garey and D. S. Johnson},
pages={397--411},
journal=sicomp,
year=1975,
month=dec,
volume=4,
number=4
}

@Article{Brand75,
title={Proving Theorems with the Modification Method},
author={D. Brand},
pages={412--430},
journal=sicomp,
year=1975,
month=dec,
volume=4,
number=4
}

@Article{BakerGS75,
title={Relativizations of the {$\mathcal{P} \mathrel{=?}
\mathcal{NP}$} Question},
author={Theodore Baker and John Gill and Robert Solovay},
pages={431--442},
journal=sicomp,
year=1975,
month=dec,
volume=4,
number=4
}

@Article{Rosenberg75:443,
title={Preserving Proximity in Arrays},
author={Arnold L. Rosenberg},
pages={443--460},
journal=sicomp,
year=1975,
month=dec,
volume=4,
number=4
}

@Article{GelenbeLP75,
title={Response Time of a Fixed-Head Disk to Transfers of Variable
Length},
author={Erol Gelenbe and Jacques Lenfant and Dominique Potier},
pages={461--473},
journal=sicomp,
year=1975,
month=dec,
volume=4,
number=4
}

@Article{JacksonR75,
title={The Enumeration of Generalized Double Stochastic Nonnegative
Integer Square Matrices},
author={D. M. Jackson and G. H. J. Van Rees},
pages={474--477},
journal=sicomp,
year=1975,
month=dec,
volume=4,
number=4
}

@Article{BrunoH75,
title={On Scheduling Chains of Jobs on One Processor with Limited
Preemption},
author={John Bruno and Micha Hofri},
pages={478--490},
journal=sicomp,
year=1975,
month=dec,
volume=4,
number=4
}

@Article{Alder75,
title={A Convergence Theorem for Hierarchies of Model Neurones},
author={M. D. Alder},
pages={491--506},
journal=sicomp,
year=1975,
month=dec,
volume=4,
number=4
}

@Article{EvenT75,
title={Network Flow and Testing Graph Connectivity},
author={Shimon Even and R. Endre Tarjan},
pages={507--518},
journal=sicomp,
year=1975,
month=dec,
volume=4,
number=4
}

@Article{HechtU75,
title={A Simple Algorithm for Global Data Flow Analysis Problems},
author={Matthew S. Hecht and Jeffrey D. Ullman},
pages={519--532},
journal=sicomp,
year=1975,
month=dec,
volume=4,
number=4
}

@Article{AhoSU75,
title={Evaluating Polynomials at Fixed Sets of Points},
author={A. V. Aho and K. Steiglitz and J. D. Ullman},
pages={533--539},
journal=sicomp,
year=1975,
month=dec,
volume=4,
number=4
}

@Article{Konheim75,
title={An Elementary Solution of the Queuing System {$G/G/1$}},
author={Alan G. Konheim},
pages={540--545},
journal=sicomp,
year=1975,
month=dec,
volume=4,
number=4
}

                          Volume 5, Number 1
                              March 1976

@Article{MunroS76,
title={Sorting and Searching in Multisets},
author={Ian Munro and Philip M. Spira},
pages={1--8},
journal=sicomp,
year=1976,
month=mar,
volume=5,
number=1
}

@Article{Itai76,
title={Optimal Alphabetic Trees},
author={Alon Itai},
pages={9--18},
journal=sicomp,
year=1976,
month=mar,
volume=5,
number=1
}

@Article{Rivest76,
title={Partial-Match Retrieval Algorithms},
author={Ronald L. Rivest},
pages={19--50},
journal=sicomp,
year=1976,
month=mar,
volume=5,
number=1
}

@Article{Mazlack76,
title={Machine Selection of Elements in Crossword Puzzles: An
Application of Computational Linguistics},
author={Lawrence J. Mazlack},
pages={51--72},
journal=sicomp,
year=1976,
month=mar,
volume=5,
number=1
}

@Article{Sethi76,
title={Scheduling Graphs on Two Processors},
author={Ravi Sethi},
pages={73--82},
journal=sicomp,
year=1976,
month=mar,
volume=5,
number=1
}

@Article{Fredman76,
title={New Bounds on the Complexity of the Shortest Path Problem},
author={Michael L. Fredman},
pages={83--89},
journal=sicomp,
year=1976,
month=mar,
volume=5,
number=1
}

@Article{MatetiD76,
title={On Algorithms for Enumerating All Circuits of a Graph},
author={Prabhakar Mateti and Narsingh Deo},
pages={90--99},
journal=sicomp,
year=1976,
month=mar,
volume=5,
number=1
}

@Article{Yao76,
title={On the Evaluation of Powers},
author={Andrew Chi-Chih Yao},
pages={100--103},
journal=sicomp,
year=1976,
month=mar,
volume=5,
number=1
}

@Article{GoodmanHT76,
title={{$b$-Matchings} in Trees},
author={S. Goodman and S. Hedetniemi and R. E. Tarjan},
pages={104--108},
journal=sicomp,
year=1976,
month=mar,
volume=5,
number=1
}

@Article{Hyafil76,
title={Bounds for Selection},
author={Laurent Hyafil},
pages={109--114},
journal=sicomp,
year=1976,
month=mar,
volume=5,
number=1
}

@Article{AhoHU76,
title={On Finding Lowest Common Ancestors in Trees},
author={A. V. Aho and J. E. Hopcroft and J. D. Ullman},
pages={115--132},
journal=sicomp,
year=1976,
month=mar,
volume=5,
number=1
}

@Article{Ohtsuki76,
title={A Fast Algorithm for Finding an Optimal Ordering for Vertex
Elimination on a Graph},
author={Tatsuo Ohtsuki},
pages={133--145},
journal=sicomp,
year=1976,
month=mar,
volume=5,
number=1
}

@Article{BorodinC76,
title={On the Number of Additions to Compute Specific Polynomials},
author={Allan Borodin and Stephen Cook},
pages={146--157},
journal=sicomp,
year=1976,
month=mar,
volume=5,
number=1
}

@Article{Kennedy76,
title={A Comparison of Two Algorithms for Global Data Flow Analysis},
author={Ken Kennedy},
pages={158--180},
journal=sicomp,
year=1976,
month=mar,
volume=5,
number=1
}

                          Volume 5, Number 2
                              June 1976

@Article{DobkinL76,
title={Multidimensional Searching Problems},
author={David Dobkin and Richard J. Lipton},
pages={181--186},
journal=sicomp,
year=1976,
month=jun,
volume=5,
number=2
}

@Article{Probert76,
title={On the Additive Complexity of Matrix Multiplication},
author={Robert L. Probert},
pages={187--203},
journal=sicomp,
year=1976,
month=jun,
volume=5,
number=2
}

@Article{Miller76,
title={Graph Transformations for Roundoff Analysis},
author={Webb Miller},
pages={204--216},
journal=sicomp,
year=1976,
month=jun,
volume=5,
number=2
}

@Article{SudboroughZ76,
title={On Families of Languages Defined by Time-Bounded Random Access
Machines},
author={I. H. Sudborough and A. Zalcberg},
pages={217--230},
journal=sicomp,
year=1976,
month=jun,
volume=5,
number=2
}

@Article{SzymanskiW76,
title={Noncanonical Extensions of Bottom-Up Parsing Techniques},
author={Thomas G. Szymanski and John H. Williams},
pages={231--250},
journal=sicomp,
year=1976,
month=jun,
volume=5,
number=2
}

@Article{Lien76,
title={Termination Properties of Generalized {Petri} Nets},
author={Y. Edmund Lien},
pages={251--265},
journal=sicomp,
year=1976,
month=jun,
volume=5,
number=2
}

@Article{RoseTL76,
title={Algorithmic Aspects of Vertex Elimination on Graphs},
author={Donald J. Rose and R. Endre Tarjan and George S. Lueker},
pages={266--283},
journal=sicomp,
year=1976,
month=jun,
volume=5,
number=2
}

@Article{Skyum76,
title={Decomposition Theorems for Various Kinds of Languages Parallel
in Nature},
author={Sven Skyum},
pages={284--296},
journal=sicomp,
year=1976,
month=jun,
volume=5,
number=2
}

@Article{FillmoreW76,
title={Ranking Algorithms: The Symmetries and Colorations of the
{$n$}-Cube},
author={Jay P. Fillmore and S. G. Williamson},
pages={297--304},
journal=sicomp,
year=1976,
month=jun,
volume=5,
number=2
}

@Article{Levy76,
title={Local Adjunct Languages and Regular Sets},
author={Leon S. Levy},
pages={305--308},
journal=sicomp,
year=1976,
month=jun,
volume=5,
number=2
}

@Article{Bernstein76,
title={Synthesizing a Response Function with a Feedback Scheduling
Algorithm},
author={Arthur Bernstein},
pages={309--317},
journal=sicomp,
year=1976,
month=jun,
volume=5,
number=2
}

@Article{Bollman76,
title={On Preserving Proximity in Extendible Arrays},
author={D. Bollman},
pages={318--323},
journal=sicomp,
year=1976,
month=jun,
volume=5,
number=2
}

@Article{Strassen76,
title={Computational Complexity over Finite Fields},
author={Volker Strassen},
pages={324--331},
journal=sicomp,
year=1976,
month=jun,
volume=5,
number=2
}

                          Volume 5, Number 3
                            September 1976

@Article{AshcroftW76,
title={Lucid---A Formal System for Writing and Proving Programs},
author={E. A. Ashcroft and W. W. Wadge},
pages={336--354},
journal=sicomp,
year=1976,
month=sep,
volume=5,
number=3
}

@Article{Gerhart76,
title={Proof Theory of Partial Correctness Verification Systems},
author={Susan L. Gerhart},
pages={355--377},
journal=sicomp,
year=1976,
month=sep,
volume=5,
number=3
}

@Article{DowneyS76,
title={Correct Computation Rules for Recursive Languages},
author={Peter J. Downey and Ravi Sethi},
pages={378--401},
journal=sicomp,
year=1976,
month=sep,
volume=5,
number=3
}

@Article{Chandra76,
title={Generalized Program Schemas},
author={Ashok K. Chandra},
pages={402--413},
journal=sicomp,
year=1976,
month=sep,
volume=5,
number=3
}

@Article{MannaS76,
title={The Theoretical Aspects of the Optimal Fixedpoint},
author={Zohar Manna and Adi Shamir},
pages={414--426},
journal=sicomp,
year=1976,
month=sep,
volume=5,
number=3
}

@Article{Muchnick76,
title={Computational Complexity of Multiple Recursive Schemata},
author={Steven S. Muchnick},
pages={427--451},
journal=sicomp,
year=1976,
month=sep,
volume=5,
number=3
}

@Article{Plotkin76,
title={A Powerdomain Construction},
author={G. D. Plotkin},
pages={452--487},
journal=sicomp,
year=1976,
month=sep,
volume=5,
number=3
}

@Article{Wadsworth76,
title={The Relation Between Computational and Denotational Properties
for {Scott's} {$D_\infty$}-Models of the Lambda-Calculus},
author={Christopher P. Wadsworth},
pages={488--521},
journal=sicomp,
year=1976,
month=sep,
volume=5,
number=3
}

@Article{Scott76,
title={Data Types as Lattices},
author={Dana Scott},
pages={522--587},
journal=sicomp,
year=1976,
month=sep,
volume=5,
number=3
}

                          Volume 5, Number 4
                            December 1976

@Article{KinariwalaB76,
title={Theory of Output Set Assignments and Degree Switching
Operations},
author={Bharat Kinariwala and Kabekode V. S. Bhat},
pages={589--601},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{Williamson76,
title={Ranking Algorithms for Lists of Partitions},
author={S. G. Williamson},
pages={602--617},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{Csanky76,
title={Fast Parallel Matrix Inversion Algorithms},
author={L. Csanky},
pages={618--623},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{BrockettD76,
title={On the Number of Multiplications Required for Matrix
Multiplication},
author={Roger W. Brockett and David Dobkin},
pages={624--628},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{AsanoST76,
title={General Results on Tour Lengths in Machines and Digraphs},
author={Takao Asano and Michiro Shibui and Itsuo Takanami},
pages={629--645},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{Solovay76,
title={On Sets {Cook}-Reducible to Sparse Sets},
author={Robert M. Solovay},
pages={646--652},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{EswaranT76,
title={Augmentation Problems},
author={Kapali P. Eswaran and R. Endre Tarjan},
pages={653--665},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{Cherniavsky76,
title={Simple Programs Realize Exactly {Presberger} Formulas},
author={John C. Cherniavsky},
pages={666--677},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{BarakS76,
title={On the Parallel Evaluation of {Boolean} Expressions},
author={Amnon Barak and Eliahu Shamir},
pages={678--681},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{Chin76,
title={A Generalized Asymptotic Upper Bound on Fast Polynomial
Evaluation and Interpolation},
author={Francis Y. Chin},
pages={682--690},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{EvenIS76,
title={On the Complexity of Timetable and Multicommodity Flow
Problems},
author={S. Even and A. Itai and A. Shamir},
pages={691--703},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{GareyJT76,
title={The Planar {Hamiltonian} Circuit Problem is {NP}-Complete},
author={M. R. Garey and D. S. Johnson and R. Endre Tarjan},
pages={704--714},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{Hendricks76,
title={An Account of Self-Organizing Systems},
author={W. J. Hendricks},
pages={715--723},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{CheritonT76,
title={Finding Minimum Spanning Trees},
author={David Cheriton and Robert Endre Tarjan},
pages={724--742},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{Smith76,
title={Analysis of the Optimal, Look-Ahead Demand Paging Algorithms},
author={Alan Jay Smith},
pages={743--757},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

@Article{Bass76,
title={Errata: On Optimal Processor Scheduling for Multiprogramming},
author={L. J. Bass},
pages={758},
journal=sicomp,
year=1976,
month=dec,
volume=5,
number=4
}

                          Volume 6, Number 1
                              March 1977

@Article{Zave77,
title={Optimal Polyphase Sorting},
author={Derek A. Zave},
pages={1--39},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{Adolphson77,
title={Single Machine Job Sequencing with Precedence Constraints},
author={Donald L. Adolphson},
pages={40--54},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{RosenthalG77,
title={Smallest Augmentations to Biconnect a Graph},
author={Arnie Rosenthal and Anita Goldner},
pages={55--66},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{Kou77,
title={Polynomial Complete Consecutive Information Retrieval Problems},
author={Lawrence T. Kou},
pages={67--75},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{PapadimitriouS77,
title={On the Complexity of Local Search for the Traveling Salesman
Problem},
author={Christos H. Papadimitriou and Kenneth Steiglitz},
pages={76--83},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{SolovayS77,
title={A Fast {Monte-Carlo} Test for Primality},
author={R. Solovay and V. Strassen},
pages={84--85},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{AoshimaI77,
title={Comments on {F. Hadlock's} Paper: ``{Finding} a Maximum Cut of
a Planar Graph in Polynomial Time''},
author={K. Aoshima and M. Iri},
pages={86--87},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{HendersonZ77,
title={A Graph-Theoretic Characterization of the
{$\mathrm{PV}_{\mathrm{chunk}}$} Class of Synchronizing Primitives},
author={Peter B. Henderson and Yechezkel Zalcstein},
pages={88--108},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{SzymanskiU77,
title={Evaluating Relational Expressions with Dense and Sparse
Arguments},
author={T. G. Szymanski and J. D. Ullman},
pages={109--122},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{GinsburgL77,
title={Derivation Complexity in Context-Free Grammar Forms},
author={Seymour Ginsburg and Nancy Lynch},
pages={123--138},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{Gabow77,
title={Two Algorithms for Generating Weighted Spanning Trees in Order},
author={Harold N. Gabow},
pages={139--150},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{KunduM77,
title={A Linear Tree Partitioning Algorithm},
author={Sukhamay Kundu and Jayadev Misra},
pages={151--154},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{GonzalezIS77,
title={Bounds for {LPT} Schedules on Uniform Processors},
author={Teofilo Gonzalez and Oscar H. Ibarra and Sartaj Sahni},
pages={155--166},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{KafuraS77,
title={Task Scheduling on a Multiprocessor System with Independent
Memories},
author={D. G. Kafura and V. Y. Shen},
pages={167--187},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{KirkpatrickK77,
title={Adequate Requirements for Rational Functions},
author={David G. Kirkpatrick and Zvi M. Kedem},
pages={188--199},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

@Article{AshcroftW77,
title={Erratum: Lucid---A Formal System for Writing and Proving
Programs},
author={E. A. Ashcroft and W. W. Wadge},
pages={200},
journal=sicomp,
year=1977,
month=mar,
volume=6,
number=1
}

                          Volume 6, Number 2
                              June 1977

@Article{MiyakawaYSH77,
title={Optimum Sequence Trees},
author={Masahiro Miyakawa and Toshitsugu Yuba and Yoshio Sugito and
Manoru Hoshi},
pages={201--234},
journal=sicomp,
year=1977,
month=jun,
volume=6,
number=2
}

@Article{Mehlhorn77,
title={A Best Possible Bound for the Weighted Path Length of Binary
Search Trees},
author={Kurt Mehlhorn},
pages={235--239},
journal=sicomp,
year=1977,
month=jun,
volume=6,
number=2
}

@Article{Sedgewick77,
title={Quicksort with Equal Keys},
author={Robert Sedgewick},
pages={240--268},
journal=sicomp,
year=1977,
month=jun,
volume=6,
number=2
}

@Article{Fabri77,
title={Some Remarks on {$p$}-Way Merging},
author={Janet Fabri},
pages={269--271},
journal=sicomp,
year=1977,
month=jun,
volume=6,
number=2
}

@Article{JoshiL77,
title={Constraints on Structural Descriptions: Local Transformations},
author={Aravind K. Joshi and Leon S. Levy},
pages={272--284},
journal=sicomp,
year=1977,
month=jun,
volume=6,
number=2
}

@Article{HikitaN77,
title={A Completeness Criterion for Spectra},
author={T. Hikita and A. Nozaki},
pages={285--297},
journal=sicomp,
year=1977,
month=jun,
volume=6,
number=2
}

@Article{Pippenger77,
title={Superconcentrators},
author={Nicholas Pippenger},
pages={298--304},
journal=sicomp,
year=1977,
month=jun,
volume=6,
number=2
}

@Article{BermanH77,
title={On Isomorphisms and Density of {NP} and Other Complete Sets},
author={L. Berman and J. Hartmanis},
pages={305--322},
journal=sicomp,
year=1977,
month=jun,
volume=6,
number=2
}

@Article{KnuthMP77,
title={Fast Pattern Matching in Strings},
author={Donald E. Knuth and Morris, Jr., James H. and Vaughan R.
Pratt},
pages={323--350},
journal=sicomp,
year=1977,
month=jun,
volume=6,
number=2
}

@Article{Pardo77,
title={Stable Sorting and Merging with Optimal Space and Time Bounds},
author={Luis Trabb Pardo},
pages={351--372},
journal=sicomp,
year=1977,
month=jun,
volume=6,
number=2
}

@Article{McCollP77,
title={The Depth of All {Boolean} Functions},
author={W. F. McColl and M. S. Paterson},
pages={373--380},
journal=sicomp,
year=1977,
month=jun,
volume=6,
number=2
}

@Article{Benson77,
title={Some Preservation Properties of Normal Form Grammars},
author={David B. Benson},
pages={381--402},
journal=sicomp,
year=1977,
month=jun,
volume=6,
number=2
}

                          Volume 6, Number 3
                            September 1977

@Article{Russell77:403,
title={Implementation Correctness Involving a Language with {goto}
Statements},
author={Bruce D. Russell},
pages={403--415},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

@Article{GareyJ77,
title={Two-Processor Scheduling with Start-Times and Deadlines},
author={M. R. Garey and D. S. Johnson},
pages={416--426},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

@Article{Paul77,
title={A {$2.5n$}-Lower Bound on the Combinational Complexity of
{Boolean} Functions},
author={Wolfgang J. Paul},
pages={427--443},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

@Article{Galil77,
title={On Resolution with Clauses of Bounded Size},
author={Zvi Galil},
pages={444--459},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

@Article{Igarashi77,
title={The Tape Complexity of Some Classes of {Szilard} Languages},
author={Y. Igarashi},
pages={460--466},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

@Article{Ladner77,
title={The Computational Complexity of Provability in Systems of Modal
Propositional Logic},
author={Richard E. Ladner},
pages={467--480},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

@Article{AdolphsonT77,
title={A Linear Time Algorithm for a {$2 \times n$} Transportation
Problem},
author={D. L. Adolphson and G. N. Thomas},
pages={481--486},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

@Article{Seiferas77,
title={Linear-Time Computation by Nondeterministic Multidimensional
Iterative Arrays},
author={Joel I. Seiferas},
pages={487--504},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

@Article{TsukiyamaIAS77,
title={A New Algorithm for Generating All the Maximal Independent
Sets},
author={Shuji Tsukiyama and Mikio Ide and Hiromu Ariyoshi and Isao
Shirakawa},
pages={505--517},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

@Article{LamS77,
title={Worst Case Analysis of Two Scheduling Algorithms},
author={Shui Lam and Ravi Sethi},
pages={518--536},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

@Article{TarjanT77,
title={Finding a Maximum Independent Set},
author={Robert Endre Tarjan and Anthony E. Trojanowski},
pages={537--546},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

@Article{SchmidtS77,
title={Succinctness of Descriptions of Unambiguous Context-Free
Languages},
author={Erik Meineche Schmidt and Thomas G. Szymanski},
pages={547--553},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

@Article{Chin77,
title={The Partial Fraction Expansion Problem and Its Inverse},
author={Francis Y. Chin},
pages={554--562},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

@Article{RosenkrantzSL77,
title={An Analysis of Several Heuristics for the Traveling Salesman
Problem},
author={Daniel J. Rosenkrantz and Richard E. Stearns and Philip M.
{Lewis II}},
pages={563--581},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3,
preliminary={FOCS::RosenkrantzSL1974:33}
}

@Article{KungT77,
title={Fast Algorithms for Partial Fraction Decomposition},
author={H. T. Kung and D. M. Tong},
pages={582--593},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

@Article{LeeP77,
title={Location of a Point in a Planar Subdivision and Its
Applications},
author={D. T. Lee and F. P. Preparata},
pages={594--606},
journal=sicomp,
year=1977,
month=sep,
volume=6,
number=3
}

                          Volume 6, Number 4
                            December 1977

@Article{Russell77:607,
title={Internal Fragmentation in a Class of Buddy Systems},
author={David L. Russell},
pages={607--621},
journal=sicomp,
year=1977,
month=dec,
volume=6,
number=4
}

@Article{GarsiaW77,
title={A New Algorithm for Minimum Cost Binary Trees},
author={Adriano M. Garsia and Michelle L. Wachs},
pages={622--642},
journal=sicomp,
year=1977,
month=dec,
volume=6,
number=4
}

@Article{Chvatal77,
title={Determining the Stability Number of a Graph},
author={V. Chv{\'a}tal},
pages={643--662},
journal=sicomp,
year=1977,
month=dec,
volume=6,
number=4
}

@Article{Larson77,
title={Minimizing Garbage Collection as a Function of Region Size},
author={Richard G. Larson},
pages={663--668},
journal=sicomp,
year=1977,
month=dec,
volume=6,
number=4
}

@Article{Rivest77,
title={On the Worst-Case Behavior of String-Searching Algorithms},
author={Ronald L. Rivest},
pages={669--674},
journal=sicomp,
year=1977,
month=dec,
volume=6,
number=4
}

@Article{Gill77,
title={Computational Complexity of Probabilistic {Turing} Machines},
author={John Gill},
pages={675--695},
journal=sicomp,
year=1977,
month=dec,
volume=6,
number=4
}

@Article{CarsonL77,
title={A Note on {Spira's} Algorithm for the All-Pairs Shortest-Path
Problem},
author={John S. Carson and Averill M. Law},
pages={696--699},
journal=sicomp,
year=1977,
month=dec,
volume=6,
number=4
}

@Article{FinoA77,
title={A Unified Treatment of Discrete Fast Unitary Transforms},
author={Bernard J. Fino and V. Ralph Algazi},
pages={700--717},
journal=sicomp,
year=1977,
month=dec,
volume=6,
number=4
}

@Article{Misra77,
title={Prospects and Limitations of Automatic Assertion Generation for
Loop Programs},
author={Jayadev Misra},
pages={718--729},
journal=sicomp,
year=1977,
month=dec,
volume=6,
number=4
}

@Article{Reyner77,
title={An Analysis of a Good Algorithm for the Subtree Problem},
author={Steven W. Reyner},
pages={730--732},
journal=sicomp,
year=1977,
month=dec,
volume=6,
number=4
}

@Article{Borodin77,
title={On Relating Time and Space to Size and Depth},
author={Allan Borodin},
pages={733--744},
journal=sicomp,
year=1977,
month=dec,
volume=6,
number=4
}

@Article{RuskeyH77,
title={Generating Binary Trees Lexicographically},
author={F. Ruskey and T. C. Hu},
pages={745--758},
journal=sicomp,
year=1977,
month=dec,
volume=6,
number=4
}

                          Volume 7, Number 1
                            February 1978

@Article{CoffmanGJ78,
title={An Application of Bin-Packing to Multiprocessor Scheduling},
author={Coffman, Jr., E. G.  and M. R. Garey and D. S. Johnson},
pages={1--17},
journal=sicomp,
year=1978,
month=feb,
volume=7,
number=1
}

@Article{Tanner78,
title={Minimean Merging and Sorting: An Algorithm},
author={R. Michael Tanner},
pages={18--38},
journal=sicomp,
year=1978,
month=feb,
volume=7,
number=1
}

@Article{MachteyWY78,
title={Simple {G\"odel} Numberings, Isomorphisms, and Programming
Properties},
author={Michael Machtey and Karl Winklmann and Paul Young},
pages={39--60},
journal=sicomp,
year=1978,
month=feb,
volume=7,
number=1
}

@Article{Lipton78,
title={Polynomials with 0-1 Coefficients that Are Hard to Evaluate},
author={Richard J. Lipton},
pages={61--69},
journal=sicomp,
year=1978,
month=feb,
volume=7,
number=1
}

@Article{Cook78,
title={Soundness and Completeness of an Axiom System for Program
Verification},
author={Stephen C. Cook},
pages={70--90},
journal=sicomp,
year=1978,
month=feb,
volume=7,
number=1
}

@Article{Probert78,
title={An Extension of Computational Duality to Sequences of Bilinear
Computations},
author={Robert L. Probert},
pages={91--98},
journal=sicomp,
year=1978,
month=feb,
volume=7,
number=1
}

@Article{HuntR78,
title={Computational Parallels Between the Regular and Context-Free
Languages},
author={Hunt, III, H. B.  and D. J. Rosenkrantz},
pages={99--114},
journal=sicomp,
year=1978,
month=feb,
volume=7,
number=1
}

@Article{Biskup78,
title={The Time Measure of One-Tape {Turing} Machines Does Not Have
the Parallel Computation Property},
author={Joachim Biskup},
pages={115--117},
journal=sicomp,
year=1978,
month=feb,
volume=7,
number=1
}

@Article{SolovayS78,
title={Erratum: A Fast {Monte-Carlo} Test for Primality},
author={R. Solovay and V. Strassen},
pages={118},
journal=sicomp,
year=1978,
month=feb,
volume=7,
number=1
}

                          Volume 7, Number 2
                               May 1978

@Article{LynchL78,
title={On Structure Preserving Reductions},
author={Nancy Lynch and Richard J. Lipton},
pages={119--126},
journal=sicomp,
year=1978,
month=may,
volume=7,
number=2
}

@Article{Schnorr78,
title={An Algorithm for Transitive Closure with Linear Expected Time},
author={C. P. Schnorr},
pages={127--133},
journal=sicomp,
year=1978,
month=may,
volume=7,
number=2
}

@Article{Fredman78,
title={Observations on the Complexity of Generating Quasi-{Gray}
Codes},
author={Michael L. Fredman},
pages={134--146},
journal=sicomp,
year=1978,
month=may,
volume=7,
number=2
}

@Article{JohnsonM78,
title={Selecting the {$K$}th Element in {$X+Y$} and {$X_1 + X_2 +
\cdots + X_m$}},
author={Donald B. Johnson and Tetsuo Mizoguchi},
pages={147--153},
journal=sicomp,
year=1978,
month=may,
volume=7,
number=2
}

@Article{MegiddoT78,
title={An {$O(N \cdot \log N)$} Algorithm for a Class of Matching
Problems},
author={Nimrod Megiddo and Arie Tamir},
pages={154--157},
journal=sicomp,
year=1978,
month=may,
volume=7,
number=2
}

@Article{MaurerSW78,
title={On Good {E0L} Forms},
author={H. A. Maurer and A. Salomaa and D. Wood},
pages={158--166},
journal=sicomp,
year=1978,
month=may,
volume=7,
number=2
}

@Article{BookN78,
title={Linear Languages and the Intersection Closures of Classes of
Languages},
author={Ronald V. Book and Maurice Nivat},
pages={167--177},
journal=sicomp,
year=1978,
month=may,
volume=7,
number=2
}

@Article{FredericksonHK78,
title={Approximation Algorithms for Some Routing Problems},
author={Greg N. Frederickson and Matthew S. Hecht and Chul E. Kim},
pages={178--193},
journal=sicomp,
year=1978,
month=may,
volume=7,
number=2
}

@Article{Wrathall78,
title={Rudimentary Predicates and Relative Computation},
author={Celia Wrathall},
pages={194--209},
journal=sicomp,
year=1978,
month=may,
volume=7,
number=2
}

@Article{KonheimR78,
title={Finite Capacity Queuing Systems with Applications in Computer
Modeling},
author={A. G. Konheim and M. Reiser},
pages={210--229},
journal=sicomp,
year=1978,
month=may,
volume=7,
number=2
}

@Article{ReghbatiC78,
title={Parallel Computations in Graph Theory},
author={Eshrat {Reghbati (Arjomandi)} and D. G. Corneil},
pages={230--237},
journal=sicomp,
year=1978,
month=may,
volume=7,
number=2
}

@Article{BrockettD78,
title={Errata: On the Number of Multiplications Required for Matrix
Multiplication},
author={R. W. Brockett and D. Dobkin},
pages={238},
journal=sicomp,
year=1978,
month=may,
volume=7,
number=2
}

                          Volume 7, Number 3
                             August 1978

@Article{Sedgewick78,
title={Data Movement in Odd-Even Merging},
author={Robert Sedgewick},
pages={239--272},
journal=sicomp,
year=1978,
month=aug,
volume=7,
number=3
}

@Article{Booth78,
title={Isomorphism Testing for Graphs, Semigroups, and Finite Automata
Are Polynomially Equivalent Problems},
author={Kellogg S. Booth},
pages={273--279},
journal=sicomp,
year=1978,
month=aug,
volume=7,
number=3
}

@Article{GabowM78,
title={Finding All Spanning Trees of Directed and Undirected Graphs},
author={Harold N. Gabow and Eugene W. Myers},
pages={280--287},
journal=sicomp,
year=1978,
month=aug,
volume=7,
number=3
}

@Article{FaginP78,
title={Efficient Calculation of Expected Miss Ratios in the Independent
Reference Model},
author={Ronald Fagin and Thomas G. Price},
pages={288--297},
journal=sicomp,
year=1978,
month=aug,
volume=7,
number=3
}

@Article{Brown78,
title={Implementation and Analysis of Binomial Queue Algorithms},
author={Mark R. Brown},
pages={298--319},
journal=sicomp,
year=1978,
month=aug,
volume=7,
number=3
}

@Article{Gold78,
title={Deadlock Prediction: Easy and Difficult Cases},
author={E. Mark Gold},
pages={320--336},
journal=sicomp,
year=1978,
month=aug,
volume=7,
number=3
}

@Article{Wadsworth78,
title={Approximate Reduction and Lambda Calculus Models},
author={Christopher P. Wadsworth},
pages={337--356},
journal=sicomp,
year=1978,
month=aug,
volume=7,
number=3
}

@Article{WagnerS78,
title={Correcting Counter-Automaton-Recognizable Languages},
author={Robert A. Wagner and Joel I. Seiferas},
pages={357--375},
journal=sicomp,
year=1978,
month=aug,
volume=7,
number=3
}

@Article{Baker78:376,
title={Generalized Syntax Directed Translation, Tree Transducers, and
Linear Space},
author={Brenda S. Baker},
pages={376--391},
journal=sicomp,
year=1978,
month=aug,
volume=7,
number=3
}

                          Volume 7, Number 4
                            November 1978

@Article{BrunoD78,
title={Complexity of Task Sequencing with Deadlines, Set-Up Times and
Changeover Costs},
author={John Bruno and Peter Downey},
pages={393--404},
journal=sicomp,
year=1978,
month=nov,
volume=7,
number=4
}

@Article{RosenkrantzH78,
title={Polynomial Algorithms for Deterministic Pushdown Automata},
author={Daniel J. Rosenkrantz and Hunt III, Harry B.},
pages={405--412},
journal=sicomp,
year=1978,
month=nov,
volume=7,
number=4
}

@Article{ItaiR78,
title={Finding a Minimum Circuit in a Graph},
author={Alon Itai and Michael Rodeh},
pages={413--423},
journal=sicomp,
year=1978,
month=nov,
volume=7,
number=4
}

@Article{Ruskey78,
title={Generating {$t$}-ary Trees Lexicographically},
author={Frank Ruskey},
pages={424--439},
journal=sicomp,
year=1978,
month=nov,
volume=7,
number=4
}

@Article{Selman78,
title={Polynomial Time Enumeration Reducibility},
author={Alan L. Selman},
pages={440--457},
journal=sicomp,
year=1978,
month=nov,
volume=7,
number=4
}

@Article{Plaisted78,
title={Some Polynomial and Integer Divisibility Problems are
{$NP$}-Hard},
author={David Plaisted},
pages={458--464},
journal=sicomp,
year=1978,
month=nov,
volume=7,
number=4
}

@Article{RosenbergS78,
title={Minimal-Comparison 2,3-Trees},
author={Arnold L. Rosenberg and Lawrence Snyder},
pages={465--480},
journal=sicomp,
year=1978,
month=nov,
volume=7,
number=4
}

@Article{Purdom78,
title={Tree Size by Partial Backtracking},
author={Paul W. Purdom},
pages={481--491},
journal=sicomp,
year=1978,
month=nov,
volume=7,
number=4
}

@Article{Trojanowski78,
title={Ranking and Listing Algorithms for {$k$}-ary Trees},
author={Anthony E. Trojanowski},
pages={492--509},
journal=sicomp,
year=1978,
month=nov,
volume=7,
number=4
}

@Article{Pippenger78,
title={Generalized Connectors},
author={Nicholas Pippenger},
pages={510--514},
journal=sicomp,
year=1978,
month=nov,
volume=7,
number=4
}

@Article{Yao78,
title={On the Loop Switching Addressing Problem},
author={Andrew Chi-Chih Yao},
pages={515--523},
journal=sicomp,
year=1978,
month=nov,
volume=7,
number=4
}

@Article{Ibarra78,
title={The Unsolvability of the Equivalence Problem for
{$\epsilon$}-Free {NGSM's} with Unary Input (Output) Alphabet and
Applications},
author={Oscar H. Ibarra},
pages={524--532},
journal=sicomp,
year=1978,
month=nov,
volume=7,
number=4
}

@Article{Baker78:533,
title={A Technique for Extending Rapid Exact-Match String Matching to
Arrays of More than One Dimension},
author={Theodore P. Baker},
pages={533--541},
journal=sicomp,
year=1978,
month=nov,
volume=7,
number=4
}

                          Volume 8, Number 1
                            February 1979

@Article{McDiarmid79,
title={Determining the Chromatic Number of a Graph},
author={Colin McDiarmid},
pages={1--14},
journal=sicomp,
year=1979,
month=feb,
volume=8,
number=1
}

@Article{Shiloach79:15,
title={Multi-Terminal 0-1 Flow},
author={Yossi Shiloach},
pages={15--32},
journal=sicomp,
year=1979,
month=feb,
volume=8,
number=1
}

@Article{Brown79,
title={A Partial Analysis of Random Height-Balanced Trees},
author={Mark R. Brown},
pages={33--41},
journal=sicomp,
year=1979,
month=feb,
volume=8,
number=1
}

@Article{MillerPRS79,
title={Optimal 2,3-Trees},
author={Raymond E. Miller and Nicholas Pippenger and Arnold L.
Rosenberg and Lawrence Snyder},
pages={42--59},
journal=sicomp,
year=1979,
month=feb,
volume=8,
number=1
}

@Article{AggarwalB79,
title={A Round-Off Error Model with Applications to Arithmetic
Expressions},
author={Vijay B. Aggarwal and James W. Burgmeier},
pages={60--72},
journal=sicomp,
year=1979,
month=feb,
volume=8,
number=1
}

@Article{ZaksR79,
title={Generating Trees and Other Combinatorial Objects
Lexicographically},
author={S. Zaks and D. Richards},
pages={73--81},
journal=sicomp,
year=1979,
month=feb,
volume=8,
number=1
}

@Article{Bitner79,
title={Heuristics That Dynamically Organize Data Structures},
author={James R. Bitner},
pages={82--110},
journal=sicomp,
year=1979,
month=feb,
volume=8,
number=1
}

@Article{Opatrny79,
title={Total Ordering Problem},
author={J. Opatrny},
pages={111--114},
journal=sicomp,
year=1979,
month=feb,
volume=8,
number=1
}

                          Volume 8, Number 2
                               May 1979

@Article{HarperS79,
title={Lower Bounds on Synchronous Combinational Complexity},
author={L. H. Harper and J. E. Savage},
pages={115--119},
journal=sicomp,
year=1979,
month=may,
volume=8,
number=2
}

@Article{Hyafil79,
title={On the Parallel Evaluation of Multivariate Polynomials},
author={Laurent Hyafil},
pages={120--123},
journal=sicomp,
year=1979,
month=may,
volume=8,
number=2
}

@Article{HehnerH79,
title={A New Representation of the Rational Numbers for Fast Easy
Arithmetic},
author={E. C. R. Hehner and R. N. S. Horspool},
pages={124--134},
journal=sicomp,
year=1979,
month=may,
volume=8,
number=2
}

@Article{ItaiS79,
title={Maximum Flow in Planar Networks},
author={Alon Itai and Yossi Shiloach},
pages={135--150},
journal=sicomp,
year=1979,
month=may,
volume=8,
number=2
}

@Article{StockmeyerC79,
title={Provably Difficult Combinatorial Games},
author={Larry J. Stockmeyer and Ashok K. Chandra},
pages={151--174},
journal=sicomp,
year=1979,
month=may,
volume=8,
number=2
}

@Article{Mehlhorn79,
title={Dynamic Binary Search},
author={Kurt Mehlhorn},
pages={175--198},
journal=sicomp,
year=1979,
month=may,
volume=8,
number=2
}

@Article{Carlson79,
title={A Counterexample to {Reingold's} Pushdown Permuter
Characterization Theorem},
author={Carl R. Carlson},
pages={199--201},
journal=sicomp,
year=1979,
month=may,
volume=8,
number=2
}

@Article{CoffmanL79,
title={Combinatorial Analysis of an Efficient Algorithm for Processor
and Storage Allocation},
author={Coffman, Jr., E. G.  and Joseph {Y-T.} Leung},
pages={202--217},
journal=sicomp,
year=1979,
month=may,
volume=8,
number=2
}

@Article{AhoSU79,
title={Equivalences Among Relational Expressions},
author={A. V. Aho and Y. Sagiv and J. D. Ullman},
pages={218--246},
journal=sicomp,
year=1979,
month=may,
volume=8,
number=2
}

@Article{HagiharaITK79,
title={Decision Problems for Multivalued Dependencies in Relational
Databases},
author={Kenichi Hagihara and Minoru Ito and Kenichi Taniguchi and
Tadao Kasami},
pages={247--264},
journal=sicomp,
year=1979,
month=may,
volume=8,
number=2
}

@Article{Schnorr79,
title={Bottlenecks and Edge Connectivity in Unsymmetrical Networks},
author={C. P. Schnorr},
pages={265--274},
journal=sicomp,
year=1979,
month=may,
volume=8,
number=2
}

@Article{SahniC79,
title={Nearly On Line Scheduling of a Uniform Processor System with
Release Times},
author={Sartaj Sahni and Yookun Cho},
pages={275--285},
journal=sicomp,
year=1979,
month=may,
volume=8,
number=2
}

                          Volume 8, Number 3
                             August 1979

              SIAM-SIGSAM Symposium on Computer Algebra
                   Richard D. Jenks, Special Editor

@Article{Stoutmyer79,
title={Automatic Asymptotic and Big-{$O$} Calculations Via Computer
Algebra},
author={David R. Stoutmyer},
pages={287--299},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{WangT79,
title={New Algorithms for Polynomial Square-Free Decomposition Over
the Integers},
author={Paul S. Wang and Barry M. Trager},
pages={300--305},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{Wirth79,
title={Symbolic Vector and Dyadic Analysis},
author={Michael C. Wirth},
pages={306--319},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{Epstein79,
title={A Natural Structure Theorem for Complex Fields},
author={H. I. Epstein},
pages={320--325},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{Klip79,
title={New Algorithms for Polynomial Multiplication},
author={Dorothea A. Klip},
pages={326--343},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{McKay79,
title={Some Remarks on Computing {Galois} Groups},
author={J. McKay},
pages={344--347},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{Yun79,
title={Uniform Bounds for a Class of Algebraic Mappings},
author={David Y. Y. Yun},
pages={348--356},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{RothsteinC79,
title={A Structure Theorem for Exponential and Primitive Functions},
author={Michael Rothstein and B. F. Caviness},
pages={357--367},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

REGULAR ARTICLES:

@Article{Yao79,
title={The Complexity of Pattern Matching for a Random String},
author={Andrew Chi-Chih Yao},
pages={368--387},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{StockmeyerW79,
title={On the Number of Comparisons to Find the Intersection of Two
Relations},
author={L. J. Stockmeyer and C. K. Wong},
pages={388--404},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{PapadimitriouY79,
title={Scheduling Interval-Ordered Tasks},
author={C. H. Papadimitriou and M. Yannakakis},
pages={405--409},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{Valiant79,
title={The Complexity of Enumeration and Reliability Problems},
author={Leslie G. Valiant},
pages={410--421},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{Shiloach79:422,
title={A Minimum Linear Arrangement Algorithm for Undirected Trees},
author={Yossi Shiloach},
pages={422--430},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{Fortune79,
title={A Note on Sparse Complete Sets},
author={Steven Fortune},
pages={431--433},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{Book79,
title={Polynomial Space and Transitive Closure},
author={Ronald V. Book},
pages={434--439},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{Walkup79,
title={On the Expected Value of a Random Assignment Problem},
author={David W. Walkup},
pages={440--442},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{JaJa79,
title={Optimal Evaluation of Pairs of Bilinear Forms},
author={Joseph Ja'Ja'},
pages={443--462},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3
}

@Article{GonnetM79,
title={Efficient Ordering of Hash Tables},
author={Gaston H. Gonnet and J. Ian Munro},
pages={463--478},
journal=sicomp,
year=1979,
month=aug,
volume=8,
number=3,
preliminary={STOC::GonnetM1977:113}
}

                          Volume 8, Number 4
                            November 1979

@Article{BitnerW79,
title={Optimal and Near-Optimal Scheduling Algorithms for Batched
Processing in Linear Storage},
author={J. R. Bitner and C. K. Wong},
pages={479--498},
journal=sicomp,
year=1979,
month=nov,
volume=8,
number=4
}

@Article{KannanB79,
title={Polynomial Algorithms for Computing the {Smith} and {Hermite}
Normal Forms of an Integer Matrix},
author={Ravindran Kannan and Achim Bachem},
pages={499--507},
journal=sicomp,
year=1979,
month=nov,
volume=8,
number=4
}

@Article{Priese79,
title={Towards a Precise Characterization of the Complexity of
Universal and Nonuniversal {Turing} Machines},
author={Lutz Priese},
pages={508--523},
journal=sicomp,
year=1979,
month=nov,
volume=8,
number=4
}

@Article{BagchiR79,
title={On {$V$}-Optimal Trees},
author={A. Bagchi and J. K. Roy},
pages={524--541},
journal=sicomp,
year=1979,
month=nov,
volume=8,
number=4
}

@Article{Preparata79,
title={A Note on Locating a Set of Points in a Planar Subdivision},
author={F. P. Preparata},
pages={542--545},
journal=sicomp,
year=1979,
month=nov,
volume=8,
number=4
}

@Article{Donahue79,
title={On the Semantics of ``Data Type''},
author={James Donahue},
pages={546--560},
journal=sicomp,
year=1979,
month=nov,
volume=8,
number=4
}

@Article{Karp79,
title={A Patching Algorithm for the Nonsymmetric Traveling-Salesman
Problem},
author={Richard M. Karp},
pages={561--573},
journal=sicomp,
year=1979,
month=nov,
volume=8,
number=4
}

@Article{KasaiAI79,
title={Classes of Pebble Games and Complete Problems},
author={Takumi Kasai and Akeo Adachi and Shigeki Iwata},
pages={574--586},
journal=sicomp,
year=1979,
month=nov,
volume=8,
number=4
}

@Article{Weyuker79,
title={Translatability and Decidability Questions for Restricted
Classes of Program Schemas},
author={Elaine J. Weyuker},
pages={587--598},
journal=sicomp,
year=1979,
month=nov,
volume=8,
number=4
}

@Article{Maier79,
title={An Efficient Method for Storing Ancestor Information in Trees},
author={David Maier},
pages={599--618},
journal=sicomp,
year=1979,
month=nov,
volume=8,
number=4
}

@Article{KrishnamoorthyD79,
title={Node-Deletion {NP}-Complete Problems},
author={M. S. Krishnamoorthy and Narsingh Deo},
pages={619--625},
journal=sicomp,
year=1979,
month=nov,
volume=8,
number=4
}

@Article{ProbstA79,
title={A Family of Algorithms for Powering Sparse Polynomials},
author={David K. Probst and Vangalur S. Alagar},
pages={626--644},
journal=sicomp,
year=1979,
month=nov,
volume=8,
number=4
}

@Article{Shamir79,
title={A Linear Time Algorithm for Finding Minimum Cutsets in Reducible
Graphs},
author={Adi Shamir},
pages={645--655},
journal=sicomp,
year=1979,
month=nov,
volume=8,
number=4
}

@Article{HikitaN79,
title={Corrigenda: A Completeness Criterion for Spectra},
author={T. Hikita and A. Nozaki},
pages={656},
journal=sicomp,
year=1979,
month=nov,
volume=8,
number=4
}

                          Volume 9, Number 1
                            February 1980

@Article{Tucker80,
title={An Efficient Test for Circular-Arc Graphs},
author={Alan Tucker},
pages={1--24},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{BloomEW80:25,
title={Solutions of the Iteration Equation and Extensions of the Scalar
iteration Operation},
author={Stephen L. Bloom and Calvin C. Elgot and Jesse B. Wright},
pages={25--45},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{KintalaF80,
title={Refining Nondeterminism in Relativized Polynomial-Time Bounded
Computations},
author={Chandra M. R. Kintala and Patrick C. Fischer},
pages={46--53},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{BrentT80,
title={On the Complexity of Composition and Generalized Composition of
Power Series},
author={R. P. Brent and J. F. Traub},
pages={54--66},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{Hennessy80,
title={The Semantics of Call-By-Value and Call-By-Name in a
Nondeterministic Environment},
author={M. C. B. Hennessy},
pages={67--84},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{StockmeyerY80,
title={On the Optimality of Linear Merge},
author={Paul K. Stockmeyer and F. Frances Yao},
pages={85--90},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{ChoS80,
title={Bounds for List Schedules on Uniform Processors},
author={Yookun Cho and Sartaj Sahni},
pages={91--103},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{Statman80,
title={Worst Case Exponential Lower Bounds for Input Resolution with
Paramodulation},
author={R. Statman},
pages={104--110},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{WongE80,
title={An Efficient Method for Weighted Sampling Without Replacement},
author={C. K. Wong and M. C. Easton},
pages={111--113},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{Hartmanis80,
title={On the Succinctness of Different Representations of Languages},
author={J. Hartmanis},
pages={114--120},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{DobkinL80,
title={Addition Chain Methods for the Evaluation of Specific
Polynomials},
author={David Dobkin and Richard J. Lipton},
pages={121--125},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{Hirschberg80,
title={On the Complexity of Searching a Set of Vectors},
author={D. S. Hirschberg},
pages={126--129},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{JoichiWW80,
title={Combinatorial {Gray} Codes},
author={J. T. Joichi and Dennis E. White and S. G. Williamson},
pages={130--141},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{FlajoletR80,
title={A Note on {Gray} Code and Odd-Even Merge},
author={P. Flajolet and Lyle Ramshaw},
pages={142--158},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{Rosen80,
title={Monoids for Rapid Data Flow Analysis},
author={Barry K. Rosen},
pages={159--196},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{Galil80,
title={Finding the Vertex Connectivity of Graphs},
author={Zvi Galil},
pages={197--199},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{LeeW80,
title={Voronoi Diagrams in {$L_1$} ({$L_\infty$}) Metrics with
2-Dimensional Storage Applications},
author={D. T. Lee and C. K. Wong},
pages={200--211},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{Babai80,
title={On the Complexity of Canonical Labeling of Strongly Regular
Graphs},
author={L{\'a}szl{\'o} Babai},
pages={212--216},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

@Article{HehnerH80,
title={Corrigendum. A New Representation of the Rational Numbers for
Fast Easy Arithmetic},
author={E. C. R. Hehner and R. N. S. Horspool},
pages={217},
journal=sicomp,
year=1980,
month=feb,
volume=9,
number=1
}

                          Volume 9, Number 2
                               May 1980

@Article{Shiloach80,
title={A Multi-Terminal Minimum Cut Algorithm for Planar Graphs},
author={Yossi Shiloach},
pages={219--224},
journal=sicomp,
year=1980,
month=may,
volume=9,
number=2
}

@Article{Winograd80,
title={On Multiplication of Polynomials Modulo a Polynomial},
author={S. Winograd},
pages={225--229},
journal=sicomp,
year=1980,
month=may,
volume=9,
number=2
}

@Article{Pippenger80,
title={On the Evaluation of Powers and Monomials},
author={Nicholas Pippenger},
pages={230--250},
journal=sicomp,
year=1980,
month=may,
volume=9,
number=2
}

@Article{Morgera80,
title={Efficient Synthesis and Implementation of Large Discrete
{Fourier} Transformations},
author={Salvatore D. Morgera},
pages={251--272},
journal=sicomp,
year=1980,
month=may,
volume=9,
number=2
}

@Article{Rabin80,
title={Probabilistic Algorithms in Finite Fields},
author={Michael O. Rabin},
pages={273--280},
journal=sicomp,
year=1980,
month=may,
volume=9,
number=2
}

@Article{CorneilK80,
title={A Theoretical Analysis of Various Heuristics for the Graph
Isomorphism Problem},
author={D. G. Corneil and D. G. Kirkpatrick},
pages={281--297},
journal=sicomp,
year=1980,
month=may,
volume=9,
number=2
}

@Article{Hwang80,
title={Optimal Merging of 3 Elements with {$n$} Elements},
author={F. K. Hwang},
pages={298--320},
journal=sicomp,
year=1980,
month=may,
volume=9,
number=2
}

@Article{Pan80,
title={New Fast Algorithms for Matrix Operations},
author={V. Ya. Pan},
pages={321--342},
journal=sicomp,
year=1980,
month=may,
volume=9,
number=2
}

@Article{YaoR80,
title={On the Polyhedral Decision Problem},
author={Andrew C. Yao and Ronald L. Rivest},
pages={343--347},
journal=sicomp,
year=1980,
month=may,
volume=9,
number=2
}

@Article{GurariI80,
title={Path Systems: Constructions, Solutions and Applications},
author={Eitan M. Gurari and Oscar H. Ibarra},
pages={348--374},
journal=sicomp,
year=1980,
month=may,
volume=9,
number=2
}

@Article{Reif80,
title={Code Motion},
author={John H. Reif},
pages={375--395},
journal=sicomp,
year=1980,
month=may,
volume=9,
number=2
}

@Article{HuntCS80,
title={On the Computational Complexity of Program Scheme Equivalence},
author={Hunt III, H. B. and R. L. Constable and S. Sahni},
pages={396--416},
journal=sicomp,
year=1980,
month=may,
volume=9,
number=2
}

@Article{GalilS80,
title={Saving Space in Fast String-Matching},
author={Zvi Galil and Joel I. Seiferas},
pages={417--438},
journal=sicomp,
year=1980,
month=may,
volume=9,
number=2
}

@Article{ProbstA80,
title={Corrigendum: A Family of Algorithms for Powering Sparse
Polynomials},
author={David K. Probst and Vangalur S. Alagar},
pages={439},
journal=sicomp,
year=1980,
month=may,
volume=9,
number=2
}

                          Volume 9, Number 3
                             August 1980

@Article{EhrigR80,
title={The Mathematics of Record Handling},
author={Hartmut Ehrig and Barry K. Rosen},
pages={441--469},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

@Article{Parker80,
title={Conditions for Optimality of the {Huffman} Algorithm},
author={Parker, Jr., D. Stott},
pages={470--489},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

@Article{Schonhage80,
title={Storage Modification Machines},
author={A. Sch{\"o}nhage},
pages={490--508},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

@Article{Rytter80,
title={A Correct Preprocessing Algorithm for {Boyer-Moore}
String-Searching},
author={Wojciech Rytter},
pages={509--512},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

@Article{GilbertLT80,
title={The Pebbling Problem is Complete in Polynomial Space},
author={John R. Gilbert and Thomas Lengauer and Robert Endre Tarjan},
pages={513--524},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

@Article{BloomEW80:525,
title={Vector Iteration in Pointed Iterative Theories},
author={Stephen L. Bloom and Calvin C. Elgot and Jesse B. Wright},
pages={525--540},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

@Article{Jaffe80,
title={Bounds on the Scheduling of Typed Task Systems},
author={Jeffrey M. Jaffe},
pages={541--551},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

@Article{Weide80,
title={Random Graphs and Graph Optimization Problems},
author={Bruce W. Weide},
pages={552--557},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

@Article{LawlerLK80,
title={Generating All Maximal Independent Sets: {NP}-Hardness and
Polynomial-Time Algorithms},
author={E. L. Lawler and J. K. Lenstra and A. H. G. Rinnooy Kan},
pages={558--565},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}
@Article{Yao80,
title={Bounds on Selection Networks},
author={Andrew Chi-Chih Yao},
pages={566--582},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

@Article{GeorgeL80,
title={An Optimal Algorithm for Symbolic Factorization of Symmetric
Matrices},
author={Alan George and Joseph W. H. Liu},
pages={583--593},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

@Article{BrownT80,
title={Design and Analysis of a Data Structure for Representing Sorted
Lists},
author={Mark R. Brown and Robert E. Tarjan},
pages={594--614},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

@Article{LiptonT80,
title={Applications of a Planar Separator Theorem},
author={Richard J. Lipton and Robert Endre Tarjan},
pages={615--627},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

@Article{BabaiES80,
title={Random Graph Isomorphism},
author={L{\'a}szl{\'o} Babai and Paul Erd{\H{o}}s and Stanley M.
Selkow},
pages={628--635},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

@Article{CookR80,
title={Space Lower Bounds for Maze Threadability on Restricted
Machines},
author={Stephen C. Cook and Charles W. Rackoff},
pages={636--652},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

@Article{Tai80,
title={Predictors of Context-Free Grammars},
author={{Kuo-Chung} Tai},
pages={653--664},
journal=sicomp,
year=1980,
month=aug,
volume=9,
number=3
}

                          Volume 9, Number 4
                            November 1980

@Article{AptM80,
title={Completeness with Finite Systems of Intermediate Assertions for
Recursive Program Schemes},
author={Krzysztof R. Apt and Lambert G. L. T. Meertens},
pages={665--671},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4
}

@Article{GuibasO80,
title={A New Proof of the Linearity of the {Boyer-Moore} String
Searching Algorithm},
author={Leo J. Guibas and Andrew M. Odlyzko},
pages={672--682},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4
}

@Article{BloomT80,
title={Compatible Orderings on the Metric Theory of Trees},
author={Stephen L. Bloom and Ralph Tindell},
pages={683--691},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4
}

@Article{BiniLR80,
title={Approximate Solutions for the Bilinear Form Computational
Problem},
author={Dario Bini and Grazia Lotti and Francesco Romani},
pages={692--697},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4
}

@Article{Plaisted80,
title={The Application of Multivariate Polynomials to Inference Rules
and Partial Tests for Unsatisfiability},
author={David A. Plaisted},
pages={698--705},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4
}

@Article{BeyerH80,
title={Constant Time Generation of Rooted Trees},
author={Terry Beyer and Sandra Mitchell Hedetniemi},
pages={706--712},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4
}

@Article{JaJa80,
title={On the Complexity of Bilinear Forms with Commutativity},
author={Joseph Ja'Ja'},
pages={713--728},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4
}

@Article{BookB80,
title={Equality Sets and Complexity Classes},
author={Ronald V. Book and Franz-Josef Brandenburg},
pages={729--743},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4,
xxx-preliminary={ICALP6 (1979)}
}

@Article{NassimiS80,
title={Finding Connected Components and Connected Ones on a
Mesh-Connected Parallel Computer},
author={David Nassimi and Sartaj Sahni},
pages={744--757},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4
}

@Article{SeroussiL80,
title={Factorization of Symmetric Matrices and Trace-Orthogonal Bases
in Finite Fields},
author={Gadiel Seroussi and Abraham Lempel},
pages={758--767},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4
}

@Article{FeldmanN80,
title={A Model and Proof Technique for Message-Based Systems},
author={Jerome A. Feldman and Anil Nigam},
pages={768--784},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4
}

@Article{MajsterR80,
title={Efficient On-Line Construction and Correction of Position
Trees},
author={Mila E. Majster and Angelika Reiser},
pages={785--807},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4
}

@Article{CoffmanGJT80,
title={Performance Bounds for Level-Oriented Two-Dimensional Packing
Algorithms},
author={Coffman, Jr., E. G.  and M. R. Garey and D. S. Johnson and R.
E. Tarjan},
pages={808--826},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4
}

@Article{AspvallS80,
title={A Polynomial Time Algorithm for Solving Systems of Linear
Inequalities with Two Variables per Inequality},
author={Bengt Aspvall and Yossi Shiloach},
pages={827--845},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4
}

@Article{BakerCR80,
title={Orthogonal Packings in Two Dimensions},
author={Brenda S. Baker and Coffman, Jr., E. G. and Ronald L. Rivest},
pages={846--855},
journal=sicomp,
year=1980,
month=nov,
volume=9,
number=4
}

                         Volume 10, Number 1
                            February 1981

@Article{Fredman81,
title={Lower Bounds on the Complexity of Some Optimal Data
Structures},
author={Michael L. Fredman},
pages={1--10},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

@Article{Lubiw81,
title={Some {NP}-Complete Problems Similar to Graph Isomorphism},
author={Anna Lubiw},
pages={11--21},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

@Article{IbarraL81,
title={Characterizations of {Presburger} Functions},
author={Oscar H. Ibarra and Brian S. Leininger},
pages={22--39},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

@Article{EhrenfeuchtRV81,
title={On {ET0L} Systems with Finite Tree-Rank},
author={A. Ehrenfeucht and G. Rozenberg and D. Vermeir},
pages={40--58},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

@Article{RowlandD81,
title={On the Selection of Test Data for Recursive Mathematical
Subroutines},
author={John H. Rowland and Philip J. Davis},
pages={59--72},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

@Article{LeeD81,
title={Generalizion of {Voronoi} Diagrams in the Plane},
author={D. T. Lee and Drysdale, III, R. L.},
pages={73--87},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

@Article{EllisS81,
title={Fast Sorting of {Weyl} Sequences Using Comparisons},
author={Martin H. Ellis and J. Michael Steele},
pages={88--95},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

@Article{BennettG81,
title={Relative to a Random Oracle {$A$}, {$\mathbf{P}^A \ne
\mathbf{NP}^A \ne \mbox{co-\textbf{NP}}^A$}
with Probability 1},
author={Charles H. Bennett and John Gill},
pages={96--113},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

@Article{JonesS81,
title={A Note on the Complexity of General {$D0L$} Membership},
author={Neil D. Jones and Sven Skyum},
pages={114--117},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

@Article{Liu81,
title={On String Pattern Matching: A New Model with a Polynomial Time
Algorithm},
author={{Ken-Chih} Liu},
pages={118--140},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

@Article{Ruskey81,
title={Listing and Counting Subtrees of a Tree},
author={Frank Ruskey},
pages={141--150},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

@Article{Kunde81,
title={Nonpreemptive {LP}-Scheduling on Homogeneous Multiprocessor
Systems},
author={Manfred Kunde},
pages={151--173},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

@Article{Crespi-ReghizziGM81,
title={Operator Precedence Grammars and the Noncounting Property},
author={Stefano Crespi-Reghizzi and Giovanni Guida and Dino
Mandrioli},
pages={174--191},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

@Article{DessoukyD81,
title={Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow
Time},
author={M. I. Dessouky and J. S. Deogun},
pages={192--202},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

@Article{ColbournB81,
title={Linear Time Automorphism Algorithms for Trees, Interval Graphs,
and Planar Graphs},
author={Charles J. Colbourn and Kellogg S. Booth},
pages={203--225},
journal=sicomp,
year=1981,
month=feb,
volume=10,
number=1
}

                         Volume 10, Number 2
                               May 1981

@Article{FlonS81,
title={The Total Correctness of Parallel Programs},
author={Lawrence Flon and Norihisa Suzuki},
pages={227--246},
journal=sicomp,
year=1981,
month=may,
volume=10,
number=2,
preliminary={FOCS::FlonS1978:184}
}

@Article{KatohIM81,
title={An Algorithm for Finding {$K$} Minimum Spanning Trees},
author={N. Katoh and T. Ibaraki and H. Mine},
pages={247--255},
journal=sicomp,
year=1981,
month=may,
volume=10,
number=2
}

@Article{GareyJST81,
title={Scheduling Unit-Time Tasks with Arbitrary Release Times and
Deadlines},
author={M. R. Garey and D. S. Johnson and B. B. Simons and R. E.
Tarjan},
pages={256--269},
journal=sicomp,
year=1981,
month=may,
volume=10,
number=2
}

@Article{FredericksonJ81,
title={Approximation Algorithm Algorithms for Several Graph
Augmentation Problems},
author={Greg N. Frederickson and Joseph Ja'Ja'},
pages={270--283},
journal=sicomp,
year=1981,
month=may,
volume=10,
number=2
}

@Article{BoassonCN81,
title={The Rational Index: A Complexity Measure for Languages},
author={Luc Boasson and Bruno Courcelle and Maurice Nivat},
pages={284--296},
journal=sicomp,
year=1981,
month=may,
volume=10,
number=2
}

@Article{Yannakakis81:297,
title={Edge-Deletion Problems},
author={Mihalis Yannakakis},
pages={297--309},
journal=sicomp,
year=1981,
month=may,
volume=10,
number=2
}

@Article{Yannakakis81:310,
title={Node-Deletion Problems on Bipartite Graphs},
author={M. Yannakakis},
pages={310--327},
journal=sicomp,
year=1981,
month=may,
volume=10,
number=2
}

@Article{MegiddoTZC81,
title={An {$O(n \log^2 n)$} Algorithm for the {$k$}th Longest Path in
a Tree with Applications to Location Problems},
author={N. Megiddo and A. Tamir and E. Zemel and R. Chandrasekaran},
pages={328--337},
journal=sicomp,
year=1981,
month=may,
volume=10,
number=2
}

@Article{Lueker81,
title={Optimization Problems on Graphs with Independent Random Edge
Weights},
author={George S. Lueker},
pages={338--351},
journal=sicomp,
year=1981,
month=may,
volume=10,
number=2,
preliminary={STOC::Lueker1978:13}
}

@Article{BeeriMSU81,
title={Equivalence of Relational Database Schemes},
author={Catriel Beeri and Alberto O. Mendelzon and Yehoshua Sagiv and
Jeffrey D. Ullman},
pages={352--370},
journal=sicomp,
year=1981,
month=may,
volume=10,
number=2,
preliminary={STOC::BeeriMSU1979:319}
}

@Article{Schnorr81,
title={An Extension of {Strassen's} Degree Bound},
author={C. P. Schnorr},
pages={371--382},
journal=sicomp,
year=1981,
month=may,
volume=10,
number=2
}

@Article{HartmanisM81,
title={Languages Simultaneously Complete for One-Way and Two-Way
Log-Tape Automata},
author={J. Hartmanis and S. Mahaney},
pages={383--390},
journal=sicomp,
year=1981,
month=may,
volume=10,
number=2
}

@Article{Proskurowski81,
title={Recursive Graphs, Recursive Labelings and Shortest Paths},
author={Andrzej Proskurowski},
pages={391--397},
journal=sicomp,
year=1981,
month=may,
volume=10,
number=2
}

@Article{Yao81,
title={An Analysis of a Memory Allocation Scheme for Implementing
Stacks},
author={Andrew C. Yao},
pages={398--403},
journal=sicomp,
year=1981,
month=may,
volume=10,
number=2
}

                         Volume 10, Number 3
                             August 1981

@Article{AhoSSU81,
title={Inferring a Tree from Lowest Common Ancestors with an
Application to the Optimization of Relational Expressions},
author={A. V. Aho and Y. Sagiv and T. G. Szymanski and J. D. Ullman},
pages={405--421},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{Gotlieb81,
title={Optimal Multi-Way Search Trees},
author={L. Gotlieb},
pages={422--433},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{Schonhage81,
title={Partial and Total Matrix Multiplication},
author={A. Sch{\"o}nhage},
pages={434--455},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{SchroeppelS81,
title={A {$T = O(2^{n/2})$}, {$S = O(2^{n/4})$} Algorithm for Certain
{NP}-Complete Problems},
author={Richard Schroeppel and Adi Shamir},
pages={456--464},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{HaggkvistH81,
title={Parallel Sorting with Constant Time for Comparisons},
author={Roland H{\"a}ggkvist and Pavol Hell},
pages={465--472},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{Preparata81,
title={A New Approach to Planar Point Location},
author={Franco P. Preparata},
pages={473--482},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{MaurerSW81,
title={Uniform Interpretations of Grammar Forms},
author={H. A. Maurer and A. Salomaa and D. Wood},
pages={483--502},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{Mayoh81,
title={Attribute Grammars and Mathematical Semantics},
author={Brian H. Mayoh},
pages={503--518},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{PnueliS81,
title={Automatic Programming of Finite State Linear Programs},
author={Amir Pnueli and Giora Slutzki},
pages={519--535},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{EhrenfeuchtPR81,
title={Pumping Lemmas for Regular Sets},
author={A. Ehrenfeucht and R. Parikh and G. Rozenberg},
pages={536--541},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{Papadimitriou81,
title={Worst-Case and Probabilistic Analysis of a Geometric Location
Problem},
author={Christos H. Papadimitriou},
pages={542--557},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{BitnerH81,
title={Key Comparison Optimal 2-3 Trees with Maximum Utilization},
author={James R. Bitner and {Shou-Hsuan} Huang},
pages={558--570},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{Golan81,
title={Performance Bounds for Orthogonal Oriented Two-Dimensional
Packing Algorithms},
author={Igal Golan},
pages={571--582},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{BrownP81,
title={An Average Time Analysis of Backtracking},
author={Cynthia A. Brown and Purdom, Jr., Paul Walton},
pages={583--593},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{TouegU81,
title={Deadlock-Free Packet Switching Networks},
author={Sam Toueg and Jeffrey D. Ullman},
pages={594--611},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3,
preliminary={STOC::TouegU1979:89}
}

@Article{Cook81,
title={Corrigendum: Soundness and Completeness of an Axiom System for
Program Verification},
author={Stephen A. Cook},
pages={612},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{GonnetMS81,
title={Exegesis of Self-Organizing Linear Search},
author={Gaston H. Gonnet and J. Ian Munro and Hendra Suwanda},
pages={613--637},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{DowneyLS81,
title={Computing Sequences with Addition Chains},
author={Peter Downey and Benton Leong and Ravi Sethi},
pages={638--646},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

@Article{BeeriH81,
title={Preserving Functional Dependencies},
author={C. Beeri and P. Honeyman},
pages={647--656},
journal=sicomp,
year=1981,
month=aug,
volume=10,
number=3
}

                         Volume 10, Number 4
                            November 1981

@Article{DekelNS81,
title={Parallel Matrix and Graph Algorithms},
author={Eliezer Dekel and David Nassimi and Sartaj Sahni},
pages={657--675},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

@Article{ReingoldT81,
title={On a Greedy Heuristic for Complete Matching},
author={Edward M. Reingold and Robert E. Tarjan},
pages={676--681},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

@Article{SavageJ81,
title={Fast, Efficient Parallel Algorithms for Some Graph Problems},
author={Carla Savage and Joseph Ja'Ja'},
pages={682--691},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

@Article{SlaterCH81,
title={Information Dissemination in Trees},
author={P. J. Slater and E. J. Cockayne and S. T. Hedetniemi},
pages={692--701},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

@Article{TouegS81,
title={Some Complexity Results in the Design of Deadlock-Free Packet
Switching Networks},
author={Sam Toueg and Kenneth Steiglitz},
pages={702--712},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

@Article{Holyer81:713,
title={The {NP}-Completeness of Some Edge-Partition Problems},
author={Ian Holyer},
pages={713--717},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

@Article{Holyer81:718,
title={The {NP}-Completeness of Edge-Coloring},
author={Ian Holyer},
pages={718--720},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

@Article{Bolour81,
title={Optimal Retrieval Algorithms for Small Region Queries},
author={Azad Bolour},
pages={721--741},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

@Article{RackoffS81,
title={Limitations on Separating Nondeterministic Complexity Classes},
author={Charles W. Rackoff and Joel I. Seiferas},
pages={742--745},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

@Article{ItaiLPR81,
title={Covering Graphs by Simple Circuits},
author={Alon Itai and Richard J. Lipton and Christos H. Papadimitriou
and M. Rodeh},
pages={746--750},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

@Article{BernsteinG81,
title={Power of Natural Semijoins},
author={Philip A. Bernstein and Nathan Goodman},
pages={751--771},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

@Article{RaihaU81,
title={Minimizing the Number of Evaluation Passes for Attribute
Grammars},
author={{Kari-Jouko} R{\"a}ih{\"a} and Esko Ukkonen},
pages={772--786},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

@Article{KoM81,
title={Completeness, Approximation and Density},
author={{Ker-I} Ko and Daniel Moore},
pages={787--796},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

@Article{Syslo81,
title={An Efficient Cycle Vector Space Algorithm for Listing All Cycles
of a Planar Graph},
author={Maciej M. Sys{\l}o},
pages={797--808},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

@Article{BarakD81,
title={Distributed Processor Scheduling and User Countermeasures},
author={Amnon B. Barak and Peter J. Downey},
pages={809--819},
journal=sicomp,
year=1981,
month=nov,
volume=10,
number=4
}

                         Volume 11, Number 1
                            February 1982

@Article{IbarraL82:1,
title={Straight-Line Programs with One Input Variable},
author={Oscar H. Ibarra and Brian S. Leininger},
pages={1--14},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

@Article{IbarraL82:15,
title={The Complexity of the Equivalence Problem for Simple Loop-Free
Programs},
author={Oscar H. Ibarra and Brian S. Leininger},
pages={15--27},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

@Article{HaltonT82,
title={A Fast Algorithm for the {Euclidean} Traveling Salesman
Problem, Optimal with Probability One},
author={J. H. Halton and R. Terada},
pages={28--46},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

@Article{Rosenthal82,
title={Dynamic Programming is Optimal for Nonserial Optimization
Problems},
author={Arnon Rosenthal},
pages={47--59},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

@Article{CoffmanH82,
title={On the Expected Performance of Scanning Disks},
author={Coffman, Jr., E. G. and Micha Hofri},
pages={60--70},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

@Article{BurtonS82,
title={A Hidden-Line Algorithm for Hyperspace},
author={Robert P. Burton and David R. Smith},
pages={71--80},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

@Article{ReifT82,
title={Symbolic Program Analysis in Almost-Linear Time},
author={John H. Reif and Robert E. Tarjan},
pages={81--93},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

@Article{CoppersmithPW82,
title={Analysis of a General Mass Storage System},
author={D. Coppersmith and D. S. Parker and C. K. Wong},
pages={94--116},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

@Article{GabowK82,
title={Algorithms for Edge Coloring Bipartite Graphs and Multigraphs},
author={Harold N. Gabow and Oded Kariv},
pages={117--129},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

@Article{Tompa82,
title={Two Familiar Transitive Closure Algorithms Which Admit No
Polynomial Time, Sublinear Space Implementations},
author={Martin Tompa},
pages={130--137},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

@Article{Kou82,
title={Minimum Variance {Huffman} Codes},
author={Lawrence T. Kou},
pages={138--148},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

@Article{Willard82,
title={Polygon Retrieval},
author={Dan E. Willard},
pages={149--165},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

@Article{FriedmanG82,
title={A Polynomial Time Algorithm for Deciding the Equivalence
Problem for 2-Tape Deterministic Finite State Acceptors},
author={E. P. Friedman and S. A. Greibach},
pages={166--183},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

@Article{JensenK82,
title={Complexity of Matroid Property Algorithms},
author={Per M. Jensen and Bernhard Korte},
pages={184--190},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

@Article{BoothJ82,
title={Dominating Sets in Chordal Graphs},
author={Kellogg S. Booth and J. Howard Johnson},
pages={191--199},
journal=sicomp,
year=1982,
month=feb,
volume=11,
number=1
}

                         Volume 11, Number 2
                               May 1982

@Article{LevyM82,
title={Continuous Data Types},
author={M. R. Levy and T. S. E. Maibaum},
pages={201--216},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

@Article{ComerO82,
title={Geometric Problems with Application to Hashing},
author={Douglas Comer Comer and Michael J. O'Donnell},
pages={217--226},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

@Article{HongR82,
title={Graphs that are Almost Binary Trees},
author={{Jia-Wei} Hong and Arnold L. Rosenberg},
pages={227--242},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

@Article{Bitner82,
title={An Asymptotically Optimal Algorithm for the Dutch National Flag
Problem},
author={James R. Bitner},
pages={243--262},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

@Article{Romani82,
title={Some Properties of Disjoint Sums of Tensors Related to Matrix
Multiplication},
author={Francesco Romani},
pages={263--267},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

@Article{KeohaneCH82,
title={On Transforming Control Structures},
author={John Keohane and John C. Cherniavsky and Peter B. Henderson},
pages={268--286},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

@Article{BorodinC82,
title={A Time-Space Tradeoff for Sorting on a General Sequential Model
of Computation},
author={A. Borodin and S. Cook},
pages={287--297},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

@Article{ValdesTL82,
title={The Recognition of Series Parallel Digraphs},
author={Jacobo Valdes and Robert E. Tarjan and Eugene L. Lawler},
pages={298--313},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2,
preliminary={STOC::ValdesTL1979:1}
}

@Article{JaJaS82,
title={Parallel Algorithms in Graph Theory: Planarity Testing},
author={Joseph Ja'Ja' and Janos Simon},
pages={314--328},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

@Article{Lichtenstein82,
title={Planar Formulae and their Uses},
author={David Lichtenstein},
pages={329--343},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

@Article{Moran82,
title={On the Accepting Density Hierarchy in {NP}},
author={Shlomo Moran},
pages={344--349},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

@Article{Valiant82,
title={A Scheme for Fast Parallel Communication},
author={L. G. Valiant},
pages={350--361},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

@Article{HuS82,
title={Computation of Matrix Chain Products. {Part I}},
author={T. C. Hu and M. T. Shing},
pages={362--373},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

@Article{Lehmann82,
title={On Primality Tests},
author={Daniel J. Lehmann},
pages={374--375},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

@Article{SedgewickSY82,
title={The Complexity of Finding Cycles in Periodic Functions},
author={Robert Sedgewick and Thomas G. Szymanski and Andrew C. Yao},
pages={376--390},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

@Article{Yannakakis82,
title={Freedom from Deadlock of Safe Locking Policies},
author={Mihalis Yannakakis},
pages={391--408},
journal=sicomp,
year=1982,
month=may,
volume=11,
number=2
}

                         Volume 11, Number 3
                             August 1982

@Article{LinialT82,
title={The Counterfeit Coin Problem Revisited},
author={Nathan Linial and Michael Tarsi},
pages={409--415},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{FischerMP82,
title={{$\Omega(n \log n)$} Lower Bounds on Length of {Boolean}
Formulas},
author={Michael J. Fischer and Albert R. Meyer and Michael S.
Paterson},
pages={416--427},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3,
preliminary={STOC::FischerMP1975:37}
}

@Article{YaoY82,
title={On the Average-Case Complexity of Selecting the kth Best},
author={Andrew C. Yao and F. Frances Yao},
pages={428--447},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{Gurari82,
title={The Equivalence Problem for Deterministic Two-Way Sequential
Transducers is Decidable},
author={Eitan M. Gurari},
pages={448--452},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{HofriT82,
title={The Working Set Size Distribution for the {Markov} Chain Model
of Program Behavior},
author={M. Hofri and P. Tzelnic},
pages={453--466},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{Coppersmith82,
title={Rapid Multiplication of Rectangular Matrices},
author={D. Coppersmith},
pages={467--471},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{CoppersmithW82,
title={On the Asymptotic Complexity of Matrix Multiplication},
author={D. Coppersmith and S. Winograd},
pages={472--492},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{Rosen82,
title={A Lubricant for Data Flow Analysis},
author={Barry K. Rosen},
pages={493--511},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{NakajimaHL82,
title={Complexity Results for Scheduling Tasks in Fixed Intervals on
Two Types of Machines},
author={K. Nakajima and S. L. Hakimi and J. K. Lenstra},
pages={512--520},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{BanaschewskiN82,
title={Completions of Partially Ordered Sets},
author={Bernhard Banaschewski and Evelyn Nelson},
pages={521--528},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{Gouyou-Beauchamps82,
title={The {Hamiltonian} Circuit Problem is Polynomial for 4-Connected
Planar Graphs},
author={D. Gouyou-Beauchamps},
pages={529--539},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{ColeH82,
title={On Edge Coloring Bipartite Graphs},
author={Richard Cole and John Hopcroft},
pages={540--546},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{DavisW82,
title={Computational Power in Query Languages},
author={Henry W. Davis and Leon E. Winslow},
pages={547--554},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{Hochbaum82,
title={Approximation Algorithms for the Set Covering and Vertex Cover
Problems},
author={Dorit S. Hochbaum},
pages={555--556},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{TenenbaumN82,
title={Two Spectra of Self-Organizing Sequential Search Algorithms},
author={Aaron M. Tenenbaum and Richard M. Nemes},
pages={557--566},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{Atallah82,
title={Finding the Cyclic Index of an Irreducible, Nonnegative Matrix},
author={Mikhail J. Atallah},
pages={567--570},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{BookWX82,
title={Relativizing Time, Space, and Time-Space},
author={Ronald V. Book and Christopher B. Wilson and Xu Mei-Rui},
pages={571--581},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{GuptaLW82,
title={Ranking and Unranking of 2-3 Trees},
author={Udai Gupta and D. T. Lee and C. K. Wong},
pages={582--590},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

@Article{Hong82,
title={On Some Deterministic Space Complexity Problems},
author={{Jia-Wei} Hong},
pages={591--601},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3,
preliminary={STOC::Hong1980:310}
}

@Article{GligorM82,
title={Finding Augmented-Set Bases},
author={Virgil Gligor and David Maier},
pages={602--609},
journal=sicomp,
year=1982,
month=aug,
volume=11,
number=3
}

                         Volume 11, Number 4
                            November 1982

@Article{Noshita82,
title={Predicting the Number of Distinct Elements in a Multiset},
author={Koheil Noshita},
pages={611--619},
journal=sicomp,
year=1982,
month=nov,
volume=11,
number=4
}

@Article{KarpP82,
title={On Linear Characterizations of Combinatorial Optimization
Problems},
author={Richard M. Karp and Christos H. Papadimitriou},
pages={620--632},
journal=sicomp,
year=1982,
month=nov,
volume=11,
number=4
}

@Article{GonzalezJ82,
title={Evaluation of Arithmetic Expressions with Algebraic
Identities},
author={Teofilo Gonzalez and Joseph Ja'Ja'},
pages={633--662},
journal=sicomp,
year=1982,
month=nov,
volume=11,
number=4
}

@Article{ChibaNS82,
title={An Approximation Algorithm for the Maximum Independent Set
Problem on Planar Graphs},
author={Norishige Chiba and Takao Nishizeki and Nobuji Saito},
pages={663--675},
journal=sicomp,
year=1982,
month=nov,
volume=11,
number=4
}

@Article{ItaiPS82,
title={Hamilton Paths in Grid Graphs},
author={Alon Itai and Christos H. Papadimitriou and Jayme Luiz
Szwarcfiter},
pages={676--686},
journal=sicomp,
year=1982,
month=nov,
volume=11,
number=4
}

@Article{ChouC82,
title={Algorithms for the Solution of Systems of Linear {Diophantine}
Equations},
author={{Tsu-Wu} J. Chou and George E. Collins},
pages={687--708},
journal=sicomp,
year=1982,
month=nov,
volume=11,
number=4
}

@Article{AchugbueC82,
title={Scheduling the Open Shop to Minimize Mean Flow Time},
author={James O. Achugbue and Francis Y. Chin},
pages={709--720},
journal=sicomp,
year=1982,
month=nov,
volume=11,
number=4
}

@Article{Yao82,
title={On Constructing Minimum Spanning Trees in {$k$}-Dimensional
Spaces and Related Problems},
author={Andrew Chi-Chih Yao},
pages={721--736},
journal=sicomp,
year=1982,
month=nov,
volume=11,
number=4
}

@Article{BrentG82,
title={Some Area-Time Tradeoffs for {VLSI}},
author={Richard P. Brent and Leslie M. Goldschlager},
pages={737--747},
journal=sicomp,
year=1982,
month=nov,
volume=11,
number=4
}

@Article{Mehlhorn82,
title={A Partial Analysis of Height-Balanced Trees Under Random
Insertions and Deletions},
author={Kurt Mehlhorn},
pages={748--760},
journal=sicomp,
year=1982,
month=nov,
volume=11,
number=4
}

@Article{SmythP82,
title={The Category-Theoretic Solution of Recursive Domain Equations},
author={M. B. Smyth and G. D. Plotkin},
pages={761--783},
journal=sicomp,
year=1982,
month=nov,
volume=11,
number=4
}

@Article{Ronse82,
title={Optimization of Cost and Delay in Cellular Permutation
Networks},
author={C. Ronse},
pages={784--788},
journal=sicomp,
year=1982,
month=nov,
volume=11,
number=4
}

@Article{AtkinL82,
title={On a Primality Test of {Solovay} and {Strassen}},
author={A. O. L. Atkin and R. G. Larson},
pages={789--791},
journal=sicomp,
year=1982,
month=nov,
volume=11,
number=4
}

                         Volume 12, Number 1
                            February 1983

@Article{Strassen83,
title={The Computational Complexity of Continued Fractions},
author={V. Strassen},
pages={1--27},
journal=sicomp,
year=1983,
month=feb,
volume=12,
number=1
}

@Article{Kirkpatrick83,
title={Optimal Search in Planar Subdivisions},
author={David Kirkpatrick},
pages={28--35},
journal=sicomp,
year=1983,
month=feb,
volume=12,
number=1
}

@Article{FaginMUY83,
title={Tools for Template Dependencies},
author={Ronald Fagin and David Maier and Jeffrey D. Ullman and Mihalis
Yannakakis},
pages={36--59},
journal=sicomp,
year=1983,
month=feb,
volume=12,
number=1
}

@Article{FriesenL83,
title={Bounds for Multifit Scheduling on Uniform Processors},
author={D. K. Friesen and M. A. Langston},
pages={60--70},
journal=sicomp,
year=1983,
month=feb,
volume=12,
number=1
}

@Article{Reif83,
title={Minimum {$s$}-{$t$} Cut of a Planar Undirected Network in {$O(n
\log^2(n))$} Time},
author={John H. Reif},
pages={71--81},
journal=sicomp,
year=1983,
month=feb,
volume=12,
number=1
}

@Article{Peterson83,
title={A Technique for Establishing Completeness Results in Theorem
Proving with Equality},
author={Gerald E. Peterson},
pages={82--100},
journal=sicomp,
year=1983,
month=feb,
volume=12,
number=1
}

@Article{Groote83,
title={Characterization of Division Algebras of Minimal Rank and the
Structure of their Algorithm Varieties},
author={Hans F. de Groote},
pages={101--117},
journal=sicomp,
year=1983,
month=feb,
volume=12,
number=1
}

@Article{SupowitR83,
title={Divide and Conquer Heuristics for Minimum Weighted {Euclidean}
Matching},
author={Kenneth J. Supowit and Edward M. Reingold},
pages={118--143},
journal=sicomp,
year=1983,
month=feb,
volume=12,
number=1,
xxx-preliminary={STOC::SupowitPR1980:398}
}

@Article{SupowitRP83,
title={The Traveling Salesman Problem and Minimum Matching in the Unit
Square},
author={Kenneth J. Supowit and Edward M. Reingold and David A.
Plaisted},
pages={144--156},
journal=sicomp,
year=1983,
month=feb,
volume=12,
number=1,
xxx-preliminary={STOC::SupowitPR1980:398}
}

@Article{Gusfield83,
title={Simple Construction for Multi-Terminal Network Flow Synthesis},
author={Dan Gusfield},
pages={157--165},
journal=sicomp,
year=1983,
month=feb,
volume=12,
number=1
}

@Article{FleckL83,
title={Formal Semantics and Abstract Properties of String Pattern
Operations and Extended Formal Language Description Mechanisms},
author={A. C. Fleck and R. S. Limaye},
pages={166--188},
journal=sicomp,
year=1983,
month=feb,
volume=12,
number=1
}

@Article{GuttagKM83,
title={On Proving Uniform Termination and Restricted Termination of
Rewriting Systems},
author={J. V. Guttag and D. Kapur and D. R. Musser},
pages={189--214},
journal=sicomp,
year=1983,
month=feb,
volume=12,
number=1
}

                         Volume 12, Number 2
                               May 1983

@Article{Papadimitriou83,
title={Concurrency Control by Locking},
author={Christos H. Papadimitriou},
pages={215--226},
journal=sicomp,
year=1983,
month=may,
volume=12,
number=2
}

@Article{CoffmanGJ83,
title={Dynamic Bin Packing},
author={Coffman, Jr., E. G.  and M. R. Garey and D. S. Johnson},
pages={227--258},
journal=sicomp,
year=1983,
month=may,
volume=12,
number=2
}

@Article{FischerT83,
title={Whether a Set of Multivalued Dependencies Implies a Join
Dependency is {NP}-Hard},
author={Patrick C. Fischer and {Don-Min} Tsou},
pages={259--266},
journal=sicomp,
year=1983,
month=may,
volume=12,
number=2
}

@Article{Cohn83,
title={The Equivalence of Two Semantic Definitions: A Case Study in
{LCF}},
author={Avra Cohn},
pages={267--285},
journal=sicomp,
year=1983,
month=may,
volume=12,
number=2
}

@Article{Loos83,
title={Computing Rational Zeros of Integral Polynomials by {$p$}-adic
Expansion},
author={R{\"u}diger Loos},
pages={286--293},
journal=sicomp,
year=1983,
month=may,
volume=12,
number=2
}

@Article{Simons83,
title={Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary
Release Times and Deadlines},
author={Barbara Simons},
pages={294--299},
journal=sicomp,
year=1983,
month=may,
volume=12,
number=2
}

@Article{ChoffrutC83,
title={Properties of Finite and Pushdown Transducers},
author={Christian Choffrut and Culik II, Karel},
pages={300--315},
journal=sicomp,
year=1983,
month=may,
volume=12,
number=2
}

@Article{Sagiv83,
title={Quadratic Algorithms for Minimizing Joins in Restricted
Relational Expressions},
author={Yehoshua Sagiv},
pages={316--328},
journal=sicomp,
year=1983,
month=may,
volume=12,
number=2
}

@Article{LifschitzP83,
title={The Worst and the Most Probable Performance of a Class of
Set-Covering Algorithms},
author={V. Lifschitz and B. Pittel},
pages={329--346},
journal=sicomp,
year=1983,
month=may,
volume=12,
number=2
}

@Article{Megiddo83:347,
title={Towards a Genuinely Polynomial Algorithm for Linear
Programming},
author={Nimrod Megiddo},
pages={347--353},
journal=sicomp,
year=1983,
month=may,
volume=12,
number=2
}


@Article{Hanbrusch83,
title={{VLSI} Algorithms for the Connected Component Problem},
author={Susanne E. Hanbrusch},
pages={354--365},
journal=sicomp,
year=1983,
month=may,
volume=12,
number=2
}

@Article{BergstraT83,
title={Initial and Final Algebra Semantics for Data Type
Specifications: Two Characterization Theorems},
author={J. A. Bergstra and J. V. Tucker},
pages={366--387},
journal=sicomp,
year=1983,
month=may,
volume=12,
number=2
}

@Article{IbarraM83,
title={Some Time-Space Tradeoff Results Concerning Single-Tape and
Offline {TM's}},
author={Oscar H. Ibarra and Shlomo Moran},
pages={388--394},
journal=sicomp,
year=1983,
month=may,
volume=12,
number=2
}

@Article{Lauer83,
title={Generalized {$p$}-adic Constructions},
author={Markus Lauer},
pages={395--410},
journal=sicomp,
year=1983,
month=may,
volume=12,
number=2
}

                         Volume 12, Number 3
                             August 1983

@Article{Yesha83,
title={On Certain Polynomial-Time Truth-Table Reducibilities of
Complete Sets to Sparse Sets},
author={Yaacov Yesha},
pages={411--425},
journal=sicomp,
year=1983,
month=aug,
volume=12,
number=3
}

@Article{ChoyW83,
title={Construction of Optimal {$\alpha$}-{$\beta$} Leaf Trees with
Applications to Prefix Code and Information Retrieval},
author={David M. Choy and C. K. Wong},
pages={426--446},
journal=sicomp,
year=1983,
month=aug,
volume=12,
number=3
}

@Article{LeisersonP83,
title={Optimal Placement for River Routing},
author={Charles E. Leiserson and Ron Y. Pinter},
pages={447--462},
journal=sicomp,
year=1983,
month=aug,
volume=12,
number=3
}

@Article{Loui83,
title={Optimal Dynamic Embedding of Trees into Arrays},
author={Michael C. Loui},
pages={463--472},
journal=sicomp,
year=1983,
month=aug,
volume=12,
number=3
}

@Article{KaltofenMS83,
title={A Generalized Class of Polynomials that are Hard to Factor},
author={Erich Kaltofen and David R. Musser and B. David Saunders},
pages={473--483},
journal=sicomp,
year=1983,
month=aug,
volume=12,
number=3
}

@Article{GoodmanP83,
title={Multidimensional Sorting},
author={Jacob E. Goodman and Richard Pollack},
pages={484--507},
journal=sicomp,
year=1983,
month=aug,
volume=12,
number=3
}

@Article{BakerS83,
title={Shelf Algorithms for Two-Dimensional Packing Problems},
author={Brenda S. Baker and Jerald S. Schwarz},
pages={508--525},
journal=sicomp,
year=1983,
month=aug,
volume=12,
number=3
}

@Article{RowlandS83,
title={On the Selection of Test Data for Vector-Valued Recursive
Subroutines},
author={John H. Rowland and Leslie E. Shader},
pages={526--538},
journal=sicomp,
year=1983,
month=aug,
volume=12,
number=3
}

@Article{YamadaI83,
title={One Step Transformation of Periodic Sequences by Cellular
Automata},
author={Hisao Yamada and Masatosi Imori},
pages={539--550},
journal=sicomp,
year=1983,
month=aug,
volume=12,
number=3
}

@Article{FennerL83,
title={Tree Traversal Related Algorithms for Generating Integer
Partitions},
author={Trevor I. Fenner and Georghios Loizou},
pages={551--564},
journal=sicomp,
year=1983,
month=aug,
volume=12,
number=3
}

@Article{SelmanXB83,
title={Positive Relativizations of Complexity Classes},
author={Alan L. Selman and Xu Mei-Rui and Ronald V. Book},
pages={565--579},
journal=sicomp,
year=1983,
month=aug,
volume=12,
number=3
}

@Article{Ukkonen83,
title={Two Results on Polynomial Time Truth-Table Reductions to Sparse
Sets},
author={Esko Ukkonen},
pages={580--587},
journal=sicomp,
year=1983,
month=aug,
volume=12,
number=3
}

@Article{Bloniarz83,
title={A Shortest-Path Algorithm with Expected Time {$O(n \log n
\log^* n)$}},
author={Peter A. Bloniarz},
pages={588--600},
journal=sicomp,
year=1983,
month=aug,
volume=12,
number=3
}

@Article{KirkpatrickH83,
title={On the Complexity of General Graph Factor Problems},
author={D. G. Kirkpatrick and P. Hell},
pages={601--609},
journal=sicomp,
year=1983,
month=aug,
volume=12,
number=3,
preliminary={STOC::KirkpatrickH1978:240}
}

                         Volume 12, Number 4
                            November 1983

@Article{AtkinsonL83,
title={The Ranks of {$m \times n \times (mn-2)$} Tensors},
author={M. D. Atkinson and S. Lloyd},
pages={611--615},
journal=sicomp,
year=1983,
month=nov,
volume=12,
number=4
}

@Article{JohnsonK83,
title={Optimizing Conjunctive Queries that Contain Untyped Variables},
author={D. S. Johnson and A. Klug},
pages={616--640},
journal=sicomp,
year=1983,
month=nov,
volume=12,
number=4,
preliminary={FOCS::JohnsonK1981:203}
}

@Article{ValiantSBR83,
title={Fast Parallel Computation of Polynomials Using Few Processors},
author={L. G. Valiant and S. Skyum and S. Berkowitz and C. Rackoff},
pages={641--644},
journal=sicomp,
year=1983,
month=nov,
volume=12,
number=4
}

@Article{HickeyC83,
title={Uniform Random Generation of Strings in a Context-Free
Language},
author={Timothy Hickey and Jacques Cohen},
pages={645--655},
journal=sicomp,
year=1983,
month=nov,
volume=12,
number=4
}

@Article{DolevS83,
title={Authenticated Algorithms for {Byzantine} Agreement},
author={D. Dolev and H. R. Strong},
pages={656--666},
journal=sicomp,
year=1983,
month=nov,
volume=12,
number=4
}

@Article{ChenV83,
title={Analysis of Early-Insertion Standard Coalesced Hashing},
author={{Wen-Chin} Chen and Jeffrey Scott Vitter},
pages={667--676},
journal=sicomp,
year=1983,
month=nov,
volume=12,
number=4
}

@Article{BloomT83,
title={Varieties of ``If-Then-Else''},
author={Stephen L. Bloom and Ralph Tindell},
pages={677--707},
journal=sicomp,
year=1983,
month=nov,
volume=12,
number=4
}

@Article{ChanI83,
title={On the Space and Time Complexity of Functions Computable by
Simple Programs},
author={{Tat-Hung} Chan and Oscar H. Ibarra},
pages={708--716},
journal=sicomp,
year=1983,
month=nov,
volume=12,
number=4
}

@Article{PurdomB83,
title={An Analysis of Backtracking with Search Rearrangement},
author={Purdom, Jr., Paul Walton and Cynthia A. Brown},
pages={717--733},
journal=sicomp,
year=1983,
month=nov,
volume=12,
number=4
}

@Article{Pfaltz83,
title={Convex Clusters in a Discrete m-Dimensional Space},
author={John L. Pfaltz},
pages={734--750},
journal=sicomp,
year=1983,
month=nov,
volume=12,
number=4
}

@Article{MegiddoT83,
title={New Results on the Complexity of {$p$}-Center Problems},
author={Nimrod Megiddo and Arie Tamir},
pages={751--758},
journal=sicomp,
year=1983,
month=nov,
volume=12,
number=4
}

@Article{Megiddo83:759,
title={Linear-Time Algorithms for Linear Programming in {$R^3$} and
Related Problems},
author={Nimrod Megiddo},
pages={759--776},
journal=sicomp,
year=1983,
month=nov,
volume=12,
number=4
}

@Article{ProvanB83,
title={The Complexity of Counting Cuts and of Computing the
Probability that a Graph is Connected},
author={J. Scott Provan and Michael O. Ball},
pages={777--788},
journal=sicomp,
year=1983,
month=nov,
volume=12,
number=4
}

@Article{MitraM83,
title={Asymptotic Expansions of Moments of the Waiting Time in a
Shared-Processor of an Interactive System},
author={Debasis Mitra and J. A. Morrison},
pages={789--802},
journal=sicomp,
year=1983,
month=nov,
volume=12,
number=4
}

                         Volume 13, Number 1
                            February 1984

@Article{Bruin84,
title={On the Existence of {Cook} Semantics},
author={Arie de Bruin},
pages={1--13},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1
}

@Article{FredericksonJ84,
title={Generalized Selection and Ranking: Sorted Matrices},
author={Greg N. Frederickson and Donald B. Johnson},
pages={14--30},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1
}

@Article{Dyer84,
title={Linear Time Algorithms for Two- and Three-Variable Linear
Programs},
author={M. E. Dyer},
pages={31--45},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1
}

@Article{Reif84,
title={On Synchronous Parallel Computations with Independent
Probabilistic Choice},
author={John H. Reif},
pages={46--56},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1
}

@Article{Pullman84,
title={Clique Covering of Graphs {IV.} {Algorithms}},
author={Normal J. Pullman},
pages={57--75},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1
}

@Article{BeeriV84,
title={Formal Systems for Tuple and Equality Generating Dependencies},
author={C. Beeri and M. Y. Vardi},
pages={76--98},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1
}

@Article{CosmadakisP84,
title={The Traveling Salesman Problem with Many Visits to Few Cities},
author={Stavros S. Cosmadakis and Christos H. Papadimitriou},
pages={99--108},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1
}

@Article{ManberT84,
title={The Effect of Number of {Hamiltonian} Paths on the Complexity
of a Vertex-Coloring Problem},
author={Udi Manber and Martin Tompa},
pages={109--115},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1
}

@Article{ChiuBH84,
title={Optimizing Chain Queries in a Distributed Database System},
author={{Dah-Ming} Chiu and Philip A. Bernstein and {Yu-Chi} Ho},
pages={116--134},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1
}

@Article{LadnerLS84,
title={Alternating Pushdown and Stack Automata},
author={Richard E. Ladner and Richard J. Lipton and Larry J.
Stockmeyer},
pages={135--155},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1,
preliminary={FOCS::LadnerLS1978:92}
}

@Article{Klawe84,
title={Limitations on Explicit Constructions of Expanding Graphs},
author={Maria Klawe},
pages={156--166},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1
}

@Article{Ramanan84,
title={Pushdown Permuter Characterization Theorem},
author={Prakash V. Ramanan},
pages={167--169},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1
}

@Article{Friesen84,
title={Tighter Bounds for the Multifit Processor Scheduling
Algorithm},
author={Donald K. Friesen},
pages={170--181},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1
}

@Article{MegiddoS84,
title={On the Complexity of Some Common Geometric Location Problems},
author={Nimrod Megiddo and Kenneth J. Supowit},
pages={182--196},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1
}

@Article{OttmannPRSW84,
title={Minimal-Cost Brother Trees},
author={Thomas Ottmann and D. Stott Parker and Arnold L. Rosenberg and
Hans W. Six and Derick Wood},
pages={197--217},
journal=sicomp,
year=1984,
month=feb,
volume=13,
number=1
}

                         Volume 13, Number 2
                               May 1984

@Article{DurisG84,
title={Two Tapes are Better than One for Nondeterministic Machines},
author={Pavol D{\'u}ri{\'s} and Zvi Galil},
pages={219--227},
journal=sicomp,
year=1984,
month=may,
volume=13,
number=2
}

@Article{HuS84,
title={Computation of Matrix Chain Products. {Part} {II}},
author={T. C. Hu and M. T. Shing},
pages={228--251},
journal=sicomp,
year=1984,
month=may,
volume=13,
number=2
}

@Article{Robson84,
title={{$N$} by {$N$} Checkers is {Exptime} Complete},
author={J. M. Robson},
pages={252--267},
journal=sicomp,
year=1984,
month=may,
volume=13,
number=2
}

@Article{Bini84,
title={Parallel Solution of Certain {Toeplitz} Linear Systems},
author={Dario Bini},
pages={268--276},
journal=sicomp,
year=1984,
month=may,
volume=13,
number=2
}

@Article{Frederickson84,
title={Self-Organizing Heuristics for Implicit Data Structures},
author={Greg N. Frederickson},
pages={277--291},
journal=sicomp,
year=1984,
month=may,
volume=13,
number=2
}

@Article{SharirPH84,
title={Verification of Probabilistic Programs},
author={Micha Sharir and Amir Pnueli and Sergiu Hart},
pages={292--314},
journal=sicomp,
year=1984,
month=may,
volume=13,
number=2
}

@Article{AgarwalMS84,
title={Constrained Optimum Communication Trees and Sensitivity
Analysis},
author={Sunita Agarwal and A. K. Mittal and P. Sharma},
pages={315--328},
journal=sicomp,
year=1984,
month=may,
volume=13,
number=2
}

@Article{SchoningB84,
title={Immunity, Relativizations, and Nondeterminism},
author={Uwe Sch{\"o}ning and Ronald V. Book},
pages={329--337},
journal=sicomp,
year=1984,
month=may,
volume=13,
number=2
}

@Article{HarelT84,
title={Fast Algorithms for Finding Nearest Common Ancestors},
author={Dov Harel and Robert Endre Tarjan},
pages={338--355},
journal=sicomp,
year=1984,
month=may,
volume=13,
number=2
}

@Article{Grandjean84,
title={The Spectra of First-Order Sentences and Computational
Complexity},
author={Etienne Grandjean},
pages={356--373},
journal=sicomp,
year=1984,
month=may,
volume=13,
number=2
}

@Article{Cartwright84,
title={Recursive Programs as Definitions in First Order Logic},
author={Robert Cartwright},
pages={374--408},
journal=sicomp,
year=1984,
month=may,
volume=13,
number=2
}

@Article{StockmeyerV84,
title={Simulation of Parallel Random Access Machines by Circuits},
author={Larry Stockmeyer and Uzi Vishkin},
pages={409--422},
journal=sicomp,
year=1984,
month=may,
volume=13,
number=2,
xxx-preliminary={FOCS::ChandraSV1982:1}
}

@Article{ChandraSV84,
title={Constant Depth Reducibility},
author={Ashok K. Chandra and Larry Stockmeyer and Uzi Vishkin},
pages={423--439},
journal=sicomp,
year=1984,
month=may,
volume=13,
number=2,
preliminary={FOCS::ChandraSV1982:1}
}

                         Volume 13, Number 3
                             August 1984

@Article{Mayr84,
title={An Algorithm for the General {Petri} Net Reachability Problem},
author={Ernst W. Mayr},
pages={441--460},
journal=sicomp,
year=1984,
month=aug,
volume=13,
number=3
}

@Article{BookLS84,
title={Quantitative Relativizations of Complexity Classes},
author={Ronald V. Book and Timothy J. Long and Alan L. Selman},
pages={461--487},
journal=sicomp,
year=1984,
month=aug,
volume=13,
number=3
}

@Article{Chazelle84,
title={Convex Partitions of Polyhedra: A Lower Bound and Worst-Case
Optimal Algorithm},
author={Bernard Chazelle},
pages={488--507},
journal=sicomp,
year=1984,
month=aug,
volume=13,
number=3
}

@Article{RosenkrantzSL84,
title={Consistency and Serializability in Concurrent Database Systems},
author={D. J. Rosenkrantz and R. E. Stearns and Lewis II, P. M.},
pages={508--530},
journal=sicomp,
year=1984,
month=aug,
volume=13,
number=3
}

@Article{KeaneKM84,
title={The Organ Pipe Permutation},
author={M. Keane and A. G. Konheim and I. Meilijson},
pages={531--540},
journal=sicomp,
year=1984,
month=aug,
volume=13,
number=3
}

@Article{MelhemR84,
title={A Mathematical Model for the Verification of Systolic
Networks},
author={Rami G. Melhem and Werner C. Rheinboldt},
pages={541--565},
journal=sicomp,
year=1984,
month=aug,
volume=13,
number=3
}

@Article{TarjanY84,
title={Simple Linear-Time Algorithms to Test Chordality of Graphs, Test
Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs},
author={Robert E. Tarjan and Mihalis Yannakakis},
pages={566--579},
journal=sicomp,
year=1984,
month=aug,
volume=13,
number=3
}

@Article{TsinC84,
title={Efficient Parallel Algorithms for a Class of Graph Theoretic
Problems},
author={Yung H. Tsin and Francis Y. Chin},
pages={580--599},
journal=sicomp,
year=1984,
month=aug,
volume=13,
number=3
}

@Article{BakerC84,
title={Insertion and Compaction Algorithms in Sequentially Allocated
Storage},
author={B. S. Baker and Coffman, Jr., E. G.},
pages={600--609},
journal=sicomp,
year=1984,
month=aug,
volume=13,
number=3
}

@Article{HopcroftJW84,
title={Movement Problems for 2-Dimensional Linkages},
author={John Hopcroft and Deborah Joseph and Sue Whitesides},
pages={610--629},
journal=sicomp,
year=1984,
month=aug,
volume=13,
number=3
}

@Article{TouegB84,
title={On the Optimum Checkpoint Selection Problem},
author={Sam Toueg and {\"O}zalp Babao{\~g}lu},
pages={630--649},
journal=sicomp,
year=1984,
month=aug,
volume=13,
number=3
}

@Article{LeungVW84,
title={On Some Variants of the Bandwidth Minimization Problem},
author={Joseph {Y-T.} Leung and Oliver Vornberger and James D.
Witthoff},
pages={650--667},
journal=sicomp,
year=1984,
month=aug,
volume=13,
number=3
}

                         Volume 13, Number 4
                            November 1984

@Article{HeymanT84,
title={Disk Performance in a Transaction-Oriented System},
author={D. P. Heyman and S. Tsur},
pages={669--681},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4
}

@Article{BlassG84,
title={Equivalence Relations, Invariants, and Normal Forms},
author={Andreas Blass and Yuri Gurevich},
pages={682--689},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4
}

@Article{LaiS84,
title={Preemptive Scheduling of a Multiprocessor System with Memories
to Minimize Maximum Lateness},
author={{Ten-Hwang} Lai and Sartaj Sahni},
pages={690--704},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4
}

@Article{Dobson84,
title={Scheduling Independent Tasks on Uniform Processors},
author={Gregory Dobson},
pages={705--716},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4
}

@Article{Heller84,
title={On Relativized Polynomial and Exponential Computations},
author={Hans Heller},
pages={717--725},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4
}

@Article{Barz84,
title={The Power of Synchronization Mechanisms},
author={H. W. Barz},
pages={726--749},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4
}

@Article{Gallier84:750,
title={{$n$}-Rational Algebras {I}. {Basic} Properties and Free
Algebras},
author={Jean H. Gallier},
pages={750--775},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4
}

@Article{Gallier84:776,
title={{$n$}-Rational Algebras {II.} {Varieties} and Logic of
Inequalities},
author={Jean H. Gallier},
pages={776--794},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4
}

@Article{Linial84,
title={The Information-Theoretic Bound is Good for Merging},
author={Nathan Linial},
pages={795--801},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4
}
@Article{Gathen84,
title={Parallel Algorithms for Algebraic Problems},
author={Joachim von zur Gathen},
pages={802--824},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4
}

@Article{ShermanPH84,
title={Is the Interesting Part of Process Logic Uninteresting?: A
Translation from {PL} to {PDL}},
author={R. Sherman and A. Pnueli and D. Harel},
pages={825--839},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4
}

@Article{JaJaKS84,
title={Information Transfer under Different Sets of Protocols},
author={J. Ja'Ja' and V. K. Prasanna Kumar and J. Simon},
pages={840--849},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4
}

@Article{BlumM84,
title={How to Generate Cryptographically Strong Sequences of
Pseudo-Random Bits},
author={Manuel Blum and Silvio Micali},
pages={850--864},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4,
preliminary={FOCS::BlumM1982:112}
}

@Article{ArnonCM84:865,
title={Cylindrical Algebraic Decomposition {I}: The Basic Algorithm},
author={Dennis S. Arnon and George E. Collins and Scott McCallum},
pages={865--877},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4
}

@Article{ArnonCM84:878,
title={Cylindrical Algebraic Decomposition {II}: An Adjacency
Algorithm for the Plane},
author={Dennis S. Arnon and George E. Collins and Scott McCallum},
pages={878--889},
journal=sicomp,
year=1984,
month=nov,
volume=13,
number=4
}

                         Volume 14, Number 1
                            February 1985

@Article{Vitanyi85:1,
title={An Optimal Simulation of Counter Machines},
author={Paul M. B. Vit{\'a}nyi},
pages={1--33},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1,
preliminary={STOC::Vitanyi1982:27}
}

@Article{Vitanyi85:34,
title={An Optimal Simulation of Counter Machines: The {ACM} Case},
author={Paul M. B. Vit{\'a}nyi},
pages={34--40},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{KoS85,
title={On Circuit-Size Complexity and the Low Hierarchy in {NP}},
author={{Ker-I} Ko and Uwe Sch{\"o}ning},
pages={41--51},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{KanellakisP85,
title={The Complexity of Distributed Concurrency Control},
author={Paris C. Kanellakis and Christos H. Papadimitriou},
pages={52--74},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{ReifS85,
title={Unbounded Speed Variability in Distributed Communications
Systems},
author={John H. Reif and Paul G. Spirakis},
pages={75--92},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{ImaiIM85,
title={Voronoi Diagram in the {Laguerre} Geometry and Its
Applications},
author={Hiroshi Imai and Masao Iri and Kazuo Murota},
pages={93--105},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{Fiduccia85,
title={An Efficient Formula for Linear Recurrences},
author={Charles M. Fiduccia},
pages={106--112},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{Kurtz85,
title={Sparse Sets in {$\mathbf{NP} - \mathbf{P}$}: Relativizations},
author={Stuart A. Kurtz},
pages={113--119},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{YaoY85,
title={On Fault-Tolerant Networks for Sorting},
author={Andrew C. Yao and F. Frances Yao},
pages={120--128},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{Yao85:129,
title={On the Expected Performance of Path Compression Algorithms},
author={Andrew C. Yao},
pages={129--133},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{BoyceDDG85,
title={Finding Extremal Polygons},
author={James E. Boyce and David P. Dobkin and Drysdale III, Robert L.
(Scot) and Leo J. Guibas},
pages={134--147},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{Balcazar85,
title={Simplicity, Relativizations and Nondeterminism},
author={Jos{\'e} L. Balc{\'a}zar},
pages={148--157},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{ChungMST85,
title={Polynomial Time Algorithms for the Min Cut Problem on Degree
Restricted Trees},
author={{Moon-Jung} Chung and Fillia Makedon and Ivan Hal Sudborough
and Jonathan Turner},
pages={158--177},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{Risler85,
title={Additive Complexity and Zeros of Real Polynomials},
author={J. J. Risler},
pages={178--183},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{Landau85,
title={Factoring Polynomials Over Algebraic Number Fields},
author={Susan Landau},
pages={184--195},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{Lagarias85,
title={The Computational Complexity of Simultaneous {Diophantine}
Approximation Problems},
author={J. C. Lagarias},
pages={196--209},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1,
preliminary={FOCS::Lagarias1982:32}
}

@Article{ChibaN85,
title={Arboricity and Subgraph Listing Algorithms},
author={Norishige Chiba and Takao Nishizeki},
pages={210--223},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{Hsu85,
title={Maximum Weight Clique Algorithms for Circular-Arc Graphs and
Circle Graphs},
author={{Wen-Lian} Hsu},
pages={224--231},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{Willard85,
title={New Data Structures for Orthogonal Range Queries},
author={Dan E. Willard},
pages={232--253},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

@Article{TarjanY85,
title={Addendum: Simple Linear-Time Algorithms to Test Chordality of
Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic
Hypergraphs},
author={Robert E. Tarjan and Mihalis Yannakakis},
pages={254--255},
journal=sicomp,
year=1985,
month=feb,
volume=14,
number=1
}

                         Volume 14, Number 2
                               May 1985

@Article{McCreight85,
title={Priority Search Trees},
author={Edward M. McCreight},
pages={257--276},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{Yao85:277,
title={On the Complexity of Maintaining Partial Sums},
author={Andrew C. Yao},
pages={277--288},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{MatsumotoNS85,
title={An Efficient Algorithm for Finding Multicommodity Flows in
Planar Networks},
author={Kazuhiko Matsumoto and Takao Nishizeki and Nobuji Saito},
pages={289--302},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{VishkinW85,
title={Trade-Offs Between Depth and Width in Parallel Computation},
author={Uzi Vishkin and Avi Wigderson},
pages={303--314},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2,
preliminary={FOCS::VishkinW1983:146}
}

@Article{HopcroftJW85,
title={On the Movement of Robot Arms in 2-Dimensional Bounded
Regions},
author={John Hopcroft and Deborah Joseph and Sue Whitesides},
pages={315--333},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{ItoIK85,
title={Some Results on the Representative Instance in Relational
Databases},
author={Minoru Ito and Motoaki Iwasaki and Tadao Kasami},
pages={334--354},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{VijayanW85,
title={Rectilinear Graphs and their Embeddings},
author={Gopalakrishnan Vijayan and Avi Wigderson},
pages={355--372},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{Revesz85,
title={Axioms for the Theory of Lambda-Conversion},
author={Gyorgy Revesz},
pages={373--382},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{Hartmann85,
title={On the Multiplicative Complexity of Modules Over Associative
Algebras},
author={W. Hartmann},
pages={383--395},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{Reischuk85,
title={Probabilistic Parallel Algorithms for Sorting and Selection},
author={R{\"u}diger Reischuk},
pages={396--409},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{OgdenRW85,
title={An ``Interchange Lemma'' for Context-Free Languages},
author={William Ogden and Rockford J. Ross and Karl Winklmann},
pages={410--415},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{CoffmanKS85,
title={A Stochastic Model of Fragmentation in Dynamic Storage
Allocation},
author={Coffman, Jr., E. G. and T. T. Kadota and L. A. Shepp},
pages={416--425},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{IbarraKM85,
title={Sequential Machine Characterizations of Trellis and Cellular
Automata and Applications},
author={Oscar H. Ibarra and Sam M. Kim and Shlomo Moran},
pages={426--447},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{Sharir85,
title={Intersection and Closest-Pair Problems for a Set of Planar
Discs},
author={Micha Sharir},
pages={448--468},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{Kaltofen85,
title={Polynomial-Time Reductions from Multivariate to Bi- and
Univariate Integral Polynomial Factorization},
author={Erich Kaltofen},
pages={469--489},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{VitterC85,
title={Optimum Algorithms for a Model of Direct Chaining},
author={Jeffrey Scott Vitter and {Wen-Chin} Chen},
pages={490--499},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

@Article{GareyJ85,
title={Composing Functions to Minimize Image Size},
author={M. R. Garey and D. S. Johnson},
pages={500--503},
journal=sicomp,
year=1985,
month=may,
volume=14,
number=2
}

                         Volume 14, Number 3
                             August 1985

@Article{ReedsS85,
title={Shift-Register Synthesis (Modulo {$m$})},
author={J. A. Reeds and N. J. A. Sloane},
pages={505--513},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{KirkpatrickK85,
title={Alphabetic Minimax Trees},
author={David G. Kirkpatrick and Maria M. Klawe},
pages={514--526},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{HambruschS85,
title={Solving Undirected Graph Problems on {VLSI}},
author={Susanne E. Hambrusch and Janos Simon},
pages={527--544},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{BentST85,
title={Biased Search Trees},
author={Samuel W. Bent and Daniel D. Sleator and Robert E. Tarjan},
pages={545--568},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{GoudaR85,
title={Priority Networks of Communicating Finite State Machines},
author={Mohamed G. Gouda and Louis E. Rosier},
pages={569--584},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{Long85,
title={On Restricting the Size of Oracles Compared with Restricting
Access to Oracles},
author={Timothy J. Long},
pages={585--597},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{StearnsH85,
title={On the Equivalence and Containment Problems for Unambiguous
Regular Expressions, Regular Grammars and Finite Automata},
author={R. E. Stearns and Hunt III, H. B.},
pages={598--611},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{HassinJ85,
title={An {$O(n \log_2 n)$} Algorithm for Maximum Flow in Undirected
Planar Networks},
author={Rafael Hassin and Donald B. Johnson},
pages={612--624},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{Myers85,
title={An {$O(E \log E + I)$} Expected Time Algorithm for the Planar
Segment Intersection Problem},
author={Eugene W. Myers},
pages={625--637},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{DolevW85,
title={Scheduling Flat Graphs},
author={Danny Dolev and Manfred Warmuth},
pages={638--657},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{Spinrad85,
title={On Comparability and Permutation Graphs},
author={Jeremy Spinrad},
pages={658--670},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{ChandraV85,
title={The Implication Problem for Functional and Inclusion
Dependencies is Undecidable},
author={Ashok K. Chandra and Moshe Y. Vardi},
pages={671--677},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{Kalorkoti85,
title={A Lower Bound for the Formula Size of Rational Functions},
author={K. A. Kalorkoti},
pages={678--687},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{Snir85,
title={On Parallel Searching},
author={Marc Snir},
pages={688--708},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{Veldhorst85,
title={Approximation of the Consecutive Ones Matrix Augmentation
Problem},
author={Marinus Veldhorst},
pages={709--729},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{Kedem85,
title={Optimal Allocation of Area for Single-Chip Computations},
author={Zvi M. Kedem},
pages={730--742},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

@Article{CoffmanGJL85,
title={Scheduling File Transfers},
author={Coffman, Jr., E. G. and M. R. Garey and D. S. Johnson and A.
S. Lapaugh},
pages={743--780},
journal=sicomp,
year=1985,
month=aug,
volume=14,
number=3
}

                         Volume 14, Number 4
                            November 1985

@Article{Frederickson1985,
title={Data Structures for On-line Updating of Minimum Spanning Trees,
with Applications},
author={Greg N. Frederickson},
pages={781--798},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{Keil1985,
title={Decomposing a Polygon into Simpler Components},
author={J. Mark Keil},
pages={799--817},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{SatyanarayanaW1985,
title={A Linear-Time Algorithm for Computing {$K$}-terminal
Reliability in Series-Parallel Networks},
author={A. Satyanarayana and R. Kevin Wood},
pages={818--832},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{CookH1985,
title={A Depth-Universal Circuit},
author={Stephen A. Cook and H. James Hoover},
pages={833--839},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{AltM1985,
title={Searching Semisorted Tables},
author={Helmut Alt and Kurt Mehlhorn},
pages={840--848},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{Stockmeyer1985,
title={On Approximation Algorithms for {{\#P}}},
author={Larry Stockmeyer},
pages={849--861},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4,
preliminary={STOC::Stockmeyer1983:118}
}

@Article{TarjanV1985,
title={An Efficient Parallel Biconnectivity Algorithm},
author={Robert E. Tarjan and Uzi Vishkin},
pages={862--874},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4,
preliminary={FOCS::TarjanV1984:12}
}

@Article{Jaffe1985,
title={Distributed Multi-Destination Routing: The Constraints of Local
Information},
author={Jeffrey M. Jaffe},
pages={875--888},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{Alblas1985,
title={Finding Minimal Pass Sequences for Atttibute Grammars},
author={Henk Alblas},
pages={889--914},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{El-MallahC1985,
title={Optimum Communication Spanning Trees in Series-Parallel
Networks},
author={Ehab S. El-Mallah and Charles J. Colbourn},
pages={915--925},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{CorneilPS1985,
title={A Linear Recognition Algorithm for Cographs},
author={D. G. Corneil and Y. Perl and L. K. Stewart},
pages={926--934},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{ParikhCHM1985,
title={Equations Between Regular Terms and an Application to Process
Logic},
author={Rohit Parikh and Ashok Chandra and Joe Halpern and Albert
Meyer},
pages={935--942},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4,
preliminary={STOC::ChandraHMP1981:384}
}

@Article{PurdomB1985,
title={The Pure Literal Rule and Polynomial Average Time},
author={Purdom, Jr., Paul Walton and Cynthia A. Brown},
pages={943--953},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{FaigleGS1985,
title={Algorithmic Approaches to Setup Minimization},
author={Ulrich Faigle and Gerhard Gierz and Rainer Schrader},
pages={954--965},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{SingerSC1985,
title={An Extension of {Liouville's} Theorem on Integration in Finite
Terms},
author={M. F. Singer and B. D. Saunders and B. F. Caviness},
pages={966--990},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{HartS1985,
title={Concurrent Probabilistic Programs, or: How to Schedule If You
Must},
author={Sergiu Hart and Micha Sharir},
pages={991--1012},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{Willard1985,
title={Searching Unindexed and Nonuniformly Generated Files in {$\log
\log N$} Time},
author={Dan E. Willlard},
pages={1013--1029},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{Mitra1985,
title={Probabilistic Models and Asymptotic Results for Concurrent
Processing with Exclusive and Non-Exclusive Locks},
author={Debasis Mitra},
pages={1030--1051},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

@Article{KapurN1985,
title={The {Knuth}-{Bendix} Completion Procedure and {Thue} Systems},
author={Deepak Kapur and Paliath Narendran},
pages={1052--1072},
journal=sicomp,
month=nov,
year=1985,
volume=14,
number=4
}

                         Volume 15, Number 1
                            February 1986

@Article{Cherry86,
title={Integration in Finite Terms with Special Functions: The
Logarithmic Integral},
author={G. W. Cherry},
pages={1--21},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{MehlhornT86,
title={An Amortized Analysis of Insertions into {AVL}-Trees},
author={Kurt Mehlhorn and Athanasios Tsakalidis},
pages={22--33},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{ORourke86,
title={The Signature of a Plane Curve},
author={Joseph O'Rourke},
pages={34--51},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{SleatorT86,
title={Self-Adjusting Heaps},
author={Daniel Dominic Sleator and Robert Endre Tarjan},
pages={52--69},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{Engelfriet86,
title={The Complexity of Languages Generated by Attribute Grammars},
author={Joost Engelfriet},
pages={70--86},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{CookDR86,
title={Upper and Lower Time Bounds for Parallel Random Access Machines
without Simultaneous Writes},
author={Stephen Cook and Cynthia Dwork and R{\"u}diger Reischuk},
pages={87--97},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{ApostolicoG86,
title={The {Boyer-Moore-Galil} String Searching Strategies Revisited},
author={Alberto Apostolico and Raffaele Giancarlo},
pages={98--105},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{Heide86,
title={Efficient Simulations Among Several Models of Parallel
Computers},
author={Meyer auf der Heide, Friedhelm},
pages={106--119},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{GalilMG86,
title={An {$O(EV \log V)$} Algorithm for Finding a Maximal Weighted
Matching in General Graphs},
author={Zvi Galil and Silvio Micali and Harold Gabow},
pages={120--130},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{ChinR86,
title={Optimal Termination Protocols for Network Partitioning},
author={Francis Chin and K. V. S. Ramarao},
pages={131--144},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{ShubS86,
title={Computational Complexity: On the Geometry of Polynomials and a
Theory of Cost: {II}},
author={M. Shub and S. Smale},
pages={145--161},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{Baker86,
title={A Provably Good Algorithm for the Two Module Routing Problem},
author={Brenda S. Baker},
pages={162--188},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{CoppersmithKP86,
title={Alphabetic Minimax Trees of Degree at Most {$t$}},
author={D. Coppersmith and M. M. Klawe and N. J. Pippenger},
pages={189--192},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{SharirS86,
title={On Shortest Paths in Polyhedral Spaces},
author={Micha Sharir and Amir Schorr},
pages={193--215},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1,
preliminary={STOC::SharirS1984:144}
}

@Article{EtzionL86,
title={An Efficient Algorithm for Generating Linear Transformations in
a Shuffle-Exchange Network},
author={T. Etzion and A. Lempel},
pages={216--221},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{FriesenL86,
title={Variable Sized Bin Packing},
author={D. K. Friesen and M. A. Langston},
pages={222--230},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{Reif86,
title={Logarithmic Depth Circuits for Algebraic Functions},
author={John H. Reif},
pages={231--242},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{CabayC86,
title={Algebraic Computations of Scaled {Pad\'e} Fractions},
author={Stanley Cabay and {Dong-Koo} Choi},
pages={243--270},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{EdelsbrunnerW86,
title={Constructing Belts in Two-Dimensional Arrangements with
Applications},
author={H. Edelsbrunner and E. Welzl},
pages={271--284},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{Levin86,
title={Average Case Complete Problems},
author={Leonid A. Levin},
pages={285--286},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{KirkpatrickS86,
title={The Ultimate Planar Convex Hull Algorithm?},
author={David G. Kirkpatrick and Raimund Seidel},
pages={287--299},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

@Article{ChazelleDL86,
title={Computing the Largest Empty Rectangle},
author={B. Chazelle and R. L. Drysdale and D. T. Lee},
pages={300--315},
journal=sicomp,
year=1986,
month=feb,
volume=15,
number=1
}

                         Volume 15, Number 2
                               May 1986

@Article{EdelsbrunnerGS86,
title={Optimal Point Location in a Monotone Subdivision},
author={Herbert Edelsbrunner and Leonidas J. Guibas and Jorge Stolfi},
pages={317--340},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{EdelsbrunnerOS86,
title={Constructing Arrangements of Lines and Hyperplanes with
Applications},
author={H. Edelsbrunner and J. O'Rourke and R. Seidel},
pages={341--363},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{BlumBS86,
title={A Simple Unpredictable Pseudo-Random Number Generator},
author={L. Blum and M. Blum and M. Shub},
pages={364--383},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{BlumS86,
title={Evaluating Rational Functions: Infinite Precision is Finite
Cost and Tractable on Average},
author={Lenore Blum and Michael Shub},
pages={384--398},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{OrponenRS86,
title={Optimal Approximations and Polynomially Levelable Sets},
author={Pekka Orponen and David A. Russo and Uwe Sch{\"o}ning},
pages={399--408},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{BrunoD86,
title={Probabilistic Bounds on the Performance of List Scheduling},
author={John L. Bruno and Peter J. Downey},
pages={409--417},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{AusielloDS86,
title={Minimal Representation of Directed Hypergraphs},
author={G. Ausiello and A. D'Atri and D. Sacc{\`a}},
pages={418--431},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{Gathen86,
title={Representations and Parallel Computations for Rational
Functions},
author={Joachim von zur Gathen},
pages={432--452},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2,
preliminary={FOCS::Gathen1983:133}
}

@Article{Maass86,
title={On the Complexity of Nonconvex Covering},
author={Wolfgang Maass},
pages={453--467},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{Willard86,
title={Log-Logarithmic Selection Resolution Protocols in a Multiple
Access Channel},
author={Dan E. Willard},
pages={468--477},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{ImaiA86,
title={Efficient Algorithms for Geometric Graph Search Problems},
author={Hiroshi Imai and Takao Asano},
pages={478--494},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{MatsumotoNS86,
title={Planar Multicommodity Flows, Maximum Matchings and Negative
Cycles},
author={Kazuhiko Matsumoto and Takao Nishizeki and Nobuji Saito},
pages={495--510},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{GeskeG86,
title={Relativizations of Unambiguous and Random Polynomial Time
Classes},
author={John Geske and Joachim Grollmann},
pages={511--519},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{LangenhopW86,
title={Probabilities Related to Father-Son Distances in Binary Search
Trees},
author={Carl E. Langenhop and William E. Wright},
pages={520--530},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{Valiant86,
title={Negation is Powerless for {Boolean} Slice Functions},
author={L. G. Valiant},
pages={531--535},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{Frieze86,
title={On the {Lagarias-Odlyzko} Algorithm for the Subset Sum
Problem},
author={A. M. Frieze},
pages={536--539},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{WrightROM86,
title={Constant Time Generation of Free Trees},
author={Robert Alan Wright and Bruce Richmond and Andrew Odlyzko and
Brendan D. McKay},
pages={540--548},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{BorodinDFP86,
title={Bounds for Width Two Branching Programs},
author={Allan Borodin and Danny Dolev and Faith E. Fich and Wolfgang
Paul},
pages={549--560},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{Turner86,
title={On the Probable Performance of Heuristics for Bandwidth
Minimization},
author={Jonathan S. Turner},
pages={561--580},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2,
preliminary={STOC::Turner1983:467}
}

@Article{Huynh86:581,
title={The Complexity of the Membership Problem for Two Subclasses of
Polynomial Ideals},
author={Dung T. Huynh},
pages={581--594},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{JohnsonM86,
title={Noncommutative Bilinear Algorithms for {$3 \times 3$} Matrix
Multiplication},
author={Rodney W. Johnson and Aileen M. McLoughlin},
pages={595--603},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{BermanBDOP86,
title={Collections of Functions for Perfect Hashing},
author={Francine Berman and Mary Ellen Bock and Eric Dittert and
Michael J. O'Donnell and Darrell Plank},
pages={604--618},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

@Article{FeigenbaumS86,
title={Recognizing Composite Graphs is Equivalent to Testing Graph
Isomorphism},
author={Joan Feigenbaum and Alejandro A. Sch{\"a}ffer},
pages={619--627},
journal=sicomp,
year=1986,
month=may,
volume=15,
number=2
}

                         Volume 15, Number 3
                             August 1986

@Article{FlajoletP86,
title={Register Allocation for Unary-Binary Trees},
author={P. Flajolet and H. Prodinger},
pages={629--640},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{Friedman86,
title={Constructing {$O(n \log n)$} Size Monotone Formulae for the
{$k$}th Threshold Function of {$n$} {Boolean} Variables},
author={Joel Friedman},
pages={641--654},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{IrvingL86,
title={The Complexity of Counting Stable Marriages},
author={Robert W. Irving and Paul Leather},
pages={655--667},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{CitriniCM86,
title={On Deterministic Multi-Pass Analysis},
author={Claudio Citrini and Stefano Crespi-Reghizzi and Dino
Mandrioli},
pages={668--693},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{Provan86,
title={The Complexity of Reliability Computations in Planar and
Acyclic Graphs},
author={J. Scott Provan},
pages={694--702},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{Chazelle86,
title={Filtering Search: A New Approach to Query-Answering},
author={Bernard Chazelle},
pages={703--724},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{Dyer86,
title={On a Multidimensional Search Technique and its Application to
the {Euclidean} One-Centre Problem},
author={M. E. Dyer},
pages={725--738},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{BalcazarBS86,
title={Sparse Sets, Lowness and Highness},
author={Jos{\'e} L. Balc{\'a}zar and Ronald V. Book and Uwe
Sch{\"o}ning},
pages={739--747},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{FlajoletS86,
title={Digital Search Trees Revisited},
author={Philippe Flajolet and Robert Sedgewick},
pages={748--767},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{HopcroftW86,
title={Reducing Multiple Object Motion Planning to Graph Searching},
author={J. E. Hopcroft and G. T. Wilfong},
pages={768--785},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{Otto86,
title={{Church-Rosser} {Thue} Systems that Present Free Monoids},
author={Friedrich Otto},
pages={786--792},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{LeightonR86,
title={Three-Dimensional Circuit Layouts},
author={Frank Thomson Leighton and Arnold L. Rosenberg},
pages={793--813},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{Smith86,
title={Parallel Algorithms for Depth-First Searches {I}. {Planar}
Graphs},
author={Justin R. Smith},
pages={814--830},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{HuntR86,
title={Recursion Schemes and Recursive Programs are Exponentially Hard
to Analyze},
author={Hunt III, H. B. and D. J. Rosenkrantz},
pages={831--850},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3,
preliminary={FOCS::HuntR1980:152}
}

@Article{Arazi86,
title={A Binary Search with a Parallel Recovery of the Bits},
author={Benjamin Arazi},
pages={851--855},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{Hull86,
title={Relative Information Capacity of Simple Relational Database
Schemata},
author={Richard Hull},
pages={856--886},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

@Article{Kingston86,
title={Analysis of {Henriksen's} Algorithm for the Simulation Event
Set},
author={Jeffrey H. Kingston},
pages={887--902},
journal=sicomp,
year=1986,
month=aug,
volume=15,
number=3
}

                         Volume 15, Number 4
                            November 1986

@Article{Davenport86,
title={The {Risch} Differential Equation Problem},
author={J. H. Davenport},
pages={903--918},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{KatzV86,
title={Data Structures for Retrieval on Square Grids},
author={Martin David Katz and Dennis J. Volper},
pages={919--931},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{PangE86,
title={Communication Complexity of Computing the {Hamming} Distance},
author={King F. Pang and El Gamal, Abbas},
pages={932--947},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{Cunningham86,
title={Improved Bounds for Matroid Partition and Intersection
Algorithms},
author={William H. Cunningham},
pages={948--957},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{Ambos-Spies86,
title={An Inhomogeneity in the Structure of {Karp} Degrees},
author={Klaus Ambos-Spies},
pages={958--963},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{GonnetM86,
title={Heaps on Heaps},
author={Gaston H. Gonnet and J. Ian Munro},
pages={964--971},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{Prill86,
title={On Approximations and Incidence in Cylindrical Algebraic
Decompositions},
author={David Prill},
pages={972--993},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{BeameCH86,
title={Log Depth Circuits for Division and Related Problems},
author={Paul W. Beame and Stephen A. Cook and H. James Hoover},
pages={994--1003},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4,
preliminary={FOCS::BeameCH1984:1}
}

@Article{JaJaT86,
title={On the Validity of the Direct Sum Conjecture},
author={Joseph Ja'Ja' and Jean Takche},
pages={1004--1020},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{Blum86,
title={On the Single-Operation Worst-Case Time Complexity of the
Disjoint Set Union Problem},
author={Norbert Blum},
pages={1021--1024},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{Li86,
title={Ranking and Unranking of {AVL}-Trees},
author={Liwu Li},
pages={1025--1035},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{Luby86,
title={A Simple Parallel Algorithm for the Maximal Independent Set
Problem},
author={Michael Luby},
pages={1036--1053},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{BalasY86,
title={Finding a Maximum Clique in an Arbitrary Graph},
author={Egon Balas and Chang Sung Yu},
pages={1054--1068},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{HirschbergL86,
title={Average Case Analysis of Marking Algorithms},
author={D. S. Hirschberg and L. L. Larmore},
pages={1069--1074},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{FaigleLST86,
title={Searching in Trees, Series-Parallel and Interval Orders},
author={U. Faigle and L. Lov{\'a}sz and R. Schrader and Gy.
Tur{\'a}n},
pages={1075--1084},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{GaverJ86,
title={Processor-Shared Time-Sharing Models in Heavy Traffic},
author={Donald P. Gaver and Patricia A. Jacobs},
pages={1085--1100},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{Huynh86:1101,
title={Some Observations about the Randomness of Hard Problems},
author={Dung T. Huynh},
pages={1101--1105},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{ChaoF86,
title={Probabilistic Analysis of Two Heuristics for the
3-Satisfiability Problem},
author={{Ming-Te} Chao and John Franco},
pages={1106--1118},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{KawaguchiK86,
title={Worst Case Bound of an {LRF} Schedule for the Mean Weighted
Flow-Time Problem},
author={Tsuyoshi Kawaguchi and Seiki Kyan},
pages={1119--1129},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

@Article{Manber86,
title={On Maintaining Dynamic Information in a Concurrent
Environment},
author={Udi Manber},
pages={1130--1142},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4,
preliminary={STOC::Manber1984:273}
}

@Article{BachMS86,
title={Sums of Divisors, Perfect Numbers and Factoring},
author={Eric Bach and Gary Miller and Jeffrey Shallit},
pages={1143--1154},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4,
preliminary={STOC::BachMS1984:183}
}

@Article{JouannaudK86,
title={Completion of a Set of Rules Modulo a Set of Equations},
author={{Jean-Pierre} Jouannaud and H{\'e}l{\`e}ne Kirchner},
pages={1155--1194},
journal=sicomp,
year=1986,
month=nov,
volume=15,
number=4
}

                         Volume 16, Number 1
                            February 1987

@Article{PapadimitriouT87,
title={On Stochastic Scheduling with In-Tree Precedence Constraints},
author={Christos H. Papadimitriou and John N. Tsitsiklis},
pages={1--6},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{KannanMR87,
title={Sublinear Parallel Algorithm for Computing the Greatest Common
Divisor of Two Integers},
author={Ravindran Kannan and Gary Miller and Larry Rudolph},
pages={7--16},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{ShmueliI87,
title={Complexity of Views: Tree and Cyclic Schemas},
author={Oded Shmueli and Alon Itai},
pages={17--37},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{MillerS87,
title={Data Movement Techniques for the Pyramid Computer},
author={Russ Miller and Quentin F. Stout},
pages={38--60},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{ColeSY87,
title={On {$k$}-Hulls and Related Problems},
author={Richard Cole and Micha Sharir and Chee K. Yap},
pages={61--77},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1,
preliminary={STOC::ColeSY1984:154}
}

@Article{Aurenhammer87,
title={Power Diagrams: Properties, Algorithms and Applications},
author={F. Aurenhammer},
pages={78--96},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{BorodinFMUW87,
title={A Time-Space Tradeoff for Element Distinctness},
author={A. Borodin and F. Fich and Meyer auf der Heide, F. and E.
Upfal and A. Wigderson},
pages={97--99},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{HeideW87,
title={The Complexity of Parallel Sorting},
author={Meyer auf der Heide, Friedhelm and Avi Wigderson},
pages={100--107},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{Jones87,
title={A Note on Bottom-Up Skew Heaps},
author={Douglas W. Jones},
pages={108--110},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{Gusfield87:111,
title={Three Fast Algorithms for Four Problems in Stable Marriage},
author={Dan Gusfield},
pages={111--128},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{HuntRB87,
title={On the Computational Complexity of Algebra on Lattices},
author={Hunt III, H. B. and D. J. Rosenkrantz and P. A. Bloniarz},
pages={129--148},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{Murgolo87,
title={An Efficient Approximation Scheme for Variable-Sized Bin
Packing},
author={Frank D. Murgolo},
pages={149--161},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{ChoiH87,
title={Scheduling File Transfers for Trees and Odd Cycles},
author={{Hyeong-Ah} Choi and S. Louis Hakimi},
pages={162--168},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{CourcoubetisRS87,
title={Stability of a Queueing System with Concurrent Service and
Locking},
author={C. A. Courcoubetis and M. I. Reiman and B. Simon},
pages={169--178},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{MossesP87,
title={On Proving Limiting Completeness},
author={Peter D. Mosses and Gordon D. Plotkin},
pages={179--194},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{MaassS87,
title={Speed-Up of {Turing} Machines with One Work Tape and a Two-Way
Input Tape},
author={Wolfgang Maass and Amir Schorr},
pages={195--202},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

@Article{SoulieW87,
title={Random Iterations of Threshold Networks and Associative Memory},
author={Fran{\c{c}}ois Fogelman Soulie and G{\'e}rard Weisbuch},
pages={203--220},
journal=sicomp,
year=1987,
month=feb,
volume=16,
number=1
}

                         Volume 16, Number 2
                              April 1987

@Article{CulikK87,
title={The Equivalence Problem for Single-Valued Two-Way Transducers
(on {NPDT0L} Languages) is Decidable},
author={Culik II, Karel and Juhani Karhum{\"a}ki},
pages={221--230},
journal=sicomp,
year=1987,
month=apr,
volume=16,
number=2
}

@Article{KorachMZ87,
title={The Optimality of Distributive Constructions of Minimum Weight
and Degree Restricted Spanning Trees in a Complete Network of
Processors},
author={E. Korach and S. Moran and S. Zaks},
pages={231--236},
journal=sicomp,
year=1987,
month=apr,
volume=16,
number=2
}

@Article{GusfieldMF87,
title={Fast Algorithms for Bipartite Network Flow},
author={Dan Gusfield and Charles Martel and David Fernandez-Baca},
pages={237--251},
journal=sicomp,
year=1987,
month=apr,
volume=16,
number=2
}

@Article{BiniC87,
title={Tensor Rank and Border Rank of Band {Toeplitz} Matrices},
author={D. Bini and M. Capovani},
pages={252--258},
journal=sicomp,
year=1987,
month=apr,
volume=16,
number=2
}

@Article{CaiM87,
title={Graph Minimal Uncolorability is
{$\mathrm{D}^\mathrm{P}$}-Complete},
author={{Jin-Yi} Cai and Gabriele E. Meyer},
pages={259--277},
journal=sicomp,
year=1987,
month=apr,
volume=16,
number=2
}

@Article{Lickteig87,
title={The Computational Complexity of Division in Quadratic Extension
Fields},
author={Thomas Lickteig},
pages={278--311},
journal=sicomp,
year=1987,
month=apr,
volume=16,
number=2
}

@Article{Asano87,
title={An Application of Duality to Edge-Deletion Problems},
author={Takao Asano},
pages={312--331},
journal=sicomp,
year=1987,
month=apr,
volume=16,
number=2
}

@Article{GuessarianM87,
title={On the Axiomatization of ``If-Then-Else''},
author={Ir{\`e}ne Guessarian and Jos{\'e} Meseguer},
pages={332--357},
journal=sicomp,
year=1987,
month=apr,
volume=16,
number=2
}

@Article{Horton87,
title={A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of
a Graph},
author={J. D. Horton},
pages={358--366},
journal=sicomp,
year=1987,
month=apr,
volume=16,
number=2
}

@Article{IbarraP87,
title={On Efficient Simulations of Systolic Arrays of Random-Access
Machines},
author={Oscar H. Ibarra and Michael A. Palis},
pages={367--377},
journal=sicomp,
year=1987,
month=apr,
volume=16,
number=2
}

@Article{KnesslMST87,
title={Asymptotic Expansions for a Closed Multiple Access System},
author={C. Knessl and B. J. Matkowsky and Z. Schuss and C. Tier},
pages={378--398},
journal=sicomp,
year=1987,
month=apr,
volume=16,
number=2
}

@Article{HofriR87,
title={On the Optimal Control of Two Queues with Server Setup Times
and Its Analysis},
author={Micha Hofri and Keith W. Ross},
pages={399--420},
journal=sicomp,
year=1987,
month=apr,
volume=16,
number=2
}

                         Volume 16, Number 3
                              June 1987

@Article{Tamassia87,
title={On Embedding a Graph in the Grid with the Minimum Number of
Bends},
author={Roberto Tamassia},
pages={421--444},
journal=sicomp,
year=1987,
month=jun,
volume=16,
number=3
}

@Article{TouegPS87,
title={Fast Distributed Agreement},
author={Sam Toueg and Kenneth J. Perry and T. K. Srikanth},
pages={445--457},
journal=sicomp,
year=1987,
month=jun,
volume=16,
number=3
}

@Article{AzarV87,
title={Tight Comparison Bounds on the Complexity of Parallel Sorting},
author={Yossi Azar and Uzi Vishkin},
pages={458--464},
journal=sicomp,
year=1987,
month=jun,
volume=16,
number=3
}

@Article{MeklerN87,
title={Equational Bases for If-Then-Else},
author={Alan H. Mekler and Evelyn M. Nelson},
pages={465--485},
journal=sicomp,
year=1987,
month=jun,
volume=16,
number=3
}

@Article{GurevichS87,
title={Expected Computation Time for {Hamiltonian} Path Problem},
author={Yuri Gurevich and Saharon Shelah},
pages={486--502},
journal=sicomp,
year=1987,
month=jun,
volume=16,
number=3
}

@Article{Vaishnavi87,
title={Weighted Leaf {AVL}-Trees},
author={Vijay K. Vaishnavi},
pages={503--537},
journal=sicomp,
year=1987,
month=jun,
volume=16,
number=3
}

@Article{PapadimitriouY87,
title={The Complexity of Reliable Concurrency Control},
author={Christos H. Papadimitriou and Mihalis Yannakakis},
pages={538--553},
journal=sicomp,
year=1987,
month=jun,
volume=16,
number=3
}

@Article{Friesen87,
title={Tighter Bounds for {LPT} Scheduling on Uniform Processors},
author={Donald K. Friesen},
pages={554--560},
journal=sicomp,
year=1987,
month=jun,
volume=16,
number=3
}

@Article{Sharir87,
title={On Shortest Paths Amidst Convex Polyhedra},
author={Micha Sharir},
pages={561--572},
journal=sicomp,
year=1987,
month=jun,
volume=16,
number=3
}

@Article{HuW87,
title={Binary Search on a Tape},
author={T. C. Hu and Michelle L. Wachs},
pages={573--590},
journal=sicomp,
year=1987,
month=jun,
volume=16,
number=3
}

@Article{Lenstra87,
title={Factoring Multivariate Polynomials over Algebraic Number
Fields},
author={Arjen K. Lenstra},
pages={591--598},
journal=sicomp,
year=1987,
month=jun,
volume=16,
number=3
}

                         Volume 16, Number 4
                             August 1987

@Article{Gusfield87:599,
title={Optimal Mixed Graph Augmentation},
author={Dan Gusfield},
pages={599--612},
journal=sicomp,
year=1987,
month=aug,
volume=16,
number=4
}

@Article{Gasarch87,
title={Oracles for Deterministic versus Alternating Classes},
author={William Gasarch},
pages={613--627},
journal=sicomp,
year=1987,
month=aug,
volume=16,
number=4
}

@Article{HirschbergL87,
title={The Least Weight Subsequence Problem},
author={D. S. Hirschberg and L. L. Larmore},
pages={628--638},
journal=sicomp,
year=1987,
month=aug,
volume=16,
number=4,
preliminary={FOCS::HirschbergL1985:137}
}

@Article{PapadimitriouU87,
title={A Communication-Time Tradeoff},
author={Christos H. Papadimitriou and Jeffrey D. Ullman},
pages={639--646},
journal=sicomp,
year=1987,
month=aug,
volume=16,
number=4
}

@Article{MitchellMP87,
title={The Discrete Geodesic Problem},
author={Joseph S. B. Mitchell and David M. Mount and Christos H.
Papadimitriou},
pages={647--668},
journal=sicomp,
year=1987,
month=aug,
volume=16,
number=4
}

@Article{GonzalezL87,
title={A 1.6 Approximation Algorithm for Routing Multiterminal Nets},
author={Teofilo F. Gonzalez and {Sing-Ling} Lee},
pages={669--704},
journal=sicomp,
year=1987,
month=aug,
volume=16,
number=4
}

@Article{OommenH87,
title={List Organizing Strategies Using Stochastic Move-to-Front and
Stochastic Move-to-Rear Operations},
author={B. John Oommen and E. R. Hansen},
pages={705--716},
journal=sicomp,
year=1987,
month=aug,
volume=16,
number=4
}

@Article{Wormald87,
title={Generating Random Unlabelled Graphs},
author={Nicholas C. Wormald},
pages={717--727},
journal=sicomp,
year=1987,
month=aug,
volume=16,
number=4
}

@Article{WidmayerWW87,
title={On Some Distance Problems in Fixed Orientations},
author={P. Widmayer and Y. F. Wu and C. K. Wong},
pages={728--746},
journal=sicomp,
year=1987,
month=aug,
volume=16,
number=4
}

@Article{HelmboldM87,
title={Two Processor Scheduling is in {$\mathcal{NC}$}},
author={David Helmbold and Ernst Mayr},
pages={747--759},
journal=sicomp,
year=1987,
month=aug,
volume=16,
number=4
}

@Article{Immerman87,
title={Languages that Capture Complexity Classes},
author={Neil Immerman},
pages={760--778},
journal=sicomp,
year=1987,
month=aug,
volume=16,
number=4
}

                         Volume 16, Number 5
                             October 1987

@Article{RosierY87,
title={Logspace Hierarchies, Polynomial Time and the Complexity of
Fairness Problems Concerning {$\omega$}-Machines},
author={Louis E. Rosier and {Hsu-Chun} Yen},
pages={779--807},
journal=sicomp,
year=1987,
month=oct,
volume=16,
number=5
}

@Article{AltHMP87,
title={Deterministic Simulation of Idealized Parallel Computers on More
Realistic Ones},
author={Helmut Alt and Torben Hagerup and Kurt Mehlhorn and Franco P.
Preparata},
pages={808--835},
journal=sicomp,
year=1987,
month=oct,
volume=16,
number=5
}

@Article{HuangY87,
title={A {DNF} without Regular Shortest Consensus Path},
author={Wenqui Huang and Xiangdong Yu},
pages={836--840},
journal=sicomp,
year=1987,
month=oct,
volume=16,
number=5
}

@Article{ChanM87,
title={Independent and Separable Database Schemes},
author={Edward P. F. Chan and Alberto O. Mendelzon},
pages={841--851},
journal=sicomp,
year=1987,
month=oct,
volume=16,
number=5
}

@Article{Kurtz87,
title={A Note on Randomized Polynomial Time},
author={Stuart A. Kurtz},
pages={852--853},
journal=sicomp,
year=1987,
month=oct,
volume=16,
number=5
}

@Article{Lubiw87,
title={Doubly Lexical Orderings of Matrices},
author={Anna Lubiw},
pages={854--879},
journal=sicomp,
year=1987,
month=oct,
volume=16,
number=5
}

@Article{McKenzieC87,
title={The Parallel Complexity of {Abelian} Permutation Group
Problems},
author={Pierre McKenzie and Stephen A. Cook},
pages={880--909},
journal=sicomp,
year=1987,
month=oct,
volume=16,
number=5,
preliminary={FOCS::McKenzieC1983:154}
}

@Article{HuntS87,
title={Nonlinear Algebra and Optimization on Rings Are ``Hard''},
author={Hunt III, H. B. and R. E. Stearns},
pages={910--929},
journal=sicomp,
year=1987,
month=oct,
volume=16,
number=5
}

@Article{Gathen87,
title={Computing Powers in Parallel},
author={Joachim von zur Gathen},
pages={930--945},
journal=sicomp,
year=1987,
month=oct,
volume=16,
number=5,
preliminary={FOCS::Gathen1984:31}
}

@Article{BeckerH87,
title={On the Optimal Layout of Planar Graphs with Fixed Boundary},
author={B. Becker and G. Hotz},
pages={946--972},
journal=sicomp,
year=1987,
month=oct,
volume=16,
number=5
}

                         Volume 16, Number 6
                            December 1987

@Article{PaigeT87,
title={Three Partition Refinement Algorithms},
author={Robert Paige and Robert E. Tarjan},
pages={973--989},
journal=sicomp,
year=1987,
month=dec,
volume=16,
number=6
}

@Article{YangHC87,
title={Optimal Parallel Sorting Scheme by Order Statistics},
author={Mark C. K. Yang and Jun S. Huang and {Yuan-Chieh} Chow},
pages={990--1003},
journal=sicomp,
year=1987,
month=dec,
volume=16,
number=6
}

@Article{Frederickson87,
title={Fast Algorithms for Shortest Paths in Planar Graphs, with
Applications},
author={Greg N. Frederickson},
pages={1004--1022},
journal=sicomp,
year=1987,
month=dec,
volume=16,
number=6,
preliminary={FOCS::Frederickson1983:242}
}

@Article{MoffatT87,
title={An All Pairs Shortest Path Algorithm with Expected Time {$O(n^2
\log n)$}},
author={Alistair Moffat and TAdao Takaoka},
pages={1023--1031},
journal=sicomp,
year=1987,
month=dec,
volume=16,
number=6
}

@Article{Pippenger87,
title={Sorting and Selecting in Rounds},
author={Nicholas Pippenger},
pages={1032--1038},
journal=sicomp,
year=1987,
month=dec,
volume=16,
number=6
}

@Article{Abrahamson87,
title={Generalized String Matching},
author={Karl Abrahamson},
pages={1039--1051},
journal=sicomp,
year=1987,
month=dec,
volume=16,
number=6
}

@Article{Frieze87,
title={On the Exact Solution of Random Travelling Salesman Problems
with Medium Size Integer Coefficients},
author={A. M. Frieze},
pages={1052--1072},
journal=sicomp,
year=1987,
month=dec,
volume=16,
number=6
}

@Article{HofriK87,
title={Padded Lists Revisited},
author={Micha Hofri and Alan G. Konheim},
pages={1073--114},
journal=sicomp,
year=1987,
month=dec,
volume=16,
number=6
}

@Article{Larmore87,
title={Height Restricted Optimal Binary Trees},
author={Lawrence L. Larmore},
pages={1115--1123},
journal=sicomp,
year=1987,
month=dec,
volume=16,
number=6
}

@Article{Scheinerman87,
title={Almost Sure Fault Tolerance in Random Graphs},
author={Edward R. Scheinerman},
pages={1124--1134},
journal=sicomp,
year=1987,
month=dec,
volume=16,
number=6
}

@Article{IbarraJ87,
title={On One-Way Cellular Arrays},
author={Oscar H. Ibarra and Tao Jiang},
pages={1135--1154},
journal=sicomp,
year=1987,
month=dec,
volume=16,
number=6
}

@Article{MorrisonSV87,
title={A Queueing Analysis of Hashing with Lazy Deletion},
author={John A. Morrison and Larry A. Shepp and Christopher J. Van
Wyk},
pages={1155--1164},
journal=sicomp,
year=1987,
month=dec,
volume=16,
number=6
}

                         Volume 17, Number 1
                            February 1988

@Article{Sagiv88,
title={On Bounded Database Schemes and Bounded {Horn}-Clause Programs},
author={Yehoshua Sagiv},
pages={1--22},
journal=sicomp,
year=1988,
month=feb,
volume=17,
number=1
}

@Article{FriesenK88,
title={Analysis of a Hybrid Algorithm for Packing Unequal Bins},
author={D. K. Friesen and F. S. Kuhl},
pages={23--40},
journal=sicomp,
year=1988,
month=feb,
volume=17,
number=1
}

@Article{MasudaN88,
title={An Optimal Algorithm for Finding a Maximum Independent Set of a
Circular-Arc Graph},
author={Sumio Masuda and Kazuo Nakajima},
pages={41--52},
journal=sicomp,
year=1988,
month=feb,
volume=17,
number=1
}

@Article{BienstockM88,
title={On the Complexity of Covering Vertices by Faces in a Planar
Graph},
author={Daniel Bienstock and Clyde L. Monma},
pages={53--76},
journal=sicomp,
year=1988,
month=feb,
volume=17,
number=1
}

@Article{KatajainenvP88,
title={Fast Simulation of {Turing} Machines by Random Access Machines},
author={Jyrki Katajainen and Jan van Leeuwen and Martti Penttonen},
pages={77--88},
journal=sicomp,
year=1988,
month=feb,
volume=17,
number=1
}

@Article{Fushimi88,
title={Designing a Uniform Random Number Generator Whose Subsequences
are {$k$}-Distributed},
author={Masanori Fushimi},
pages={89--99},
journal=sicomp,
year=1988,
month=feb,
volume=17,
number=1
}

@Article{FaigleT88,
title={Sorting and Recognition Problems for Ordered Sets},
author={U. Faigle and Gy. Tur{\'a}n},
pages={100--113},
journal=sicomp,
year=1988,
month=feb,
volume=17,
number=1
}

@Article{Nicol88,
title={Expected Performance of {$m$}-Solution Backtracking},
author={David M. Nicol},
pages={114--127},
journal=sicomp,
year=1988,
month=feb,
volume=17,
number=1
}

@Article{ColeV88,
title={Approximate Parallel Scheduling. {Part} {I}: The Basic
Technique with Applications to Optimal Parallel List Ranking in
Logarithmic Time},
author={Richard Cole and Uzi Vishkin},
pages={128--142},
journal=sicomp,
year=1988,
month=feb,
volume=17,
number=1
}

@Article{TarjanV88:143,
title={An {$O(n \log \log n)$}-Time Algorithm for Triangulating a
Simple Polygon},
author={Robert E. Tarjan and Christopher J. Van Wyk},
pages={143--178},
journal=sicomp,
year=1988,
month=feb,
volume=17,
number=1
}

                         Volume 17, Number 2
                              April 1988

                    Special Issue on Cryptography

@Article{Galil88,
title={Preface},
author={Zvi Galil},
pages={v--vii},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2
}

@Article{Bach88,
title={How to Generate Factored Random Numbers},
author={Eric Bach},
pages={179--193},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2,
preliminary={STOC::Bach1983:184}
}

@Article{AlexiCGS88,
title={{RSA} and {Rabin} Functions: Certain Parts Are as Hard as the
Whole},
author={Werner Alexi and Benny Chor and Oded Goldreich and Claus P.
Schnorr},
pages={194--209},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2
}

@Article{BennettBR88,
title={Privacy Amplification by Public Discussion},
author={Charles H. Bennett and Gilles Brassard and {Jean-Marc}
Robert},
pages={210--229},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2
}

@Article{ChorG88,
title={Unbiased Bits from Sources of Weak Randomness and Probabilistic
Communication Complexity},
author={Benny Chor and Oded Goldreich},
pages={230--261},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2
}

@Article{FriezeHKLS88,
title={Reconstructing Truncated Integer Variables Satisfying Linear
Congruences},
author={Alan M. Frieze and Johan Hastad and Ravi Kannan and Jeffrey C.
Lagarias and Adi Shamir},
pages={262--280},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2
}

@Article{GoldwasserMR88,
title={A Digital Signature Scheme Secure Against Adaptive
Chosen-Message Attacks},
author={Shafi Goldwasser and Silvio Micali and Ronald L. Rivest},
pages={281--308},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2
}

@Article{GrollmannS88,
title={Complexity Measures for Public-Key Cryptosystems},
author={Joachim Grollmann and Alan L. Selman},
pages={309--335},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2,
preliminary={FOCS::GrollmannS1984:495}
}

@Article{Hastad88,
title={Solving Simultaneous Modular Equations of Low Degree},
author={Johan Hastad},
pages={336--341},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2
}

@Article{LagariasR88,
title={Unique Extrapolation of Polynomial Recurrences},
author={Jeffrey C. Lagarias and James A. Reeds},
pages={342--362},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2
}

@Article{LongW88,
title={The Discrete Logarithm Hides {$O(\log n)$} Bits},
author={Douglas L. Long and Avi Wigderson},
pages={363--372},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2
}

@Article{LubyR88,
title={How to Construct Pseudorandom Permutations from Pseudorandom
Functions},
author={Michael Luby and Charles Rackoff},
pages={373--386},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2
}

@Article{PomeranceST88,
title={A Pipeline Architecture for Factoring Large Integers with the
Quadratic Sieve Algorithm},
author={Carl Pomerance and J. W. Smith and Randy Tuler},
pages={387--403},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2
}

@Article{ReifT88,
title={Efficient Parallel Pseudorandom Number Generation},
author={J. H. Reif and J. D. Tygar},
pages={404--411},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2
}

@Article{MicaliRS88,
title={The Notion of Security for Probabilistic Cryptosystems},
author={Silvio Micali and Charles Rackoff and Bob Sloan},
pages={412--426},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2
}

                         Volume 17, Number 3
                              June 1988

@Article{Chazelle88,
title={A Functional Approach to Data Structures and Its Use in
Multidimensional Searching},
author={Bernard Chazelle},
pages={427--462},
journal=sicomp,
year=1988,
month=jun,
volume=17,
number=3,
preliminary={FOCS::Chazelle1985:165}
}

@Article{KleinR88,
title={Parallel Time {$O(\log n)$} Acceptance of Deterministic {CFLs}
on an Exclusive-Write {P-RAM}},
author={Philip N. Klein and John H. Reif},
pages={463--485},
journal=sicomp,
year=1988,
month=jun,
volume=17,
number=3,
xxx-preliminary={FOCS::KleinR1986:465}
}

@Article{HeY88,
title={A Nearly Optimal Parallel Algorithm for Constructing Depth First
Spanning Trees in Planar Graphs},
author={Xin He and Yaacov Yesha},
pages={486--491},
journal=sicomp,
year=1988,
month=jun,
volume=17,
number=3
}

@Article{PittelY88,
title={On Search Times for Early-Insertion Coalesced Hashing},
author={Boris Pittel and {Jenn-Hwa} Yu},
pages={492--503},
journal=sicomp,
year=1988,
month=jun,
volume=17,
number=3
}

@Article{BookORW88,
title={Lowness Properties of Sets in the Exponential-Time Hierarchy},
author={R. Book and P. Orponen and D. Russo and O. Watanabe},
pages={504--516},
journal=sicomp,
year=1988,
month=jun,
volume=17,
number=3
}

@Article{Yao88,
title={Monotone Bipartite Graph Properties Are Evasive},
author={Andrew {Chi-Chih} Yao},
pages={517--520},
journal=sicomp,
year=1988,
month=jun,
volume=17,
number=3
}

@Article{DAtriM88,
title={Distance-Hereditary Graphs, {Steiner} Trees, and Connected
Domination},
author={Alessandro D'Atri and Marina Moscarini},
pages={521--538},
journal=sicomp,
year=1988,
month=jun,
volume=17,
number=3
}

@Article{HochbaumS88,
title={A Polynomial Approximation Scheme for Scheduling on Uniform
Processors: Using the Dual Approximation Approach},
author={Dorit S. Hochbaum and David B. Shmoys},
pages={539--551},
journal=sicomp,
year=1988,
month=jun,
volume=17,
number=3
}

@Article{Gusfield88:552,
title={A Graph Theoretic Approach to Statistical Data Security},
author={Dan Gusfield},
pages={552--571},
journal=sicomp,
year=1988,
month=jun,
volume=17,
number=3
}

@Article{Vaidya88,
title={Minimum Spanning Trees in {$k$}-Dimensional Space},
author={Pravin M. Vaidya},
pages={572--582},
journal=sicomp,
year=1988,
month=jun,
volume=17,
number=3
}

@Article{SiegelD88,
title={Some Geometry for General River Routing},
author={Alan Siegel and Danny Dolev},
pages={583--605},
journal=sicomp,
year=1988,
month=jun,
volume=17,
number=3
}

@Article{FichRW88,
title={Relations Between Concurrent-Write Models of Parallel
Computation},
author={Faith E. Fich and Prabhakar Ragde and Avi Wigderson},
pages={606--627},
journal=sicomp,
year=1988,
month=jun,
volume=17,
number=3
}

@Article{Long88,
title={Erratum: On Restricting the Size of Oracles Compared with
Restricting Access to Oracles},
author={Timothy J. Long},
pages={628},
journal=sicomp,
year=1988,
month=jun,
volume=17,
number=3
}

                         Volume 17, Number 4
                             August 1988

@Article{DershowitzMT88,
title={Existence, Uniqueness, and Construction of Rewrite Systems},
author={Nachum Dershowitz and Leo Marcus and Andrzej Tarlecki},
pages={629--639},
journal=sicomp,
year=1988,
month=aug,
volume=17,
number=4
}

@Article{John88,
title={A New Lower Bound for the Set-Partitioning Problem},
author={John Welliaveetil John},
pages={640--647},
journal=sicomp,
year=1988,
month=aug,
volume=17,
number=4
}

@Article{Schaback88,
title={On the Expected Sublinearity of the {Boyer-Moore} Algorithm},
author={R. Schaback},
pages={648--658},
journal=sicomp,
year=1988,
month=aug,
volume=17,
number=4
}

@Article{Vitanyi88,
title={Locality, Communication, and Interconnect Length in
Multicomputers},
author={Paul M. B. Vit{\'a}nyi},
pages={659--672},
journal=sicomp,
year=1988,
month=aug,
volume=17,
number=4
}

@Article{KuceraT88,
title={Isomorphism Testing of Unary Algebras},
author={Lud{\v{e}}k Ku{\v{c}}era and V{\v{e}}ra Trnkov{\'a}},
pages={673--686},
journal=sicomp,
year=1988,
month=aug,
volume=17,
number=4
}

@Article{MillerRK88,
title={Efficient Parallel Evaluation of Straight-Line Code and
Arithmetic Circuits},
author={Gary L. Miller and Vijaya Ramachandran and Erich Kaltofen},
pages={687--695},
journal=sicomp,
year=1988,
month=aug,
volume=17,
number=4
}

@Article{RaviL88,
title={The Complexity of Near-Optimal Programmable Logic Array
Folding},
author={S. S. Ravi and Errol L. Lloyd},
pages={696--710},
journal=sicomp,
year=1988,
month=aug,
volume=17,
number=4
}

@Article{DworkKS88,
title={Parallel Algorithms for Term Matching},
author={Cynthia Dwork and Paris C. Kanellakis and Larry Stockmeyer},
pages={711--731},
journal=sicomp,
year=1988,
month=aug,
volume=17,
number=4
}

@Article{AvisL88,
title={The Probabilistic Analysis of a Heuristic for the Assignment
Problem},
author={David Avis and C. W. Lai},
pages={732--741},
journal=sicomp,
year=1988,
month=aug,
volume=17,
number=4
}

@Article{Gusfield88:742,
title={The Structure of the Stable Roommate Problem: Efficient
Representation and Enumeration of all Stable Assignments},
author={Dan Gusfield},
pages={742--769},
journal=sicomp,
year=1988,
month=aug,
volume=17,
number=4
}

@Article{Cole88,
title={Parallel Merge Sort},
author={Richard Cole},
pages={770--785},
journal=sicomp,
year=1988,
month=aug,
volume=17,
number=4,
preliminary={FOCS::Cole1986:511}
}

@Article{Grandjean88,
title={A Natural {NP}-Complete Problem with a Nontrivial Lower Bound},
author={Etienne Grandjean},
pages={786--809},
journal=sicomp,
year=1988,
month=aug,
volume=17,
number=4
}

@Article{Gabow88,
title={Scheduling {UET} Systems on Two Uniform Processors and Length
Two Pipelines},
author={Harold N. Gabow},
pages={810--829},
journal=sicomp,
year=1988,
month=aug,
volume=17,
number=4
}

@Article{Clarkson88,
title={A Randomized Algorithm for Closest-Point Queries},
author={Kenneth L. Clarkson},
pages={830--847},
journal=sicomp,
year=1988,
month=aug,
volume=17,
number=4
}

                         Volume 17, Number 5
                             October 1988

@Article{AtallahK88,
title={Efficient Solutions to Some Transportation Problems with
Applications to Minimizing Robot Arm Travel},
author={Mikhail J. Atallah and S. Rao Kosaraju},
pages={849--869},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

@Article{EdelsbrunnerS88,
title={Probing Convex Polygons with {X}-Rays},
author={Herbert Edelsbrunner and Steven S. Skiena},
pages={870--882},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

@Article{KarpMR88,
title={Deferred Data Structuring},
author={Richard M. Karp and Rajeev Motwani and Prabhakar Raghavan},
pages={883--902},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

@Article{BookK88,
title={On Sets Truth-Table Reducible to Sparse Sets},
author={Ronald V. Book and {Ker-I} Ko},
pages={903--919},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

@Article{Provan88,
title={An Approximation Scheme for Finding {Steiner} Trees with
Obstacles},
author={J. Scott Provan},
pages={920--934},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

@Article{Immerman88,
title={Nondeterministic Space Is Closed under Complementation},
author={Neil Immerman},
pages={935--938},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

@Article{BloomE88,
title={Varieties of Iteration Theories},
author={Stephen L. Bloom and Zoltan Esik},
pages={939--966},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

@Article{DyerF88,
title={On the Complexity of Computing the Volume of a Polyhedron},
author={M. E. Dyer and A. M. Frieze},
pages={967--974},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

@Article{DworkPPU88,
title={Fault Tolerance in Networks of Bounded Degree},
author={Cynthia Dwork and David Peleg and Nicholas Pippenger and Eli
Upfal},
pages={975--988},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

@Article{Selman88,
title={Natural Self-Reducible Sets},
author={Alan L. Selman},
pages={989--996},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

@Article{Hennessy88,
title={Axiomatising Finite Concurrent Processes},
author={Matthew Hennessy},
pages={997--1017},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

@Article{Miller88,
title={A Linear Algorithm for Topological Bandwidth in Degree-Three
Trees},
author={Zevi Miller},
pages={1018--1035},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

@Article{Zellini88,
title={Optimal Bounds for Solving Tridiagonal Systems with
Preconditioning},
author={Paolo Zellini},
pages={1036--1043},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

@Article{McDiarmid88,
title={Average-Case Lower Bounds for Searching},
author={Colin McDiarmid},
pages={1044--1060},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

@Article{TarjanV88:1061,
title={Erratum: An {$O(n \log \log n)$}-Time Algorithm for
Triangulating a Simple Polygon},
author={Robert E. Tarjan and Christopher J. Van Wyk},
pages={1061},
journal=sicomp,
year=1988,
month=oct,
volume=17,
number=5
}

                         Volume 17, Number 6
                            December 1988

@Article{LengauerW88,
title={Efficient Solution of Connectivity Problems on Hierarchically
Defined Graphs},
author={Thomas Lengauer and Egon Wanke},
pages={1063--1080},
journal=sicomp,
year=1988,
month=dec,
volume=17,
number=6
}

@Article{Ben-OrFKT88,
title={A Fast Parallel Algorithm for Determining All Roots of a
Polynomial with Real Roots},
author={Michael Ben-Or and Ephraim Feig and Dexter Kozen and Prasoon
Tiwari},
pages={1081--1092},
journal=sicomp,
year=1988,
month=dec,
volume=17,
number=6,
preliminary={STOC::Ben-OrFKT1986:340}
}

@Article{MehlhornNA88,
title={A Lower Bound on the Complexity of the {Union-Split-Find}
Problem},
author={Kurt Mehlhorn and Stefan N{\"a}her and Helmut Alt},
pages={1093--1102},
journal=sicomp,
year=1988,
month=dec,
volume=17,
number=6
}

@Article{MorrisW88,
title={A Short-Term Neural Network Memory},
author={Robert J. T. Morris and Wing Shing Wong},
pages={1103--1118},
journal=sicomp,
year=1988,
month=dec,
volume=17,
number=6
}

@Article{BollobasB88,
title={Transitive Orientations of Graphs},
author={B{\'e}la Bollob{\'a}s and Graham Brightwell},
pages={1119--1133},
journal=sicomp,
year=1988,
month=dec,
volume=17,
number=6
}

@Article{BergstraKO88,
title={Readies and Failures in the Algebra of Communicating Processes},
author={J. A. Bergstra and J. W. Klop and {E.-R.} Olderog},
pages={1134--1177},
journal=sicomp,
year=1988,
month=dec,
volume=17,
number=6
}

@Article{AlonA88,
title={The Average Complexity of Deterministic and Randomized Parallel
Comparison-Sorting Algorithms},
author={N. Alon and Y. Azar},
pages={1178--1192},
journal=sicomp,
year=1988,
month=dec,
volume=17,
number=6
}

@Article{AllenderR88,
title={{P}-Printable Sets},
author={ERic W. Allender and Roy S. Rubinstein},
pages={1193--1202},
journal=sicomp,
year=1988,
month=dec,
volume=17,
number=6
}

@Article{Knight88,
title={Search in an Ordered Array Having Variable Probe Cost},
author={William J. Knight},
pages={1203--1214},
journal=sicomp,
year=1988,
month=dec,
volume=17,
number=6
}

@Article{KongMR88,
title={The Decomposition of a Rectangle into Rectangles of Minimal
Perimeter},
author={T. Y. Kong and David M. Mount and A. W. Roscoe},
pages={1215--1231},
journal=sicomp,
year=1988,
month=dec,
volume=17,
number=6
}

@Article{CaiGHHSWW88,
title={The {Boolean} Hierarchy {I}: Structural Properties},
author={{Jin-Yi} Cai and Thomas Gundermann and Juris Hartmanis and
Lane A. Hemachandra and Vivian Sewelson and Klaus Wagner and Gerd
Wechsung},
pages={1232--1252},
journal=sicomp,
year=1988,
month=dec,
volume=17,
number=6
}

@Article{SchieberV88,
title={On Finding Lowest Common Ancestors: Simplification and
Parallelization},
author={Baruch Schieber and Uzi Vishkin},
pages={1253--1262},
journal=sicomp,
year=1988,
month=dec,
volume=17,
number=6
}

@Article{Kadin88,
title={The Polynomial Time Hierarchy Collapses if the {Boolean}
Hierarchy Collapses},
author={Jim Kadin},
pages={1263--1282},
journal=sicomp,
year=1988,
month=dec,
volume=17,
number=6
}

                         Volume 18, Number 1
                            February 1989

@Article{WestbrookT89,
title={Amortized Analysis of Algorithms for Set Union with
Backtracking},
author={Jeffery Westbrook and Robert E. Tarjan},
pages={1--11},
journal=sicomp,
year=1989,
month=feb,
volume=18,
number=1
}

@Article{AbrahamsonAGHK89,
title={The Bit Complexity of Randomized Leader Election on a Ring},
author={Karl Abrahamson and Andrew Adler and Rachel Gelbart and Lisa
Higham and David Kirkpatrick},
pages={12--29},
journal=sicomp,
year=1989,
month=feb,
volume=18,
number=1
}

@Article{GalloGT89,
title={A Fast Parametric Maximum Flow Algorithm and Applications},
author={Giorgio Gallo and Michael D. Grigoriadis and Robert E.
Tarjan},
pages={30--55},
journal=sicomp,
year=1989,
month=feb,
volume=18,
number=1
}

@Article{Wilber89,
title={Lower Bounds for Accessing Binary Search Trees with Rotations},
author={Robert Wilber},
pages={56--67},
journal=sicomp,
year=1989,
month=feb,
volume=18,
number=1,
preliminary={FOCS::Wilber1986:61}
}

@Article{KorteM89,
title={An Incremental Linear-Time Algorithm for Recognizing Interval
Graphs},
author={Norbert Korte and Rolf H. M{\"o}hring},
pages={68--81},
journal=sicomp,
year=1989,
month=feb,
volume=18,
number=1
}

@Article{Larmore89,
title={Minimum Delay Codes},
author={Lawrence L. Larmore},
pages={82--94},
journal=sicomp,
year=1989,
month=feb,
volume=18,
number=1
}

@Article{CaiGHHSWW89,
title={The {Boolean} Hierarchy {II}: Applications},
author={{Jin-Yi} Cai and Thomas Gundermann and Juris Hartmanis and
Lane A. Hemachandra and Vivan Sewelson and Klaus Wagner and Gerd
Wechsung},
pages={95--111},
journal=sicomp,
year=1989,
month=feb,
volume=18,
number=1
}

@Article{FredericksonS89,
title={Algorithms and Data Structures for an Expanded Family of Matroid
Intersection Problems},
author={Greg N. Frederickson and Mandayam A. Srinivas},
pages={112--138},
journal=sicomp,
year=1989,
month=feb,
volume=18,
number=1
}

@Article{RheeT89:139,
title={Optimal Bin Packing with Items of Random Sizes {II}},
author={Wansoo T. Rhee and Michel Talagrand},
pages={139--151},
journal=sicomp,
year=1989,
month=feb,
volume=18,
number=1
}

@Article{Ordman89,
title={Minimal Threshold Separators and Memory Requirements for
Synchronization},
author={Edward T. Ordman},
pages={152--165},
journal=sicomp,
year=1989,
month=feb,
volume=18,
number=1
}

@Article{CoffmanL89,
title={Algorithms for Packing Squares: A Probabilistic Analysis},
author={Coffman, Jr., E. G. and J. C. Lagarias},
pages={166--185},
journal=sicomp,
year=1989,
month=feb,
volume=18,
number=1
}

@Article{GoldwasserMR89,
title={The Knowledge Complexity of Interactive Proof Systems},
author={Shafi Goldwasser and Silvio Micali and Charles Rackoff},
pages={186--208},
journal=sicomp,
year=1989,
month=feb,
volume=18,
number=1,
preliminary={STOC::GoldwasserMR1985:291}
}

                         Volume 18, Number 2
                              April 1989

@Article{Lickteig89,
title={A Lower Bound on the Complexity of Division in Finite Extension
Fields and Inversion in Quadratic Alternative Algebras},
author={Thomas Lickteig},
pages={209--215},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2
}

@Article{BilardiN89,
title={Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for
Shared-Memory Machines},
author={Gianfranco Bilardi and Alexandru Nicolau},
pages={216--228},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2
}

@Article{PelegU89:229,
title={The Token Distribution Problem},
author={David Peleg and Eli Upfal},
pages={229--243},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2,
preliminary={FOCS::PelegU1986:418}
}

@Article{HwangCAL89,
title={Scheduling Precedence Graphs in Systems with Interprocessor
Communication Times},
author={{Jing-Jang} Hwang and {Yuan-Chieh} Chow and Frank D. Anger and
{Chung-Yee} Lee},
pages={244--257},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2
}

@Article{AlonA89,
title={Finding an Approximate Maximum},
author={N. Alon and Y. Azar},
pages={258--267},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2
}

@Article{Bar-NoyBKLW89,
title={Bounds on Universal Sequences},
author={Amotz Bar-Noy and Allan Borodin and Mauricio Karchmer and
Nathan Linial and Michael Werman},
pages={268--277},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2
}

@Article{SteeleS89,
title={Worst-Case Growth Rates of Some Classical Problems of
Combinatorial Optimization},
author={J. Michael Steele and Timothy Law Snyder},
pages={278--287},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2
}

@Article{HagerupCD89,
title={Optimal Parallel 5-Colouring of Planar Graphs},
author={Torben Hagerup and Marek Chrobak and Krzysztof Diks},
pages={288--300},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2
}

@Article{MelenT89,
title={Nonblocking Multirate Networks},
author={Riccardo Melen and Jonathan S. Turner},
pages={301--313},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2
}

@Article{LeungY89,
title={Minimizing Schedule Length Subject to Minimum Flow Time},
author={Joseph {Y-T.} Leung and Gilbert H. Young},
pages={314--326},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2
}

@Article{NaorNS89,
title={Fast Parallel Algorithms for Chordal Graphs},
author={Joseph Naor and Moni Naor and Alejandro Sch{\"a}ffer},
pages={327--349},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2,
preliminary={STOC::NaorNS1987:355}
}

@Article{Renegar89,
title={On the Worst-Case Arithmetic Complexity of Approximating Zeros
of Systems of Polynomials},
author={James Renegar},
pages={350--370},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2
}

@Article{YaoDEP89,
title={Partitioning Space for Range Queries},
author={F. Frances Yao and David P. Dobkin and Herbert Edelsbrunner
and Michael S. Paterson},
pages={371--384},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2
}

@Article{Iwama89,
title={{CNF} Satisfiability Test by Counting and Polynomial Average
Time},
author={Kazuo Iwama},
pages={385--391},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2
}

@Article{Ko89,
title={Relativized Polynomial Time Hierarchies Having Exactly {$K$}
Levels},
author={{Ker-I} Ko},
pages={392--408},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2,
preliminary={STOC::Ko1988:245}
}

@Article{BugraraPP89,
title={Exponential Average Time for the Pure Literal Rule},
author={Khaled M. Bugrara and Youfang Pan and Purdom, Jr., Paul
Walton},
pages={409--418},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2
}

@Article{GoldbergS89,
title={A New Parallel Algorithm for the Maximal Independent Set
Problem},
author={Mark Goldberg and Thomas Spencer},
pages={419--427},
journal=sicomp,
year=1989,
month=apr,
volume=18,
number=2
}

                         Volume 18, Number 3
                              June 1989

@Article{Chan89,
title={A Design Theory for Solving the Anomalies Problem},
author={Edward P. F. Chan},
pages={429--448},
journal=sicomp,
year=1989,
month=jun,
volume=18,
number=3
}

@Article{TangW89,
title={On Tally Relativizations of {$BP$}-Complexity Classes},
author={Shouwen Tang and Osamu Watanabe},
pages={449--462},
journal=sicomp,
year=1989,
month=jun,
volume=18,
number=3
}

@Article{Li89,
title={Dynamic Programming by Exchangeability},
author={{Shuo-Yen} Robert Li},
pages={463--472},
journal=sicomp,
year=1989,
month=jun,
volume=18,
number=3
}

@Article{RheeT89:473,
title={Optimal Bin Packing with Items of Random Sizes {III}},
author={Wansoo T. Rhee and Michel Talagrand},
pages={473--486},
journal=sicomp,
year=1989,
month=jun,
volume=18,
number=3
}

@Article{RheeT89:487,
title={Optimal Bin Covering with Items of Random Size},
author={Wansoon T. Rhee and Michel Talagrand},
pages={487--498},
journal=sicomp,
year=1989,
month=jun,
volume=18,
number=3
}

@Article{AtallahCG89,
title={Cascading Divide-and-Conquer: A Technique for Designing Parallel
Algorithms},
author={Mikhail J. Atallah and Richard Cole and Michael T. Goodrich},
pages={499--532},
journal=sicomp,
year=1989,
month=jun,
volume=18,
number=3
}

@Article{VenkateswaranT89,
title={A New Pebble Game That Characterizes Parallel Complexity
Classes},
author={H. Venkateswaran and Martin Tompa},
pages={533--549},
journal=sicomp,
year=1989,
month=jun,
volume=18,
number=3,
preliminary={FOCS::VenkateswaranT1986:348}
}

@Article{FurstK89,
title={Succinct Certificates for Almost All Subset Sum Problems},
author={Merrick L. Furst and Ravi Kannan},
pages={550--558},
journal=sicomp,
year=1989,
month=jun,
volume=18,
number=3
}

@Article{BorodinCDRT89:559,
title={Two Applications of Inductive Counting for Complementation
Problems},
author={Allan Borodin and Stephen A. Cook and Patrick W. Dymond and
Walter L. Ruzzo and Martin Tompa},
pages={559--578},
journal=sicomp,
year=1989,
month=jun,
volume=18,
number=3
}

@Article{BarahonaT89,
title={Note on {Weintraub's} Minimum-Cost Circulation Algorithm},
author={Francisco Barahona and {\'E}va Tardos},
pages={579--583},
journal=sicomp,
year=1989,
month=jun,
volume=18,
number=3
}

@Article{Clausen89,
title={Fast {Fourier} Transforms for Metabelian Groups},
author={Michael Clausen},
pages={584--593},
journal=sicomp,
year=1989,
month=jun,
volume=18,
number=3
}

@Article{RajasekaranR89,
title={Optimal and Sublogarithmic Time Randomized Parallel Sorting
Algorithms},
author={Sanguthevar Rajasekaran and John H. Reif},
pages={594--607},
journal=sicomp,
year=1989,
month=jun,
volume=18,
number=3,
xxx-preliminary={FOCS18}
}

@Article{Norton89,
title={Precise Analyses of the Right- and Left-Shift Greatest Common
Divisor Algorithms for {$GF(q)[x]$}},
author={G. H. Norton},
pages={608--624},
journal=sicomp,
year=1989,
month=jun,
volume=18,
number=3
}

@Article{Immerman89,
title={Expressibility and Parallel Complexity},
author={Neil Immerman},
pages={},
journal=sicomp,
year=1989,
month=jun,
volume=18,
number=3
}

                         Volume 18, Number 4
                             August 1989

@Article{LabahnC89,
title={Matrix {Pad\'e} Fractions and Their Computation},
author={George Labahn and Stan Cabay},
pages={639--657},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4
}

@Article{Iliopoulos89:658,
title={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},
author={Costas S. Iliopoulos},
pages={658--669},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4
}

@Article{Iliopoulos89:670,
title={Worst-Case Complexity Bounds on Algorithms for Computing the
Canonical Structure of Infinite {Abelian} Groups and Solving Systems of
Linear {Diophantine} Equations},
author={Costas S. Iliopoulos},
pages={670--678},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4
}

@Article{Yao89,
title={On the Complexity of Partial Order Productions},
author={Andrew {Chi-Chih} Yao},
pages={679--689},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4
}

@Article{SimonsW89,
title={A Fast Algorithm for Multiprocessor Scheduling of Unit-Length
Jobs},
author={Barbara B. Simons and Manfred K. Warmuth},
pages={690--710},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4
}

@Article{GalilHY89,
title={Minimum-Knowledge Interactive Proofs for Decision Problems},
author={Zvi Galil and Stuart Haber and Moti Yung},
pages={711--739},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4,
preliminary={FOCS::GalilHY1985:360}
}

@Article{PelegU89:740,
title={An Optimal Synchronizer for the Hypercube},
author={David Peleg and Jeffrey D. Ullman},
pages={740--747},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4
}

@Article{Vaidya89:748,
title={Space-Time Trade-Offs for Orthogonal Range Queries},
author={Pravin M. Vaidya},
pages={748--758},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4,
preliminary={STOC::Vaidya1985:169}
}

@Article{Bshouty89,
title={A Lower Bound for Matrix Multiplication},
author={Nader H. Bshouty},
pages={759--765},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4,
preliminary={FOCS::Bshouty1988:64}
}

@Article{Bennett89,
title={Time/Space Trade-Offs for Reversible Computation},
author={Charles H. Bennett},
pages={766--776},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4
}

@Article{JacquetS89,
title={Ultimate Characterizations of the Burst Response of an Interval
Searching Algorithm: A Study of a Functional Equation},
author={Philippe Jacquet and Wojciech Szpankowski},
pages={777--791},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4
}

@Article{ColeSSS89,
title={An Optimal-Time Algorithm for Slope Selection},
author={Richard Cole and Jeffrey S. Salowe and W. L.  Steiger and
Endre Szemer{\'e}di},
pages={792--810},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4
}

@Article{PreparataT89,
title={Fully Dynamic Point Location in a Monotone Subdivision},
author={Franco P. Preparata and Roberto Tamassia},
pages={811--830},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4,
preliminary={FOCS::PreparataT1988:558}
}

@Article{CulikPY89,
title={On the Limit Sets of Cellular Automata},
author={Culik II, Karel and Jan Pachl and Sheng Yu},
pages={831--842},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4
}

@Article{FredericksonJ89,
title={Efficient Message Routing in Planar Networks},
author={Greg N. Frederickson and Ravi Janardan},
pages={843--857},
journal=sicomp,
year=1989,
month=aug,
volume=18,
number=4,
preliminary={FOCS::FredericksonJ1986:428}
}

                         Volume 18, Number 5
                             October 1989

@Article{HastadJLS89,
title={Polynomial Time Algorithms for Finding Integer Relations among
Real Numbers},
author={J. Hastad and B. Just and J. C. Lagarias and C. P. Schnorr},
pages={859--881},
journal=sicomp,
year=1989,
month=oct,
volume=18,
number=5
}

@Article{AnilyH89,
title={Ranking the Best Binary Trees},
author={S. Anily and R. Hassin},
pages={882--892},
journal=sicomp,
year=1989,
month=oct,
volume=18,
number=5
}

@Article{Cherry89,
title={An Analysis of the Rational Exponential Integral},
author={G. W. Cherry},
pages={893--905},
journal=sicomp,
year=1989,
month=oct,
volume=18,
number=5
}

@Article{VermaR89,
title={An Analysis of a Good Algorithm for the Subtree Problem,
Corrected},
author={Rakesh Verma and Steven W. Reyner},
pages={906--908},
journal=sicomp,
year=1989,
month=oct,
volume=18,
number=5
}

@Article{RheeT89:909,
title={The Complete Convergence of Best Fit Decreasing},
author={Wansoo T. Rhee and Michel Talagrand},
pages={909--918},
journal=sicomp,
year=1989,
month=oct,
volume=18,
number=5
}

@Article{RheeT89:919,
title={The Complete Convergence of First Fit Decreasing},
author={Wansoo T. Rhee and Michel Talagrand},
pages={919--938},
journal=sicomp,
year=1989,
month=oct,
volume=18,
number=5
}

@Article{AhujaOT89,
title={Improved Time Bounds for the Maximum Flow Problem},
author={Ravindra K. Ahuja and James B. Orlin and Robert E. Tarjan},
pages={939--954},
journal=sicomp,
year=1989,
month=oct,
volume=18,
number=5
}

@Article{Eberly89,
title={Very Fast Parallel Polynomial Arithmetic},
author={Wayne Eberly},
pages={955--976},
journal=sicomp,
year=1989,
month=oct,
volume=18,
number=5,
preliminary={FOCS::Eberly1984:21}
}

@Article{Doberkat89,
title={Topological Completeness in an Ideal Model for Polymorphic
Types},
author={{Ernst-Erich} Doberkat},
pages={977--989},
journal=sicomp,
year=1989,
month=oct,
volume=18,
number=5
}

@Article{CoanDDS89,
title={The Distributed Firing Squad Problem},
author={Brian A. Coan and Danny Dolev and Cynthia Dwork and Larry
Stockmeyer},
pages={990--1012},
journal=sicomp,
year=1989,
month=oct,
volume=18,
number=5
}

@Article{GabowT89,
title={Faster Scaling Algorithms for Network Problems},
author={Harold N. Gabow and Robert E. Tarjan},
pages={1013--1036},
journal=sicomp,
year=1989,
month=oct,
volume=18,
number=5
}

@Article{BrownFP89,
title={A New Base Change Algorithm for Permutation Groups},
author={Cynthia A. Brown and Larry Finkelstein and Purdom, Jr., Paul
W.},
pages={1037--1047},
journal=sicomp,
year=1989,
month=oct,
volume=18,
number=5
}

@Article{Humenik89,
title={Ratio Estimators Are Maximum-Likelihood Estimators for
Non-Context-Free Grammars},
author={Keith Humenik},
pages={1048--1055},
journal=sicomp,
year=1989,
month=oct,
volume=18,
number=5
}

                         Volume 18, Number 6
                            December 1989

@Article{CheriyanM89,
title={Analysis of Preflow Push Algorithms for Maximum Network Flow},
author={J. Cheriyan and S. N. Maheshwari},
pages={1057--1086},
journal=sicomp,
year=1989,
month=dec,
volume=18,
number=6
}

@Article{Ladner89,
title={Polynomial Space Counting Problems},
author={Richard E. Ladner},
pages={1087--1097},
journal=sicomp,
year=1989,
month=dec,
volume=18,
number=6
}

@Article{BernsteinJR89,
title={Scheduling Arithmetic and Load Operations in Parallel with No
Spilling},
author={David Bernstein and Jeffrey M. Jaffe and Michael Rodeh},
pages={1098--1127},
journal=sicomp,
year=1989,
month=dec,
volume=18,
number=6
}

@Article{Rappaport89,
title={Computing Simple Circuits from a Set of Line Segments Is
{NP}-Complete},
author={David Rappaport},
pages={1128--1139},
journal=sicomp,
year=1989,
month=dec,
volume=18,
number=6
}

@Article{VaziraniV89,
title={The Two-Processor Scheduling Problem Is in Random {NC}},
author={Umesh V. Vazirani and Vijay V. Vazirani},
pages={1140--1148},
journal=sicomp,
year=1989,
month=dec,
volume=18,
number=6
}

@Article{JerrumS89,
title={Approximating the Permanent},
author={Mark Jerrum and Alistair Sinclair},
pages={1149--1178},
journal=sicomp,
year=1989,
month=dec,
volume=18,
number=6,
preliminary={STOC::JerrumS1988:235}
}

@Article{SchimmlerS89,
title={A Correction Network for {$N$}-Sorters},
author={Manfred Schimmler and Christoph Starke},
pages={1179--1187},
journal=sicomp,
year=1989,
month=dec,
volume=18,
number=6
}

@Article{LiR89,
title={Solution of a Divide-and-Conquer Maximin Recurrence},
author={Zhiyuan Li and Edward M. Reingold},
pages={1188--1200},
journal=sicomp,
year=1989,
month=dec,
volume=18,
number=6
}

@Article{Vaidya89:1201,
title={Geometry Helps in Matching},
author={Pravin M. Vaidya},
pages={1201--1225},
journal=sicomp,
year=1989,
month=dec,
volume=18,
number=6
}

@Article{ChenS89,
title={On Relaxed Squashed Embedding of Graphs into a Hypercube},
author={{Ming-Syan} Chen and Kang G. Shin},
pages={1226--1244},
journal=sicomp,
year=1989,
month=dec,
volume=18,
number=6
}

@Article{ZhangS89,
title={Simple Fast Algorithms for the Editing Distance Between Trees
and Related Problems},
author={Kaizhong Zhang and Dennis Shasha},
pages={1245--1262},
journal=sicomp,
year=1989,
month=dec,
volume=18,
number=6
}

@Article{RavikumarI89,
title={Relating the Type of Ambiguity of Finite Automata to the
Succinctness of Their Representation},
author={Bala Ravikumar and Oscar H. Ibarra},
pages={1263--1282},
journal=sicomp,
year=1989,
month=dec,
volume=18,
number=6
}

@Article{BorodinCDRT89:1283,
title={Erratum: Two Applications of Inductive Counting for
Complementation Problems},
author={Allan Borodin and Stephen A. Cook and Patrick W. Dymond and
Walter L. Ruzzo and Martin Tompa},
pages={1283},
journal=sicomp,
year=1989,
month=dec,
volume=18,
number=6
}

                         Volume 19, Number 1
                            February 1990

@Article{PalisSW90,
title={An Optimal Linear-Time Parallel Parser for Tree Adjoining
Languages},
author={Michael A. Palis and Sunil Shende and David S. L. Wei},
pages={1--31},
journal=sicomp,
year=1990,
month=feb,
volume=19,
number=1
}

@Article{HentzelJ90,
title={Complexity and Unsolvability Properties of Nilpotency},
author={I. R. Hentzel and D. Pokrass Jacobs},
pages={32--43},
journal=sicomp,
year=1990,
month=feb,
volume=19,
number=1
}

@Article{HuntS90,
title={The Complexity of Very Simple {Boolean} Formulas with
Applications},
author={Hunt III, H. B. and R. E. Stearns},
pages={44--70},
journal=sicomp,
year=1990,
month=feb,
volume=19,
number=1
}

@Article{NgH90,
title={Lower Bounds for the Stable Marriage Problem and Its Variants},
author={Cheng Ng and Daniel S. Hirschberg},
pages={71--77},
journal=sicomp,
year=1990,
month=feb,
volume=19,
number=1
}

@Article{YokouchiH90,
title={A Rewriting System for Categorical Combinators with Multiple
Arguments},
author={Hirofumi Yokouchi and Teruo Hikita},
pages={78--97},
journal=sicomp,
year=1990,
month=feb,
volume=19,
number=1
}

@Article{LabahnCC90,
title={The Inverses of Block {Hankel} and Block {Toeplitz} Matrices},
author={George Labahn and Dong Koo Choi and Stan Cabay},
pages={98--123},
journal=sicomp,
year=1990,
month=feb,
volume=19,
number=1
}

@Article{Friedman90:124,
title={A Density Theorem for Purely Iterative Zero Finding Methods},
author={Joel Friedman},
pages={124--132},
journal=sicomp,
year=1990,
month=feb,
volume=19,
number=1
}

@Article{Dowling90,
title={A Fast Parallel {Horner} Algorithm},
author={Michael L. Dowling},
pages={133--142},
journal=sicomp,
year=1990,
month=feb,
volume=19,
number=1
}

@Article{Gusfield90,
title={Very Simple Methods for all Pairs Network Flow Analysis},
author={Dan Gusfield},
pages={143--155},
journal=sicomp,
year=1990,
month=feb,
volume=19,
number=1
}

@Article{Scheinerman90,
title={On the Expected Capacity of Binomial and Random Concentrators},
author={Edward R. Scheinerman},
pages={156--163},
journal=sicomp,
year=1990,
month=feb,
volume=19,
number=1
}

@Article{FredericksonJ90:164,
title={Space-Efficient Message Routing in {$c$}-Decomposable
Networks},
author={Greg N. Frederickson and Ravi Janardan},
pages={164--181},
journal=sicomp,
year=1990,
month=feb,
volume=19,
number=1,
preliminary={FOCS::FredericksonJ1986:428}
}

@Article{Hoover90,
title={Feasible Real Functions and Arithmetic Circuits},
author={H. James Hoover},
pages={182--204},
journal=sicomp,
year=1990,
month=feb,
volume=19,
number=1
}

@Article{FredericksonJ90:205,
title={Erratum: Generalized Selection and Ranking: Sorted Matrices},
author={Greg N. Frederickson and Donald B. Johnson},
pages={205--206},
journal=sicomp,
year=1990,
month=feb,
volume=19,
number=1
}

                         Volume 19, Number 2
                              April 1990

@Article{KutylowskiLL90,
title={Reversal Complexity Classes for Alternating {Turing} Machines},
author={Miros{\l}aw Kuty{\l}owski and Maciej Li{\'s}kiewicz and
Krzysztof Lory{\'s}},
pages={207--221},
journal=sicomp,
year=1990,
month=apr,
volume=19,
number=2
}

@Article{Whitehead90,
title={The Complexity of File Transfer Scheduling with Forwarding},
author={Jennifer Whitehead},
pages={222--245},
journal=sicomp,
year=1990,
month=apr,
volume=19,
number=2
}

@Article{BilardiP90,
title={Characterization of Associative Operations with Prefix Circuits
of Constant Depth and Linear Size},
author={G. Bilardi and F. P. Preparata},
pages={246--255},
journal=sicomp,
year=1990,
month=apr,
volume=19,
number=2
}

@Article{PelegU90,
title={A Time-Randomness Trade-Off for Oblivious Routing},
author={David Peleg and Eli Upfal},
pages={256--266},
journal=sicomp,
year=1990,
month=apr,
volume=19,
number=2,
preliminary={STOC::PelegU1988:43}
}

@Article{Plaisted90,
title={A Heuristic Algorithm for Small Separators in Arbitrary Graphs},
author={David A. Plaisted},
pages={267--280},
journal=sicomp,
year=1990,
month=apr,
volume=19,
number=2
}

@Article{SanchisF90,
title={On the Efficient Generation of Language Instances},
author={Laura A. Sanchis and Mark A. Fulk},
pages={281--296},
journal=sicomp,
year=1990,
month=apr,
volume=19,
number=2
}

@Article{AgarwalS90,
title={Red-Blue Intersection Detection Algorithms, with Applications to
Motion Planning and Collision Detection},
author={Pankaj K. Agarwal and Micha Sharir},
pages={297--321},
journal=sicomp,
year=1990,
month=apr,
volume=19,
number=2
}

@Article{PapadimitriouY90,
title={Towards an Architecture-Independent Analysis of Parallel
Algorithms},
author={Christos H. Papadimitriou and Mihalis Yannakakis},
pages={322--328},
journal=sicomp,
year=1990,
month=apr,
volume=19,
number=2
}

@Article{FloydK90,
title={Addition Machines},
author={Robert W. Floyd and Donald E. Knuth},
pages={329--340},
journal=sicomp,
year=1990,
month=apr,
volume=19,
number=2
}

@Article{Rutten90,
title={Semantic Correctness for a Parallel Object-Oriented Language},
author={J. J. M. M. Rutten},
pages={341--383},
journal=sicomp,
year=1990,
month=apr,
volume=19,
number=2
}

@Article{Wilson90,
title={On the Decomposability of {$NC$} and {$AC$}},
author={Christopher B. Wilson},
pages={384--396},
journal=sicomp,
year=1990,
month=apr,
volume=19,
number=2
}

@Article{AggarwalAK90,
title={Parallel Depth-First Search in General Directed Graphs},
author={Alok Aggarwal and Richard J. Anderson and {Ming-Yang} Kao},
pages={397--409},
journal=sicomp,
year=1990,
month=apr,
volume=19,
number=2,
preliminary={STOC::aggarwalak1989:297}
}

                         Volume 19, Number 3
                              June 1990

@Article{Molzan90,
title={Expressibility and Nonuniform Complexity Classes},
author={B. Molzan},
pages={411--423},
journal=sicomp,
year=1990,
month=jun,
volume=19,
number=3
}

@Article{Seidl90,
title={Deciding Equivalence of Finite Tree Automata},
author={Helmut Seidl},
pages={424--437},
journal=sicomp,
year=1990,
month=jun,
volume=19,
number=3
}

@Article{Grandjean90,
title={A Nontrivial Lower Bound for an {NP} Problem on Automata},
author={Etienne Grandjean},
pages={438--451},
journal=sicomp,
year=1990,
month=jun,
volume=19,
number=3
}

@Article{BshoutyK90,
title={Multiplication of Polynomials over Finite Fields},
author={Nader H. Bshouty and Michael Kaminski},
pages={452--456},
journal=sicomp,
year=1990,
month=jun,
volume=19,
number=3
}

@Article{Ye90,
title={A Class of Projective Transformations for Linear Programming},
author={Yinyu Ye},
pages={457--466},
journal=sicomp,
year=1990,
month=jun,
volume=19,
number=3
}

@Article{Bshouty90,
title={Maximal Rank of {$m \times n \times (mn - k)$} Tensors},
author={Nader H. Bshouty},
pages={467--471},
journal=sicomp,
year=1990,
month=jun,
volume=19,
number=3
}

@Article{DworkSS90,
title={Flipping Persuasively in Constant Time},
author={Cynthia Dwork and David Shmoys and Larry Stockmeyer},
pages={472--499},
journal=sicomp,
year=1990,
month=jun,
volume=19,
number=3,
preliminary={FOCS::DworkSS1986:222}
}

@Article{Eppstein90,
title={Reset Sequences for Monotonic Automata},
author={David Eppstein},
pages={500--510},
journal=sicomp,
year=1990,
month=jun,
volume=19,
number=3
}

@Article{LiskiewiczL90,
title={Fast Simulations of Time-Bounded One-Tape {Turing} Machines by
Space-Bounded Ones},
author={Maciej Li{\'s}kiewicz and Krzysztof Lory{\'s}},
pages={511--521},
journal=sicomp,
year=1990,
month=jun,
volume=19,
number=3
}

@Article{Beigel90,
title={Unbounded Searching Algorithms},
author={Richard Beigel},
pages={522--537},
journal=sicomp,
year=1990,
month=jun,
volume=19,
number=3
}

@Article{Sakkalis90,
title={The {Euclidean} Algorithm and the Degree of the {Gauss} Map},
author={Takis Sakkalis},
pages={538--543},
journal=sicomp,
year=1990,
month=jun,
volume=19,
number=3
}

@Article{AnnexsteinBR90,
title={Group Action Graphs and Parallel Architectures},
author={Fred Annexstein and Marc Baumslag and Arnold L. Rosenberg},
pages={544--569},
journal=sicomp,
year=1990,
month=jun,
volume=19,
number=3
}

@Article{WagnerC90,
title={Embedding Trees in a Hypercube is {NP}-Complete},
author={A. Wagner and D. G. Corneil},
pages={570--590},
journal=sicomp,
year=1990,
month=jun,
volume=19,
number=3
}

@Article{Vaishnavi90,
title={Erratum: Weighted Leaf {AVL}-Trees},
author={Vijay K. Vaishnavi},
pages={591},
journal=sicomp,
year=1990,
month=jun,
volume=19,
number=3
}

                         Volume 19, Number 4
                             August 1990

@Article{Mount90,
title={The Number of Shortest Paths on the Surface of a Polyhedron},
author={David M. Mount},
pages={593--611},
journal=sicomp,
year=1990,
month=aug,
volume=19,
number=4
}

@Article{ChinT90,
title={Improving the Time Complexity of Message-Optimal Distributed
Algorithms for Minimum-Weight Spanning Trees},
author={F. Chin and H. F. Ting},
pages={612--626},
journal=sicomp,
year=1990,
month=aug,
volume=19,
number=4
}

@Article{JoverKLR90,
title={On the Analysis of Synchronous Computing Systems},
author={J. M. Jover and T. Kailath and H. Lev-Ari and S. K. Rao},
pages={627--643},
journal=sicomp,
year=1990,
month=aug,
volume=19,
number=4
}

@Article{Dezani-CiancagliniV90,
title={Partial Types and Intervals},
author={M. Dezani-Ciancaglini and B. Venneri},
pages={644--568},
journal=sicomp,
year=1990,
month=aug,
volume=19,
number=4
}

@Article{Jackson90,
title={Shortest Circuit Covers and Postman Tours in Graphs with a
Nowhere Zero 4-Flow},
author={Bill Jackson},
pages={659--665},
journal=sicomp,
year=1990,
month=aug,
volume=19,
number=4
}

@Article{FriezeMR90,
title={Greedy Matching on the Line},
author={Alan Frieze and Colin McDiarmid and Bruce Reed},
pages={666--672},
journal=sicomp,
year=1990,
month=aug,
volume=19,
number=4
}

@Article{LevinS90,
title={A Note on {Bennett's} Time-Space Tradeoff for Reversible
Computation},
author={Robert Y. Levin and Alan T. Sherman},
pages={673--677},
journal=sicomp,
year=1990,
month=aug,
volume=19,
number=4
}

@Article{Hagerup90,
title={Planar Depth-First Search in {$O(\log n)$} Parallel Time},
author={Torben Hagerup},
pages={678--704},
journal=sicomp,
year=1990,
month=aug,
volume=19,
number=4
}

@Article{Rhee90,
title={A Note on Optimal Bin Packing and Optimal Bin Covering with
Items of Random Size},
author={Wansoo T. Rhee},
pages={705--710},
journal=sicomp,
year=1990,
month=aug,
volume=19,
number=4
}

@Article{Stinson90,
title={Some Observations on Parallel Algorithms for Fast Exponentiation
in {$\mathrm{GF}(2^n)$}},
author={D. R. Stinson},
pages={711--717},
journal=sicomp,
year=1990,
month=aug,
volume=19,
number=4
}

@Article{FichW90,
title={Toward Understanding Exclusive Read},
author={Faith E. Fich and Avi Wigderson},
pages={718--727},
journal=sicomp,
year=1990,
month=aug,
volume=19,
number=4
}

@Article{MunshiS90,
title={Scheduling Sequential Loops on Parallel Processors},
author={Ashfaq A. Munshi and Barbara Simons},
pages={728--741},
journal=sicomp,
year=1990,
month=aug,
volume=19,
number=4
}

@Article{Krentel90,
title={On Finding and Verifying Locally Optimal Solutions},
author={Mark W. Krentel},
pages={742--749},
journal=sicomp,
year=1990,
month=aug,
volume=19,
number=4
}

@Article{Dube90,
title={The Structure of Polynomial Ideals and {Gr\"obner} Bases},
author={Thomas Dub{\'e}},
pages={750--773},
journal=sicomp,
year=1990,
month=aug,
volume=19,
number=4
}

                         Volume 19, Number 5
                             October 1990

@Article{SchmidtS90,
title={The Spatial Complexity of Oblivious {$k$}-Probe Hash Functions},
author={Jeanette P. Schmidt and Alan Siegel},
pages={775--786},
journal=sicomp,
year=1990,
month=oct,
volume=19,
number=5
}

@Article{Gradel90,
title={Domino Games and Complexity},
author={Erich Gr{\"a}del},
pages={787--804},
journal=sicomp,
year=1990,
month=oct,
volume=19,
number=5
}

@Article{CypherSS90,
title={The {Hough} Transform has {$O(N)$} Complexity on {$N \times N$}
Mesh Connected Computers},
author={R. E. Cypher and J. L. C. Sanz and L. Snyder},
pages={805--820},
journal=sicomp,
year=1990,
month=oct,
volume=19,
number=5
}

@Article{DevroyeL90,
title={An Analysis of Random {$d$}-Dimensional Quad Trees},
author={Luc Devroye and Louise Laforest},
pages={821--832},
journal=sicomp,
year=1990,
month=oct,
volume=19,
number=5
}

@Article{Wagner90,
title={Bounded Query Classes},
author={Klaus W. Wagner},
pages={833--846},
journal=sicomp,
year=1990,
month=oct,
volume=19,
number=5
}

@Article{LiC90,
title={On Three-Dimensional Packing},
author={Keqin Li and {Kam-Hoi} Cheng},
pages={847--867},
journal=sicomp,
year=1990,
month=oct,
volume=19,
number=5
}

@Article{Lucas90,
title={Postorder Disjoint Set Union is Linear},
author={Joan M. Lucas},
pages={868--882},
journal=sicomp,
year=1990,
month=oct,
volume=19,
number=5
}

@Article{IwanoS90,
title={A Semiring on Convex Polygons and Zero-Sum Cycle Problems},
author={Kazuo Iwano and Kenneth Steiglitz},
pages={883--901},
journal=sicomp,
year=1990,
month=oct,
volume=19,
number=5,
preliminary={STOC::IwanoS1987:46}
}

@Article{MehlhornNR90,
title={On the Complexity of a Game Related to the Dictionary Problem},
author={K. Mehlhorn and St. N{\"a}her and M. Rauch},
pages={902--906},
journal=sicomp,
year=1990,
month=oct,
volume=19,
number=5
}

@Article{Bienstock90,
title={Linear-Time Test for Small Face Covers in any Fixed Surface},
author={D. Bienstock},
pages={907--911},
journal=sicomp,
year=1990,
month=oct,
volume=19,
number=5
}

@Article{ReifT90,
title={Optimal Size Integer Division Circuits},
author={John H. Reif and Stephen R. Tate},
pages={912--924},
journal=sicomp,
year=1990,
month=oct,
volume=19,
number=5
}

@Article{JohnstoneB90,
title={Sorting Points Along an Algebraic Curve},
author={John K. Johnstone and Chanderjit L. Bajaj},
pages={925--967},
journal=sicomp,
year=1990,
month=oct,
volume=19,
number=5
}

@Article{ApostolicoALM90,
title={Efficient Parallel Algorithms for String Editing and Related
Problems},
author={Alberto Apostolico and Mikhail J. Atallah and Lawrence L.
Larmore and Scott McFaddin},
pages={968--988},
journal=sicomp,
year=1990,
month=oct,
volume=19,
number=5
}

                         Volume 19, Number 6
                            December 1990

@Article{GalilP90,
title={An Improved Algorithm for Approximate String Matching},
author={Zvi Galil and Kunsoo Park},
pages={989--999},
journal=sicomp,
year=1990,
month=dec,
volume=19,
number=6
}

@Article{LuekerMR90,
title={Linear Programming with Two Variables Per Inequality in Poly-Log
Time},
author={George S. Lueker and Nimrod Megiddo and Vijaya Ramachandran},
pages={1000--1010},
journal=sicomp,
year=1990,
month=dec,
volume=19,
number=6
}

@Article{DworkS90,
title={A Time Complexity Gap for Two-Way Probabilistic Finite-State
Automata},
author={Cynthia Dwork and Larry Stockmeyer},
pages={1011--1023},
journal=sicomp,
year=1990,
month=dec,
volume=19,
number=6
}

@Article{SugiharaSY90,
title={The Seqrchlight Scheduling Problem},
author={Kazuo Sugihara and Ichiro Suzuki and Masafumi Yamashita},
pages={1024--1040},
journal=sicomp,
year=1990,
month=dec,
volume=19,
number=6
}

@Article{LeeSW90,
title={Minimum Cuts for Circular-Arc Graphs},
author={D. T. Lee and M. Sarrafzadeh and Y. F. Wu},
pages={1041--1050},
journal=sicomp,
year=1990,
month=dec,
volume=19,
number=6
}

@Article{BreslauerG90,
title={An Optimal {$O(\log \log n)$} Time Parallel String Matching
Algorithm},
author={Dany Breslauer and Zvi Galil},
pages={1051--1058},
journal=sicomp,
year=1990,
month=dec,
volume=19,
number=6
}

@Article{GrigorievKS90,
title={Fast Parallel Algorithms for sparse Multivariate Polynomial
Interpolation Over Finite Fields},
author={Dima Yu. Grigoriev and Marek Karpinski and Michael F. Singer},
pages={1059--1063},
journal=sicomp,
year=1990,
month=dec,
volume=19,
number=6
}

@Article{AlonKW90,
title={Linear Circuits Over {$\mathrm{GF}(2)$}},
author={Noga Alon and Mauricio Karchmer and Avi Wigderson},
pages={1064--1067},
journal=sicomp,
year=1990,
month=dec,
volume=19,
number=6
}

@Article{Friedman90:1068,
title={Random Polynomials and Approximate Zeros of {Newton's} Method},
author={Joel Friedman},
pages={1068--1099},
journal=sicomp,
year=1990,
month=dec,
volume=19,
number=6
}

@Article{Lutz90,
title={Category and Measure in Complexity Classes},
author={Jack H. Lutz},
pages={1100--1131},
journal=sicomp,
year=1990,
month=dec,
volume=19,
number=6
}

@Article{Murota90,
title={Computing {Puiseux}-Series Solutions to Determinantal Equations
via Combinatorial Relaxation},
author={Kazuo Murota},
pages={1132--1161},
journal=sicomp,
year=1990,
month=dec,
volume=19,
number=6
}

                         Volume 20, Number 1
                            February 1991

@Article{Duval91,
title={Absolute Factorization of Polynomials: A Geometric Approach},
author={Dominique Duval},
pages={1--21},
journal=sicomp,
year=1991,
month=feb,
volume=20,
number=1
}

@Article{Vishkin91,
title={Deterministic Sampling---A New Technique for Fast Pattern
Matching},
author={Uzi Vishkin},
pages={22--40},
journal=sicomp,
year=1991,
month=feb,
volume=20,
number=1
}

@Article{GuM91,
title={Amplification of Bounded Depth Monotone Read-Once {Boolean}
Formulae},
author={Qian Ping Gu and Akira Maruoka},
pages={41--55},
journal=sicomp,
year=1991,
month=feb,
volume=20,
number=1
}

@Article{SchafferY91,
title={Simple Local Search Problems that are Hard to Solve},
author={Alejandro A. Sch{\"a}ffer and Mihalis Yannakakis},
pages={56--87},
journal=sicomp,
year=1991,
month=feb,
volume=20,
number=1
}

@Article{ParberryY91,
title={Improved Upper and Lower Time Bounds for Parallel Random Access
Machines without Simultaneous Writes},
author={Ian Parberry and Pei Yuan Yan},
pages={88--99},
journal=sicomp,
year=1991,
month=feb,
volume=20,
number=1
}

@Article{UllmanY91,
title={High-Probability Parallel Transitive-Closure Algorithms},
author={Jeffrey D. Ullman and Mihalis Yannakakis},
pages={100--125},
journal=sicomp,
year=1991,
month=feb,
volume=20,
number=1
}

@Article{Tung91,
title={Complexity of Sentences over Number Rings},
author={Shih Ping Tung},
pages={126--143},
journal=sicomp,
year=1991,
month=feb,
volume=20,
number=1
}

@Article{ChrobakL91,
title={An Optimal On-Line Algorithm for {$k$}-Servers on Trees},
author={Marek Chrobak and Lawrence L. Larmore},
pages={144--148},
journal=sicomp,
year=1991,
month=feb,
volume=20,
number=1
}

@Article{SutnerSS91,
title={The Complexity of the Residual Node Connectedness Reliability
Problem},
author={K. Sutner and A. Satyanarayana and C. Suffel},
pages={149--155},
journal=sicomp,
year=1991,
month=feb,
volume=20,
number=1
}

@Article{ReingoldS91:156,
title={More Nearly Optimal Algorithms for Unbounded Searching, Part
{I}: The Finite Case},
author={Edward M. Reingold and Xiaojun Shen},
pages={156--183},
journal=sicomp,
year=1991,
month=feb,
volume=20,
number=1
}

@Article{ReingoldS91:184,
title={More Nearly Optimal Algorithms for Unbounded Searching, Part
{II}: The Transfinite Case},
author={Edward M. Reingold and Xiaojun Shen},
pages={184--208},
journal=sicomp,
year=1991,
month=feb,
volume=20,
number=1
}

                         Volume 20, Number 2
                              April 1991

@Article{BalasX91,
title={Minimum Weighted Coloring of Triangulated Graphs, with
Application to Maximum Weight Vertex Packing and Clique Finding in
Arbitrary Graphs},
author={Egon Balas and Jue Xue},
pages={209--221},
journal=sicomp,
year=1991,
month=apr,
volume=20,
number=2
}

@Article{Matousek91,
title={Approximate Levels in Line Arrangements},
author={Ji{\v{r}}{\'\i} Matou{\v{s}}ek},
pages={222--227},
journal=sicomp,
year=1991,
month=apr,
volume=20,
number=2
}

@Article{JaJaC91,
title={Parallel Algorithms for Channel Routing in the Knock-Knee
Model},
author={Joseph J{\'a}J{\'a} and {Shing-Chong} Chang},
pages={228--245},
journal=sicomp,
year=1991,
month=apr,
volume=20,
number=2
}

@Article{Book91,
title={Some Observations on Separating Complexity Classes},
author={Ronald V. Book},
pages={246--258},
journal=sicomp,
year=1991,
month=apr,
volume=20,
number=2
}

@Article{EdelsbrunnerS91,
title={An {$O(n \log^2 h)$} Time Algorithm for the Three-Dimensional
Convex Hull Problem},
author={Herbert Edelsbrunner and Weiping Shi},
pages={259--269},
journal=sicomp,
year=1991,
month=apr,
volume=20,
number=2
}

@Article{Beame91,
title={A General Sequential Time-Space Tradeoff for Finding Unique
Elements},
author={Paul Beame},
pages={270--277},
journal=sicomp,
year=1991,
month=apr,
volume=20,
number=2
}

@Article{IbarraJ91,
title={The Power of Alternating One-Reversal Counters and Stacks},
author={Oscar H. Ibarra and Tao Jiang},
pages={278--290},
journal=sicomp,
year=1991,
month=apr,
volume=20,
number=2
}

@Article{RothB91,
title={Interpolation and Approximation of Sparse Multivariate
Polynomials over {$GF(2)$}},
author={Ron M. Roth and Gyora M. Benedek},
pages={291--314},
journal=sicomp,
year=1991,
month=apr,
volume=20,
number=2
}

@Article{MansourST91,
title={Lower Bounds for Computations with the Floor Operation},
author={Yishay Mansour and Baruch Schieber and Prasoon Tiwari},
pages={315--327},
journal=sicomp,
year=1991,
month=apr,
volume=20,
number=2
}

@Article{Natarajan91,
title={Probably Approximate Learning of Sets and Functions},
author={B. K. Natarajan},
pages={328--351},
journal=sicomp,
year=1991,
month=apr,
volume=20,
number=2
}

@Article{KhullerS91,
title={Efficient Parallel Algorithms for Testing {$k$}-Connectivity
and Finding Disjoint {$s$}-{$t$} Paths in Graphs},
author={Samir Khuller and Baruch Schieber},
pages={352--375},
journal=sicomp,
year=1991,
month=apr,
volume=20,
number=2
}

@Article{AfekG91,
title={Time and Message Bounds for Election in Synchronous and
Asynchronous Complete Networks},
author={Yehuda Afek and Eli Gafni},
pages={376--394},
journal=sicomp,
year=1991,
month=apr,
volume=20,
number=2
}

@Article{GritzmannHK91,
title={Good and Bad Radii of Convex Polygons},
author={Peter Gritzmann and Laurent Habsieger and Victor Klee},
pages={395--403},
journal=sicomp,
year=1991,
month=apr,
volume=20,
number=2
}

@Article{Kadin91,
title={Erratum: The Polynomial Time Hierarchy Collapses If the
{Boolean} Hierarchy Collapses},
author={Jim Kadin},
pages={404},
journal=sicomp,
year=1991,
month=apr,
volume=20,
number=2
}

                         Volume 20, Number 3
                              June 1991

@Article{MarcotteS91,
title={Fast Matching Algorithms for Points on a Polygon},
author={Odile Marcotte and Subhash Suri},
pages={405--422},
journal=sicomp,
year=1991,
month=jun,
volume=20,
number=3
}

@Article{WolfsonS91,
title={The Communication Complexity of Atomic Commitment and of
Gossiping},
author={Ouri Wolfson and Adrian Segall},
pages={423--450},
journal=sicomp,
year=1991,
month=jun,
volume=20,
number=3
}

@Article{BaumC91,
title={Some Lower and Upper Complexity Bounds for Generalized
{Fourier} Transforms and Their Inverses},
author={Ulrich Baum and Michael Clausen},
pages={451--459},
journal=sicomp,
year=1991,
month=jun,
volume=20,
number=3
}

@Article{PachS91,
title={On Vertical Visibility in Arrangements of Segments and the
Queue Size in the {Bentley-Ottmann} Line Sweeping Algorithm},
author={J{\'a}nos Pach and Micha Sharir},
pages={460--470},
journal=sicomp,
year=1991,
month=jun,
volume=20,
number=3
}

@Article{OgiwaraW91,
title={On Polynomial-Time Bounded Truth-Table Reducibility of {NP}
Sets to Sparse Sets},
author={Mitsunori Ogiwara and Osamu Watanabe},
pages={471--483},
journal=sicomp,
year=1991,
month=jun,
volume=20,
number=3
}

@Article{Geffert91,
title={Nondeterministic Computations in Sublogarithmic Space and Space
Constructibility},
author={Viliam Geffert},
pages={484--498},
journal=sicomp,
year=1991,
month=jun,
volume=20,
number=3
}

@Article{Zwick91,
title={A {$4n$} Lower Bound on the Combinational Complexity of Certain
Symmetric {Boolean} Functions over the Basis of Unate Dyadic {Boolean}
Functions},
author={Uri Zwick},
pages={499--505},
journal=sicomp,
year=1991,
month=jun,
volume=20,
number=3
}

@Article{GoldsmithHJY91,
title={Near-Testable Sets},
author={Judy Goldsmith and Lane E. Hemachandra and Deborah Joseph and
Paul Young},
pages={506--523},
journal=sicomp,
year=1991,
month=jun,
volume=20,
number=3
}

@Article{GoldbergS91,
title={Compression and Ranking},
author={Andrew V. Goldberg and Michael Sipser},
pages={524--536},
journal=sicomp,
year=1991,
month=jun,
volume=20,
number=3,
preliminary={STOC::GoldbergS1985:440}
}

@Article{ShihLC91,
title={Algorithms for Scheduling Imprecise Computations with Timing
Constraints},
author={{Wei-Kuan} Shih and Jane W. S. Liu and {Jen-Yao} Chung},
pages={537--552},
journal=sicomp,
year=1991,
month=jun,
volume=20,
number=3
}

@Article{CloteK91,
title={Boolean Functions, Invariance Groups, and Parallel Complexity},
author={Peter Clote and Evangelos Kranakis},
pages={553--590},
journal=sicomp,
year=1991,
month=jun,
volume=20,
number=3
}

@Article{Gathen91,
title={Tests for Permutation Polynomials},
author={Joachim von zur Gathen},
pages={591--602},
journal=sicomp,
year=1991,
month=jun,
volume=20,
number=3,
preliminary={FOCS::Gathen1989:88}
}

                         Volume 20, Number 4
                             August 1991

@Article{MehlhornY91,
title={Constructive {Whitney-Graustein} Theorem: Or How to Untangle
Closed Planar Curves},
author={Kurt Mehlhorn and {Chee-Keng} Yap},
pages={603--621},
journal=sicomp,
year=1991,
month=aug,
volume=20,
number=4
}

@Article{ChenY91,
title={Reversal Complexity},
author={{Jian-er} Chen and {Chee-Keng} Yap},
pages={622--638},
journal=sicomp,
year=1991,
month=aug,
volume=20,
number=4
}

@Article{Gusfield91,
title={Computing the Strength of a Graph},
author={Dan Gusfield},
pages={639--654},
journal=sicomp,
year=1991,
month=aug,
volume=20,
number=4
}

@Article{Yao91,
title={Lower Bounds for Algebraic Computation Trees with Integer
Inputs},
author={Andrew {Chi-Chih} Yao},
pages={655--668},
journal=sicomp,
year=1991,
month=aug,
volume=20,
number=4
}

@Article{ReutenauerS91,
title={Minimization of Rational Word Functions},
author={Christophe Reutenauer and {Marcel-Paul} Schutzenberger},
pages={669--685},
journal=sicomp,
year=1991,
month=aug,
volume=20,
number=4
}

@Article{Sutter91,
title={The Fast m-Transform: A Fast Computation of Cross-Correlations
with Binary m-Sequences},
author={Erich E. Sutter},
pages={686--694},
journal=sicomp,
year=1991,
month=aug,
volume=20,
number=4
}

@Article{Dyer91,
title={On Counting Lattice Points in Polyhedra},
author={Martin Dyer},
pages={695--707},
journal=sicomp,
year=1991,
month=aug,
volume=20,
number=4
}

@Article{TamassiaV91,
title={Parallel Transitive Closure and Point Location in Planar
Structures},
author={Roberto Tamassia and Jeffrey S. Vitter},
pages={708--725},
journal=sicomp,
year=1991,
month=aug,
volume=20,
number=4
}

@Article{ChungR91,
title={On Nonblocking Multirate Interconnection Networks},
author={{Shun-Ping} Chung and Keith W. Ross},
pages={726--736},
journal=sicomp,
year=1991,
month=aug,
volume=20,
number=4
}

@Article{Goodrich91,
title={Intersecting Line Segments in Parallel with an Output-Sensitive
Number of Processors},
author={Michael T. Goodrich},
pages={737--755},
journal=sicomp,
year=1991,
month=aug,
volume=20,
number=4
}

@Article{DavidaL91,
title={Fast Parallel Arithmetic via Modular Representation},
author={George I. Davida and Bruce Litow},
pages={756--765},
journal=sicomp,
year=1991,
month=aug,
volume=20,
number=4
}

@Article{Pigozzi91,
title={Equality-Test and If-Then-Else Algebras: Axiomatization and
Specification},
author={Don Pigozzi},
pages={766--805},
journal=sicomp,
year=1991,
month=aug,
volume=20,
number=4
}

                         Volume 20, Number 5
                             October 1991

@Article{Kenyon-MathieuV91,
title={The Maximum Size of Dynamic Data Structures},
author={Claire M. Kenyon-Mathieu and Jeffrey Scott Vitter},
pages={807--823},
journal=sicomp,
year=1991,
month=oct,
volume=20,
number=5
}

@Article{Kutylowski91,
title={Time Complexity of {Boolean} Functions on {CREW PRAMs}},
author={Miros{\l}aw Kuty{\l}owski},
pages={824--833},
journal=sicomp,
year=1991,
month=oct,
volume=20,
number=5
}

@Article{Chan91,
title={Embedding of Grids into Optimal Hypercubes},
author={Mee Yee Chan},
pages={834--864},
journal=sicomp,
year=1991,
month=oct,
volume=20,
number=5
}

@Article{Toda91,
title={{PP} Is as Hard as the Polynomial-Time Hierarchy},
author={Seinosuke Toda},
pages={865--877},
journal=sicomp,
year=1991,
month=oct,
volume=20,
number=5
}

@Article{Pippenger91,
title={Selection Networks},
author={Nicholas Pippenger},
pages={878--887},
journal=sicomp,
year=1991,
month=oct,
volume=20,
number=5
}

@Article{GhoshM91,
title={An Output-Sensitive Algorithm for Computing Visibility Graphs},
author={Subir Kumar Ghosh and David M. Mount},
pages={888--910},
journal=sicomp,
year=1991,
month=oct,
volume=20,
number=5,
preliminary={FOCS::GhoshM1987:11}
}

@Article{LiV91,
title={Learning Simple Concept under Simple Distributions},
author={Ming Li and Paul M. B. Vit{\'a}nyi},
pages={911--935},
journal=sicomp,
year=1991,
month=oct,
volume=20,
number=5,
preliminary={FOCS::LiV1989:34}
}

@Article{LuoT91,
title={On the Communication Complexity of Solving a Polynomial
Equation},
author={{Zhi-Quan} Luo and John N. Tsitsiklis},
pages={936--950},
journal=sicomp,
year=1991,
month=oct,
volume=20,
number=5
}

@Article{Friedman91,
title={The Spectra of Infinite Hypertrees},
author={Joel Friedman},
pages={951--961},
journal=sicomp,
year=1991,
month=oct,
volume=20,
number=5
}

@Article{Ko91,
title={On the Complexity of Learning Minimum Time-Bounded {Turing}
Machines},
author={{Ker-I} Ko},
pages={962--986},
journal=sicomp,
year=1991,
month=oct,
volume=20,
number=5
}

@Article{HoLCW91,
title={Minimum Diameter Spanning Trees and Related Problems},
author={{Jan-Ming} Ho and D. T. Lee and {Chia-Hsiang} Chang and C. K.
Wong},
pages={987--997},
journal=sicomp,
year=1991,
month=oct,
volume=20,
number=5
}

@Article{Landau91,
title={Erratum: Factoring Polynomials over Algebraic Number Fields},
author={Susan Landau},
pages={998},
journal=sicomp,
year=1991,
month=oct,
volume=20,
number=5
}

                         Volume 20, Number 6
                            December 1991

@Article{Nisan91,
title={{CREW PRAMs} and Decision Trees},
author={Noam Nisan},
pages={999--1007},
journal=sicomp,
year=1991,
month=dec,
volume=20,
number=6
}

@Article{GalilG91,
title={On the Exact Complexity of String Matching: Lower Bounds},
author={Zvi Galil and Raffaele  Giancarlo},
pages={1008--1020},
journal=sicomp,
year=1991,
month=dec,
volume=20,
number=6
}

@Article{Rubinstein91,
title={Self-{P}-Printability and Polynomial Time {Turing} Equivalence
to a Tally Set},
author={Roy S. Rubinstein},
pages={1021--1033},
journal=sicomp,
year=1991,
month=dec,
volume=20,
number=6
}

@Article{OvermarsY91,
title={New Upper Bounds in {Klee's} Measure Problem},
author={Mark H. Overmars and {Chee-Keng} Yap},
pages={1034--1045},
journal=sicomp,
year=1991,
month=dec,
volume=20,
number=6
}

@Article{Gazit91,
title={An Optimal Randomized Parallel Algorithm for Finding Connected
Components in a Graph},
author={Hillel Gazit},
pages={1046--1067},
journal=sicomp,
year=1991,
month=dec,
volume=20,
number=6
}

@Article{HafnerM91,
title={Asymptotically Fast Triangularization of Matrices over Rings},
author={James L. Hafner and Kevin S. McCurley},
pages={1068--1083},
journal=sicomp,
year=1991,
month=dec,
volume=20,
number=6,
preliminary={SODA::HafnerM1990:194}
}

@Article{BlumDMP91,
title={Noninteractive Zero-Knowledge},
author={Manuel Blum and Alfredo De Santis and Silvio Micali and
Giuseppe Persiano},
pages={1084--1118},
journal=sicomp,
year=1991,
month=dec,
volume=20,
number=6
}

@Article{Franco91,
title={Elimination of Infrequent Variables Improves Average Case
Performance of Satisfiability Algorithms},
author={John Franco},
pages={1119--1127},
journal=sicomp,
year=1991,
month=dec,
volume=20,
number=6
}

@Article{MillerR91,
title={Parallel Tree Contraction, Part 2: Further Applications},
author={Gary L. Miller and John H. Reif},
pages={1128--1147},
journal=sicomp,
year=1991,
month=dec,
volume=20,
number=6,
preliminary={FOCS::MillerR1985:478}
}

@Article{HemachandraH91,
title={On Sets with Efficient Implicit Membership Tests},
author={Lane A. Hemachandra and Albrecht Hoene},
pages={1148--1156},
journal=sicomp,
year=1991,
month=dec,
volume=20,
number=6
}

@Article{GalilM91,
title={An Almost Linear-Time Algorithm for the Dense Subset-Sum
Problem},
author={Zvi Galil and Oded Margalit},
pages={1157--1189},
journal=sicomp,
year=1991,
month=dec,
volume=20,
number=6
}

                         Volume 21, Number 1
                            February 1992

@Article{HalperinOS92,
title={Efficient Motion Planning for an {$L$}-Shaped Object},
author={Dan Halperin and Mark H. Overmars and Micha Sharir},
pages={1--23},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1
}

@Article{Baeza-YatesCDM92,
title={On the Average Size of the Intersection of Binary Trees},
author={R. Baeza-Yates and R. Casas and J. D{\'\i}az and C.
Mart{\'\i}nez},
pages={24--32},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1
}

@Article{BruckS92,
title={Polynomial Threshold Functions, {$AC^0$} Functions, and
Spectral Norms},
author={Jehoshua Bruck and Roman Smolensky},
pages={33--42},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1
}

@Article{Gereb-GrausK92,
title={The Average Complexity of Parallel Comparison Merging},
author={Mih{\'a}ly Ger{\'e}b-Graus and Danny Krizanc},
pages={43--47},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1
}

@Article{DevroyeSR92,
title={A Note on the Height of Suffix Trees},
author={Luc Devroye and Wojciech Szpankowski and Bonita Rais},
pages={48--53},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1
}

@Article{Ben-OrC92,
title={Computing Algebraic Formulas Using a Constant Number of
Registers},
author={Michael Ben-Or and Richard Cleve},
pages={54--58},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1,
preliminary={STOC::Ben-OrC1988:254}
}

@Article{Tsai92,
title={Asymptotic Analysis of an Algorithm for Balanced Parallel
Processor Scheduling},
author={{Li-Hui} Tsai},
pages={59--64},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1
}

@Article{Hendrickson92,
title={Conditions for Unique Graph Realizations},
author={Bruce Hendrickson},
pages={65--84},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1
}

@Article{Landau92,
title={Simplification of Nested Radicals},
author={Susan Landau},
pages={85--110},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1
}

@Article{KrummeCV92,
title={Gossiping in Minimal Time},
author={David W. Krumme and George Cybenko and K. N. Venkataraman},
pages={111--139},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1
}

@Article{GoldbergPST92,
title={Using Interior-Point Methods for Fast Parallel Algorithms for
Bipartite Matching and Related Problems},
author={Andrew V. Goldberg and Serge A. Plotkin and David B. Shmoys
and Eva Tardos},
pages={140--150},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1
}

@Article{BhattCLR92,
title={Efficient Embeddings of Trees in Hypercubes},
author={Sandeep N. Bhatt and Fan R. K. Chung and F. Thomson Leighton
and Arnold L. Rosenberg},
pages={151--162},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1
}

@Article{Snyder92,
title={On the Exact Location of {Steiner} Points in General
Dimension},
author={Timothy Law Snyder},
pages={163--180},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1
}

@Article{FischerS92,
title={On Learning Ring-Sum-Expansions},
author={Paul Fischer and Hans Ulrich Simon},
pages={181--192},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1
}

@Article{Linial92,
title={Locality in Distributed Graph Algorithms},
author={Nathan Linial},
pages={193--201},
journal=sicomp,
year=1992,
month=feb,
volume=21,
number=1
}

                         Volume 21, Number 2
                              April 1992

@Article{BuiP92,
title={Partitioning Planar Graphs},
author={Thang Nguyen Bui and Andrew Peck},
pages={203--215},
journal=sicomp,
year=1992,
month=apr,
volume=21,
number=2
}

@Article{Tzeng92,
title={A Polynomial-Time Algorithm for the Equivalence of Probabilistic
Automata},
author={{Wen-Guey} Tzeng},
pages={216--227},
journal=sicomp,
year=1992,
month=apr,
volume=21,
number=2,
preliminary={FOCS::Tzeng1989:268}
}

@Article{MenezesvV92,
title={Subgroup Refinement Algorithms for Root Finding in {$GF(q)$}},
author={A. J. Menezes and P. C. van Oorschot and S. A. Vanstone},
pages={228--239},
journal=sicomp,
year=1992,
month=apr,
volume=21,
number=2
}

@Article{HelmboldSW92,
title={Learning Integer Lattices},
author={David Helmbold and Robert Sloan and Manfred K. Warmuth},
pages={240--266},
journal=sicomp,
year=1992,
month=apr,
volume=21,
number=2
}

@Article{PreparataT92,
title={Efficient Point Location in a Convex Spatial Cell-Complex},
author={Franco P. Preparata and Roberto Tamassia},
pages={267--280},
journal=sicomp,
year=1992,
month=apr,
volume=21,
number=2
}

@Article{WangC92,
title={A Heuristic of Scheduling Parallel Tasks and Its Analysis},
author={Qingzhou Wang and Kam Hoi Cheng},
pages={281--294},
journal=sicomp,
year=1992,
month=apr,
volume=21,
number=2
}

@Article{Chen92,
title={Heuristic Sampling: A Method for Predicting the Performance of
Tree Searching Programs},
author={Pang C. Chen},
pages={295--315},
journal=sicomp,
year=1992,
month=apr,
volume=21,
number=2
}

@Article{TodaO92,
title={Counting Classes Are at Least as Hard as the Polynomial-Time
Hierarchy},
author={Seinosuke Toda and Mitsunori Ogiwara},
pages={316--328},
journal=sicomp,
year=1992,
month=apr,
volume=21,
number=2
}

@Article{Azar92,
title={Lower Bounds for Threshold and Symmetric Functions in Parallel
Computation},
author={Yossi Azar},
pages={329--338},
journal=sicomp,
year=1992,
month=apr,
volume=21,
number=2
}

@Article{BajajD92,
title={Convex Decomposition of Polyhedra and Robustness},
author={Chanderjit L. Bajaj and Tamal K. Dey},
pages={339--364},
journal=sicomp,
year=1992,
month=apr,
volume=21,
number=2
}

@Article{Krumme92,
title={Fast Gossiping for the Hypercube},
author={David W. Krumme},
pages={365--380},
journal=sicomp,
year=1992,
month=apr,
volume=21,
number=2
}

@Article{JamisonO92,
title={Recognizing {$P_4$} Sparse Graphs in Linear Time},
author={Beverly Jamison and Stephan Olariu},
pages={381--406},
journal=sicomp,
year=1992,
month=apr,
volume=21,
number=2
}

                         Volume 21, Number 3
                              June 1992

@Article{GalilG92,
title={On the Exact Complexity of String Matching: Upper Bounds},
author={Zvi Galil and Raffaele Giancarlo},
pages={407--437},
journal=sicomp,
year=1992,
month=jun,
volume=21,
number=3
}

@Article{Natarajan92,
title={Probably Approximate Learning over Classes of Distributions},
author={B. K. Natarajan},
pages={438--449},
journal=sicomp,
year=1992,
month=jun,
volume=21,
number=3
}

@Article{Papadimitriou92,
title={The Complexity of the {Lin-Kernighan} Heuristic for the
Traveling Salesman Problem},
author={Christos H. Papadimitriou},
pages={450--465},
journal=sicomp,
year=1992,
month=jun,
volume=21,
number=3
}

@Article{ReifS92,
title={Optimal Parallel Randomized Algorithms for Three-Dimensional
Convex Hulls and Related Problems},
author={John H. Reif and Sandeep Sen},
pages={466--485},
journal=sicomp,
year=1992,
month=jun,
volume=21,
number=3,
preliminary={stoc::ReifS1989:394}
}

@Article{KhullerMV92,
title={Processor Efficient Parallel Algorithms for the Two Disjoint
Paths Problem and for Finding a {Kuratowski} Homeomorph},
author={Samir Khuller and Stephen G. Mitchell and Vijay V. Vazirani},
pages={486--506},
journal=sicomp,
year=1992,
month=jun,
volume=21,
number=3,
preliminary={FOCS::KhullerMV1989:300}
}

@Article{Gatterdam92,
title={Algorithms for Splicing Systems},
author={R. W. Gatterdam},
pages={507--520},
journal=sicomp,
year=1992,
month=jun,
volume=21,
number=3
}

@Article{AllenderHOW92,
title={Relating Equivalence and Reducibility to Sparse Sets},
author={Eric Allender and Lane A. Hemachandra and Mitsunori Ogiwara
and Osamu Watanabe},
pages={521--539},
journal=sicomp,
year=1992,
month=jun,
volume=21,
number=3
}

@Article{Agarwal92,
title={Ray Shooting and Other Applications of Spanning Trees with Low
Stabbing Number},
author={Pankaj K. Agarwal},
pages={540--570},
journal=sicomp,
year=1992,
month=jun,
volume=21,
number=3
}

@Article{Kari92,
title={The Nilpotency Problem of One-Dimensional Cellular Automata},
author={Jarkko Kari},
pages={571--586},
journal=sicomp,
year=1992,
month=jun,
volume=21,
number=3
}

@Article{GuM92,
title={Learning Monotone {Boolean} Functions by Uniformly Distributed
Examples},
author={Qian Ping Gu and Akira Maruoka},
pages={587--599},
journal=sicomp,
year=1992,
month=jun,
volume=21,
number=3
}

                         Volume 21, Number 4
                             August 1992

@Article{MelissaratosS92,
title={Shortest Paths Help Solve Geometric Optimization Problems in
Planar Regions},
author={Elefterios A. Melissaratos and Diane L. Souvaine},
pages={601--638},
journal=sicomp,
year=1992,
month=aug,
volume=21,
number=4
}

@Article{LeightonNRS92,
title={Dynamic Tree Embeddings in Butterflies and Hypercubes},
author={F. T. Leighton and Mark J. Newman and Abhiram G. Ranade and
Eric J. Schwabe},
pages={639--654},
journal=sicomp,
year=1992,
month=aug,
volume=21,
number=4
}

@Article{Venkateswaran92,
title={Circuit Definitions of Nondeterministic Complexity Classes},
author={H. Venkateswaran},
pages={655--670},
journal=sicomp,
year=1992,
month=aug,
volume=21,
number=4
}

@Article{Chazelle92,
title={An Optimal Algorithm for Intersecting Three-Dimensional Convex
Polyhedra},
author={Bernard Chazelle},
pages={671--696},
journal=sicomp,
year=1992,
month=aug,
volume=21,
number=4
}

@Article{LiLV92,
title={The Power of the Queue},
author={Ming Li and Luc Longpr{\'e} and Paul Vit{\'a}nyi},
pages={697--712},
journal=sicomp,
year=1992,
month=aug,
volume=21,
number=4
}

@Article{AldousHS92,
title={Maximum Size of a Dynamic Data Structure: Hashing with Lazy
Deletion Revisited},
author={David Aldous and Micha Hofri and Wojciech Szpankowski},
pages={713--732},
journal=sicomp,
year=1992,
month=aug,
volume=21,
number=4
}

@Article{GanesanH92,
title={Complete Problems and Strong Polynomial Reducibilities},
author={K. Ganesan and Steven Homer},
pages={733--742},
journal=sicomp,
year=1992,
month=aug,
volume=21,
number=4
}

@Article{Chang92,
title={On the Structure of Bounded Queries to Arbitrary {NP} Sets},
author={Richard Chang},
pages={743--754},
journal=sicomp,
year=1992,
month=aug,
volume=21,
number=4
}

@Article{BussCGR92,
title={An Optimal Parallel Algorithm for Formula Evaluation},
author={S. Buss and S. Cook and A. Gupta and V. Ramachandran},
pages={755--780},
journal=sicomp,
year=1992,
month=aug,
volume=21,
number=4
}

@Article{BiniG92,
title={On the Complexity of Polynomial Zeros},
author={Dario Bini and Luca Gemignani},
pages={781--799},
journal=sicomp,
year=1992,
month=aug,
volume=21,
number=4
}

                         Volume 21, Number 5
                             October 1992

@Article{Koch92,
title={Increasing the Size of a Network by a Constant Factor Can
Increase Performance by More Than a Constant Factor},
author={Richard Koch},
pages={801--823},
journal=sicomp,
year=1992,
month=oct,
volume=21,
number=5
}

@Article{YuR92,
title={Representability of Design Objects by Ancestor-Controlled
Hierarchical Specifications},
author={Lin Yu and Daniel J. Rosenkrantz},
pages={824--855},
journal=sicomp,
year=1992,
month=oct,
volume=21,
number=5
}

@Article{BreslauerG92,
title={A Lower Bound for Parallel String Matching},
author={Dany Breslauer and Zvi Galil},
pages={856--862},
journal=sicomp,
year=1992,
month=oct,
volume=21,
number=5
}

@Article{SuzukiY92,
title={Searching for a Mobile Intruder in a Polygonal Region},
author={Ichiro Suzuki and Masafumi Yamashita},
pages={863--888},
journal=sicomp,
year=1992,
month=oct,
volume=21,
number=5
}

@Article{DolevF92,
title={Determinism vs.\ Nondeterminism in Multiparty Communication
Complexity},
author={Danny Dolev and Tom{\'a}s Feder},
pages={889--895},
journal=sicomp,
year=1992,
month=oct,
volume=21,
number=5
}

@Article{ReifT92,
title={On Threshold Circuits and Polynomial Computation},
author={John H. Reif and Stephen R. Tate},
pages={896--908},
journal=sicomp,
year=1992,
month=oct,
volume=21,
number=5
}

@Article{Just92,
title={Generalizing the Continued Fraction Algorithm to Arbitrary
Dimensions},
author={Bettina Just},
pages={909--926},
journal=sicomp,
year=1992,
month=oct,
volume=21,
number=5
}

@Article{HeathR92,
title={Laying Out Graphs Using Queues},
author={Lenwood S. Heath and Arnold L. Rosenberg},
pages={927--958},
journal=sicomp,
year=1992,
month=oct,
volume=21,
number=5
}

@Article{LouiL92,
title={Optimal On-Line Simulations of Tree Machines by Random Access
Machines},
author={Michael C. Loui and David R. Luginbuhl},
pages={959--971},
journal=sicomp,
year=1992,
month=oct,
volume=21,
number=5
}

@Article{ChengJ92,
title={New Results on Dynamic Planar Point Location},
author={Siu Wing Cheng and Ravi Janardan},
pages={972--999},
journal=sicomp,
year=1992,
month=oct,
volume=21,
number=5
}

@Article{BalasX92,
title={Addendum: Minimum Weighted Coloring of Triangulated Graphs, With
Application to Maximum Weight Vertex Packing and Clique Finding in
Arbitrary Graphs},
author={Egon Balas and Jue Xue},
pages={1000},
journal=sicomp,
year=1992,
month=oct,
volume=21,
number=5
}

                         Volume 21, Number 6
                            December 1992

@Article{DuH92,
title={Reducing the {Steiner} Problem in a Normed Space},
author={D. Z. Du and F. K. Hwang},
pages={1001--1007},
journal=sicomp,
year=1992,
month=dec,
volume=21,
number=6
}

@Article{Renegar92,
title={On the Computational Complexity of Approximating Solutions for
Real Algebraic Formulae},
author={James Renegar},
pages={1008--1025},
journal=sicomp,
year=1992,
month=dec,
volume=21,
number=6
}

@Article{ShihCH92,
title={An {$O(n^2 \log n)$} Algorithm for the {Hamiltonian} Cycle
Problem on Circular-Arc Graphs},
author={{Wei-Kuan} Shih and T. C. Chern and {Wen-Lian} Hsu},
pages={1026--1046},
journal=sicomp,
year=1992,
month=dec,
volume=21,
number=6
}

@Article{GalilI92,
title={Fully Dynamic Algorithms for 2-Edge Connectivity},
author={Zvi Galil and Giuseppe F. Italiano},
pages={1047--1069},
journal=sicomp,
year=1992,
month=dec,
volume=21,
number=6,
preliminary={STOC::GalilI1991:317}
}

@Article{MartelPS92,
title={Work-Optimal Asynchronous Algorithms for Shared Memory Parallel
Computers},
author={Charles Martel and Arvin Park and Ramesh Subramonian},
pages={1070--1099},
journal=sicomp,
year=1992,
month=dec,
volume=21,
number=6
}

@Article{Wang92,
title={Polynomial Time Productivity, Approximations, and Levelability},
author={Jie Wang},
pages={1100--1111},
journal=sicomp,
year=1992,
month=dec,
volume=21,
number=6
}

@Article{BeinKS92,
title={Optimal Reductions of Two-Terminal Directed Acyclic Graphs},
author={Wolfgang W. Bein and Jerzy Kamburowski and Matthias F. M.
Stallmann},
pages={1112--1129},
journal=sicomp,
year=1992,
month=dec,
volume=21,
number=6
}

@Article{FredericksonG92,
title={Preemptive Ensemble Motion Planning on a Tree},
author={Greg N. Frederickson and D. J. Guan},
pages={1130--1152},
journal=sicomp,
year=1992,
month=dec,
volume=21,
number=6,
preliminary={FOCS::FredericksonG1989:66}
}

@Article{Tompa92,
title={Lower Bounds on Universal Traversal Sequences for Cycles and
Other Low Degree Graphs},
author={Martin Tompa},
pages={1153--1160},
journal=sicomp,
year=1992,
month=dec,
volume=21,
number=6
}

@Article{BellantoniPU92,
title={Approximation and Small-Depth Frege Proofs},
author={Stephen Bellantoni and Toniann Pitassi and Alasdair Urquhart},
pages={1161--1179},
journal=sicomp,
year=1992,
month=dec,
volume=21,
number=6
}

@Article{Prodinger92,
title={External Internal Nodes in Digital Search Trees via {Mellin}
Transforms},
author={Helmut Prodinger},
pages={1180--1183},
journal=sicomp,
year=1992,
month=dec,
volume=21,
number=6
}

@Article{DixonRT92,
title={Verification and Sensitivity Analysis of Minimum Spanning Trees
in Linear Time},
author={Brandon Dixon and Monika Rauch and Robert E. Tarjan},
pages={1184--1192},
journal=sicomp,
year=1992,
month=dec,
volume=21,
number=6
}

@Article{Shokrollahi92,
title={Optimal Algorithms for Multiplication in Certain Finite Fields
Using Elliptic Curves},
author={Mohammad Amin Shokrollahi},
pages={1193--1198},
journal=sicomp,
year=1992,
month=dec,
volume=21,
number=6
}

                         Volume 22, Number 1
                            February 1993

@Article{FiatN93,
title={Implicit {$O(1)$} Probe Search},
author={Amos Fiat and Moni Naor},
pages={1--10},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{GalilI93,
title={Maintaining the 3-Edge-Connected Components of a Graph
On-Line},
author={Zvi Galil and Giuseppe F. Italiano},
pages={11--28},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{HernandezW93,
title={On the Boundedness of Constant-Time-Maintainable Database
Schemes},
author={H{\'e}ctor Hern{\'a}ndez and Ke Wang},
pages={29--45},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{Mao93,
title={Tight Worst-Case Performance Bounds for {Next-$k$-Fit} Bin
Packing},
author={Weizhen Mao},
pages={46--56},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{Frederickson93,
title={A Note on the Complexity of a Simple Transportation Problem},
author={Greg N. Frederickson},
pages={57--61},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{Cypher93:62,
title={A Lower Bound on the Size of {Shellsort} Sorting Networks},
author={Robert Cypher},
pages={62--71},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{Friedman93,
title={A Note on Poset Geometries},
author={Joel Friedman},
pages={72--78},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{Kundu93,
title={An {$O(n)$} Algorithm for Determining the Subregion-Tree
Representation of a Rectangular Dissection},
author={Sukhamay Kundu},
pages={79--101},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{Geffert93,
title={Tally Versions of the {Savitch} and {Immerman-Szelepcsenyi}
Theorems for Sublogarithmic Space},
author={Viliam Geffert},
pages={102--113},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{Oyamaguchi93,
title={{NV}-Sequentiality: A Decidable Condition for Call-by-Need
Computations in Term-Rewriting Systems},
author={Michio Oyamaguchi},
pages={114--135},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{Iwama93,
title={{$\mathop{\mathrm{ASPACE}}(o(\log \log n))$} Is Regular},
author={Kazuo Iwama},
pages={136--146},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{Miltersen93,
title={The Complexity of Malign Measures},
author={Peter Bro Miltersen},
pages={147--156},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{CheriyanKT93,
title={Scan-First Search and Sparse Certificates: An Improved Parallel
Algorithms for {$k$}-Vertex Connectivity},
author={Joseph Cheriyan and {Ming-Yang} Kao and Ramakrishna
Thurimella},
pages={157--174},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{Weber93,
title={Decomposing Finite-Valued Transducers and Deciding Their
Equivalence},
author={Andreas Weber},
pages={175--202},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{KratochvilST93,
title={One More Occurrence of Variables Makes Satisfiability Jump from
Trivial to {NP}-Complete},
author={Jan Kratochv{\'\i}l and Petr Savick{\'y} and Zsolt Tuza},
pages={203--210},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

@Article{NisanW93,
title={Rounds in Communication Complexity Revisited},
author={Noam Nisan and Avi Wigderson},
pages={211--219},
journal=sicomp,
year=1993,
month=feb,
volume=22,
number=1
}

                         Volume 22, Number 2
                              April 1993

@Article{BerkmanV93,
title={Recursive Star-Tree Parallel Data Structure},
author={Omer Berkman and Uzi Vishkin},
pages={221--242},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2,
preliminary={focs::BerkmanV1989:196}
}

@Article{TarhioU93,
title={Approximate {Boyer-Moore} String Matching},
author={Jorma Tarhio and Esko Ukkonen},
pages={243--260},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2
}

@Article{VegaKS93,
title={Two Probabilistic Results on Merging},
author={Fernandez de la Vega, Wenceslas and Sampath Kannan and Miklos
Santha},
pages={261--271},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2
}

@Article{GoddardKKS93,
title={Optimal Randomized Algorithms for Local Sorting and
Set-Maxima},
author={Wayne Goddard and Claire Kenyon and Valerie King and Leonard
J. Schulman},
pages={272--283},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2
}

@Article{KarmarkarKLLL93,
title={A {Monte-Carlo} Algorithm for Estimating the Permanent},
author={N. Karmarkar and R. Karp and R. Lipton and L. Lov{\'a}sz and
M. Luby},
pages={284--293},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2
}

@Article{SanthaW93,
title={Limiting Negations in Constant Depth Circuits},
author={Miklos Santha and Christopher Wilson},
pages={294--302},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2
}

@Article{BugraraP93,
title={Average Time Analysis of Clause Order Backtracking},
author={Khaled M. Bugrara and Purdom, Jr., Paul Walter},
pages={303--317},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2
}

@Article{BajajCGW93,
title={Factoring Rational Polynomials over the Complex Numbers},
author={Chanderjit Bajaj and John Canny and Thomas Garrity and Joe
Warren},
pages={318--331},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2
}

@Article{CoffmanFW93:332,
title={Optimal Stochastic Allocation of Machines under Waiting-Time
Constraints},
author={Coffman, Jr., E. G. and Leopold Flatto and Paul E. Wright},
pages={332--348},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2
}

@Article{GalambosW93,
title={An On-Line Scheduling Heuristic with Better Worst Case Ratio
Than {Graham's} List Scheduling},
author={G{\'a}bor Galambos and Berhard J. Woeginger},
pages={349--355},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2
}

@Article{Cypher93:356,
title={Theoretical Aspects of {VLSI} Pin Limitations},
author={Robert Cypher},
pages={356--378},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2
}

@Article{MoranW93,
title={Gap Theorems for Distributed Computation},
author={Shlomo Moran and Manfred K. Warmuth},
pages={379--394},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2
}

@Article{BookL93,
title={On Languages With Very High Space-Bounded {Kolmogorov}
Complexity},
author={Ronald V. Book and Jack H. Lutz},
pages={395--402},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2
}

@Article{AlonN93,
title={Coin-Flipping Games Immune against Linear-Sized Coalitions},
author={Noga Alon and Moni Naor},
pages={403--417},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2
}

@Article{EdelsbrunnerSS93,
title={On the Zone Theorem for Hyperplane Arrangements},
author={Herbert Edelsbrunner and Raimund Seidel and Micha Sharir},
pages={418--429},
journal=sicomp,
year=1993,
month=apr,
volume=22,
number=2
}

                         Volume 22, Number 3
                              June 1993

@Article{Kao93,
title={Linear-Processor {NC} Algorithms for Planar Directed Graphs
{I}: Directed Spanning Trees},
author={{Ming-Yang} Kao},
pages={431--459},
journal=sicomp,
year=1993,
month=jun,
volume=22,
number=3
}

@Article{KaoS93,
title={Linear-Processor {NC} Algorithms for Planar Directed Graphs
{II}: Directed Spanning Trees},
author={{Ming-Yang} Kao and Gregory E. Shannon},
pages={460--481},
journal=sicomp,
year=1993,
month=jun,
volume=22,
number=3
}

@Article{BienstockD93,
title={Blocking Small Cuts in a Network, and Related Problems},
author={Daniel Bienstock and Nicole Diaz},
pages={482--499},
journal=sicomp,
year=1993,
month=jun,
volume=22,
number=3
}

@Article{YeapS93,
title={Floor-Planning by Graph Dualization: 2-Concave Rectilinear
Modules},
author={{Kok-Hoo} Yeap and Majid Sarrafzadeh},
pages={500--526},
journal=sicomp,
year=1993,
month=jun,
volume=22,
number=3
}

@Article{EdelsbrunnerT93,
title={A Quadratic Time Algorithm for the Minimax Length
Triangulation},
author={Herbert Edelsbrunner and Tiow Seng Tan},
pages={527--551},
journal=sicomp,
year=1993,
month=jun,
volume=22,
number=3
}

@Article{Kalorkoti93,
title={Inverting Polynomials and Formal Power Series},
author={K. Kalorkoti},
pages={552--559},
journal=sicomp,
year=1993,
month=jun,
volume=22,
number=3
}

@Article{BussG93,
title={Nondeterminism Within {$P$}},
author={Jonathan F. Buss and Judy Goldsmith},
pages={560--572},
journal=sicomp,
year=1993,
month=jun,
volume=22,
number=3
}

@Article{KirousisSS93,
title={Parallel Complexity of the Connected Subgraph Problem},
author={Lefteris M. Kirousis and Maria Serna and Paul Spirakis},
pages={573--586},
journal=sicomp,
year=1993,
month=jun,
volume=22,
number=3
}

@Article{FussellRT93,
title={Finding Triconnected Components by Local Replacement},
author={Donald Fussell and Vijaya Ramachandran and Ramakrishna
Thurimella},
pages={587--616},
journal=sicomp,
year=1993,
month=jun,
volume=22,
number=3
}

@Article{BiniP93,
title={Improved Parallel Polynomial Division},
author={Dario Bini and Victor Pan},
pages={617--626},
journal=sicomp,
year=1993,
month=jun,
volume=22,
number=3
}

@Article{RosenkrantzH93,
title={The Complexity of Processing Hierarchical Specifications},
author={Daniel J. Rosenkrantz and Hunt III, Harry B.},
pages={627--649},
journal=sicomp,
year=1993,
month=jun,
volume=22,
number=3
}

@Article{CoffmanFW93:650,
title={A Stochastic Checkpoint Optimization Problem},
author={Coffman, Jr., E. G. and Leopold Flatto and Paul E. Wright},
pages={650--659},
journal=sicomp,
year=1993,
month=jun,
volume=22,
number=3
}

                         Volume 22, Number 4
                             August 1993

@Article{Goerdt93,
title={Regular Resolution versus Unrestricted Resolution},
author={Andreas Goerdt},
pages={661--683},
journal=sicomp,
year=1993,
month=aug,
volume=22,
number=4
}

@Article{NiederreiterS93,
title={Local Randomness in Polynomial Random Number and Random
Function Generators},
author={H. Niederreiter and C. P. Schnorr},
pages={684--694},
journal=sicomp,
year=1993,
month=aug,
volume=22,
number=4
}

@Article{DurG93,
title={Applying Coding Theory to Sparse Interpolation},
author={A D{\"u}r and J. Grabmeier},
pages={695--704},
journal=sicomp,
year=1993,
month=aug,
volume=22,
number=4
}

@Article{GoldmanKS93,
title={Exact Identification of Read-Once Formulas Using Fixed Points
of Amplification Functions},
author={Sally A. Goldman and Michael J. Kearns and Robert E.
Schapire},
pages={705--726},
journal=sicomp,
year=1993,
month=aug,
volume=22,
number=4
}

@Article{MoserMA93,
title={Asynchronous Fault-Tolerant Total Ordering Algorithms},
author={Louise E. Moser and P. M. Melliar-Smith and Vivek Agrawala},
pages={727--750},
journal=sicomp,
year=1993,
month=aug,
volume=22,
number=4
}

@Article{GoldsteinR93,
title={A {Fibonacci} Version of {Kraft's} Inequality Applied to
Discrete Unimodal Search},
author={Arthur S. Goldstein and Edward M. Reingold},
pages={751--777},
journal=sicomp,
year=1993,
month=aug,
volume=22,
number=4
}

@Article{AgarwalPS93,
title={Counting Circular Arc Intersections},
author={Pankaj K. Agarwal and Marco Pellegrini and Micha Sharir},
pages={778--793},
journal=sicomp,
year=1993,
month=aug,
volume=22,
number=4
}

@Article{AgarwalM93,
title={Ray Shooting and Parametric Search},
author={Pankaj K. Agarwal and Ji{\v{r}}{\'\i} Matou{\v{s}}ek},
pages={794--806},
journal=sicomp,
year=1993,
month=aug,
volume=22,
number=4
}

@Article{KearnsL93,
title={Learning in the Presence of Malicious Errors},
author={Michael Kearns and Ming Li},
pages={807--837},
journal=sicomp,
year=1993,
month=aug,
volume=22,
number=4
}

@Article{NaorN93,
title={Small-Bias Probability Spaces: Efficient Constructions and
Applications},
author={Joseph Naor and Moni Naor},
pages={838--856},
journal=sicomp,
year=1993,
month=aug,
volume=22,
number=4
}

@Article{HarelR93,
title={Deciding Properties of Nonregular Programs},
author={David Harel and Danny Raz},
pages={857--874},
journal=sicomp,
year=1993,
month=aug,
volume=22,
number=4
}

@Article{Bar-YehudaII93,
title={Multiple Communication in Multihop Radio Networks},
author={Reuven Bar-Yehuda and Amos Israeli and Alon Itai},
pages={875--887},
journal=sicomp,
year=1993,
month=aug,
volume=22,
number=4
}

                         Volume 22, Number 5
                             October 1993

@Article{HsuR93,
title={Finding a Smallest Augmentation to Biconnect a Graph},
author={{Tsan-Sheng} Hsu and Vijaya Ramachandran},
pages={889--912},
journal=sicomp,
year=1993,
month=oct,
volume=22,
number=5
}

@Article{HalstenbergR93,
title={Different Modes of Communication},
author={Bernd Halstenberg and R{\"u}diger Reischuk},
pages={913--934},
journal=sicomp,
year=1993,
month=oct,
volume=22,
number=5
}

@Article{ManberM93,
title={Suffix Arrays: A New Method for On-Line String Searches},
author={Udi Manber and Gene Myers},
pages={935--948},
journal=sicomp,
year=1993,
month=oct,
volume=22,
number=5
}

@Article{BlassG93,
title={Randomizing Reductions of Search Problems},
author={Andreas Blass and Yuri Gurevich},
pages={949--975},
journal=sicomp,
year=1993,
month=oct,
volume=22,
number=5
}

@Article{LouS93,
title={An Optimal Algorithm for the Maximum Three-Chain Problem},
author={Ruey-Der Lou and Majid Sarrafzadeh},
pages={976--993},
journal=sicomp,
year=1993,
month=oct,
volume=22,
number=5
}

@Article{FeigenbaumF93,
title={Random-Self-Reducibility of Complete Sets},
author={Joan Feigenbaum and Lance Fortnow},
pages={994--1005},
journal=sicomp,
year=1993,
month=oct,
volume=22,
number=5
}

@Article{GoldmanRS93,
title={Learning Binary Relations and Total Orders},
author={Sally A. Goldman and Ronald L. Rivest and Robert E. Schapire},
pages={1006--1034},
journal=sicomp,
year=1993,
month=oct,
volume=22,
number=5
}

@Article{FormannHHKLSWW93,
title={Drawing Graphs in the Plane with High Resolution},
author={M. Formann and T. Hagerup and J. Haralambides and M. Kaufmann
and F. T. Leighton and A. Symvonis and E. Welzl and G. Woeginger},
pages={1035--1052},
journal=sicomp,
year=1993,
month=oct,
volume=22,
number=5
}

@Article{BollobasS93,
title={Probabilistic Analysis of Disjoint Set Union Algorithms},
author={B{\'e}la Bollob{\'a}s and Istvan Simon},
pages={1053--1074},
journal=sicomp,
year=1993,
month=oct,
volume=22,
number=5
}

@Article{Lutz93,
title={A Pseudorandom Oracle Characterization of {BPP}},
author={Jack H. Lutz},
pages={1075--1086},
journal=sicomp,
year=1993,
month=oct,
volume=22,
number=5
}

@Article{JerrumS93,
title={Polynomial-Time Approximation Algorithms for the {Ising}
Model},
author={Mark Jerrum and Alistair Sinclair},
pages={1087--1116},
journal=sicomp,
year=1993,
month=oct,
volume=22,
number=5
}

                         Volume 22, Number 6
                            December 1993

@Article{JiangR93,
title={Minimal {NFA} Problems Are Hard},
author={Tao Jiang and B. Ravikumar},
pages={1117--1141},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

@Article{CaiHT93,
title={An {$O(m \log n)$}-Time Algorithm for the Maximal Planar
Subgraph Problem},
author={Jiazhen Cai and Xiaofeng Han and Robert E. Tarjan},
pages={1142--1162},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

@Article{GoldreichKL93,
title={On the Existence of Pseudorandom Generators},
author={Oded Goldreich and Hugo Krawczyk and Michael Luby},
pages={1163--1175},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

@Article{Szpankowski93,
title={A Generalized Suffix Tree and Its (Un)Expected Asymptotic
Behaviors},
author={Wojciech Szpankowski},
pages={1176--1198},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

@Article{KargerKP93,
title={Finding the Hidden Path: Time Bounds for All-Pairs Shortest
Paths},
author={David R. Karger and Daphne Koller and Steven J. Phillips},
pages={1199--1217},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

@Article{He93,
title={On Finding the Rectangular Duals of Planar Triangular Graphs},
author={Xin He},
pages={1218--1226},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

@Article{PanR93,
title={Fast and Efficient Parallel Solution of Sparse Linear Systems},
author={Victor Pan and John Reif},
pages={1227--1250},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

@Article{RheeT93,
title={On-Line Bin Packing of Items of Random Sizes, {II}},
author={Wansoo T. Rhee and Michel Talagrand},
pages={1251--1256},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

@Article{GavaldaW93,
title={On the Computational Complexity of Small Descriptions},
author={Ricard Gavald{\`a} and Osamu Watanabe},
pages={1257--1275},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

@Article{KarpinskiW93,
title={{VC} Dimension and Uniform Learnability of Sparse Polynomials
and Rational Functions},
author={Marek Karpinski and Thorsten Werther},
pages={1276--1285},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

@Article{ChazelleEGSS93,
title={Computing a Face in an Arrangement of Line Segments and Related
Problems},
author={Bernard Chazelle and Herbert Edelsbrunner and Leonidas Guibas
and Micha Sharir and Jack Snoeyink},
pages={1286--1302},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

@Article{Chen93,
title={A Better Heuristic for Preemptive Parallel Machine Scheduling
with Batch Setup Times},
author={Bo Chen},
pages={1303--1318},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

@Article{ChuK93,
title={A New Method for Computing Page-Fault Rates},
author={{Jiang-Hsing} Chu and Gary D. Knott},
pages={1319--1330},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

@Article{KushilevitzM93,
title={Learning Decision Trees Using the {Fourier} Spectrum},
author={Eyal Kushilevitz and Yishay Mansour},
pages={1331--1348},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

@Article{Cole93,
title={Correction: Parallel Merge Sort},
author={Richard Cole},
pages={1349},
journal=sicomp,
year=1993,
month=dec,
volume=22,
number=6
}

                            February 1994
                         Volume 23, Number 1

@Article{GrigorievKS1994,
title={Computational Complexity of Sparse Rational Interpolation},
author={Dima Grigoriev and Marek Karpinski and Michael F. Singer},
pages={1--11},
journal=sicomp,
month=feb,
year=1994,
volume=23,
number=1
}

@Article{SantisP1994,
title={Tight Upper and Lower Bounds on the Path Length of Binary
Trees},
author={Alfredo De Santis and Giuseppe Persiano},
pages={12--23},
journal=sicomp,
month=feb,
year=1994,
volume=23,
number=1
}

@Article{SundarT1994,
title={Unique Binary-Search-Tree Representations and Equality Testing
of Sets and Sequences},
author={Rajamani Sundar and Robert E. Tarjan},
pages={24--44},
journal=sicomp,
month=feb,
year=1994,
volume=23,
number=1
}

@Article{BorosCHS1994,
title={A Complexity Index for Satisfiability Problems},
author={E. Boros and Y. Crama and P. L. Hammer and M. Saks},
pages={45--49},
journal=sicomp,
month=feb,
year=1994,
volume=23,
number=1
}

@Article{ApostolicoIGT1994,
title={The Set Union Problem with Unlimited Backtracking},
author={Alberto Apostolico and Giuseppe F. Italiano and Giorgio
Gambosi and Maurizio Talamo},
pages={50--70},
journal=sicomp,
month=feb,
year=1994,
volume=23,
number=1
}

@Article{KuoC1994,
title={The Profile Minimization Problem in Trees},
author={David Kuo and Gerard J. Chang},
pages={71--81},
journal=sicomp,
month=feb,
year=1994,
volume=23,
number=1
}

@Article{DuXSC1994,
title={Modifications of Competitive Group Testing},
author={D.-Z. Du and G.-L. Xue and S.-Z. Sun and S.-W. Cheng},
pages={82--96},
journal=sicomp,
month=feb,
year=1994,
volume=23,
number=1
}

@Article{BellareG1994,
title={The Complexity of Decision Versus Search},
author={Mihir Bellare and Shafi Goldwasser},
pages={97--119},
journal=sicomp,
month=feb,
year=1994,
volume=23,
number=1
}

@Article{Shawe-TaylorP1994,
title={Homeomorphism of 2-Complexes Is Graph Isomorphism Complete},
author={John Shawe-Taylor and Toma{\v{z}} Pisanski},
pages={120--132},
journal=sicomp,
month=feb,
year=1994,
volume=23,
number=1
}

@Article{Pellegrini1994,
title={On Collision-Free Placements of Simplices and the Closest Pair
of Lines in 3-Space},
author={Marco Pellegrini},
pages={133--153},
journal=sicomp,
month=feb,
year=1994,
volume=23,
number=1
}

@Article{MatousekPSSW1994,
title={Fat Triangles Determine Linearly Many Holes},
author={Ji{\v{r}}{\'\i} Matou{\v{s}}ek and J{\'a}nos Pach and Micha
Sharir and Shmuel Sifrony and Emo Welzl},
pages={154--169},
journal=sicomp,
month=feb,
year=1994,
volume=23,
number=1
}

@Article{IrvingJ1994,
title={Three-Dimensional Statistical Data Security Problems},
author={Robert W. Irving and Mark R. Jerrum},
pages={170--184},
journal=sicomp,
month=feb,
year=1994,
volume=23,
number=1
}

@Article{FredericksonR1994,
title={An {NC} Algorithm for Scheduling Unit-Time Jobs with Arbitrary
Release Times and Deadlines},
author={Greg N. Frederickson and Susan H. Rodger},
pages={185--211},
journal=sicomp,
month=feb,
year=1994,
volume=23,
number=1
}

@Article{BermondF1994,
title={Broadcasting and Gossiping in {de~Bruijn} Networks},
author={Jean-Claude Bermond and Pierre Fraigniaud},
pages={212--225},
journal=sicomp,
month=feb,
year=1994,
volume=23,
number=1
}

                              April 1994
                         Volume 23, Number 2

@Article{KaufmannM1994,
title={A Linear-Time Algorithm for the Homotopic Routing Problem in
Grid Graphs},
author={Michael Kaufmann and Kurt Mehlhorn},
pages={227--246},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{Triesch1994,
title={Some Results on Elusive Graph Properties},
author={Eberhard Triesch},
pages={247--254},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{FuL1994,
title={Closeness of {NP}-Hard Sets to Other Complexity Classes},
author={Bin Fu and Hong-Zhou Li},
pages={255--260},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{KoblerT1994,
title={Complexity-Restricted Advice Functions},
author={Johannes K{\"o}bler and Thomas Thierauf},
pages={261--275},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{HerleyB1994,
title={Deterministic Simulations of {PRAMs} on Bounded Degree
Networks},
author={Kieran T. Herley and Gianfranco Bilardi},
pages={276--292},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{KarloffRR1994,
title={Lower Bounds for Randomized {$k$}-Server and Motion-Planning
Algorithms},
author={Howard Karloff and Yuval Rabani and Yiftach Ravid},
pages={293--312},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{AmirBF1994,
title={An Alphabet Independent Approach to Two-Dimensional Pattern
Matching},
author={Amihood Amir and Gary Benson and Martin Farach},
pages={313--323},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{BroderKRU1994,
title={Trading Space for Time in Undirected {$s$}-{$t$} Connectivity},
author={Andrei Z. Broder and Anna R. Karlin and Prabhakar Raghavan and
Eli Upfal},
pages={324--334},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{ChaudhuriW1994,
title={Bounds on the Costs of Multivalued Register Implementations},
author={Soma Chaudhuri and Jennifer L. Welch},
pages={335--354},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{BagchiSH1994,
title={Parallel Information Dissemination by Packets},
author={A. Bagchi and E. F. Schmeichel and S. L. Hakimi},
pages={355--372},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{PruesseR1994,
title={Generating Linear Extensions Fast},
author={Gara Pruesse and Frank Ruskey},
pages={373--386},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{NarayananSV1994,
title={Randomized Parallel Algorithms for Matroid Union and
Intersection, With Applications to Arboresences and Edge-Disjoint
Spanning Trees},
author={H. Narayanan and Huzur Saran and Vijay V. Vazirani},
pages={387--397},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{SwaminathanW1994,
title={On the Consecutive-Retrieval Problem},
author={R. Swaminathan and Donald K. Wagner},
pages={398--414},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{KimS1994,
title={Polynomial Root-Finding Algorithms and Branched Covers},
author={Myong-Hi Kim and Scott Sutherland},
pages={415--436},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{DeBergOS1994,
title={Computing and Verifying Depth Orders},
author={Mark de Berg and Mark Overmars and Otfried Schwarzkopf},
pages={437--446},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}

@Article{ReifS1994:err,
title={Erratum: Optimal Parallel Randomized Algorithms for
Three-Dimensional Convex Hulls and Related Problems},
author={John H. Reif and Sandeep Sen},
pages={447--448},
journal=sicomp,
month=apr,
year=1994,
volume=23,
number=2
}


                              June 1994
                         Volume 23, Number 3

@Article{BerkmanJKTV1994,
title={Top-Bottom Routing Around a Rectangle is as Easy as Computing
Prefix Minima},
author={Omer Berkman and Joseph J{\'a}j{\'a} and Sridhar Krishnamurthy
and Ramakrishna Thurimella and Uzi Vishkin},
pages={449--465},
journal=sicomp,
month=jun,
year=1994,
volume=23,
number=3
}

@Article{KleinPST1994,
title={Faster Approximation Algorithms for the Unit Capacity
Concurrent Flow Problem With Applications to Routing and Finding
Sparse Cuts},
author={Philip Klein and Serge Plotkin and Clifford Stein and {\'E}va
Tardos},
pages={466--487},
journal=sicomp,
month=jun,
year=1994,
volume=23,
number=3
}

@Article{SheuL1994,
title={The Extended Low Hierarchy is an Infinite Hierarchy},
author={Ming-Jye Sheu and Timothy J. Long},
pages={488--509},
journal=sicomp,
month=jun,
year=1994,
volume=23,
number=3
}

@Article{JohnsonR1994,
title={Complexity of Network Reliability and Optimal Resource
Placement Problems},
author={Donald B. Johnson and Larry Raab},
pages={510--519},
journal=sicomp,
month=jun,
year=1994,
volume=23,
number=3
}

@Article{DeogunS1994,
title={Polynomial Algorithms for {Hamiltonian} Cycle in
Cocomparability Graphs},
author={Jitender S. Deogun and George Steiner},
pages={520--552},
journal=sicomp,
month=jun,
year=1994,
volume=23,
number=3
}

@Article{PestienRS1994,
title={Packet Transmission in a Noisy-Channel Ring Network},
author={Victor Pestien and S. Ramakrishnan and Dilip Sarkar},
pages={553--562},
journal=sicomp,
month=jun,
year=1994,
volume=23,
number=3
}

@Article{CaiL1994,
title={Subquadratic Simulations of Balanced Formulae by Branching
Programs},
author={Jin-Yi Cai and Richard J. Lipton},
pages={563--572},
journal=sicomp,
month=jun,
year=1994,
volume=23,
number=3
}

@Article{Grandjean1994,
title={Linear Time Algorithms and {NP}-Complete Problems},
author={Etienne Grandjean},
pages={573--597},
journal=sicomp,
month=jun,
year=1994,
volume=23,
number=3
}

@Article{KirschenhoferPS1994,
title={Digital Search Trees Again Revisited: The Internal Path Length
Perspective},
author={Peter Kirschenhofer and Helmut Prodiner and Wojciech
Szpankowski},
pages={598--616},
journal=sicomp,
month=jun,
year=1994,
volume=23,
number=3
}

@Article{ShmoysSW1994,
title={Improved Approximation Algorithms for Shop Scheduling Problems},
author={David B. Shmoys and Clifford Stein and Joel Wein},
pages={617--632},
journal=sicomp,
month=jun,
year=1994,
volume=23,
number=3
}

@Article{ReifS1994:633,
title={Randomized Algorithms for Binary Search and Load Balancing on
Fixed Connection Networks with Geometric Applications},
author={John H. Reif and Sandeep Sen},
pages={633--651},
journal=sicomp,
month=jun,
year=1994,
volume=23,
number=3
}

@Article{BeameTY1994,
title={Communication-Space Tradeoffs for Unrestricted Protocols},
author={Paul Beame and Martin Tompa and Peiyuan Yan},
pages={652--661},
journal=sicomp,
month=jun,
year=1994,
volume=23,
number=3
}

@Article{BraschiT1994,
title={A New Insight into the {Coffman}-{Graham} Algorithm},
author={Bertrand Braschi and Denis Trystram},
pages={662--669},
journal=sicomp,
month=jun,
year=1994,
volume=23,
number=3
}


                             August 1994
                         Volume 23, Number 4

@Article{Subramanian1994,
title={A New Approach to Stable Matching Problems},
author={Ashok Subramanian},
pages={671--700},
journal=sicomp,
month=aug,
year=1994,
volume=23,
number=4
}

@Article{ChorIL1994,
title={Wait-Free Consensus Using Asynchronous Hardware},
author={Benny Chor and Amos Israeli and Ming Li},
pages={701--712},
journal=sicomp,
month=aug,
year=1994,
volume=23,
number=4
}

@Article{KannanW1994,
title={Inferring Evolutionary History from {DNA} Sequences},
author={Sampath K. Kannan and Tandy J. Warnow},
pages={713--737},
journal=sicomp,
month=aug,
year=1994,
volume=23,
number=4
}

@Article{DietzfelbingerKMHRT1994,
title={Dynamic Perfect Hashing: Upper and Lower Bounds},
author={Martin Dietzfelbinger and Anna Karlin and Kurt Mehlhorn and
Friedhelm Meyer Auf Der Heide and Hans Rohnert and Robert E. Tarjan},
pages={738--761},
journal=sicomp,
month=aug,
year=1994,
volume=23,
number=4
}

@Article{LutzM1994,
title={Measure, Stochasticity, and the Density of Hard Languages},
author={Jack H. Lutz and Elvira Mayordomo},
pages={762--779},
journal=sicomp,
month=aug,
year=1994,
volume=23,
number=4
}

@Article{Schrijver1994,
title={Finding {$k$} Disjoint Paths in a Directed Planar Graph},
author={Alexander Schrijver},
pages={780--788},
journal=sicomp,
month=aug,
year=1994,
volume=23,
number=4
}

@Article{IIK1994,
title={Finite Automata Computing Real Functions},
author={Culik II, Karel and Juhani Karhum{\"a}ki},
pages={789--814},
journal=sicomp,
month=aug,
year=1994,
volume=23,
number=4
}

@Article{Bshouty1994,
title={On the Complexity of Bilinear Forms Over Associative Algebras},
author={Nader H. Bshouty},
pages={815--833},
journal=sicomp,
month=aug,
year=1994,
volume=23,
number=4
}

@Article{Ramanan1994,
title={A New Lower Bound Technique and its Application: Tight Lower
Bound for a Polygon Triangulation Problem},
author={Prakash Ramanan},
pages={834--851},
journal=sicomp,
month=aug,
year=1994,
volume=23,
number=4
}

@Article{Aceto1994,
title={On ``{Axiomatising} Finite Concurrent Processes''},
author={Luca Aceto},
pages={852--863},
journal=sicomp,
month=aug,
year=1994,
volume=23,
number=4
}

@Article{DahlhausJPSY1994,
title={The Complexity of Multiterminal Cuts},
author={E. Dahlhaus and D. S. Johnson and C. H. Papadimitriou and P.
D. Seymour and M. Yannakakis},
pages={864--894},
journal=sicomp,
month=aug,
year=1994,
volume=23,
number=4,
preliminary={STOC::DahlhausJPSY1992:241}
}


                             October 1994
                         Volume 23, Number 5

@Article{DasTA1994,
title={Diagnosis of {$t/(t+1)$}-Diagnosable Systems},
author={A. Das and K. Thulasiraman and V. K. Agarwal},
pages={895--905},
journal=sicomp,
month=oct,
year=1994,
volume=23,
number=5
}

@Article{AhujaOST1994,
title={Improved Algorithms for Bipartite Network Flow},
author={Ravindra K. Ahuja and James B. Orlin and Clifford Stein and
Robert E. Tarjan},
pages={906--933},
journal=sicomp,
month=oct,
year=1994,
volume=23,
number=5
}

@Article{Pan1994,
title={New Resultant Inequalities and Complex Polynomial
Factorization},
author={V. Y. Pan},
pages={934--950},
journal=sicomp,
month=oct,
year=1994,
volume=23,
number=5
}

@Article{Westbrook1994,
title={Randomized Algorithms for Multiprocessor Page Migration},
author={Jeffery Westbrook},
pages={951--965},
journal=sicomp,
month=oct,
year=1994,
volume=23,
number=5
}

@Article{Yao1994,
title={Near-Optimal Time-Space Tradeoff for Element Distinctness},
author={Andrew Chi-Chih Yao},
pages={966--975},
journal=sicomp,
month=oct,
year=1994,
volume=23,
number=5
}

@Article{BroderFU1994,
title={Existence and Construction of Edge-Disjoint Paths on Expander
Graphs},
author={Andrei Z. Broder and Alan M. Frieze and Eli Upfal},
pages={976--989},
journal=sicomp,
month=oct,
year=1994,
volume=23,
number=5
}

@Article{Blum1994,
title={Separating Distribution-Free and Mistake-Bound Learning Models
Over the {Boolean} Domain},
author={Avrim L. Blum},
pages={990--1000},
journal=sicomp,
month=oct,
year=1994,
volume=23,
number=5
}

@Article{FeigeRPU1994,
title={Computing with Noisy Information},
author={Uriel Feige and Prabhakar Raghavan and David Peleg and Eli
Upfal},
pages={1001--1018},
journal=sicomp,
month=oct,
year=1994,
volume=23,
number=5
}

@Article{DuP1994,
title={On Competitive Group Testing},
author={Ding-Zhu Du and Haesun Park},
pages={1019--1025},
journal=sicomp,
month=oct,
year=1994,
volume=23,
number=5
}

@Article{AllenderG1994,
title={A Uniform Circuit Lower Bound for the Permanent},
author={Eric Allender and Vivek Gore},
pages={1026--1049},
journal=sicomp,
month=oct,
year=1994,
volume=23,
number=5
}

@Article{LewM1994,
title={The Joint Distribution of Elastic Buckets in Multiway Search
Trees},
author={William Lew and Hosam M. Mahmoud},
pages={1050--1074},
journal=sicomp,
month=oct,
year=1994,
volume=23,
number=5
}

@Article{Cole1994,
title={Tight Bounds on the Complexity of the {Boyer-Moore} String
Matching Algorithm},
author={Richard Cole},
pages={1075--1091},
journal=sicomp,
month=oct,
year=1994,
volume=23,
number=5
}


                            December 1994
                         Volume 23, Number 6

@Article{GyssensPV1994,
title={A Grammar-Based Approach Towards Unifying Hierarchical Data
Models},
author={Marc Gyssens and Jan Paredaens and Dirk Van Gucht},
pages={1093--1137},
journal=sicomp,
month=dec,
year=1994,
volume=23,
number=6
}

@Article{ChazelleEGHS1994,
title={Selecting Heavily Covered Points},
author={Bernard Chazelle and Herbert Edelsbrunner and Leonidas J.
Guibas and John E. Hershberger and Raimund Seidel and Micha Sharir},
pages={1138--1151},
journal=sicomp,
month=dec,
year=1994,
volume=23,
number=6
}

@Article{AfekG1994,
title={Distributed Algorithms for Unidirectional Networks},
author={Yehuda Afek and Eli Gafni},
pages={1152--1178},
journal=sicomp,
month=dec,
year=1994,
volume=23,
number=6
}

@Article{HochbaumN1994,
title={Simple and Fast Algorithms for Linear and Integer Programs with
Two Variables Per Inequality},
author={Dorit S. Hochbaum and Joseph (Seffi) Naor},
pages={1179--1192},
journal=sicomp,
month=dec,
year=1994,
volume=23,
number=6
}

@Article{KimM1994,
title={Computing the Order of a Locally Testable Automaton},
author={Sam Kim and Robert McNaughton},
pages={1193--1215},
journal=sicomp,
month=dec,
year=1994,
volume=23,
number=6
}

@Article{AgarwalaF1994,
title={A Polynomial-Time Algorithm for the Perfect Phylogeny Problem
When the Number of Character States is Fixed},
author={Richa Agarwala and David Fern{\'a}ndez-Baca},
pages={1216--1224},
journal=sicomp,
month=dec,
year=1994,
volume=23,
number=6
}

@Article{AtkinsonB1994,
title={Priority Queues and Permutations},
author={M. D. Atkinson and Robert Beals},
pages={1225--1230},
journal=sicomp,
month=dec,
year=1994,
volume=23,
number=6
}

@Article{Nishimura1994,
title={A Model for Asynchronous Shared Memory Parallel Computation},
author={Naomi Nishimura},
pages={1231--1252},
journal=sicomp,
month=dec,
year=1994,
volume=23,
number=6
}

@Article{Chaudhuri1994,
title={Tight Bounds on Oblivious Chaining},
author={Shiva Chaudhuri},
pages={1253--1265},
journal=sicomp,
month=dec,
year=1994,
volume=23,
number=6
}

@Article{CypherG1994,
title={Requirements for Deadlock-Free, Adaptive Packet Routing},
author={Robert Cypher and Luis Gravano},
pages={1266--1274},
journal=sicomp,
month=dec,
year=1994,
volume=23,
number=6
}

@Article{Book1994,
title={On Languages Reducible to Algorithmically Random Languages},
author={Ronald V. Book},
pages={1275--1282},
journal=sicomp,
month=dec,
year=1994,
volume=23,
number=6
}

@Article{LarmoreP1994,
title={A Fast Algorithm for Optimum Height-Limited Alphabetic Binary
Trees},
author={Lawrence L. Larmore and Teresa M. Przytycka},
pages={1283--1312},
journal=sicomp,
month=dec,
year=1994,
volume=23,
number=6
}

@Article{CohenM1994,
title={Improved Algorithms for Linear Inequalities with Two Variables
Per Inequality},
author={Edith Cohen and Nimrod Megiddo},
pages={1313--1347},
journal=sicomp,
month=dec,
year=1994,
volume=23,
number=6
}


                            February 1995
                         Volume 24, Number 1

@Article{BlassG1995,
title={Matrix Transformation Is Complete for the Average Case},
author={Andreas Blass and Yuri Gurevich},
pages={3--29},
journal=sicomp,
month=feb,
year=1995,
volume=24,
number=1
}

@Article{ColeHPZ1995,
title={Tighter Lower Bounds on the Exact Complexity of String
Matching},
author={Richard Cole and Ramesh Hariharan and Mike Paterson and Uri
Zwick},
pages={30--45},
journal=sicomp,
month=feb,
year=1995,
volume=24,
number=1
}

@Article{Kao1995,
title={Planar Strong Connectivity Helps in Parallel Depth-First
Search},
author={Ming-Yang Kao},
pages={46--62},
journal=sicomp,
month=feb,
year=1995,
volume=24,
number=1
}

@Article{BiniG1995,
title={Fast Parallel Computation of the Polynomial Remainder Sequence
Via {B\'ezout} and {Hankel} Matrices},
author={Dario Bini and Luca Gemignani},
pages={63--77},
journal=sicomp,
month=feb,
year=1995,
volume=24,
number=1
}

@Article{AlonKPW1995,
title={A Graph-Theoretic Game and Its Application to the {$k$}-Server
Problem},
author={Noga Alon and Richard M. Karp and David Peleg and Douglas
West},
pages={78--100},
journal=sicomp,
month=feb,
year=1995,
volume=24,
number=1
}

@Article{SaranV1995,
title={Finding {$k$} Cuts within Twice the Optimal},
author={Huzur Saran and Vijay V. Vazirani},
pages={101--108},
journal=sicomp,
month=feb,
year=1995,
volume=24,
number=1
}

@Article{BonetB1995,
title={The Serial Transitive Closure Problem for Trees},
author={Maria Luisa Bonet and Samuel R. Buss},
pages={109--122},
journal=sicomp,
month=feb,
year=1995,
volume=24,
number=1
}

@Article{IbarraJTW1995,
title={New Decidability Results Concerning Two-Way Counter Machines},
author={Oscar H. Ibarra and Tao Jiang and Nicholas Tran and Hui Wang},
pages={123--137},
journal=sicomp,
month=feb,
year=1995,
volume=24,
number=1
}

@Article{Zhang1995,
title={On the Optimality of Randomized {$\alpha$}-{$\beta$} Search},
author={Yanjun Zhang},
pages={138--147},
journal=sicomp,
month=feb,
year=1995,
volume=24,
number=1
}

@Article{CidonKMP1995,
title={Greedy Packet Scheduling},
author={Israel Cidon and Shay Kutten and Yishay Mansour and David
Peleg},
pages={148--157},
journal=sicomp,
month=feb,
year=1995,
volume=24,
number=1
}

@Article{NaorR1995,
title={Optimal File Sharing in Distributed Networks},
author={Moni Naor and Ron M. Roth},
pages={158--183},
journal=sicomp,
month=feb,
year=1995,
volume=24,
number=1
}

@Article{HeffernanM1995,
title={An Optimal Algorithm for Computing Visibility in the Plane},
author={Paul J. Heffernan and Joseph S. B. Mitchell},
pages={184--201},
journal=sicomp,
month=feb,
year=1995,
volume=24,
number=1
}


                              April 1995
                         Volume 24, Number 2

@Article{CheriyanH1995,
title={A Randomized Maximum-Flow Algorithm},
author={Joseph Cheriyan and Torben Hagerup},
pages={203--226},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}

@Article{Natarajan1995,
title={Sparse Approximate Solutions to Linear Systems},
author={B. K. Natarajan},
pages={227--234},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}

@Article{WangL1995,
title={A Heuristic Scheduling of Independent Tasks with Bottleneck
Resource Constraints},
author={Qingzhou Wang and Ernst L. Leiss},
pages={235--241},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}

@Article{GrigorievSY1995,
title={On Computing Algebraic Functions Using Logarithms and
Exponentials},
author={Dima Grigoriev and Michael Singer and Andrew Yao},
pages={242--246},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}

@Article{KapoorR1995,
title={Algorithms for Enumerating All Spanning Trees of Undirected and
Weighted Graphs},
author={Sanjiv Kapoor and H. Ramesh},
pages={247--265},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}

@Article{FichMP1995,
title={Permuting in Place},
author={Faith E. Fich and Ian Munro and Patricio V. Poblete},
pages={266--278},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}

@Article{JuedesL1995,
title={The Complexity and Distribution of Hard Problems},
author={David W. Juedes and Jack H. Lutz},
pages={279--295},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}

@Article{GoemansW1995,
title={A General Approximation Technique for Constrained Forest
Problems},
author={Michel X. Goemans and David P. Williamson},
pages={296--317},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}

@Article{KorenS1995,
title={{$D^{\mathit{over}}$}: An Optimal On-Line Scheduling Algorithm
for Overloaded Uniprocessor Real-Time Systems},
author={Gilad Koren and Dennis Shasha},
pages={318--339},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}

@Article{KilpelainenM1995,
title={Ordered and Unordered Tree Inclusion},
author={Pekka Kilpel{\"a}inen and Heikki Mannila},
pages={340--356},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}

@Article{Mansour1995,
title={Randomized Interpolation and Approximation of Sparse
Polynomials},
author={Yishay Mansour},
pages={357--368},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}

@Article{DelcherK1995,
title={An {$\mathcal{NC}$} Algorithm for Evaluating Monotone Planar
Circuits},
author={A. L. Delcher and S. Rao Kosaraju},
pages={369--375},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}

@Article{ChorGK1995,
title={Private Computations over the Integers},
author={Benny Chor and Mih{\'a}ly Ger{\'e}b-Graus and Eyal
Kushilevitz},
pages={376--386},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}

@Article{LakshmanS1995,
title={Sparse Polynomial Interpolation in Nonstandard Bases},
author={Y. N. Lakshman and B. David Saunders},
pages={387--397},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}

@Article{LiV1995,
title={A New Approach to Formal Language Theory by {Kolmogorov}
Complexity},
author={Ming Li and Paul Vit{\'a}nyi},
pages={398--410},
journal=sicomp,
month=apr,
year=1995,
volume=24,
number=2
}


                              June 1995
                         Volume 24, Number 3

@Article{Hsu1995,
title={{$O(M\cdot N)$} Algorithms for the Recognition and Isomorphism
Problems on Circular-Arc Graphs},
author={Wen-Lian Hsu},
pages={411--439},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}

@Article{AgrawalKR1995,
title={When Trees Collide: An Approximation Algorithm for the
Generalized {Steiner} Problem on Networks},
author={Ajit Agrawal and Philip Klein and R. Ravi},
pages={440--456},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}

@Article{YangLW1995,
title={Rectilinear Path Problems among Rectilinear Obstacles
Revisited},
author={Chung-Do Yang and D. T. Lee and C. K. Wong},
pages={457--472},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}

@Article{Ganz1995,
title={Evaluation of Polynomials Using the Structure of the
Coefficients},
author={J{\"u}rg Ganz},
pages={473--483},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}

@Article{FriezeKR1995,
title={When is the Assignment Bound Tight for the Asymmetric
Traveling-Salesman Problem?},
author={Alan Frieze and Richard M. Karp and Bruce Reed},
pages={484--493},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}

@Article{Goldberg1995,
title={Scaling Algorithms for the Shortest Paths Problem},
author={Andrew V. Goldberg},
pages={494--504},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}

@Article{Benczur1995,
title={Counterexamples for Directed and Node Capacitated Cut-Trees},
author={Andr{\'a}s A. Bencz{\'u}r},
pages={505--510},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}

@Article{KannanW1995,
title={Tree Reconstruction from Partial Orders},
author={Sampath K. Kannan and Tandy J. Warnow},
pages={511--519},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}

@Article{Giancarlo1995,
title={A Generalization of the Suffix Tree to Square Matrices, with
Applications},
author={Raffaele Giancarlo},
pages={520--562},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}

@Article{TokuyamaN1995,
title={Efficient Algorithms for the {Hitchcock} Transportation
Problem},
author={Takeshi Tokuyama and Jun Nakano},
pages={563--578},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}

@Article{Cohen1995,
title={Approximate Max-Flow on Small Depth Networks},
author={Edith Cohen},
pages={579--597},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}

@Article{DukeLR1995,
title={A Fast Approximation Algorithm for Computing the Frequencies of
Subgraphs in a Given Graph},
author={Richard A Duke and Hanno Lefmann and Vojtech Rodl},
pages={598--620},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}

@Article{MejeanMR1995,
title={A Variational Method for Analysing Unit Clause Search},
author={Henri-M. M{\'e}jean and Henri Morel and G{\'e}rard Reynaud},
pages={621--649},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}

@Article{EmirisC1995,
title={A General Approach to Removing Degeneracies},
author={Ioannis Z. Emiris and John F. Canny},
pages={650--664},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}

@Article{SnyderS1995,
title={A Priori Bounds on the {Euclidean} Traveling Salesman},
author={Timothy Law Snyder and J. Michael Steele},
pages={665--671},
journal=sicomp,
month=jun,
year=1995,
volume=24,
number=3
}


                             August 1995
                         Volume 24, Number 4

@Article{BuhrmanHL1995,
title={{SPARSE} Reduces Conjunctively to {TALLY}},
author={Harry Buhrman and Edith Hemaspaandra and Luc Longpr{\'e}},
pages={673--681},
journal=sicomp,
month=aug,
year=1995,
volume=24,
number=4
}

@Article{BshoutyCE1995,
title={Size-Depth Tradeoffs for Algebraic Formulas},
author={Nader H. Bshouty and Richard Cleve and Wayne Eberly},
pages={682--705},
journal=sicomp,
month=aug,
year=1995,
volume=24,
number=4
}

@Article{BshoutyHH1995,
title={Learning Arithmetic Read-Once Formulas},
author={Nader H. Bshouty and Thomas R. Hancock and Lisa Hellerstein},
pages={706--735},
journal=sicomp,
month=aug,
year=1995,
volume=24,
number=4
}

@Article{FederKNN1995,
title={Amortized Communication Complexity},
author={Tom{\`a}s Feder and Eyal Kushilevitz and Moni Naor and Noam
Nisan},
pages={736--750},
journal=sicomp,
month=aug,
year=1995,
volume=24,
number=4
}

@Article{LennerstadL1995,
title={An Optimal Execution Time Estimate of Static Versus Dynamic
Allocation in Multiprocessor Systems},
author={H{\aa}kan Lennerstad and Lars Lundberg},
pages={751--764},
journal=sicomp,
month=aug,
year=1995,
volume=24,
number=4
}

@Article{Murota1995,
title={Computing the Degree of Determinants Via Combinatorial
Relaxation},
author={Kazuo Murota},
pages={765--796},
journal=sicomp,
month=aug,
year=1995,
volume=24,
number=4
}

@Article{GilliesL1995,
title={Scheduling Tasks with {AND/OR} Precedence Constraints},
author={Donald W. Gillies and Jane W.-S. Liu},
pages={797--810},
journal=sicomp,
month=aug,
year=1995,
volume=24,
number=4
}

@Article{PanP1995,
title={Work-Preserving Speed-Up of Parallel Matrix Computations},
author={Victor Y. Pan and Franco P. Preparata},
pages={811--821},
journal=sicomp,
month=aug,
year=1995,
volume=24,
number=4
}

@Article{Poljak1995,
title={Integer Linear Programs and Local Search for Max-Cut},
author={Svatopluk Poljak},
pages={822--839},
journal=sicomp,
month=aug,
year=1995,
volume=24,
number=4
}

@Article{HemaspaandraS1995,
title={Easily Checked Generalized Self-Reducibility},
author={Lane A. Hemaspaandra and Riccardo Silvestri},
pages={840--858},
journal=sicomp,
month=aug,
year=1995,
volume=24,
number=4
}

@Article{KhullerRY1995,
title={Approximating the Minimum Equivalent Digraph},
author={Samir Khuller and Balaji Raghavachari and Neal Young},
pages={859--872},
journal=sicomp,
month=aug,
year=1995,
volume=24,
number=4
}

@Article{DowneyF1995,
title={Fixed-Parameter Tractability and Completeness {I}: Basic
Results},
author={Rod G. Downey and Michael R. Fellows},
pages={873--921},
journal=sicomp,
month=aug,
year=1995,
volume=24,
number=4
}

                             October 1995
                         Volume 24, Number 5

@Article{ChouK1995,
title={Computational Complexity of Two-Dimensional Regions},
author={Arthur W. Chou and Ker-I Ko},
pages={923--947},
journal=sicomp,
month=oct,
year=1995,
volume=24,
number=5
}

@Article{Giesbrecht1995,
title={Nearly Optimal Algorithms for Canonical Matrix Forms},
author={Mark Giesbrecht},
pages={948--969},
journal=sicomp,
month=oct,
year=1995,
volume=24,
number=5
}

@Article{CohenDTT1995,
title={Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and
Planar {$ST$}-Digraphs},
author={Robert F. Cohen and Giuseppe Di Battista and Roberto Tamassia
and Ioannis G. Tollis},
pages={970--1001},
journal=sicomp,
month=oct,
year=1995,
volume=24,
number=5
}

@Article{MillerN1995,
title={Flow in Planar Graphs with Multiple Sources and Sinks},
author={Gary L. Miller and Joseph (Seffi) Naor},
pages={1002--1017},
journal=sicomp,
month=oct,
year=1995,
volume=24,
number=5
}

@Article{Gaertner1995,
title={A Subexponential Algorithm for Abstract Optimization Problems},
author={Bernd G{\"a}rtner},
pages={1018--1035},
journal=sicomp,
month=oct,
year=1995,
volume=24,
number=5
}

@Article{ChariRS1995,
title={Randomness-Optimal Unique Element Isolation with Applications
to Perfect Matching and Related Problems},
author={Suresh Chari and Pankaj Rohatgi and Aravind Srinivasan},
pages={1036--1050},
journal=sicomp,
month=oct,
year=1995,
volume=24,
number=5
}

@Article{HoeftingW1995,
title={Minimum Cost Paths in Periodic Graphs},
author={Franz H{\"o}fting and Egon Wanke},
pages={1051--1067},
journal=sicomp,
month=oct,
year=1995,
volume=24,
number=5
}

@Article{Ogihara1995,
title={Polynomial-Time Membership Comparable Sets},
author={Mitsunori Ogihara},
pages={1068--1081},
journal=sicomp,
month=oct,
year=1995,
volume=24,
number=5
}

@Article{Fu1995,
title={With Quasilinear Queries {EXP} Is Not Polynomial Time {Turing}
Reducible to Sparse Sets},
author={Bin Fu},
pages={1082--1090},
journal=sicomp,
month=oct,
year=1995,
volume=24,
number=5
}

@Article{AnderssonO1995,
title={New Tight Bounds on Uniquely Represented Dictionaries},
author={Arne Andersson and Thomas Ottmann},
pages={1091--1103},
journal=sicomp,
month=oct,
year=1995,
volume=24,
number=5
}

@Article{HanLL1995,
title={Scheduling Jobs with Temporal Distance Constraints},
author={Ching-Chih Han and Kwei-Jay Lin and Jane W.-S. Liu},
pages={1104--1121},
journal=sicomp,
month=oct,
year=1995,
volume=24,
number=5
}

@Article{JiangL1995,
title={On the Approximation of Shortest Common Supersequences and
Longest Common Subsequences},
author={Tao Jiang and Ming Li},
pages={1122--1139},
journal=sicomp,
month=oct,
year=1995,
volume=24,
number=5
}

                         Volume 24, Number 6
                            December 1995

@Article{DevroyeR1995:1141,
title={On the Generation of Random Binary Search Trees},
author={Luc Devroye and John Michael Robson},
pages={1141--1156},
journal=sicomp,
month=dec,
year=1995,
volume=24,
number=6,
c-references={TOMS::KachitvichyanukulS1988}
}

@Article{DevroyeR1995:1157,
title={On the Variance of the Height of Random Binary Search Trees},
author={Luc Devroye and Bruce Reed},
pages={1157--1162},
journal=sicomp,
month=dec,
year=1995,
volume=24,
number=6
}

@Article{LarmoreP1995,
title={Constructing {Huffman} Trees in Parallel},
author={Lawrence L. Larmore and Teresa M. Przytycka},
pages={1163--1169},
journal=sicomp,
month=dec,
year=1995,
volume=24,
number=6
}

@Article{Lutz1995,
title={Weakly Hard Problems},
author={Jack H. Lutz},
pages={1170--1189},
journal=sicomp,
month=dec,
year=1995,
volume=24,
number=6
}

@Article{BuchsbaumST1995,
title={Data-Structural Bootstrapping, Linear Path Compression, and
Catenable Heap-Ordered Double-Ended Queues},
author={Adam L. Buchsbaum and Rajamani Sundar and Robert E. Tarjan},
pages={1190--1206},
journal=sicomp,
month=dec,
year=1995,
volume=24,
number=6
}

@Article{SekarRR1995,
title={Adaptive Pattern Matching},
author={R. C. Sekar and R. Ramesh and I. V. Ramakrishnan},
pages={1207--1234},
journal=sicomp,
month=dec,
year=1995,
volume=24,
number=6
}

@Article{MendelzonW1995,
title={Finding Regular Simple Paths in Graph Databases},
author={Alberto O. Mendelzon and Peter T. Wood},
pages={1235--1258},
journal=sicomp,
month=dec,
year=1995,
volume=24,
number=6
}

@Article{NaorS1995,
title={What Can Be Computed Locally?},
author={Moni Naor and Larry Stockmeyer},
pages={1259--1277},
journal=sicomp,
month=dec,
year=1995,
volume=24,
number=6
}

@Article{EiterG1995,
title={Identifying the Minimal Transversals of a Hypergraph and
Related Problems},
author={Thomas Eiter and Georg Gottlob},
pages={1278--1304},
journal=sicomp,
month=dec,
year=1995,
volume=24,
number=6
}

@Article{Kalorkoti1995,
title={On the Reuse of Additions in Matrix Multiplication},
author={K. Kalorkoti},
pages={1305--1312},
journal=sicomp,
month=dec,
year=1995,
volume=24,
number=6
}

@Article{ShmoysWW1995,
title={Scheduling Parallel Machines On-Line},
author={David B. Shmoys and Joel Wein and David P. Williamson},
pages={1313--1331},
journal=sicomp,
month=dec,
year=1995,
volume=24,
number=6
}

@Article{HanKRT1995,
title={Computing Minimal Spanning Subgraphs in Linear Time},
author={Xiaofeng Han and Pierre Kelsen and Vijaya Ramachandran and
Robert Tarjan},
pages={1332--1358},
journal=sicomp,
month=dec,
year=1995,
volume=24,
number=6
}

                            February 1996
                         Volume 25, Number 1

@Article{GroveHK1996,
title={Asymptotic Conditional Probabilities: The Unary Case},
author={Adam J. Grove and Joseph Y. Halpern and Daphne Koller},
pages={1--51},
journal=sicomp,
month=feb,
year=1996,
volume=25,
number=1
}

@Article{Han1996,
title={A Fast Derandomization Scheme and Its Applications},
author={Yijie Han},
pages={52--82},
journal=sicomp,
month=feb,
year=1996,
volume=25,
number=1
}

@Article{AgarwalaF1996,
title={Weighted Multidimensional Search and Its Application to Convex
Optimization},
author={Richa Agarwala and David Fern{\'a}ndez-Baca},
pages={83--99},
journal=sicomp,
month=feb,
year=1996,
volume=25,
number=1
}

@Article{AgarwalS1996,
title={Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in
Three Dimensions},
author={Pankaj K. Agarwal and Micha Sharir},
pages={100--116},
journal=sicomp,
month=feb,
year=1996,
volume=25,
number=1
}

@Article{KapronC1996,
title={A New Characterization of Type-2 Feasibility},
author={B. M. Kapron and S. A. Cook},
pages={117--132},
journal=sicomp,
month=feb,
year=1996,
volume=25,
number=1
}

@Article{Regan1996,
title={Linear Time and Memory-Efficient Computation},
author={Kenneth W. Regan},
pages={133--168},
journal=sicomp,
month=feb,
year=1996,
volume=25,
number=1
}

@Article{GoldreichK1996,
title={On the Composition of Zero-Knowledge Proof Systems},
author={Oded Goldreich and Hugo Krawczyk},
pages={169--192},
journal=sicomp,
month=feb,
year=1996,
volume=25,
number=1
}

@Article{FennerFK1996,
title={The Isomorphism Conjecture Holds Relative to an Oracle},
author={Stephen Fenner and Lance Fortnow and Stuart A. Kurtz},
pages={193--206},
journal=sicomp,
month=feb,
year=1996,
volume=25,
number=1
}

@Article{ChiangPT1996,
title={A Unified Approach to Dynamic Point Location, Ray Shooting, and
Shortest Paths in Planar Maps},
author={Yi-Jen Chiang and Franco P. Preparata and Roberto Tamassia},
pages={207--233},
journal=sicomp,
month=feb,
year=1996,
volume=25,
number=1
}

                              April 1996
                         Volume 25, Number 2

@Article{GargVY1996,
title={Approximate Max-Floor Min-(Multi)Cut Theorems and Their
Applications},
author={Naveen Garg and Vijay V. Vazirani and Mihalis Yannakakis},
pages={235--251},
journal=sicomp,
month=apr,
year=1996,
volume=25,
number=2
}

@Article{RubinfeldS1996,
title={Robust Characterizations of Polynomials with Applications to
Program Testing},
author={Ronitt Rubinfeld and Madhu Sudan},
pages={252--271},
journal=sicomp,
month=apr,
year=1996,
volume=25,
number=2,
XXX-preliminary={SODA::RubinfeldS1992, STOC::GemmellLRSW1991}
}

@Article{BafnaP1996,
title={Genome Rearragements and Sorting by Reversals},
author={Vineet Bafna and Pavel A. Pevzner},
pages={272--289},
journal=sicomp,
month=apr,
year=1996,
volume=25,
number=2,
preliminary={FOCS::BafnaP1993:148}
}

@Article{SatyanarayanaWCP1996,
title={Note on ``{A} Linear-Time Algorithm for Computing
{$K$}-Terminal Reliability in a Series-Parallel Network''},
author={A. Satyanarayana and R. K. Wood and L. Camarinopoulos and G.
Pampoukis},
pages={290},
journal=sicomp,
month=apr,
year=1996,
volume=25,
number=2
}

@Article{HuttonL1996,
title={Upward Planar Drawings of Single-Source Acyclic Digraphs},
author={Michael D. Hutton and Anna Lubiw},
pages={291--311},
journal=sicomp,
month=apr,
year=1996,
volume=25,
number=2,
preliminary={SODA::HuttonL1991:203}
}

@Article{RamachandranY1996,
title={An Efficient Parallel Algorithm for the General Planar Monotone
Circuite Value Problem},
author={Vijaya Ramachandran and Honghua Yang},
pages={312--339},
journal=sicomp,
month=apr,
year=1996,
volume=25,
number=2,
preliminary={SODA::RamachandranY1994:622}
}

@Article{ChangK1996,
title={The {Boolean} Hierarchy and the Polynomial Hierarchy: A Closer
Connection},
author={Richard Chang and Jim Kadin},
pages={340--354},
journal=sicomp,
month=apr,
year=1996,
volume=25,
number=2
}

@Article{KhullerRY1996,
title={Low-Degree Spanning Trees of Small Weight},
author={Samir Khuller and Balaji Raghavachari and Neal Young},
pages={355--368},
journal=sicomp,
month=apr,
year=1996,
volume=25,
number=2
}

@Article{AttiyaHR1996,
title={Optimal Clock Synchronization Under Different Delay
Assumptions},
author={Hagit Attiya and Amir Herzberg and Sergio Rajsbaum},
pages={369--389},
journal=sicomp,
month=apr,
year=1996,
volume=25,
number=2
}

@Article{DengHH1996,
title={Linear-Time Representation Algorithms for Proper Circular-Arc
Graphs and Proper Interval Graphs},
author={Xiaotie Deng and Pavol Hell and Jing Huang},
pages={390--403},
journal=sicomp,
month=apr,
year=1996,
volume=25,
number=2
}

@Article{RheeLDL1996,
title={An {$O(N+M)$}-Time Algorithm for Finding a Minimum-Weight
Dominating Set in a Permutation Graph},
author={C. Rhee and Y. D. Liang and S. K. Dhall and S.
Lakshmivarahan},
pages={404--419},
journal=sicomp,
month=apr,
year=1996,
volume=25,
number=2
}

@Article{MathurR1996,
title={Generalized {Kraft's} Inequality and Discrete {$k$}-Modal
Search},
author={Anmol Mathur and Edward M. Reingold},
pages={420--447},
journal=sicomp,
month=apr,
year=1996,
volume=25,
number=2
}

@Article{StearnsH1996,
title={An Algebraic Model for Combinatorial Problems},
author={Richard E. Stearns and Hunt III, Harry B.},
pages={448--476},
journal=sicomp,
month=apr,
year=1996,
volume=25,
number=2
}

                              June 1996
                         Volume 25, Number 3

@Article{IraniKP1996,
title={Strongly Competitive Algorithms for Paging with Locality of
Reference},
author={Sandy Irani and Anna R. Karlin and Steven Phillips},
pages={477--497},
journal=sicomp,
month=jun,
year=1996,
volume=25,
number=3
}

@Article{IraniR1996,
title={On the Value of Coordination in Distributed Decision Making},
author={Sandy Irani and Yuval Rabani},
pages={498--519},
journal=sicomp,
month=jun,
year=1996,
volume=25,
number=3,
preliminary={FOCS::IraniR1993:12}
}

@Article{CondonLLS1996,
title={Complexity of Sub-Bus Mesh Computations},
author={Anne Condon and Richard Ladner and Jordan Lampe and Rakesh
Sinha},
pages={520--539},
journal=sicomp,
month=jun,
year=1996,
volume=25,
number=3
}

@Article{KaplanS1996,
title={Pathwidth, Bandwidth, and Completion Problems to Proper
Interval Graphs with Small Cliques},
author={Haim Kaplan and Ron Shamir},
pages={540--561},
journal=sicomp,
month=jun,
year=1996,
volume=25,
number=3
}

@Article{FriedmanHS1996,
title={Efficiently Planning Compliant Motion in the Plane},
author={J. Friedman and J. Hershberger and J. Snoeyink},
pages={562--599},
journal=sicomp,
month=jun,
year=1996,
volume=25,
number=3
}

@Article{AroraLM1996,
title={On-Line Algorithms for Path Selection in a Nonblocking
Network},
author={Sanjeev Arora and F. T. Leighton and Bruce M. Maggs},
pages={600--625},
journal=sicomp,
month=jun,
year=1996,
volume=25,
number=3,
preliminary={STOC::AroraLM1990}
}

@Article{KirousisT1996,
title={The Linkage of a Graph},
author={Lefteris M. Kirousis and Dimitrios M. Thilikos},
pages={626--647},
journal=sicomp,
month=jun,
year=1996,
volume=25,
number=3
}

@Article{KannanM1996,
title={An Algorithm for Locating Nonoverlapping Regions of Maximum
Alignment Score},
author={Sampath K. Kannan and Eugene W. Myers},
pages={648--662},
journal=sicomp,
month=jun,
year=1996,
volume=25,
number=3
}

@Article{JimM1996,
title={Full Abstraction and the Context Lemma},
author={Trevor Jim and Albert R. Meyer},
pages={663--696},
journal=sicomp,
month=jun,
year=1996,
volume=25,
number=3
}

                         Volume 25, Number 4
                             August 1996

@Article{HemaspaandraNOS1996,
title={Computing Solutions Uniquely Collapses the Polynomial
Hierarchy},
author={Lane A. Hemaspaandra and Ashish V. Naik and Mitsunori Ogihara
and Alan L. Selman},
pages={697--708},
journal=sicomp,
month=aug,
year=1996,
volume=25,
number=4
}

@Article{JimboM1996,
title={A Method of Constructing Selection Networks with {$O(\log n)$}
Depth},
author={S. Jimbo and A. Maruoka},
pages={709--739},
journal=sicomp,
month=aug,
year=1996,
volume=25,
number=4
}

@Article{HastadLR1996,
title={Analysis of Backoff Protocols for Multiple Access Channels},
author={Johan H{\aa}stad and Tom Leighton and Brian Rogoff},
pages={740--774},
journal=sicomp,
month=aug,
year=1996,
volume=25,
number=4
}

@Article{KapoorS1996,
title={New Techniques for Exact and Approximate Dynamic Closest-Point
Problems},
author={Sanjiv Kapoor and Michiel Smid},
pages={775--796},
journal=sicomp,
month=aug,
year=1996,
volume=25,
number=4
}

@Article{Klein1996,
title={Efficient Parallel Algorithms for Chordal Graphs},
author={Philip N. Klein},
pages={797--827},
journal=sicomp,
month=aug,
year=1996,
volume=25,
number=4,
preliminary={focs::Klein1988:150}
}

@Article{LiskiewiczR1996,
title={The Sublogarithmic Alternating Space World},
author={Maciej Li{\'s}kiewicz and R{\"u}diger Reischuk},
pages={828--861},
journal=sicomp,
month=aug,
year=1996,
volume=25,
number=4
}

@Article{Rajasekaran1996,
title={Tree-Adjoining Language Parsing in {$o(n^6)$} Time},
author={Sanguthevar Rajasekaran},
pages={862--873},
journal=sicomp,
month=aug,
year=1996,
volume=25,
number=4
}

@Article{Ramanan1996,
title={An Efficient Parallel Algorithm for the Matrix-Chain-Product
Problem},
author={Prakash Ramanan},
pages={874--893},
journal=sicomp,
month=aug,
year=1996,
volume=25,
number=4
}

@Article{RheeT1996,
title={Convergence in Distribution for Best-Fit Decreasing},
author={Wansoo T. Rhee and Michel Talagrand},
pages={894--906},
journal=sicomp,
month=aug,
year=1996,
volume=25,
number=4
}

                         Volume 25, Number 5
                             October 1996

@Article{GalilP1996,
title={Alphabet-Independent Two-Dimensional Witness Computation},
author={Zvi Galil and Kunsoo Park},
pages={907--935},
journal=sicomp,
month=oct,
year=1996,
volume=25,
number=5
}

@Article{GilHW1996,
title={The Tree Model for Hashing: Lower and Upper Bounds},
author={Joseph Gil and Meyer auf der Heide, Friedhelm and Avi
Wigderson},
pages={936--955},
journal=sicomp,
month=oct,
year=1996,
volume=25,
number=5,
preliminary={STOC::GilHW1990}
}

@Article{BattistaT1996,
title={On-Line Planarity Testing},
author={Giuseppe Di Battista and Roberto Tamassia},
pages={956--997},
journal=sicomp,
month=oct,
year=1996,
volume=25,
number=5,
preliminary={FOCS::BattistaT1989:436}
}

@Article{KedemLP1996,
title={Parallel Suffix--Prefix-Matching Algorithm and Applications},
author={Zvi M. Kedem and Gad M. Landau and Krishna V. Palem},
pages={998--1023},
journal=sicomp,
month=oct,
year=1996,
volume=25,
number=5
}

@Article{AspnesW1996,
title={Randomized Consensus in Expected {$O(N \log^2 N)$} Operations
per Processor},
author={James Aspnes and Orli Waarts},
pages={1024--1044},
journal=sicomp,
month=oct,
year=1996,
volume=25,
number=5,
preliminary={FOCS::AspnesW1992:137}
}

@Article{FujitaY1996,
title={Optiaml Group Crossing in Hypercubes under a Circuit-Switching
Model},
author={Satoshi Fujita and Masafumi Yamashita},
pages={1045--1060},
journal=sicomp,
month=oct,
year=1996,
volume=25,
number=5
}

@Article{Pellegrini1996,
title={On Point Location and Motion Planning Among Simplices},
author={Marco Pellegrini},
pages={1061--1081},
journal=sicomp,
month=oct,
year=1996,
volume=25,
number=5,
preliminary={STOC::Pellegrini1994:95}
}

@Article{CypherK1996,
title={Bounds on the Efficiency of Message-Passing Protocols for
Parallel Computers},
author={Robert Cypher and Smaragda Konstantinidou},
pages={1082--1104},
journal=sicomp,
month=oct,
year=1996,
volume=25,
number=5
}

@Article{ShihL1996,
title={On-Line Scheduling of Imprecise Computations to Minimize
Error},
author={Wei-Kuan Shih and Jane W. S. Liu},
pages={1105--1121},
journal=sicomp,
month=oct,
year=1996,
volume=25,
number=5
}

                         Volume 25, Number 6
                             December 1996

@Article{Kummer1996,
title={Kolmogorov Complexity and Instance Complexity of Recursively
Enumerable Sets},
author={Martin Kummer},
pages={1123--1143},
journal=sicomp,
month=dec,
year=1996,
volume=25,
number=6,
preliminary={sctc::Kummer1995}
}

@Article{CheriyanHM1996,
title={An {$o(n^3)$}-Time Maximum-Flow Algorithm},
author={Joseph Cheriyan and Torben Hagerup and Kurt Mehlhorn},
pages={1144--1170},
journal=sicomp,
month=dec,
year=1996,
volume=25,
number=6,
preliminary={icalp::CheriyanHM1990}
}

@Article{AjtaiM1996,
title={A Deterministic {$\mathrm{poly}(\log \log n)$}-Time
{$n$}-Processor Algorithm for Linear Programming in Fixed Dimension},
author={Miklos Ajtai and Nimrod Megiddo},
pages={1171--1195},
journal=sicomp,
month=dec,
year=1996,
volume=25,
number=6
}

@Article{DietzfelbingerKR1996,
title={Feasible Time-Optimal Algorithms for {Boolean} Functions on
Exclusive-Write Parallel Random-Access Machines},
author={Martin Dietzfelbinger and Miros{\l}aw Kuty{\l}owski and
R{\"u}diger Reischuk},
pages={1196--1230},
journal=sicomp,
month=dec,
year=1996,
volume=25,
number=6,
preliminary={spaa::DietzfelbingerKR1990}
}

@Article{Sellen1996,
title={Lower Bounds for Geometrical and Physical Problems},
author={J{\"u}rgen Sellen},
pages={1231--1253},
journal=sicomp,
month=dec,
year=1996,
volume=25,
number=6
}

@Article{Allenberg-NavonyIM1996,
title={Average and Randomized Complexity of Distributed Problems},
author={Nechama Allenberg-Navony and Alon Itai and Shlomo Moran},
pages={1254--1267},
journal=sicomp,
month=dec,
year=1996,
volume=25,
number=6
}

@Article{BergadanoV1996,
title={Learning Behaviors of Automata from Multiplicity and
Equivalence Queries},
author={Francesco Bergadano and Stefano Varricchio},
pages={1268--1280},
journal=sicomp,
month=dec,
year=1996,
volume=25,
number=6
}

@Article{GolinY1996,
title={Prefix Codes: Equiprobable Words, Unequal Letter Costs},
author={Mordecai J. Golin and Neal Young},
pages={1281--1292},
journal=sicomp,
month=dec,
year=1996,
volume=25,
number=6
}

@Article{Zuckerman1996,
title={On Unapproximable Versions of \emph{NP}-Complete Problems},
author={David Zuckerman},
pages={1293--1304},
journal=sicomp,
month=dec,
year=1996,
volume=25,
number=6,
preliminary={sctc::Zuckerman1993}
}

@Article{Bodlaender1996,
title={A Linear-Time Algorithm for Finding Tree-Decompositions of
Small Treewidth},
author={Hans L. Bodlaender},
pages={1305--1317},
journal=sicomp,
month=dec,
year=1996,
volume=25,
number=6
}

@Article{ApostolicoB1996,
title={An Optimal {$O(\log \log n)$}-Time Parallel Algorithm for
Detecting All Squares in a String},
author={Alberto Apostolico and Dany Breslauer},
pages={1318--1331},
journal=sicomp,
month=dec,
year=1996,
volume=25,
number=6,
c-preliminary={icalp::ApostilocoB1992}
}

@Article{FischerMRT1996,
title={The Wakeup Problem},
author={Michael J. Fischer and Shlomo Moran and Steven Rudich and Gadi
Taubenfeld},
pages={1332--1357},
journal=sicomp,
month=dec,
year=1996,
volume=25,
number=6,
preliminary={stoc::FischerMRT1990}
}

@Article{BiniG1996,
title={Erratum: Fast Parallel Computations of the Polynomial Remainder
Sequence via {Bezout} and {Hankel} Matrices},
author={Dario Bini and Luca Gemignani},
pages=1358,
journal=sicomp,
month=dec,
year=1996,
volume=25,
number=6
}

                         Volume 26, Number 1
                             January 1997

@Article{AlonsoRS1997,
title={The Average-Case Complexity of Determining the Majority},
author={Laurent Alonso and Edward M. Reingold and Ren{\'e} Schott},
pages={1--14},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
siam-key={27591}
}

@Article{DubinerZ1997,
title={Amplification by Read-Once Formulas},
author={Moshe Dubiner and Uri Zwick},
pages={15--38},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
preliminary={focs::DubinerZ1992},
siam-key={23633}
}

@Article{NivatP1997,
title={Minimal Ascending and Descending Tree Automata},
author={Maurice Nivat and Andreas Podelski},
pages={39--58},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
siam-key={16407}
}

@Article{HanHT1997,
title={Threshold Computation and Cryptography Security},
author={Yenjo Han and Lane A. Hemaspaandra and Thomas Thierauf},
pages={59--78},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
siam-key={24046}
}

@Article{GeH1997,
title={Disjoint Rooted Spanning Trees with Small Depths in {deBruijn}
and {Kautz} Graphs},
author={Zhengyu Ge and S. Louis Hakimi},
pages={79--92},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
preliminary={},
siam-key={24419}
}

@Article{BorosHIK1997,
title={Polynomial-Time Recognition of 2-Monotonic Positive {Boolean}
Functions Given by an Oracle},
author={Endre Boros and Peter L. Hammer and Toshihide Ibaraki and
Kazuhiko Kawakami},
pages={93--109},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
preliminary={},
siam-key={26908}
}

@Article{BlumRS1997,
title={Navigating in Unfamiliar Geometric Terrain},
author={Avrim Blum and Prabhakar Raghavan and Baruch Schieber},
pages={110--137},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
preliminary={},
siam-key={19493}
}

@Article{BeaudryMPT1997,
title={Finite Monoids: From Word to Circuit Evaluation},
author={Martin Beaudry and Pierre McKenzie and Pierre P{\'e}ladeau and
Denis Th{\'e}rien},
pages={138--152},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
c-preliminary={stacs::BeaudryMPT1993},
siam-key={24953}
}

@Article{Mak1997,
title={Parallelism Always Helps},
author={Louis Mak},
pages={153--172},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
preliminary={},
siam-key={26540}
}

@Article{LiuS1997,
title={Stochastic Scheduling with Variable Profile and Precedence Constraints},
author={Zhen Liu and Eric Sanlaville},
pages={173--187},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
preliminary={},
siam-key={21894}
}

@Article{ChangGL1997,
title={On Bounded Queries and Approximation},
author={Richard Chang and William I. Gasarch and Carsten Lund},
pages={188--209},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
preliminary={focs::ChangG1993:547},
siam-key={26648}
}

@Article{FarachT1997,
title={Sparse Dynamic Programming for Evolutionary-Tree Comparison},
author={Martin Farach and Mikkel Thorup},
pages={210--230},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
preliminary={focs::FarachT1994},
siam-key={26242}
}

@Article{Kao1997,
title={Total Protection of Analytic-Invariant Information in
Cross-Tabulated Tables},
author={Ming-Yang Kao},
pages={231--242},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
preliminary={stacs::Kao1994},
siam-key={25358}
}

@Article{CuckerG1997,
title={On the Power of Real {Turing} Machines over Binary Inputs},
author={Felipe Cucker and Dima Grigoriev},
pages={243--254},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
preliminary={},
siam-key={27034}
}

@Article{KargerM1997,
title={An {$\mathcal{NC}$} Algorithm for Minimum Cuts},
author={David R. Karger and Rajeev Motwani},
pages={255--272},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
preliminary={stoc::KargerM1994:497},
siam-key={27308}
}

@Article{DolevIM1997,
title={Resource Bounds for Self-Stabilizing Message-Driven Protocols},
author={Shlomi Dolev and Amos Israeli and Shlomo Moran},
pages={273--290},
journal=sicomp,
month=jan,
year=1997,
volume=26,
number=1,
preliminary={podc::DolevIM1991},
siam-key={23507}
}

                         Volume 26, Number 2
                              April 1997

@Article{PedersenP1997,
title={Fail-Stop Signatures},
author={Torben Pryds Pedersen and Birgit Pfitzmann},
pages={291--330},
journal=sicomp,
month=apr,
year=1997,
volume=26,
number=2,
siam-key={}
}

@Article{Ripphausen-LipaWW1997,
title={The Vertex-Disjoint {Menger} Problem in Planar Graphs},
author={Heike Ripphausen-Lipa and Dorothea Wagner and Karsten Weihe},
pages={331--349},
journal=sicomp,
month=apr,
year=1997,
volume=26,
number=2,
siam-key={25356}
}

@Article{PanconesiS1997,
title={Randomized Distributed Edge Coloring via an Extension of the
{Chernoff--Hoeffding} Bounds},
author={Alessandro Panconesi and Aravind Srinivasan},
pages={350--368},
journal=sicomp,
month=apr,
year=1997,
volume=26,
number=2,
siam-key={25076}
}

@Article{CondonFLS1997,
title={Random Debaters and the Hardness of Approximating Stochastic
Functions},
author={Anne Condon and Joan Feinberg and Carsten Lund and Peter
Shor},
pages={369--400},
journal=sicomp,
month=apr,
year=1997,
volume=26,
number=2,
siam-key={26073}
}

@Article{Steinberg1997,
title={A Strip-Packing Algorithm with Absolute Performance Bound~2},
author={A. Steinberg},
pages={401--409},
journal=sicomp,
month=apr,
year=1997,
volume=26,
number=2,
siam-key={25580}
}

@Article{TengY1997,
title={Approximating Shortest Superstrings},
author={Shang-Hua Teng and Frances F. Yao},
pages={410--417},
journal=sicomp,
month=apr,
year=1997,
volume=26,
number=2,
siam-key={28612}

}

@Article{DolevS1997,
title={Bounded Concurrent Time-Stamping},
author={Danny Dolev and Nir Shavit},
pages={418--455},
journal=sicomp,
month=apr,
year=1997,
volume=26,
number=2,
siam-key={19264},
preliminary={stoc::DolevS1989}
}

@Article{PurdomH1997,
title={Probe Order Backtracking},
author={Purdom, Jr., Paul Walton and G. Neil Haven},
pages={456--483},
journal=sicomp,
month=apr,
year=1997,
volume=26,
number=2,
siam-key={25605}
}

@Article{Frederickson1997,
title={Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and
{$k$} Smallest Spaning Trees},
author={Greg N. Frederickson},
pages={484--538},
journal=sicomp,
month=apr,
year=1997,
volume=26,
number=2,
siam-key={22682},
preliminary={focs::Frederickson1991}
}

@Article{AlurAT1997,
title={Time-Adaptive Algorithms for Syncronization},
author={Rajeev Alur and Hagit Attiya and Gadi Taubenfeld},
pages={539--556},
journal=sicomp,
month=apr,
year=1997,
volume=26,
number=2,
siam-key={26524},
preliminary={stoc::AlurAT1994}
}

@Article{AllenderBI1997,
title={A First-Order Isomorphism Theorem},
author={Eric Allender and Jos{\'e} Balc{\'a}zar and Neil Immerman},
pages={557--567},
journal=sicomp,
month=apr,
year=1997,
volume=26,
number=2,
siam-key={27023},
preliminary={stacs::AllenderBI1993}
}

@Article{Verma1997,
title={General Techniques for Analyzing Recursive Algorithms with
Applications},
author={Rakesh M. Verma},
pages={568--581},
journal=sicomp,
month=apr,
year=1997,
volume=26,
number=2,
siam-key={24058}
}

@Article{Sebo1997,
title={Potentials in Undirected Graphs and Planar Multiflows},
author={Andr{\'a}s Seb{\H{o}}},
pages={582--603},
journal=sicomp,
month=apr,
year=1997,
volume=26,
number=2,
siam-key={18670}
}

                         Volume 26, Number 3
                              June 1997

@Article{PudlakRS1997,
title={Boolean Circuits, Tensor Ranks, and Communication Complexity},
author={Pavel Pudl{\'a}k and Vojt{\v{e}}ch R{\"o}dl and
Ji{\v{r}}{\'\i} Sgall},
pages={605--633},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={26480}
}

@Article{HemaspaandraR1997,
title={Unambiguous Computation: {Boolean} Hierarchies and Sparse
{Turing}-Complete Sets},
author={Lane A. Hemaspaandra and J{\"o}rg Rothe},
pages={634--653},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={26197}
}

@Article{MohabanS1997,
title={Ray Shooting Amidst Spheres in Three Dimensions and Related
Problems},
author={Shai Mohaban and Micha Sharir},
pages={654--674},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={25208}
}

@Article{Thomassen1997,
title={On the Complexity of Finding a Minimum Cycle Cover of a Graph},
author={Carsten Thomassen},
pages={675--677},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={26725}
}

@Article{ShiouraTU1997,
title={An Optimal Algorithm for Scanning All Spanning Trees of
Undirected Graphs},
author={Akiyoshi Shioura and Akihisa Tamura and Takeaki Uno},
pages={678--692},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={27088}
}

@Article{ImpagliazzoPS1997,
title={Size-Depth Tradeoffs for Threshold Circuits},
author={Russell Impagliazzo and Ramamohan Paturi and Michael E. Saks},
pages={693--707},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={28296}
}

@Article{Maass1997,
title={Bounds for the Computational Power and Learning Complexity of
Analog Neural Nets},
author={Wolfgang Maass},
pages={708--732},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={25604}
}

@Article{CaiC1997,
title={On the Amount of Nondeterminism and the Power of Verifying},
author={Liming Cai and Jianer Chen},
pages={733--750},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={25829},
preliminary={mfcs::CaiC1993}
}

@Article{Simon1997,
title={Bounds on the Number of Examples Needed for Learning
Functions},
author={Hans Ulrich Simon},
pages={751--763},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={25918}
}

@Article{Varricchio1997,
title={A Pumping Condition for Regular Sets},
author={Stefano Varricchio},
pages={764--771},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={17994}
}

@Article{Singh1997,
title={Leader Election in Complete Networks},
author={Gurdip Singh},
pages={772--785},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={27686}
}

@Article{DengM1997,
title={The Cost of Derandomization: Computability or Competitiveness},
author={Xiaotie Deng and Sanjeev Mahajan},
pages={786--802},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={20230},
preliminary={STOC::DengM1991}
}

@Article{ColeH1997,
title={Tighter Upper Bounds on the Exact Complexity of String
Matching},
author={Richard Cole and Ramesh Hariharan},
pages={803--856},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={24694}
}

@Article{BorchersD1997,
title={The {$k$-Steiner} Ratio in Graphs},
author={Al Borchers and Ding-Zhu Du},
pages={857--869},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={28108}
}

@Article{ChandrasekaranCGNVW1997,
title={A Note on ``{An} On-Line Scheduling Heuristic with Better Worst
Case Ratio than {Graham's} List Scheduling''},
author={R. Chandrasekaran and Bo Chien and G{\'a}bor Galambos and
P. R. Narayanan and Andr{\'e} van Vliet and Gerhard J. Woeginger},
pages={870--872},
journal=sicomp,
month=jun,
year=1997,
volume=26,
number=3,
siam-key={25877}
}