Skip to main content

Browsing by Author Braverman, Mark

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 64 to 77 of 77 < previous 
Publication DateArticle TitleAuthor(s)
2013Search using queries on indistinguishable itemsBraverman, Mark; Oshri, G
Jun-2018Selling to a No-Regret BuyerBraverman, Mark; Mao, Jieming; Schneider, Jon; Weinberg, Matt
2018Semi-Direct Sum Theorem and Nearest Neighbor under l_inftyBraverman, Mark; Ko, Young K
2015Simulating Noisy Channel InteractionBraverman, Mark; Mao, Jieming
2015Small Value Parallel Repetition for General GamesBraverman, Mark; Garg, Ankit
27-Aug-2015Space-Bounded Church-Turing Thesis and Computational Tractability of Closed SystemsBraverman, Mark; Schneider, J; Rojas, C
13-Jun-2014Stability in large matching markets with complementaritiesAshlagi, I; Braverman, Mark; Hassidim, A
2-Jun-2016Strategyproof Mechanisms for Competitive Influence in NetworksBorodin, A; Braverman, Mark; Lucier, B; Oren, J
2013Strategyproof mechanisms for competitive influence in networksBorodin, Allan; Braverman, Mark; Lucier, Brendan; Oren, Joel
1-Dec-2012Thurston equivalence to a rational map is decidableSylvain, B; Braverman, Mark; Yampolsky, MY
10-Feb-2015A tight bound for set disjointness in the message-passing modelBraverman, Mark; Ellen, F; Oshman, R; Pitassi, T; Vaikuntanathan, V
2017Tight space-noise tradeoffs in computing the ergodic measureBraverman, Mark; Rojas, Cristóbal; Schneider, Jon
2014Toward Coding for Maximum Errors in Interactive CommunicationBraverman, Mark; Rao, Anup
2012Towards deterministic tree code constructionsBraverman, Mark