An adversary-based lower bound for sorting

DOI10.1016/0020-0190(81)90031-4zbMath0464.68059OpenAlexW2045183461MaRDI QIDQ1154272

Mikhail J. Atallah, S. Rao 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)

Related Items (3)

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

Cites Work

• Unnamed Item
• An adversary-based lower bound for sorting

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