Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Approximating Large Powers of Stochastic Matrices in Small Space., , and . Electron. Colloquium Comput. Complex., (2022)An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy., , and . STOC, page 1185-1194. ACM, (2017)Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL., , and . STOC, page 2039-2049. ACM, (2024)New Near-Linear Time Decodable Codes Closer to the GV Bound., and . CCC, volume 234 of LIPIcs, page 10:1-10:40. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Pseudorandom Generators for Read-Once Monotone Branching Programs., , , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 58:1-58:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions., , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 43:1-43:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Study of Error Reduction Polynomials., , , , , and . Electron. Colloquium Comput. Complex., (2024)When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?, , and . APPROX/RANDOM, volume 317 of LIPIcs, page 53:1-53:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends., , and . Electron. Colloquium Comput. Complex., (2018)Almost Chor-Goldreich Sources and Adversarial Random Walks., , , and . STOC, page 1-9. ACM, (2023)