Author of the publication

Finding Heavy Hitters from Lossy or Noisy Data.

, , , and . APPROX-RANDOM, volume 8096 of Lecture Notes in Computer Science, page 347-362. Springer, (2013)

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

On the (Non) NP-Hardness of Computing Circuit Complexity., and . Electron. Colloquium Comput. Complex., (2014)Circuit Lower Bounds for Nondeterministic Quasi-Polytime: An Easy Witness Lemma for NP and NQP., and . Electron. Colloquium Comput. Complex., (2017)Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP., and . STOC, page 890-901. ACM, (2018)Connections between circuit analysis problems and circuit lower bounds.. Massachusetts Institute of Technology, Cambridge, USA, (2018)ndltd.org (oai:dspace.mit.edu:1721.1/120467).Finding Heavy Hitters from Lossy or Noisy Data., , , and . APPROX-RANDOM, volume 8096 of Lecture Notes in Computer Science, page 347-362. Springer, (2013)Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems., , , and . CCC, volume 137 of LIPIcs, page 30:1-30:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Easiness Amplification and Uniform Circuit Lower Bounds., and . CCC, volume 79 of LIPIcs, page 8:1-8:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On the (Non) NP-Hardness of Computing Circuit Complexity., and . CCC, volume 33 of LIPIcs, page 365-380. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)On the (Non) NP-Hardness of Computing Circuit Complexity., and . Theory of Computing, 13 (1): 1-22 (2017)Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma., and . SIAM J. Comput., (2020)