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


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