Approximate sorting of data streams with limited storage

DOI10.1007/S10878-015-9930-6zbMATH Open1386.68218OpenAlexW2148236791MaRDI QIDQ346499FDOQ346499

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

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

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)

Cites Work

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

Cited In (2)

• Approximate sorting of data streams with limited storage
• Approximate sorting and its applications in I/O model

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)