%0 Conference Paper %1 conf/recomb/EkimBO20 %A Ekim, Baris %A Berger, Bonnie %A Orenstein, Yaron %B RECOMB %D 2020 %E Schwartz, Russell %I Springer %K dblp %P 37-53 %T A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets. %U http://dblp.uni-trier.de/db/conf/recomb/recomb2020.html#EkimBO20 %V 12074 %@ 978-3-030-45257-5

@inproceedings{conf/recomb/EkimBO20, added-at = {2020-05-04T00:00:00.000+0200}, author = {Ekim, Baris and Berger, Bonnie and Orenstein, Yaron}, biburl = {https://www.bibsonomy.org/bibtex/2479104095d3048b04cfad73b5ee5932a/dblp}, booktitle = {RECOMB}, crossref = {conf/recomb/2020}, editor = {Schwartz, Russell}, ee = {https://doi.org/10.1007/978-3-030-45257-5_3}, interhash = {583f9496ebaeeb46623921dd6a879f5c}, intrahash = {479104095d3048b04cfad73b5ee5932a}, isbn = {978-3-030-45257-5}, keywords = {dblp}, pages = {37-53}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2020-05-05T11:48:31.000+0200}, title = {A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets.}, url = {http://dblp.uni-trier.de/db/conf/recomb/recomb2020.html#EkimBO20}, volume = 12074, year = 2020 }