@InProceedings{dhulipala_et_al:LIPIcs.DISC.2024.19,
author = {Dhulipala, Laxman and Dinitz, Michael and {\L}\k{a}cki, Jakub and Mitrovi\'{c}, Slobodan},
title = {{Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling}},
booktitle = {38th International Symposium on Distributed Computing (DISC 2024)},
pages = {19:1--19:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-352-2},
ISSN = {1868-8969},
year = {2024},
volume = {319},
editor = {Alistarh, Dan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.19},
URN = {urn:nbn:de:0030-drops-212453},
doi = {10.4230/LIPIcs.DISC.2024.19},
annote = {Keywords: approximate maximum matching, set cover, hypergraph matching, PRAM, massively parallel computation}
}