Sorting and selection on dynamic data

DOI10.1016/J.TCS.2010.10.003MaRDI QIDQ541657zbMATH OpenOpenAlexWikidataFDO

Authors Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal

Publication date 7 June 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2010.10.003

zbMATH Keywords

algorithmssortingdynamic data

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• Sort Me If You Can: How to Sort Dynamic Data
• Partial sorting problem on evolving data
• How to Select the Top k Elements from Evolving Data?
• Optimally sorting evolving data
• Automata, Languages and Programming

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Algorithmic and analysis techniques in property testing
• Algorithms on evolving graphs
• Concentration of Measure for the Analysis of Randomized Algorithms
• Data streams: algorithms and applications.
• Graphical Method of Factoring the Correlation Matrix
• Introduction to algorithms
• Probability and Computing

Cited in

(12)

• Sorting and searching revisted
• Sort Me If You Can: How to Sort Dynamic Data
• How to Select the Top k Elements from Evolving Data?
• On limits on the computational power of data-accumulating algorithms
• Streaming Algorithms for Selection and Approximate Sorting
• Optimally sorting evolving data
• Extensible Datasort Refinements
• Partial sorting problem on evolving data
• Electronic Data Sorting
• Quadratic time algorithms appear to be optimal for sorting evolving data
• On quickselect, partial sorting and multiple Quickselect
• A selectable sloppy heap

This page was built for publication: Sorting and selection on dynamic data

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