Showing results 59 to 78 of 79
< previous
next >
Publication Date | Article Title | Author(s) |
2014 | Pseudorandom Generators for Regular Branching Programs | Braverman, Mark; Rao, Anup; Raz, Ran; Yehudayoff, Amir |
2019 | Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs | Braverman, Mark; Cohen, Gil; Garg, Sumegha |
2014 | Public vs Private Coin in Bounded-Round Information | Braverman, Mark; Garg, Ankit |
2012 | The rate of convergence of the Walk on Spheres Algorithm | Binder, Ilia; Braverman, Mark |
25-Jul-2016 | Reliable communication over highly connected noisy networks | Alon, N; Braverman, Mark; Efremenko, K; Gelles, Ran; Haeupler, B |
2016 | Reliable Communication over Highly Connected Noisy Networks | Alon, Noga; Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard |
2020 | The Role of Randomness and Noise in Strategic Classification | Braverman, Mark; Garg, Sumegha |
2013 | Search using queries on indistinguishable items | Braverman, Mark; Oshri, G |
Jun-2018 | Selling to a No-Regret Buyer | Braverman, Mark; Mao, Jieming; Schneider, Jon; Weinberg, Matt |
2018 | Semi-Direct Sum Theorem and Nearest Neighbor under l_infty | Braverman, Mark; Ko, Young K |
2015 | Simulating Noisy Channel Interaction | Braverman, Mark; Mao, Jieming |
2015 | Small Value Parallel Repetition for General Games | Braverman, Mark; Garg, Ankit |
27-Aug-2015 | Space-Bounded Church-Turing Thesis and Computational Tractability of Closed Systems | Braverman, Mark; Schneider, J; Rojas, C |
13-Jun-2014 | Stability in large matching markets with complementarities | Ashlagi, I; Braverman, Mark; Hassidim, A |
2-Jun-2016 | Strategyproof Mechanisms for Competitive Influence in Networks | Borodin, A; Braverman, Mark; Lucier, B; Oren, J |
2013 | Strategyproof mechanisms for competitive influence in networks | Borodin, Allan; Braverman, Mark; Lucier, Brendan; Oren, Joel |
1-Dec-2012 | Thurston equivalence to a rational map is decidable | Sylvain, B; Braverman, Mark; Yampolsky, MY |
10-Feb-2015 | A tight bound for set disjointness in the message-passing model | Braverman, Mark; Ellen, F; Oshman, R; Pitassi, T; Vaikuntanathan, V |
2017 | Tight space-noise tradeoffs in computing the ergodic measure | Braverman, Mark; Rojas, Cristóbal; Schneider, Jon |
2014 | Toward Coding for Maximum Errors in Interactive Communication | Braverman, Mark; Rao, Anup |