Optimal incremental sorting

DOI10.1137/1.9781611972863.16MaRDI QIDQ5233473zbMATH OpenOpenAlexWikidataFDO

Authors Rodrigo Paredes, Gonzalo Navarro

Publication date 11 September 2019

Published in 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611972863.16

Mathematics Subject Classification ID

Searching and sorting (68P10) Online algorithms; streaming algorithms (68W27)

Recommendations

• On sorting, heaps, and minimum spanning trees
• Cascade heap: towards time-optimal extractions
• An optimal algorithm for selection in a min-heap
• An optimal minimum spanning tree algorithm
• Cascade heap: towards time-optimal extractions

Cited in

(7)

• NP-hard and linear variants of hypergraph partitioning
• Constant-time sorting
• scientific article; zbMATH DE number 4155864 (Why is no real title available?)
• scientific article; zbMATH DE number 5556488 (Why is no real title available?)
• scientific article; zbMATH DE number 4114045 (Why is no real title available?)
• scientific article; zbMATH DE number 5051648 (Why is no real title available?)
• Any-k algorithms for enumerating ranked answers to conjunctive queries

This page was built for publication: Optimal incremental sorting

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