Tight lower bounds for selection in randomly ordered streams

Amit Chakrabarti, T. S. Jayram, Mihai Patrascu. Tight lower bounds for selection in randomly ordered streams. 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 720-729, SIAM, 2008. [doi]

@inproceedings{ChakrabartiJP08,
  title = {Tight lower bounds for selection in randomly ordered streams},
  author = {Amit Chakrabarti and T. S. Jayram and Mihai Patrascu},
  year = {2008},
  doi = {10.1145/1347082.1347161},
  url = {http://doi.acm.org/10.1145/1347082.1347161},
  researchr = {https://researchr.org/publication/ChakrabartiJP08},
  cites = {0},
  citedby = {0},
  pages = {720-729},
  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},
}