An adversary-based lower bound for sorting

DOI10.1016/0020-0190(81)90031-4MaRDI QIDQ1154272zbMATH OpenOpenAlexFDO

Authors Mikhail J. Atallah, S. R. Kosaraju

Publication date 1981

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(81)90031-4

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites work

• An adversary-based lower bound for sorting
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)

Cited in

(3)

• On the distribution of comparisons in sorting algorithms
• An adversary-based lower bound for sorting
• The randomized complexity of maintaining the minimum

This page was built for publication: An adversary-based lower bound for sorting

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