( en | de | ru )

 

Disambiguation of "Lovett, Shachar"

Author of the publication

copydeleteadd this publication to your clipboard
Decision List Compression by Mild Random Restrictions.

, , and . J. ACM, 68 (6): 45:1-45:17 (2021)

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.

Tom Lovett

Brendan Lovett

 

Other publications of authors with the same name

On the Complexity of Boolean Functions in Different Characteristics., , and . CCC, page 173-183. IEEE Computer Society, (2009)Random Low Degree Polynomials are Hard to Approximate., , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 366-377. Springer, (2009)On the Beck-Fiala Conjecture for Random Set Systems., and . APPROX-RANDOM, volume 60 of LIPIcs, page 29:1-29:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture.. FOCS, page 194-199. IEEE Computer Society, (2018)A Lower Bound for Dynamic Approximate Membership Data Structures., and . FOCS, page 797-804. IEEE Computer Society, (2010)Decision list compression by mild random restrictions., , and . STOC, page 247-254. ACM, (2020)Improved bounds for the sunflower lemma., , , and . STOC, page 624-630. ACM, (2020)The gram-schmidt walk: a cure for the Banaszczyk blues., , , and . STOC, page 587-597. ACM, (2018)List decoding Reed-Muller codes over small fields., and . Electron. Colloquium Comput. Complex., (2014)Generalized comparison trees for point-location problems., , and . Electron. Colloquium Comput. Complex., (2018)