Browsing by Author Braverman, Mark
Showing results 50 to 69 of 79
< previous
next >
| Publication Date | Article Title | Author(s) |
|---|---|---|
| 2018 | On Simultaneous Two-player Combinatorial Auctions | Braverman, Mark; Mao, Jieming; Weinberg, S Matthew |
| 2019 | On the Computational Power of Radio Channels | Braverman, Mark; Kol, Gillat; Oshman, Rotem; Tal, Avishay |
| 9-Jan-2013 | On the convergence of the Hegselmann-Krause system | Bhattacharyya, Arnab; Braverman, Mark; Chazelle, Bernard; Nguyen, Huy L. |
| 9-Jan-2013 | On the convergence of the Hegselmann-Krause system. | Bhattacharyya, Arnab; Braverman, Mark; Chazelle, Bernard; Nguyen, Huy L. |
| 5-Jan-2016 | Optimal Provision-After-Wait in Healthcare | Braverman, Mark; Chen, J; Kannan, S |
| 2019 | Optimal Short-Circuit Resilient Formulas | Braverman, Mark; Efremenko, Klim; Gelles, Ran; Yitayew, Michael A |
| 19-Jun-2016 | Parallel algorithms for select and partition with noisy comparisons | Braverman, Mark; Mao, J; Weinberg, SM |
| 2018 | The Price of Uncertain Priors in Source Coding | Braverman, Mark; Juba, Brendan |
| 7-Apr-2016 | The price of uncertainty in communication | Braverman, Mark; Juba, B |
| 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 |