Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{gs_et_al:LIPIcs:2019:11266, author = {Mika G{\"o}{\"o}s and Thomas Watson}, title = {{A Lower Bound for Sampling Disjoint Sets}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {51:151:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771252}, ISSN = {18688969}, year = {2019}, volume = {145}, editor = {Dimitris Achlioptas and L{\'a}szl{\'o} A. V{\'e}gh}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11266}, URN = {urn:nbn:de:0030drops112666}, doi = {10.4230/LIPIcs.APPROXRANDOM.2019.51}, annote = {Keywords: Communication complexity, set disjointness, sampling} }
Keywords:  Communication complexity, set disjointness, sampling  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)  
Issue Date:  2019  
Date of publication:  17.09.2019 