Sorting and Searching Revisited,” in Algorithm Theory (1996)

by A Andersson
Results 1 - 2 of 2

Optimal Time-Space Trade-Offs for Sorting

by Jakob Pagter, Jakob Pagter, Theis Rauhe, Theis Rauhe - In Proc. 39th IEEE Sympos. Found. Comput. Sci , 1998
"... We study the fundamental problem of sorting in a sequential model of computation and in particular consider the time-space trade-off (product of time and space) for this problem. ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
We study the fundamental problem of sorting in a sequential model of computation and in particular consider the time-space trade-off (product of time and space) for this problem.

Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting ∗

by Rasmus Pagh, Jakob Pagter, Copyright C, Rasmus Pagh, Jakob Pagter, Rasmus Pagh, Jakob Pagter , 2001
"... Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS