Approximate sorting of data streams with limited storage

DOI10.1007/s10878-015-9930-6zbMath1386.68218OpenAlexW2148236791MaRDI QIDQ346499

Jehoshua Bruck, Eitan Yaakobi, 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)

Related Items (1)

Approximate sorting and its applications in I/O model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Selection and sorting with limited storage
• A weighted Kendall's tau statistic
• On the Lambert \(w\) function
• Bounds for Permutation Rate-Distortion
• On the lengths of the pieces of a stick broken at random
• Elements of Information Theory

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