Streaming Algorithms for Selection and Approximate Sorting

DOI10.1007/978-3-540-77050-3_2zbMath1135.68379OpenAlexW1561501418MaRDI QIDQ5458820

Richard M. Karp

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_2

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Unnamed Item
• Multiple Quickselect -- Hoare's Find algorithm for several elements
• Selection and sorting with limited storage
• Random sampling with a reservoir
• Expected time bounds for selection
• The soft heap

This page was built for publication: Streaming Algorithms for Selection and Approximate Sorting