A time-space tradeoff for sorting on a general sequential model of computation (1982)
Cached
Download Links
- [www.cs.utoronto.ca]
- [www.cs.toronto.edu]
- DBLP
Other Repositories/Bibliography
by
A. Borodin
,
S. Cook
| Venue: | SIAM Journal on Computing |
| Citations: | 52 - 5 self |
BibTeX
@ARTICLE{Borodin82atime-space,
author = {A. Borodin and S. Cook},
title = {A time-space tradeoff for sorting on a general sequential model of computation},
journal = {SIAM Journal on Computing},
year = {1982},
volume = {11},
pages = {287--297}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. In a general sequential model of computation, no restrictions are placed on theway in which the computation may proceed, except that parallel operations are not allowed. We show that in such an unrestricted environment TIME.SPACE fl(N2/logN) in order to sort N integers, each in the range [,N]. Key words, time-space tradeoffs, conputational complexity, sorting, time lower bounds, space lower bounds
