Upper bounds for time-space trade-offs in sorting and selection
Journal of Computer and System Sciences
Selection from read-only memory and sorting with minimum data movement
Theoretical Computer Science
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Expected time bounds for selection
Communications of the ACM
Optimal Time-Space Trade-Offs for Sorting
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Comparison-based time-space lower bounds for selection
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Constant-Working-Space Algorithms for Image Processing
Emerging Trends in Visual Computing
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We consider the problem of finding an element of a given rank in a totally ordered set given in a read-only array, using limited extra storage cells. We give new algorithms for various ranges of extra space. Our upper bounds improve the previously known bounds in the range of space s such that s is o(lg2 n) and s ≥ (1 + ε) lg lg n/ lg lg lg n for any positive constant ε