A time-space tradeoff for sorting on a general sequential model of computation

In a general sequential model of computation, no restrictions are placed on the way in which the computation may proceed, except parallel operations are not allowed. We show that in such an unrestricted environment TIME•SPACE&equil;Ω(N<supscrpt>2</supscrpt>/log N) in order to sort N elements, each in the range [1,N<supscrpt>2</supscrpt>].

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[2]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[3]  F. C. Hennie.  Crossing sequences and off-line Turing machine computations , 1965, SWCT.

[4]  Alan Cobham,et al.  The Recognition Problem for the Set of Perfect Squares , 1966, SWAT.

[5]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[6]  Michael J. Fischer,et al.  Boolean Matrix Multiplication and Transitive Closure , 1971, SWAT.

[7]  Donald E. Knuth,et al.  Mathematical Analysis of Algorithms , 1971, IFIP Congress.

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

[9]  Leslie G. Valiant,et al.  Shifting Graphs and Their Applications , 1976, J. ACM.

[10]  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).

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

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

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

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