Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan 0001, Santhoshini Velusamy. Sketching Approximability of (Weak) Monarchy Predicates. In Amit Chakrabarti, Chaitanya Swamy, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference). Volume 245 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]
@inproceedings{ChouGSSV22,
title = {Sketching Approximability of (Weak) Monarchy Predicates},
author = {Chi-Ning Chou and Alexander Golovnev and Amirbehshad Shahrasbi and Madhu Sudan 0001 and Santhoshini Velusamy},
year = {2022},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.35},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.35},
researchr = {https://researchr.org/publication/ChouGSSV22},
cites = {0},
citedby = {0},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)},
editor = {Amit Chakrabarti and Chaitanya Swamy},
volume = {245},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-249-5},
}