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

Authors:
A. Borodin;S. Cook
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Ontario, Canada;Department of Computer Science, University of Toronto, Toronto, Ontario, Canada
Venue:
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Year:
1980

Citing 4
Cited 2

Shifting Graphs and Their Applications

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Deterministic CFL's are accepted simultaneously in polynomial time and log squared space

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Boolean matrix multiplication and transitive closure

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)

A lower bound for parallel string matching

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A note on the decoding complexity of error-correcting codes

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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;&Ohgr;(N2/log N) in order to sort N elements, each in the range [1,N2].