A sort of an adversary

Haim Kaplan; Or Zamir; Uri Zwick

doi:10.1137/1.9781611975482.79

A sort of an adversary

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We describe an efficient deterministic adversary that forces any comparison-based sorting algorithm to perform at least³⁷₆₄ 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 least¹₂ n log n comparisons.

Original language	English
Title of host publication	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher	Association for Computing Machinery
Pages	1291-1310
Number of pages	20
ISBN (Electronic)	9781611975482
DOIs	https://doi.org/10.1137/1.9781611975482.79
State	Published - 2019
Event	30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 - San Diego, United States Duration: 6 Jan 2019 → 9 Jan 2019

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference	30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019
Country/Territory	United States
City	San Diego
Period	6/01/19 → 9/01/19

Funding

Funders	Funder number
Israel Science Foundation	1841-14
Israel Science Foundation

Access to Document

10.1137/1.9781611975482.79

Cite this

@inproceedings{0751b982ea004d2c8ef84ec92389edf5,

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",

}

Kaplan, H , Zamir, O & Zwick, U 2019, A sort of an adversary. in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery, pp. 1291-1310, 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, United States, 6/01/19. https://doi.org/10.1137/1.9781611975482.79

TY - GEN

T1 - A sort of an adversary

AU - Kaplan, Haim

AU - Zamir, Or

AU - Zwick, Uri

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85066923517&partnerID=8YFLogxK

U2 - 10.1137/1.9781611975482.79

DO - 10.1137/1.9781611975482.79

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85066923517

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 1291

EP - 1310

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

PB - Association for Computing Machinery

T2 - 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019

Y2 - 6 January 2019 through 9 January 2019

ER -

A sort of an adversary

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this