From post

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.

 

Другие публикации лиц с тем же именем

Near Optimal Distributed Learning of Halfspaces with Two Parties., , , и . COLT, том 134 из Proceedings of Machine Learning Research, стр. 724-758. PMLR, (2021)New separations results for external information., и . STOC, стр. 248-258. ACM, (2021)A Discrepancy Lower Bound for Information Complexity., и . APPROX-RANDOM, том 7408 из Lecture Notes in Computer Science, стр. 459-470. Springer, (2012)Inapproximability of NP-Complete Variants of Nash Equilibrium., , и . APPROX-RANDOM, том 6845 из Lecture Notes in Computer Science, стр. 13-25. Springer, (2011)The price of uncertainty in communication., и . Allerton, стр. 924-927. IEEE, (2015)Information Complexity Is Computable., и . ICALP, том 55 из LIPIcs, стр. 87:1-87:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Non-computable Julia sets, и . CoRR, (2004)Parallel algorithms for select and partition with noisy comparisons., , и . STOC, стр. 851-862. ACM, (2016)Communication lower bounds for statistical estimation problems via a distributed data processing inequality., , , , и . STOC, стр. 1011-1020. ACM, (2016)On the Complexity of Real Functions.. FOCS, стр. 155-164. IEEE Computer Society, (2005)