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


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