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 48 to 67 of 77 < previous   next >
Publication DateArticle TitleAuthor(s)
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
2016Reliable Communication over Highly Connected Noisy NetworksAlon, Noga; Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard
2020The Role of Randomness and Noise in Strategic ClassificationBraverman, Mark; Garg, Sumegha
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