Speedups of Deterministic Machines by Synchronous Parallel Machines

[1]  Mike Paterson.  Tape Bounds for Time-Bounded Turing Machines , 1972, J. Comput. Syst. Sci..

[2]  Leslie G. Valiant,et al.  On time versus space and related problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

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

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

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

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

[7]  Leslie G. Valiant,et al.  On Time Versus Space , 1977, JACM.

[8]  Leslie M. Goldschlager,et al.  A unified approach to models of synchronous parallel machines , 1978, STOC.

[9]  Wolfgang J. Paul,et al.  On alternation , 1980, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

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

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

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

[13]  John H. Reif,et al.  On the Power of Probabilistic Choice in Synchronous Parallel Computations , 1982, ICALP.