A wait-free sorting algorithm

DOI10.1007/S00224-001-1009-3MaRDI QIDQ1348691zbMATH OpenOpenAlexFDO

Authors Eli Upfal, Nir Shavit, Asaph Zemach

Publication date 29 September 2002

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-001-1009-3

zbMATH Keywords

sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 4064478
• Are wait-free algorithms fast?
• Parallel sorting by regular sampling
• Probabilistic integer sorting
• Sorting in Average Time $o(\log \,n)$

Cited in

(3)

• Are wait-free algorithms fast?
• An efficient external sorting algorithm
• An only-once-sorting algorithm

This page was built for publication: A wait-free sorting algorithm

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