Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
David J. Lee, Samuel McCauley, Shikha Singh, and Max Stein. Telescoping Filter: A Practical Adaptive Filter. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 60:1-60:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{lee_et_al:LIPIcs.ESA.2021.60, author = {Lee, David J. and McCauley, Samuel and Singh, Shikha and Stein, Max}, title = {{Telescoping Filter: A Practical Adaptive Filter}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {60:1--60:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.60}, URN = {urn:nbn:de:0030-drops-146410}, doi = {10.4230/LIPIcs.ESA.2021.60}, annote = {Keywords: Filters, approximate-membership query data structures (AMQs), Bloom filters, quotient filters, cuckoo filters, adaptivity, succinct data structures} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
Samuel McCauley. Approximate Similarity Search Under Edit Distance Using Locality-Sensitive Hashing. In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 21:1-21:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{mccauley:LIPIcs.ICDT.2021.21, author = {McCauley, Samuel}, title = {{Approximate Similarity Search Under Edit Distance Using Locality-Sensitive Hashing}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {21:1--21:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-179-5}, ISSN = {1868-8969}, year = {2021}, volume = {186}, editor = {Yi, Ke and Wei, Zhewei}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.21}, URN = {urn:nbn:de:0030-drops-137299}, doi = {10.4230/LIPIcs.ICDT.2021.21}, annote = {Keywords: edit distance, approximate pattern matching, approximate nearest neighbor, similarity search, locality-sensitive hashing} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Jing Chen, Samuel McCauley, and Shikha Singh. Non-Cooperative Rational Interactive Proofs. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 29:1-29:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chen_et_al:LIPIcs.ESA.2019.29, author = {Chen, Jing and McCauley, Samuel and Singh, Shikha}, title = {{Non-Cooperative Rational Interactive Proofs}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.29}, URN = {urn:nbn:de:0030-drops-111508}, doi = {10.4230/LIPIcs.ESA.2019.29}, annote = {Keywords: non-cooperative game theory, extensive-form games with imperfect information, refined sequential equilibrium, rational proofs, interactive proofs} }
Published in: LIPIcs, Volume 49, 8th International Conference on Fun with Algorithms (FUN 2016)
Michael A. Bender, Samuel McCauley, Bertrand Simon, Shikha Singh, and Frédéric Vivien. Resource Optimization for Program Committee Members: A Subreview Article. In 8th International Conference on Fun with Algorithms (FUN 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 49, pp. 7:1-7:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bender_et_al:LIPIcs.FUN.2016.7, author = {Bender, Michael A. and McCauley, Samuel and Simon, Bertrand and Singh, Shikha and Vivien, Fr\'{e}d\'{e}ric}, title = {{Resource Optimization for Program Committee Members: A Subreview Article}}, booktitle = {8th International Conference on Fun with Algorithms (FUN 2016)}, pages = {7:1--7:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-005-7}, ISSN = {1868-8969}, year = {2016}, volume = {49}, editor = {Demaine, Erik D. and Grandoni, Fabrizio}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.7}, URN = {urn:nbn:de:0030-drops-58872}, doi = {10.4230/LIPIcs.FUN.2016.7}, annote = {Keywords: Scheduling, Delegation, Subreviews} }