Noisy sorting without resampling

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 268-276

  Braverman, Mark ^a   Mossel, Elchanan ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH PROBABILITY; NP-HARD; RE SAMPLING; RUNNING TIME;

CAVITY RESONATORS;

MAXIMUM LIKELIHOOD;

EID: 58449083612     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: ranking and clustering. In Proceedings of 37rd STOC, 2005.
2. N. Alon. Ranking tournaments. Siam Journal on Discrete Mathematics, 20(1):137-142, 2006.
3. D. Coppersmith, L. Fleischer, and A. Rudra. Ordering by weighted number of wins gives a good ranking for weighted tournaments. In Proceedings of SODA, 2006.
4. P. Diaconis and It. L. Graham. Spearman's footrule as a measure of disarray. J. Roy. Statist. Soc. Ser. B, 39(2):262-268, 1977.
5. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Computing with unreliable information. In Proceedings 22nd STOC, 1990.
6. D. Karp and R. Kleinberg. Noisy binary serach and its applications. In Proceedings of SODA, pages 891-890, 2007.
7. C. Kenyon-Mathieu and W. Schudy. How to rank with few errors. In STOC, pages 95-103, 2007.
8. S. Romann. Introduction to Coding and Information 'Theory. Springer, 1997.
9. T. Tao and V. H. Vu. Additive Combinatorics. Cambridge University Press, 2006.