Approximate sorting of data streams with limited storage

DOI10.1007/978-3-319-08783-2_40zbMATH Open1386.68217OpenAlexW2259700187MaRDI QIDQ2920482FDOQ2920482

Authors: Eitan Yaakobi, Jehoshua Bruck, Farzad Farnoud (Hassanzadeh) 

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_40

Recommendations

• Approximate sorting of data streams with limited storage
• Sorting streamed multisets
• Estimating the sortedness of a data stream
• Approximate Sorting
• On the monotonicity of a data stream

Mathematics Subject Classification ID

Searching and sorting (68P10) Approximation algorithms (68W25) Algorithms on strings (68W32)

Cited In (2)

• Streaming Algorithms for Selection and Approximate Sorting
• Approximate sorting of data streams with limited storage

This page was built for publication: Approximate sorting of data streams with limited storage

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