Author of the publication

Information Complexity Is Computable.

, and . ICALP, volume 55 of LIPIcs, page 87:1-87:10. 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

Network coding in undirected graphs is either very helpful or not helpful at all., , and . CoRR, (2016)Efficient Communication Using Partial Information., and . Electron. Colloquium Comput. Complex., (2010)On ad hoc routing with guaranteed delivery.. PODC, page 418. ACM, (2008)Simulating Noisy Channel Interaction., and . ITCS, page 21-30. ACM, (2015)Search using queries on indistinguishable items., and . STACS, volume 20 of LIPIcs, page 610-621. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Stability in Large Matching Markets with Complementarities., , and . Operations Research, 62 (4): 713-732 (2014)Tiered Random Matching Markets: Rank Is Proportional to Popularity., , , , and . ITCS, volume 185 of LIPIcs, page 46:1-46:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On Rich 2-to-1 Games., , and . ITCS, volume 185 of LIPIcs, page 27:1-27:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions., , and . SODA, page 1444-1457. SIAM, (2016)The complexity of simulating Brownian Motion., and . SODA, page 58-67. SIAM, (2009)