Author of the publication

Optimality of Linear Sketching Under Modular Updates.

, , and . CCC, volume 137 of LIPIcs, page 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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

Structure of Protocols for XOR Functions., , and . FOCS, page 282-288. IEEE Computer Society, (2016)Pseudorandom Generators from Polarizing Random Walks., , , and . CCC, volume 102 of LIPIcs, page 1:1-1:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Affine-malleable extractors, spectrum doubling, and application to privacy amplification., , and . ISIT, page 2913-2917. IEEE, (2016)Structure and Randomness in Complexity Theory and Additive Combinatorics.. University of California, San Diego, USA, (2019)Sign Rank vs Discrepancy., , and . CCC, volume 169 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Torus Polynomials: An Algebraic Approach to ACC Lower Bounds., , , and . ITCS, volume 124 of LIPIcs, page 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications., , and . STOC, page 463-471. ACM, (2023)Separation of the Factorization Norm and Randomized Communication Complexity., , , and . CCC, volume 264 of LIPIcs, page 1:1-1:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Online Learning and Disambiguations of Partial Concept Classes., , , and . ICALP, volume 261 of LIPIcs, page 42:1-42:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification., , and . IACR Cryptology ePrint Archive, (2015)