DocumentCode
2180697
Title
A time-space tradeoff for sorting on non-oblivious machines
Author
Borodin, Allan ; Fischer, Michael J. ; Kirkpatrick, David G. ; Lynch, Nancy A. ; Tompa, Martin
fYear
1979
fDate
29-31 Oct. 1979
Firstpage
319
Lastpage
327
Abstract
A model of computation is introduced which permits the analysis of both the time and space requirements of non-oblivious programs. Using this model, it is demonstrated that any algorithm for sorting n inputs which is based on comparisons of individual inputs requires time-space product proportional to n2. Uniform and non-uniform sorting algorithms are presented which show that this lower bound is nearly tight.
Keywords
Computational modeling; Computer science; Councils; Marketing and sales; Merging; Registers; Sorting; Testing; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1979., 20th Annual Symposium on
Conference_Location
San Juan, Puerto Rico
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1979.4
Filename
4568027
Link To Document