Published in: LIPIcs, Volume 392, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2026)
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach, and Yunya Zhao. Two-Sided Lossless Expanders in the Unbalanced Setting. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 392, pp. 34:1-34:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{chattopadhyay_et_al:LIPIcs.APPROX/RANDOM.2026.34,
author = {Chattopadhyay, Eshan and Gurumukhani, Mohit and Ringach, Noam and Zhao, Yunya},
title = {{Two-Sided Lossless Expanders in the Unbalanced Setting}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2026)},
pages = {34:1--34:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-449-9},
ISSN = {1868-8969},
year = {2026},
volume = {392},
editor = {Singh, Mohit and Gur, Tom},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2026.34},
URN = {urn:nbn:de:0030-drops-277517},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2026.34},
annote = {Keywords: Pseudorandomness, lossless expanders, multiplicity codes, condensers}
}