No. Title Author Year
1 A Candidate for a Strong Separation of Information and Communication Braverman, Mark et al. 2018
2 Information Value of Two-Prover Games Braverman, Mark et al. 2018
3 Semi-Direct Sum Theorem and Nearest Neighbor under l_infty Braverman, Mark et al. 2018
4 Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All Braverman, Mark et al. 2017
5 Coding for Interactive Communication Correcting Insertions and Deletions Braverman, Mark et al. 2016
6 Information Complexity Is Computable Braverman, Mark et al. 2016
7 Search using queries on indistinguishable items Braverman, Mark et al. 2013
8 Computability and Complexity of Julia Sets (Invited Talk) Braverman, Mark 2009
9 Fractional Pebbling and Thrifty Branching Programs Braverman, Mark et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI