Publications

Bogdan Kulynych, Yao{-}Yuan Yang, Yaodong Yu, Jarosław Błasiok, Preetum Nakkiran (2022). What You See is What You Get: Distributional Generalization for Algorithm Design in Deep Learning. NeurIPS 2022.
Cite DOI arxiv
Jarosław Błasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan (2022). General Strong Polarization. J. ACM.
Cite DOI arxiv
Jarosław Błasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola (2021). Fourier growth of structured $\mathbb{F}_2$-polynomials and applications. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021).
Cite DOI arxiv
Jarosław Błasiok (2020). Optimal Streaming and Tracking Distinct Elements with High Probability. ACM Trans. Algorithms; Best Student Paper Award at SODA 2018.
Cite DOI arxiv
Jarosław Błasiok, Mark Bun, Aleksandar Nikolov, Thomas Steinke (2019). Towards Instance-Optimal Private Query Release. SODA 2019.
Cite arxiv
Jarosław Błasiok, Marcin Kaminski, Jean{-}Florent Raymond, Th{\'{e}}ophile Trunck (2019). Induced minors and well-quasi-ordering. J. Comb. Theory, Ser. B.
Cite DOI arxiv
Jarosław Błasiok, Patrick Lopatto, Kyle Luh, Jake Marcinek, Shravas Rao (2019). An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices. 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019.
Cite DOI arxiv
Jarosław Błasiok, Venkatesan Guruswami, Madhu Sudan (2018). Polar Codes with Exponentially Small Error at Finite Block Length. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA.
Cite DOI arxiv
Charalampos E. Tsourakakis, Michael Mitzenmacher, Kasper Green Larsen, Jarosław Błasiok, Ben Lawson, Preetum Nakkiran, Vasileios Nakos (2017). Predicting Positive and Negative Links with Noisy Queries: Theory Practice. Unpublished manuscript.
Cite arxiv
Jarosław Błasiok, Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Lin F. Yang (2017). Streaming symmetric norms via measure concentration. Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017.
Cite DOI arxiv