Author of the publication

Dimension, Pseudorandomness and Extraction of Pseudorandomness.

, , , and . FSTTCS, volume 45 of LIPIcs, page 221-235. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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

Tight cell probe bounds for succinct Boolean matrix-vector multiplication., , and . STOC, page 1297-1306. ACM, (2018)On Resource-Bounded Versions of the van Lambalgen Theorem., , and . TAMC, volume 10185 of Lecture Notes in Computer Science, page 129-143. (2017)Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs., and . WALCOM, volume 8973 of Lecture Notes in Computer Science, page 258-269. Springer, (2015)Tight Lower Bound on Equivalence Testing in Conditional Sampling Model., , and . CoRR, (2023)Support Size Estimation: The Power of Conditioning., , and . MFCS, volume 272 of LIPIcs, page 33:1-33:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity., , , and . ESA, volume 112 of LIPIcs, page 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Sparse Weight Tolerant Subgraph for Single Source Shortest Path., and . SWAT, volume 101 of LIPIcs, page 15:1-15:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Pairwise Reachability Oracles and Preservers under Failures., , and . CoRR, (2021)Support Size Estimation: The Power of Conditioning., , and . CoRR, (2022)Streaming Algorithms For Computing Edit Distance Without Exploiting Suffix Trees., , and . CoRR, (2016)