Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers

DOI10.1007/978-3-642-45030-3_38zbMath1310.68218OpenAlexW2189208277MaRDI QIDQ2872104

Venkatesh Raman, J. Ian Munro, Timothy M. Chan

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_38

zbMATH Keywords

selectionintegersread-only memorycentroid of a treemajority finding

Mathematics Subject Classification ID

Related Items (5)

Optimal In-place Algorithms for Basic Graph Problems ⋮ Frameworks for designing in-place graph algorithms ⋮ A Framework for In-place Graph Algorithms ⋮ Selection from read-only memory with limited workspace ⋮ Rectilinear path problems in restricted memory setup

This page was built for publication: Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers