Author of the publication

A Composition Theorem for Conical Juntas.

, and . CCC, volume 50 of LIPIcs, page 5:1-5:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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

Exponential separation of quantum and classical one-way communication complexity., , and . STOC, page 128-137. ACM, (2004)Information Theory Methods in Communication Complexity., , , and . CCC, page 93-102. IEEE Computer Society, (2002)Estimating statistical aggregates on probabilistic data streams., , , and . PODS, page 243-252. ACM, (2007)Analysis of Large-Scale Distributed Information Systems., , and . MASCOTS, page 164-171. IEEE Computer Society, (2000)Controlling Attention in a Memory-Augmented Neural Network To Solve Working Memory Tasks., , , , , and . CogSci, page 478-484. cognitivesciencesociety.org, (2019)On Multiplicative Weight Updates for Concave and Submodular Function Maximization., , and . ITCS, page 201-210. ACM, (2015)Randomized Communication vs. Partition Number., , , and . ICALP, volume 80 of LIPIcs, page 52:1-52:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Resource-Efficient Common Randomness and Secret-Key Schemes., and . SODA, page 1834-1853. SIAM, (2018)Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND.. APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 562-573. Springer, (2009)OLAP Over Uncertain and Imprecise Data., , , , and . VLDB, page 970-981. ACM, (2005)