Sampling lower bounds via information theory

Ziv Bar-Yossef. Sampling lower bounds via information theory. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA. pages 335-344, ACM, 2003. [doi]

@inproceedings{Bar-Yossef03,
  title = {Sampling lower bounds via information theory},
  author = {Ziv Bar-Yossef},
  year = {2003},
  doi = {10.1145/780542.780593},
  url = {http://doi.acm.org/10.1145/780542.780593},
  researchr = {https://researchr.org/publication/Bar-Yossef03},
  cites = {0},
  citedby = {0},
  pages = {335-344},
  booktitle = {Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA},
  publisher = {ACM},
  isbn = {1-58113-674-9},
}