Streaming Algorithms for Selection and Approximate Sorting

DOI10.1007/978-3-540-77050-3_2MaRDI QIDQ5458820zbMATH OpenOpenAlexFDO

Authors Richard 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)

Recommendations

• External selection
• Sorting and selection on dynamic data
• New algorithms for selection
• Approximate sorting of data streams with limited storage
• Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers

Cites work

• scientific article; zbMATH DE number 3458807 (Why is no real title available?)
• Expected time bounds for selection
• Multiple Quickselect -- Hoare's Find algorithm for several elements
• Random sampling with a reservoir
• Selection and sorting with limited storage
• The soft heap

Cited in

(6)

• Streaming Algorithms Measured in Terms of the Computed Quantity
• Streaming Algorithms for Independent Sets
• Streaming algorithms for bin packing and vector scheduling
• Approximate sorting of data streams with limited storage
• Streaming algorithms for extent problems in high dimensions
• scientific article; zbMATH DE number 6297803 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458820)