Probabilistic Existence of Large Sets of Designs

Shachar Lovett, Sankeerth Rao, Alexander Vardy. Probabilistic Existence of Large Sets of Designs. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018. pages 1545-1556, SIAM, 2018. [doi]

@inproceedings{LovettRV18,
  title = {Probabilistic Existence of Large Sets of Designs},
  author = {Shachar Lovett and Sankeerth Rao and Alexander Vardy},
  year = {2018},
  doi = {10.1137/1.9781611975031.101},
  url = {https://doi.org/10.1137/1.9781611975031.101},
  researchr = {https://researchr.org/publication/LovettRV18},
  cites = {0},
  citedby = {0},
  pages = {1545-1556},
  booktitle = {Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018},
  editor = {Artur Czumaj},
  publisher = {SIAM},
  isbn = {978-1-61197-503-1},
}