@inproceedings{74bd1d2a531f441f99ac74c346400fd3,
title = "A sort of an adversary",
abstract = "We describe an efficient deterministic adversary that forces any comparison-based sorting algorithm to perform at least3764 n log n comparisons. This improves on previous efficient adversaries of Atallah and Kosaraju (1981), Richards and Vaidya (1988), and of Brodal et al. (1996) that force any sorting algorithm to perform at least12 n log n comparisons.",
author = "Haim Kaplan and Or Zamir and Uri Zwick",
note = "Publisher Copyright: Copyright {\textcopyright} 2019 by SIAM; 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 ; Conference date: 06-01-2019 Through 09-01-2019",
year = "2019",
doi = "10.1137/1.9781611975482.79",
language = "الإنجليزيّة",
series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "Association for Computing Machinery",
pages = "1291--1310",
booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
address = "الولايات المتّحدة",
}