Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Optimal Bounds for Noisy Sorting

Optimal Bounds for Noisy Sorting

Thumbnail Image
Download
Name

3564246.3585131.pdf

Size

293.72 KB

Format

Adobe PDF

Checksum (MD5)

29cc6a98375119304496b93f98aceebb

Download all files submitted through automated deposit
3564246.3585131.zip (243.43 KB)
Author(s)
Gu, Yuzhou
•
Xu, Yinzhan
Date Issued
June 2, 2023
Publisher
ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing
Citation
Gu, Yuzhou and Xu, Yinzhan. 2023. "Optimal Bounds for Noisy Sorting."
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/151000
DOI of Published Version
https://doi.org/10.1145/3564246.3585131
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.