Machine models and simulations

[1]  Michael C. Loui,et al.  Hierarchies and Space Measures for Pointer Machines , 1993, Inf. Comput..

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

[3]  Peter van Emde Boas.  Space Measures for Storage Modification Machines , 1989, Inf. Process. Lett..

[4]  Paul M. B. Vitányi,et al.  Counting is easy , 1988, JACM.

[5]  Paul M. B. Vitányi.  Locality, Communication, and Interconnect Length in Multicomputers , 1988, SIAM J. Comput..

[6]  Ming Li,et al.  Tape versus Queue and Stacks: The Lower Bounds , 1988, Inf. Comput..

[7]  M. Atallah,et al.  Optimal simulations between mesh-connected arrays of processors , 1988, JACM.

[8]  Arnold Schönhage.  A nonlinear lower bound for random-access machines under logarithmic cost , 1988, JACM.

[9]  Peter van Emde Boas,et al.  The Problem of Space Invariance for Sequential Machines , 1988, Inf. Comput..

[10]  Jan van Leeuwen,et al.  Fast Simulation of Turing Machines by Random Access Machines , 1988, SIAM J. Comput..

[11]  Georg Schnitger,et al.  Parallel Computation with Threshold Functions , 1986, J. Comput. Syst. Sci..

[12]  Peter van Emde Boas.  The second machine class 2, an encyclopedic view on the parallel computation thesis , 1988 .

[13]  Ming Li,et al.  Separation and Lower Bounds for ROM and Nondeterministic Models of Parallel Computation , 1987, Inf. Comput..

[14]  Larry J. Stockmeyer,et al.  Classifying the computational complexity of problems , 1987, The Journal of Symbolic Logic.

[15]  Jan van Leeuwen,et al.  Array processing machines: An abstract model , 1987, BIT Comput. Sci. Sect..

[16]  Walter L. Ruzzo,et al.  Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract) , 1986, ICALP.

[17]  Paul M. B. Vitányi.  Nonsequentail Computation and Laws of Nature , 1986, Aegean Workshop on Computing.

[18]  Georg Schnitger,et al.  An Optimal Lower Bound for Turing Machines with One Work Tape and a Two- way Input Tape , 1986, Computational Complexity Conference.

[19]  Luc Longpré,et al.  The Power of the Queue , 1986, SIAM J. Comput..

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

[21]  Peter van Emde Boas,et al.  Two Results on Tables , 1986, Inf. Process. Lett..

[22]  D. Harel.  Recurring dominoes: making the highly undecidable highly understandable , 1985 .

[23]  Friedhelm Meyer auf der Heide,et al.  One, two, three . . . infinity: lower bounds for parallel computation , 1985, STOC '85.

[24]  Jan van Leeuwen,et al.  Array processing machines , 1985, FCT.

[25]  Mark Jerrum,et al.  The Complexity of Finding Minimum-Length Generator Sequences , 1985, Theor. Comput. Sci..

[26]  W. Maass.  Combinatorial lower bound arguments for deterministic and nondeterministic Turing machines , 1985 .

[27]  Giancarlo Mauri,et al.  Simulations Among Classes of Random Access Machines and Equivalence Among Numbers Succinctly Represented11A preliminary version of the first part of this paper has been published in the Proceedings of the ACM Symp. on theory of Computation, Milwaukee, 1991. , 1985 .

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

[29]  Paul M. B. Vitányi,et al.  An Optimal Simulation of Counter Machines , 1985, SIAM J. Comput..

[30]  Peter van Emde Boas,et al.  On tape versus core an application of space efficient perfect hash functions to the invariance of space , 1984, STOC '84.

[31]  Faith Ellen,et al.  Relations between concurrent-write models of parallel computation , 1984, PODC '84.

[32]  Mark Jerrum.  The Complexity of Finding Minimum-Length Generator Sequences (Extended Abstract) , 1984, ICALP.

[33]  John Michael Robson,et al.  N by N Checkers is Exptime Complete , 1984, SIAM J. Comput..

[34]  Norbert Blum.  A Boolean Function Requiring 3n Network Size , 1984, Theor. Comput. Sci..

[35]  Norbert Blum.  A Note on the 'Parallel Computation Thesis' , 1983, Inf. Process. Lett..

[36]  Endre Szemerédi,et al.  On determinism versus non-determinism and related problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[37]  Amir Schorr.  Physical Parallel Devices are not Much Faster than Sequential Ones , 1983, Inf. Process. Lett..

[38]  Stephen A. Cook,et al.  The Classifikation of Problems which have Fast Parallel Algorithms , 1983, FCT.

[39]  Bernard Chazelle,et al.  Unbounded Hardware is Equivalent to Deterministic Turing Machines , 1983, Theor. Comput. Sci..

[40]  Oscar H. Ibarra,et al.  Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM's , 1983, SIAM J. Comput..

[41]  Z. Galil,et al.  An Efficient General-Purpose Parallel Computer , 1983, JACM.

[42]  John Michael Robson,et al.  The Complexity of Go , 1983, IFIP Congress.

[43]  Jirí Wiedermann.  Deterministic and Nondeterministic Simulation of the RAM by the Turing Machine , 1983, IFIP Congress.

[44]  Kurt Mehlhorn,et al.  On the program size of perfect and universal hash functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[45]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

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

[47]  Martin D. Davis,et al.  Why Gödel Didn't Have Church's Thesis , 1982, Inf. Control..

[48]  Nicholas Pippenger.  Probabilistic simulations (Preliminary Version) , 1982, STOC '82.

[49]  Wolfgang J. Paul,et al.  On-line simulation of k+1 tapes by k tapes requires nonlinear time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[50]  Wolfgang J. Paul,et al.  An Information-Theoretic Approach to Time Bounds for On-Line Computation , 1981, J. Comput. Syst. Sci..

[51]  Aviezri S. Fraenkel,et al.  Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n , 1981, J. Comb. Theory, Ser. A.

[52]  Wolfgang J. Paul,et al.  On Time versus Space II. (Turing Machines) , 1981, J. Comput. Syst. Sci..

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

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

[55]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[56]  David Lichtenstein,et al.  GO Is Polynomial-Space Hard , 1980, JACM.

[57]  Robert E. Tarjan,et al.  The pebbling problem is complete in polynomial space , 1979, SIAM J. Comput..

[58]  Arnold Schönhage,et al.  Storage Modification Machines , 1979, SIAM J. Comput..

[59]  Juris Hartmanis,et al.  Observations about the development of theoretical computer science , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

[61]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[62]  Allan Borodin,et al.  A time-space tradeoff for sorting on non-oblivious machines , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[63]  Arnold Schönhage,et al.  On the Power of Random Access Machines , 1979, ICALP.

[64]  S. Rao Kosaraju,et al.  Real-time simulation of concatenable double-ended queues by double-ended queues (Preliminary Version) , 1979, STOC.

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

[66]  S. Kleene.  Origins of recursive function theory , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

[68]  Michael Sipser,et al.  Halting space-bounded computations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[69]  David S. Johnson,et al.  The complexity of checkers on an N × N board , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

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

[71]  Thomas J. Schaefer,et al.  On the Complexity of Some Two-Person Perfect-Information Games , 1978, J. Comput. Syst. Sci..

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

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

[74]  Mike Paterson,et al.  The Depth of All Boolean Functions , 1975, SIAM J. Comput..

[75]  Walter J. Savitch.  Recursive turing machines , 1977 .

[76]  Benton L. Leong,et al.  New real-time simulations of multihead tape units , 1977, STOC '77.

[77]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[78]  Robert E. Tarjan,et al.  A Combinatorial Problem Which Is Complete in Polynomial Space , 1976, JACM.

[79]  Vaughan R. Pratt,et al.  The effect of basis on size of Boolean expressions , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

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

[81]  Juris Hartmanis,et al.  On the Structure of Feasible Computation , 1974, GI Jahrestagung.

[82]  Larry J. Stockmeyer,et al.  A characterization of the power of vector machines , 1974, STOC '74.

[83]  Juris Hartmanis,et al.  On the Power of Multiplication in Random Access Machines , 1974, SWAT.

[84]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[85]  Stephen A. Cook,et al.  Time Bounded Random Access Machines , 1973, J. Comput. Syst. Sci..

[86]  Arnold L. Rosenberg,et al.  Real-Time Simulation of Multihead Tape Units , 1972, JACM.

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

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

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

[90]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[91]  Richard Edwin Stearns,et al.  Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.

[92]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[93]  Universal Pulsing Elements , 1965 .

[94]  Ya. M. Barzdin.  Universality Problems in the Theory of Growing Automata , 1965 .

[95]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[96]  John C. Shepherdson,et al.  Computability of Recursive Functions , 1963, JACM.

[97]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .