Optimal time-space trade-offs for non-comparison-based sorting

Abstract

We study the problem of sorting <i>n</i> integers of <i>w</i> bits on a unit-cost RAM with word size <i>w,</i> and in particular consider the time-space trade-off (product of time and space in bits) for this problem. For comparison-based algorithms, the time-space complexity is known to be &Theta;(<i>n</i><sup>2</sup>). A result of Beame shows that the… (More)

Topics

Cite this paper

@inproceedings{Pagh2002OptimalTT, title={Optimal time-space trade-offs for non-comparison-based sorting}, author={Rasmus Pagh and Jakob Illeborg Pagter}, booktitle={SODA}, year={2002} }