Mika Göös, Thomas Watson 0001. A Lower Bound for Sampling Disjoint Sets. In Dimitris Achlioptas, László A. Végh, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA. Volume 145 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]
@inproceedings{Goos019,
title = {A Lower Bound for Sampling Disjoint Sets},
author = {Mika Göös and Thomas Watson 0001},
year = {2019},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.51},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.51},
researchr = {https://researchr.org/publication/Goos019},
cites = {0},
citedby = {0},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA},
editor = {Dimitris Achlioptas and László A. Végh},
volume = {145},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-125-2},
}