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

A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion., and . IACR Cryptology ePrint Archive, (1999)Stabbing Planes., , , , , , and . Electron. Colloquium Comput. Complex., (2017)Models of Greedy Algorithms for Graph Problems., and . Algorithmica, 54 (3): 269-317 (2009)Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems.. RANDOM-APPROX, volume 2129 of Lecture Notes in Computer Science, page 2-5. Springer, (2001)Agnostic Learning from Tolerant Natural Proofs., , , and . APPROX-RANDOM, volume 81 of LIPIcs, page 35:1-35:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Decision trees and downward closures., and . SCT, page 29-38. IEEE Computer Society, (1988)Hard-Core Distributions for Somewhat Hard Problems.. FOCS, page 538-545. IEEE Computer Society, (1995)Tighter Connections between Derandomization and Circuit Lower Bounds., , , and . APPROX-RANDOM, volume 40 of LIPIcs, page 645-658. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Size-depth trade-offs for threshold circuits., , and . STOC, page 541-550. ACM, (1993)Direct Minimum-Knowledge Computations., and . CRYPTO, volume 293 of Lecture Notes in Computer Science, page 40-51. Springer, (1987)