Improved upper bounds for time-space tradeoffs for selection with limited storage

DOI10.1007/BFb0054361zbMath1502.68113OpenAlexW1545783417MaRDI QIDQ5054849

Sarnath Ramnath, Venkatesh Raman

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'98 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0054361

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (6)

Improved upper bounds for time-space tradeoffs for selection with limited storage ⋮ Memory-constrained algorithms for simple polygons ⋮ Reprint of: Memory-constrained algorithms for simple polygons ⋮ Computing a visibility polygon using few variables ⋮ Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) ⋮ Space-time trade-offs for stack-based algorithms

Cites Work

• Selection from read-only memory and sorting with minimum data movement
• Upper bounds for time-space trade-offs in sorting and selection
• An optimally efficient selection algorithm
• Selection and sorting with limited storage
• Improved upper bounds for time-space tradeoffs for selection with limited storage

This page was built for publication: Improved upper bounds for time-space tradeoffs for selection with limited storage