Noisy sorting without resampling

Mark Braverman, Elchanan Mossel. Noisy sorting without resampling. In Shang-Hua Teng, editor, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. pages 268-276, SIAM, 2008. [doi]

@inproceedings{BravermanM08,
  title = {Noisy sorting without resampling},
  author = {Mark Braverman and Elchanan Mossel},
  year = {2008},
  doi = {10.1145/1347082.1347112},
  url = {http://doi.acm.org/10.1145/1347082.1347112},
  researchr = {https://researchr.org/publication/BravermanM08},
  cites = {0},
  citedby = {0},
  pages = {268-276},
  booktitle = {Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008},
  editor = {Shang-Hua Teng},
  publisher = {SIAM},
}