APA
Click to copy
Brakensiek, J., Chen, Y., Dhar, M., & Zhang, Z. (2026). Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities. In Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC 2026), Salt Lake City, United States.
Chicago/Turabian
Click to copy
Brakensiek, Joshua, Yeyuan Chen, Manik Dhar, and Zihan Zhang. “Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities.” In proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC 2026), Salt Lake City, United States (2026).
MLA
Click to copy
Brakensiek, Joshua, et al. “Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities.” In Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC 2026), Salt Lake City, United States, 2026.
BibTeX Click to copy
@article{joshua2026a,
title = {Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities},
year = {2026},
journal = {In proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC 2026), Salt Lake City, United States},
author = {Brakensiek, Joshua and Chen, Yeyuan and Dhar, Manik and Zhang, Zihan}
}