Approximate sorting of data streams with limited storage

DOI10.1007/S10878-015-9930-6MaRDI QIDQ346499zbMATHOpenAlexFDO

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

Publication date 29 November 2016

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-015-9930-6

zbMATH Keywords

data streamapproximate sortinglimited storagepermutation distortion metricsuser preference rankingweighted Kendall distortion

Mathematics Subject Classification ID

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

Recommendations

• Approximate sorting of data streams with limited storage
• Sorting streamed multisets
• Estimating the sortedness of a data stream
• Approximate Sorting
• Streaming Algorithms for Selection and Approximate Sorting

Cites work

• scientific article; zbMATH DE number 5764792 (Why is no real title available?)
• scientific article; zbMATH DE number 44579 (Why is no real title available?)
• scientific article; zbMATH DE number 3523640 (Why is no real title available?)
• A weighted Kendall's tau statistic
• Bounds for Permutation Rate-Distortion
• Elements of Information Theory
• On the Lambert \(w\) function
• On the lengths of the pieces of a stick broken at random
• Selection and sorting with limited storage
• The shifting sands algorithm

Cited in

(1)

• 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 Q346499)