Author of the publication

Efficient Removal Lemmas for Matrices.

, and . APPROX-RANDOM, volume 81 of LIPIcs, page 25:1-25:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Efficient Removal Lemmas for Matrices., and . APPROX-RANDOM, volume 81 of LIPIcs, page 25:1-25:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Active Learning Polynomial Threshold Functions., , , and . NeurIPS, (2022)Archimedes Meets Privacy: On Privately Estimating Quantiles in High Dimensions Under Minimal Assumptions., , and . NeurIPS, (2022)A Framework for Adversarially Robust Streaming Algorithms., , , and . PODS, page 63-80. ACM, (2020)Adversarial laws of large numbers and optimal regret in online classification., , , , , and . STOC, page 447-455. ACM, (2021)Finding monotone patterns in sublinear time., , , and . Electron. Colloquium Comput. Complex., (2019)Semi-random graph process., , , , , and . Random Struct. Algorithms, 56 (3): 648-675 (2020)Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays., , and . ICALP, volume 80 of LIPIcs, page 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Hard Properties with (Very) Short PCPPs and Their Applications., , , and . ITCS, volume 151 of LIPIcs, page 9:1-9:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Testing Hereditary Properties of Ordered Graphs and Matrices., , and . FOCS, page 848-858. IEEE Computer Society, (2017)