Limits to Parallel Computation: P-Completeness Theory

This volume provides an ideal introduction to key topics in parallel computing. With its cogent overview of the essentials of the subject as well as lists of P -complete- and open problems, extensive remarks corresponding to each problem, a thorough index, and extensive references, the book will prove invaluable to programmers stuck on problems that are particularly difficult to parallelize. In providing an up-to-date survey of parallel computing research from 1994, Topics in Parallel Computing will prove invaluable to researchers and professionals with an interest in the super computers of the future.

[1]  Philip N. Klein,et al.  Parallel Time O(log n) Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM , 1988, SIAM J. Comput..

[2]  Richard J. Anderson,et al.  Parallel Approximation Algorithms for Bin Packing , 1988, Inf. Comput..

[3]  Elias Dahlhaus,et al.  The Complexity of Subtheories of the Existential Linear Theory of Reals , 1989, CSL.

[4]  J. Hopcroft,et al.  Fast parallel matrix and GCD computations , 1982, FOCS 1982.

[5]  Thomas Zeugmann.  Computing Large Polynomial Powers Very Fast in Parallel , 1990, MFCS.

[6]  Paul G. Spirakis,et al.  Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P , 1988, SWAT.

[7]  John E. Savage,et al.  The parallel complexity of minimizing column conflicts , 1992, [1992] Proceedings of the Second Great Lakes Symposium on VLSI.

[8]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[9]  J. Håstad.  Computational limitations of small-depth circuits , 1987 .

[10]  Elias Dahlhaus,et al.  Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach , 1987, CSL.

[11]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[12]  Robert E. Tarjan,et al.  Notes on Introductory Combinatorics , 1983, Progress in Computer Science.

[13]  Sanguthevar Rajasekaran,et al.  Ranomized Parallel Computation , 1987, FCT.

[14]  Stephen A. Cook.  Path systems and language recognition , 1970, STOC '70.

[15]  Thomas Lengauer,et al.  The Binary Network Flow Problem is Logspace Complete for P , 1990, Theor. Comput. Sci..

[16]  Endre Szemerédi,et al.  There are no p-Complete Families of Symmetric Boolean Functions , 1989, Inf. Process. Lett..

[17]  A. E. Fincham,et al.  Parallel Computation , 1999, Algorithms and Theory of Computation Handbook.

[18]  Bonnie Berger,et al.  Approximation alogorithms for the maximum acyclic subgraph problem , 1990, SODA '90.

[19]  Donald B. Johnson,et al.  Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version) , 1982, FOCS.

[20]  Philip M. Long,et al.  Composite geometric concepts and polynomial predictability , 1990, COLT '90.

[21]  Mikhail J. Atallah,et al.  P-complete geometric problems , 1990, SPAA '90.

[22]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[23]  John C. Mitchell,et al.  On the Sequential Nature of Unification , 1984, J. Log. Program..

[24]  Xin He,et al.  A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs , 1988, SIAM J. Comput..

[25]  William F. McColl.  Planar Crossovers , 1981, IEEE Transactions on Computers.

[26]  Jonathan P. Sorenson.  Two Fast GCD Algorithms , 1994, J. Algorithms.

[27]  Leslie G. Valiant,et al.  Fast Parallel Computation of Polynomials Using Few Processors , 1983, SIAM J. Comput..

[28]  Shang-Hua Teng.  Matching randomly in parallel , 1989 .

[29]  Larry J. Stockmeyer,et al.  A Characterization of the Power of Vector Machines , 1976, J. Comput. Syst. Sci..

[30]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[31]  Marek Karpinski,et al.  Optimal parallel algorithm for the Hamiltonian cycle problem on dense graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[32]  Richard J. Anderson,et al.  Parallelism and greedy algorithms , 1984 .

[33]  Takayoshi Shoudai.  The Lexicographically First Topological Order Problem is NLOG-Complete , 1989, Inf. Process. Lett..

[34]  Allan Borodin,et al.  On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..

[35]  Richard J. Anderson,et al.  A P-complete problem and approximations to it , 1984 .

[36]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[37]  Jeffrey D. Ullman,et al.  Parallel complexity of logical query programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[38]  Avi Wigderson,et al.  Improving the performance guarantee for approximate graph coloring , 1983, JACM.

[39]  Jeffrey Scott Vitter,et al.  A Complexity Theoretic Approach to Incremental Computation , 1993, STACS.

[40]  Satoru Miyano,et al.  A List of P-Complete Problems , 1989 .

[41]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[42]  Oscar H. Ibarra,et al.  Characterizations and Computational Complexity of Systolic Trellis Automata , 1984, Theor. Comput. Sci..

[43]  Justin R. Smith.  Parallel Algorithms for Depth-First Searches I. Planar Graphs , 1986, SIAM J. Comput..

[44]  J. Doug Tygar,et al.  The computability and complexity of optical beam tracing , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[45]  Ming-Yang Kao,et al.  All Graphs have Cycle Separators and Planar Directed Depth-First Search is in DNC , 1988, AWOC.

[46]  Nicholas Pippenger.  Pebbling with an Auxiliary Pushdown , 1981, J. Comput. Syst. Sci..

[47]  Shigeki Iwata,et al.  Classes of Pebble Games and Complete Problems , 1979, SIAM J. Comput..

[48]  J. Reif,et al.  Parallel Tree Contraction Part 1: Fundamentals , 1989, Adv. Comput. Res..

[49]  Ming-Yang Kao,et al.  Parallel Depth-First Search in General Directed Graphs , 1990, SIAM J. Comput..

[50]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[51]  Marek Karpinski,et al.  An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3 , 1991, Inf. Process. Lett..

[52]  Wojciech Rytter,et al.  Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract) , 1989, MFCS.

[53]  Christos H. Papadimitriou.  Efficient Search for Rationals , 1979, Inf. Process. Lett..

[54]  Simon Kasif,et al.  On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks , 1990, Artif. Intell..

[55]  Howard J. Karloff.  An NC Algorithm for Brooks' Theorem , 1989, Theor. Comput. Sci..

[56]  Clifford Stein,et al.  Approximating the Minimum-Cost Maximum Flow is P-Complete , 1992, Inf. Process. Lett..

[57]  John E. Hopcroft,et al.  Polynomial-time algorithms for permutation groups , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[58]  Leslie Michael Goldschlager,et al.  Synchronous parallel computation. , 1978 .

[59]  Selim G. Akl,et al.  The maximum weight perfect matching problem for complete weighted graphs is in PC , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[60]  J. Machta,et al.  The parallel complexity of growth models , 1994 .

[61]  Mark K. Goldberg,et al.  A New Parallel Algorithm for the Maximal Independent Set Problem , 1989, SIAM J. Comput..

[62]  Judy Goldsmith,et al.  Nondterminism Within P , 1991, STACS.

[63]  John H. Reif,et al.  Depth-First Search is Inherently Sequential , 1985, Inf. Process. Lett..

[64]  Raymond Greenlaw,et al.  Breadth-Depth Search is P-Complete , 1993, Parallel Process. Lett..

[65]  John E. Savage,et al.  A Parallel Algorithm for Channel Routing , 1988, WG.

[66]  David P. Helmbold,et al.  Fast scheduling algorithms on parallel computers , 1984 .

[67]  Gary L. Miller,et al.  Parallel Tree Contraction, Part 2: Further Applications , 1991, SIAM J. Comput..

[68]  Ernst W. Mayr,et al.  Perfect Graphs and Parallel Algorithms , 1986, ICPP.

[69]  Guy E. Blelloch,et al.  Scans as Primitive Parallel Operations , 1989, ICPP.

[70]  Samir Khuller,et al.  Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[71]  S. N. Maheshwari,et al.  The Parallel Complexity of Finding a Blocking Flow in a 3-Layer Network , 1989, Inf. Process. Lett..

[72]  John Hershberger.  Upper Envelope Onion Peeling , 1992, Comput. Geom..

[73]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[74]  Stephen A. Cook,et al.  Complexity Theory of Parallel Time and Hardware , 1989, Inf. Comput..

[75]  Benjamin W. Wah,et al.  Computers for Artificial Intelligence Applications , 1986 .

[76]  Mark W. Krentel.  On Finding and Verifying Locally Optimal Solutions , 1990, SIAM J. Comput..

[77]  Dung T. Huynh,et al.  The Parallel Complexity of Coarsest Set Partition Problems , 1992, Inf. Process. Lett..

[78]  Eli Upfal,et al.  The Parallel Complexity of Scheduling with Precedence Constraints , 1986, J. Parallel Distributed Comput..

[79]  Denis Thérien,et al.  The membership problem in aperiodic transformation monoids , 1992, JACM.

[80]  Cynthia Dwork,et al.  Parallel Algorithms for Term Matching , 1988, SIAM J. Comput..

[81]  Michael Luby.  A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..

[82]  Raymond Greenlaw.  Towards understanding the effective parallelization of sequential algorithms , 1992 .

[83]  Ashok Subramanian,et al.  A New Approach to Stable Matching Problems , 1989, SIAM J. Comput..

[84]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[85]  Gary L. Miller,et al.  Subtree isomorphism is in random NC , 1988, Discret. Appl. Math..

[86]  Stephen A. Cook,et al.  Parallel pointer machines , 2005, computational complexity.

[87]  Larry Rudolph,et al.  The power of parallel prefix , 1985, IEEE Transactions on Computers.

[88]  John N. Tsitsiklis,et al.  The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..

[89]  Andrzej Lingas,et al.  Multi-List Ranking: Complexity and Applications , 1993, STACS.

[90]  Yu Lin.  Parallel computational methods in integer linear programming , 1991 .

[91]  Ernst W. Mayr,et al.  The Complexity of Circuit Value and Network Stability , 1992, J. Comput. Syst. Sci..

[92]  David B. Shmoys,et al.  Efficient Parallel Algorithms for Edge Coloring Problems , 1987, J. Algorithms.

[93]  Eli Upfal,et al.  The Complexity of Parallel Search , 1988, J. Comput. Syst. Sci..

[94]  Michael T. Goodrich,et al.  Triangulating a Polygon in Parallel , 1989, J. Algorithms.

[95]  Paul Beame,et al.  Parallel search for maximal independence given minimal dependence , 1990, SODA '90.

[96]  Ian Parberry,et al.  Parallel complexity theory , 1987, Research notes in theoretical computer science.

[97]  Patrick William Dymond.  Simultaneous resource bounds and parallel computation , 1980 .

[98]  Robert E. Wilber.  White pebbles help , 1985, STOC '85.

[99]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[100]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[101]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity , 1994 .

[102]  Richard Edwin Stearns,et al.  Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

[103]  John H. Reif,et al.  Synthesis of Parallel Algorithms , 1993 .

[104]  Xin He,et al.  A P-Complete Graph Partition Problem , 1990, Theor. Comput. Sci..

[105]  Allan Borodin,et al.  Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines , 1984, Inf. Control..

[106]  Richard J. Lipton,et al.  Linear Programming is Log-Space Hard for P , 1979, Inf. Process. Lett..

[107]  Wojciech Rytter,et al.  Efficient parallel algorithms , 1988 .

[108]  Alejandro A. Schäffer,et al.  Optimal edge ranking of trees in polynomial time , 1993, SODA '93.

[109]  Satoru Miyano.  Parallel Complexity and P-Complete Problems , 1988, FGCS.

[110]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[111]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[112]  Andrew V. Goldberg,et al.  A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network , 1989, Inf. Process. Lett..

[113]  Stephen A. Vavasis.  Gaussian Elimination with Pivoting is P-Complete , 1989, SIAM J. Discret. Math..

[114]  David P. Dobkin,et al.  The Complexity of Linear Programming , 1980, Theor. Comput. Sci..

[115]  Joseph Naor,et al.  A Fast Parallel Coloring of Planar Graphs with Five Colors , 1987, Inf. Process. Lett..

[116]  Ronald A. Howard,et al.  Dynamic Programming and Markov Processes , 1960 .

[117]  Clyde P. Kruskal,et al.  Fast and Efficient Parallel Algorithms for Single Source Lexicographic Depth-First Breadth-First Search and Topological-First Search , 1991, ICPP.

[118]  S. Teng,et al.  Optimal Tree Contraction in the EREW Model , 1988 .

[119]  Raymond Greenlaw.  Ordered Vertex Removal and Subgraph Problems , 1989, J. Comput. Syst. Sci..

[120]  Bernard Chazelle,et al.  On the convex layers of a planar set , 1985, IEEE Trans. Inf. Theory.

[121]  Raymond Greenlaw,et al.  Super critical tree numbering and optimal tree ranking are in NC , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[122]  Jan Karel Lenstra,et al.  An introduction to parallelism in combinatorial optimization , 1986, Discret. Appl. Math..

[123]  Paul G. Spirakis,et al.  The Approximability of Problems Complete for P , 1989, Optimal Algorithms.

[124]  William M. Kantor,et al.  Sylow's Theorem in Polynomial Time , 1985, J. Comput. Syst. Sci..

[125]  Harry R. Lewis,et al.  The Complexity of the Satisfiability Problem for Krom Formulas , 1984, Theor. Comput. Sci..

[126]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[127]  László Babai,et al.  Permutation groups in NC , 1987, STOC '87.

[128]  Richard Anderson.  A parallel algorithm for the maximal path problem , 1987, Comb..

[129]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[130]  Hiroto Yasuura,et al.  On Parallel Computational Complexity of Unification , 1984, Fifth Generation Computer Systems.

[131]  Takayoshi Shoudai.  A P-Complete Language Describable with Iterated Shuffle , 1992, Inf. Process. Lett..

[132]  Jürgen Avenhaus,et al.  The Nielsen Reduction and P-Complete Problems in Free Groups , 1984, Theor. Comput. Sci..

[133]  Marek Karpinski,et al.  The matching problem for bipartite graphs with polynomially bounded permanents is in NC , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[134]  Andrzej Lingas.  A Note on a Parallel Heuristic for Minimum , 1990, Bull. EATCS.

[135]  Richard Edwin Stearns,et al.  Hierarchies of memory limited computations , 1965, SWCT.

[136]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[137]  John E. Savage,et al.  Parallelism in Graph-Partitioning , 1991, J. Parallel Distributed Comput..

[138]  Victor Y. Pan,et al.  The NC equivalence of planar integer linear programming and Euclidean GCD , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[139]  Joan Boyar,et al.  Coloring Planar Graphs in Parallel , 1987, J. Algorithms.

[140]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[141]  John H. Reif.  On Synchronous Parallel Computations with Independent Probabilistic Choice , 1984, SIAM J. Comput..

[142]  L. Csanky,et al.  Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..

[143]  Richard J. Lipton,et al.  Word Problems Solvable in Logspace , 1977, JACM.

[144]  Samir Khuller.  On Computing Graph Closures , 1989, Inf. Process. Lett..

[145]  Richard J. Anderson.  The complexity of parallel algorithms , 1986 .

[146]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[147]  Ernst W. Mayr,et al.  The computational complexity of the circuit value and network stability problems , 1990 .

[148]  Marek Karpinski,et al.  Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields , 1988, SIAM J. Comput..

[149]  Fritz Henglein,et al.  Fast Left-Linear Semi-Unification , 1991, ICCI.

[150]  Oscar H. Ibarra,et al.  A Note on the Parallel Complexity of Computing the Rank of Order n Matrices , 1980, Inf. Process. Lett..

[151]  Paul G. Spirakis,et al.  Fast parallel algorithms and the complexity of parallelism (Basic issues and recent advances) , 1988, Parcella.

[152]  Alessandro Roncato,et al.  On the Complexity of Some Reachability Problems , 1994, CIAC.

[153]  John E. Savage,et al.  Computational Work and Time on Finite Machines , 1972, JACM.

[154]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[155]  Satoru Miyano,et al.  Systematized approaches to complexity of subgraph problems , 1990 .

[156]  Ivan Hal Sudborough,et al.  On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.

[157]  Marek Karpinski,et al.  Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching , 1989, Inf. Process. Lett..

[158]  Ernst W. Mayr,et al.  The Dynamic Tree Expression Problem , 1988 .

[159]  Eric Allender,et al.  P-uniform circuit complexity , 1989, JACM.

[160]  Iain A. Stewart.  Refining known Results on the generalized Word Problem for Free Groups , 1992, Int. J. Algebra Comput..

[161]  Patrick W. Dymond,et al.  Speedups of Deterministic Machines by Synchronous Parallel Machines , 1985, J. Comput. Syst. Sci..

[162]  H. James Hoover,et al.  Feasible Real Functions and Arithmetic Circuits , 1990, SIAM J. Comput..

[163]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[164]  Ernst W. Mayr,et al.  Parallel Approximation Algorithms , 1988, FGCS.

[165]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[166]  Stephen A. Cook,et al.  Storage Requirements for Deterministic Polynomial Time Recognizable Languages , 1976, J. Comput. Syst. Sci..

[167]  Simon Kasif,et al.  On the Parallel Complexity of Some Constraint Satisfaction Problems , 1986, AAAI.

[168]  S. Rao Kosaraju,et al.  On Parallel Evaluation of Classes of Circuits , 1990, FSTTCS.

[169]  John E. Savage,et al.  On Parallelizing Graph-Partitioning Heuristics , 1990, ICALP.

[170]  H. James Hoover,et al.  Bounding Fan-out in Logical Networks , 1984, JACM.

[171]  J. L. C. Sanz.  Opportunities and Constraints of Parallel Computing , 1989, Springer US.

[172]  Arthur L. Delcher,et al.  Optimal Parallel Evaluation of Tree-Structured Computations by Raking , 1988, AWOC.

[173]  David G. Kirkpatrick,et al.  A Simple Parallel Tree Contraction Algorithm , 1989, J. Algorithms.

[174]  Dexter Kozen,et al.  Complexity of finitely presented algebras , 1977, STOC '77.

[175]  Stephen A. Cook,et al.  An Observation on Time-Storage Trade Off , 1974, J. Comput. Syst. Sci..

[176]  Johan Håstad.  One-Way Permutations in NC0 , 1987, Inf. Process. Lett..

[177]  Alok Aggarwal,et al.  A random NC algorithm for depth first search , 1987, Comb..

[178]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[179]  Neil Immerman,et al.  Number of Quantifiers is Better Than Number of Tape Cells , 1981, J. Comput. Syst. Sci..

[180]  Mark Jerrum,et al.  Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved , 1988, STOC '88.

[181]  Howard J. Karloff,et al.  The Iterated Mod Problem , 1989, Inf. Comput..

[182]  Marek Karpinski.  Boolean Complexity of Algebraic Interpolation Problems , 1988, CSL.

[183]  Jeffrey Scott Vitter,et al.  New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P , 1986, IEEE Transactions on Computers.

[184]  Raymond Greenlaw,et al.  A Model Classifying Algorithms as Inherently Sequential with Applications to Graph Searching , 1992, Inf. Comput..

[185]  Ramachandran.  Fast and processor-efficient parallel algorithms for reducible-flow graphs. Technical report , 1988 .

[186]  Stephen A. Cook,et al.  Log Depth Circuits for Division and Related Problems , 1986, SIAM J. Comput..

[187]  Rossella Petreschi,et al.  Parallelism and the Feedback Vertex Set Problem , 1988, Inf. Process. Lett..

[188]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[189]  Victor Y. Pan,et al.  On parallel complexity of integer linear programming, GCD and the iterated mod function , 1992, SODA '92.

[190]  Gary L. Miller,et al.  Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits , 1988, SIAM J. Comput..

[191]  Mihalis Yannakakis,et al.  On the complexity of local search , 1990, STOC '90.

[192]  Maria J. Serna,et al.  Approximating Linear Programming is Log-Space Complete for P , 1991, Inf. Process. Lett..

[193]  Anne Condon.  A Theory of Strict P-completeness , 1992, STACS.

[194]  Robert E. Tarjan,et al.  Asymptotically tight bounds on time-space trade-offs in a pebble game , 1982, JACM.

[195]  Joachim von zur Gathen.  Computing Powers in Parallel , 1987, SIAM J. Comput..

[196]  Stephen A. Cook,et al.  Hardware complexity and parallel computation , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[197]  Joachim von zur Gathen,et al.  Parallel algorithms for algebraic problems , 1983, SIAM J. Comput..

[198]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[199]  Paul G. Spirakis,et al.  Parallel Complexity of the Connected Subgraph Problem , 1993, SIAM J. Comput..

[200]  H. James Hoover.  Real Functions, Contraction Mappings and P-Completeness , 1991, Inf. Comput..

[201]  Andrei Z. Broder,et al.  How hard is it to marry at random? (On the approximation of the permanent) , 1986, STOC '86.

[202]  L. Goldschlager.  The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.

[203]  Dung T. Huynh,et al.  The Parallel Complexity of Finite-State Automata Problems , 1992, Inf. Comput..

[204]  Sergio De Agostino.  P-complete Problems in Data Compression , 1994, Theor. Comput. Sci..

[205]  Karel Culik,et al.  A Simple Universal Cellular Automaton and its One-Way and Totalistic Version , 1987, Complex Syst..

[206]  Nicholas Pippenger,et al.  On simultaneous resource bounds , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[207]  Xiaotie Deng,et al.  On the parallel complexity of integer programming , 1989, SPAA '89.

[208]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, Symposium on the Theory of Computing.

[209]  Ephraim Feig,et al.  A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots , 1988, SIAM J. Comput..

[210]  Donald B. Johnson,et al.  Parallel algorithms for minimum cuts and maximum flows in planar networks , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[211]  Paul G. Spirakis.  The Parallel Complexity of Deadlock Detection , 1986, MFCS.

[212]  Alon Itai,et al.  Two-Commodity Flow , 1978, JACM.

[213]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[214]  Mats G. Nordahl,et al.  Universal Computation in Simple One-Dimensional Cellular Automata , 1990, Complex Syst..

[215]  William C. Rounds,et al.  Complexity of expressions allowing concurrency , 1978, POPL '78.

[216]  Raymond Greenlaw,et al.  The Parallel Complexity of Algorithms for Pattern Formation Models (Extended Abstract) , 1994, Canada-France Conference on Parallel and Distributed Computing.

[217]  Albert G. Greenberg,et al.  Experience in massively parallel discrete event simulation , 1993, SPAA '93.

[218]  Gary L. Miller,et al.  Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers , 1984, SIAM J. Comput..

[219]  S. Rao Kosaraju,et al.  An NC Algorithm for Evaluating Monotone Planar Circuits , 1995, SIAM J. Comput..

[220]  José L. Balcázar,et al.  Parallel Complexity in the Design and Analysis on Conurrent Systems , 1991, PARLE.

[221]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[222]  K. Mulmuley.  A fast parallel algorithm to compute the rank of a matrix over an arbitrary field , 1987, Comb..

[223]  H. Venkateswaran.  Two Dynamic Programming Algorithms for Which Intepreted Pebbling Helps , 1991, Inf. Comput..

[224]  Howard J. Karloff.  A las vegas rnc algorithm for maximum matching , 1986, Comb..

[225]  B. DasGupta.  Learning capabilities of recurrent neural networks , 1992, Proceedings IEEE Southeastcon '92.

[226]  Harry W. J. M. Trienekens,et al.  Experiments with Parallel Algorithms for Combinatorial Problems , 1985 .

[227]  Endre Szemerédi,et al.  Brooks Coloring in Parallel , 1990, SIAM J. Discret. Math..

[228]  Bonnie Berger,et al.  The fourth moment method , 1991, SODA '91.

[229]  Pierre McKenzie,et al.  Oracle branching programs and Logspace versus P , 1991, Inf. Comput..

[230]  Stuart C. Schwartz,et al.  Concurrent Computations: Algorithms, Architecture, and Technology , 1989 .

[231]  Emil L. Post.  The two-valued iterative systems of mathematical logic , 1942 .

[232]  Torben Hagerup,et al.  Planar Depth-First Search in O(log n) Parallel Time , 1990, SIAM J. Comput..

[233]  Louis Mak.  Parallelism Always Helps , 1997, SIAM J. Comput..

[234]  R. Ladner.  The circuit value problem is log space complete for P , 1975, SIGA.

[235]  Uzi Vishkin,et al.  Simulation of Parallel Random Access Machines by Circuits , 1984, SIAM J. Comput..

[236]  Martin Tompa,et al.  A new pebble game that characterizes parallel complexity classes , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[237]  Mihalis Yannakakis,et al.  Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..

[238]  Pierre McKenzie,et al.  Circuits with monoidal gates , 1993 .

[239]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[240]  Oscar H. Ibarra,et al.  On Iterative and Cellular Tree Arrays , 1989, J. Comput. Syst. Sci..

[241]  Richard M. Karp,et al.  A fast parallel algorithm for the maximal independent set problem , 1985, JACM.

[242]  Joseph Naor,et al.  A Fast Parallel Algorithm to Color a Graph with Delta Colors , 1988, J. Algorithms.

[243]  Christos H. Papadimitriou,et al.  Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..

[244]  Robert E. Tarjan,et al.  Space bounds for a game on graphs , 1976, STOC '76.

[245]  Iain A. Stewart.  Complete Problems for Symmetric Logspace Involving Free Groups , 1991, Inf. Process. Lett..

[246]  Leslie M. Goldschlager,et al.  A universal interconnection pattern for parallel computers , 1982, JACM.

[247]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[248]  Thomas Lengauer.  VLSI Theory , 1990, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[249]  Iain A. Stewart.  On parallelizing a greedy heuristic for finding small dominant sets , 1993, BIT Comput. Sci. Sect..

[250]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[251]  Felipe Cucker,et al.  Two P-complete problems in the theory of the reals , 1992, J. Complex..

[252]  Martin Tompa,et al.  The complexity of short two-person games , 1990, Discret. Appl. Math..

[253]  Jeffrey Scott Vitter,et al.  A Parallel Algorithm for Recognizing Unordered Depth-First Search , 1988, Inf. Process. Lett..

[254]  David A. Plaisted.  Complete Problems in the First-Order Predicate Calculus , 1984, J. Comput. Syst. Sci..

[255]  Victor Y. Pan,et al.  Fast and efficient parallel solution of dense linear systems , 1989 .

[256]  Jürgen Avenhaus,et al.  On the Complexity of Intersection and Conjugacy Problems in Free Groups , 1984, Theor. Comput. Sci..

[257]  Nimrod Megiddo,et al.  Linear Programming with Two Variables per Inequality in Poly-Log Time , 1990, SIAM J. Comput..

[258]  Christos H. Papadimitriou,et al.  The parallel complexity of simple logic programs , 1993, JACM.

[259]  Jonathan Machta.  The computational complexity of pattern formation , 1993 .

[260]  Michael Luby.  Removing Randomness in Parallel Computation without a Processor Penalty , 1993, J. Comput. Syst. Sci..

[261]  Raymond Greenlaw,et al.  The Parallel Complexity of Eden Growth, Solid-on-Solid Groth and Ballistic Deposition (Extended Abstract) , 1994, ESA.

[262]  Iain A. Stewart.  On Two Approximation Algorithms for the Clique Problem , 1993, Int. J. Found. Comput. Sci..

[263]  Satoru Miyano,et al.  Complexity of Finding Alphabet Indexing , 1995, IEICE Trans. Inf. Syst..

[264]  Yuri Petrovich Ofman,et al.  On the Algorithmic Complexity of Discrete Functions , 1962 .

[265]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[266]  Nicholas Pippenger,et al.  Advances in Pebbling (Preliminary Version) , 1982, ICALP.

[267]  Walter J. Savitch,et al.  Time Bounded Random Access Machines with Parallel Processing , 1979, JACM.

[268]  Wojciech Rytter.  On the recognition of context-free languages , 1984, Symposium on Computation Theory.

[269]  Nimrod Megiddo,et al.  A Note on Approximate Linear Programming , 1992, Inf. Process. Lett..

[270]  Robert E. Tarjan,et al.  Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) , 1984, FOCS.

[271]  Dung T. Huynh,et al.  The complexity of membership for deterministic growing context-sensitive grammars , 1990, Int. J. Comput. Math..

[272]  Stephen A. Cook,et al.  Deterministic CFL's are accepted simultaneously in polynomial time and log squared space , 1979, STOC.

[273]  I Parberry.  Parallel speedup of sequential machines: a defense of parallel computation thesis , 1986, SIGA.

[274]  Walter L. Ruzzo.  On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..

[275]  Wojciech Rytter.  Parallel Time O(log n) Recognition of Unambiguous Context-free Languages , 1987, Inf. Comput..

[276]  Mary Lou Soffa,et al.  Feedback vertex sets and cyclically reducible graphs , 1985, JACM.

[277]  Samuel R. Buss,et al.  Feasible Mathematics: A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989 , 1990 .

[278]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[279]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[280]  James A. Storer,et al.  Parallel algorithms for optimal compression using dictionaries with the prefix property , 1992, Data Compression Conference, 1992..

[281]  Kurt Mehlhorn,et al.  The Recognition of Deterministic CFL's in Small Time and Space , 1983, Inf. Control..

[282]  Alvy Ray Smith,et al.  Simple Computation-Universal Cellular Spaces , 1971, JACM.

[283]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[284]  Leslie M. Goldschlager,et al.  A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem , 1980, Information Processing Letters.

[285]  Vijaya Ramachandran,et al.  The complexity of minimum cut and maximum flow problems in an acyclic network , 1987, Networks.

[286]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[287]  Marek Karpinski,et al.  The computational complexity of graph problems with succinct multigraph representation , 1988, ZOR Methods Model. Oper. Res..

[288]  Jeffrey C. Lagarias,et al.  One-Way Functions and Circuit Complexity , 1986, Inf. Comput..

[289]  John Staples,et al.  The Maximum Flow Problem is Log Space Complete for P , 1982, Theor. Comput. Sci..

[290]  Stephen A. Cook,et al.  Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[291]  Alberto O. Mendelzon,et al.  Low Complexity Aggregation in GraphLog and Datalog , 1993, Theor. Comput. Sci..

[292]  Jan Karel Lenstra,et al.  The Parallel Complexity of TSP Heuristics , 1989, J. Algorithms.

[293]  Leslie G. Valiant,et al.  Circuit Size is Nonlinear in Depth , 1976, Theor. Comput. Sci..

[294]  Thomas Zeugmann.  Highly Parallel Computations Modulo a Number Having Only Small Prime Factors , 1992, Inf. Comput..

[295]  Ian Parberry,et al.  On the Construction of Parallel Computers from Various Bases of Boolean Functions , 1986, Theor. Comput. Sci..

[296]  A. Gibbons.  Algorithmic Graph Theory , 1985 .

[297]  Zvi Galil,et al.  Two Way Deterministic Pushdown Automaton Languages and Some Open Problems in the Theory of Computation , 1974, SWAT.

[298]  Foto N. Afrati.  The Parallel Complexity of Single Rule Logic Programs , 1992, Discret. Appl. Math..

[299]  Teresa M. Przytycka,et al.  Optimal Tree Ranking is in NC , 1992, Parallel Process. Lett..

[300]  P. van Emde Boas.  The second machine class: models of parallelism , 1985 .

[301]  Richard J. Anderson,et al.  Parallelism and the Maximal Path Problem , 1987, Inf. Process. Lett..

[302]  Giancarlo Mauri,et al.  On characterizing classes of efficiently parallelizable problems , 1985 .

[303]  Michael J. Fischer,et al.  Relations Among Complexity Measures , 1979, JACM.

[304]  Steven Lindell.  A Logspace Algorithm for Tree Canonization , 1992 .

[305]  Stavros S. Cosmadakis,et al.  The Word and Generator Problems for Lattices , 1988, Inf. Comput..

[306]  Paul G. Spirakis,et al.  The Complexity of the Reliable Connectivity Problem , 1991, Inf. Process. Lett..

[307]  D. Knuth,et al.  A note on strategy elimination in bimatrix games , 1988 .