Parallel Algorithms and the Classification of Problems

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

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

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

[4]  Mike Paterson,et al.  Linear unification , 1976, STOC '76.

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

[6]  Alberto Bertoni,et al.  Non deterministic machines and their generalizations , 1984 .

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

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

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

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

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

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

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

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

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

[16]  Franco P. Preparata,et al.  VLSI Algorithms and Architectures , 1984, MFCS.

[17]  Nicholas Pippenger,et al.  On Simultaneous Resource Bounds (Preliminary Version) , 1979, FOCS 1979.

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

[19]  Stuart J. Berkowitz,et al.  On Computing the Determinant in Small Parallel Time Using a Small Number of Processors , 1984, Inf. Process. Lett..

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

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

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

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

[24]  Richard M. Karp,et al.  A fast parallel algorithm for the maximal independent set problem , 1984, STOC '84.

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

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