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 44 to 63 of 79 < previous   next >
Publication DateArticle TitleAuthor(s)
2017Nash Equilibria in Perturbation-Stable GamesBalcan, Maria-Florina; Braverman, Mark
17-Dec-2015Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of DisjointnessBraverman, Mark; Garg, A; Ko, YK; Mao, J; Touchette, D
2018Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of DisjointnessBraverman, Mark; Garg, Ankit; Ko, Young K; Mao, Jieming; Touchette, Dave
2021New separations results for external informationBraverman, Mark; Minzer, Dor
2013Noise versus Computational Intractability in DynamicsBraverman, Mark
1-Jul-2013Noise vs computational intractability in dynamicsBraverman, Mark; Grigo, A; Rojas, C
2018On Simultaneous Two-player Combinatorial AuctionsBraverman, Mark; Mao, Jieming; Weinberg, S Matthew
2019On the Computational Power of Radio ChannelsBraverman, Mark; Kol, Gillat; Oshman, Rotem; Tal, Avishay
9-Jan-2013On the convergence of the Hegselmann-Krause systemBhattacharyya, Arnab; Braverman, Mark; Chazelle, Bernard; Nguyen, Huy L.
9-Jan-2013On the convergence of the Hegselmann-Krause system.Bhattacharyya, Arnab; Braverman, Mark; Chazelle, Bernard; Nguyen, Huy L.
5-Jan-2016Optimal Provision-After-Wait in HealthcareBraverman, Mark; Chen, J; Kannan, S
2019Optimal Short-Circuit Resilient FormulasBraverman, Mark; Efremenko, Klim; Gelles, Ran; Yitayew, Michael A
19-Jun-2016Parallel algorithms for select and partition with noisy comparisonsBraverman, Mark; Mao, J; Weinberg, SM
2018The Price of Uncertain Priors in Source CodingBraverman, Mark; Juba, Brendan
7-Apr-2016The price of uncertainty in communicationBraverman, Mark; Juba, B
2014Pseudorandom Generators for Regular Branching ProgramsBraverman, Mark; Rao, Anup; Raz, Ran; Yehudayoff, Amir
2019Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching ProgramsBraverman, Mark; Cohen, Gil; Garg, Sumegha
2014Public vs Private Coin in Bounded-Round InformationBraverman, Mark; Garg, Ankit
2012The rate of convergence of the Walk on Spheres AlgorithmBinder, Ilia; Braverman, Mark
25-Jul-2016Reliable communication over highly connected noisy networksAlon, N; Braverman, Mark; Efremenko, K; Gelles, Ran; Haeupler, B