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 1 to 20 of 31  next >
Publication DateArticle TitleAuthor(s)
Oct-2017Coding for Interactive Communication Correcting Insertions and DeletionsBraverman, Mark; Gelles, Ran; Mao, J; Ostrovsky, R
2016Coding for interactive communication correcting insertions and deletionsBraverman, Mark; Gelles, R; Mao, J; Ostrovsky, R
1-Oct-2012Coding for interactive computation: Progress and challengesBraverman, Mark
16-Jun-2016Communication lower bounds for statistical estimation problems via a distributed data processing inequality?Braverman, Mark; Garg, A; Ma, T; Nguyen, Huy L.; Woodruff, DP
12-Jan-2014The computational hardness of pricing compound optionsBraverman, Mark; Pasricha, K
19-Jun-2016Constant-rate coding for multiparty interactive communication is impossibleBraverman, Mark; Efremenko, K; Gelles, Ran; Haeupler, B
8-Oct-2014Data-driven decisions for reducing readmissions for heart failure: General methodology and case studyBayati, M; Braverman, Mark; Gillam, M; Mack, KM; Ruiz, G; et al
26-Oct-2013Direct products in communication complexityBraverman, Mark; Weinstein, O; Rao, A; Yehudayoff, A
1-Nov-2016A Discrepancy Lower Bound for Information ComplexityBraverman, Mark; Weinstein, O
16-Jan-2017ETH hardness for densest-k-Subgraph with perfect completenessBraverman, Mark; Ko, YK; Rubinstein, A; Weinstein, O
6-Jan-2013Finding endogenously formed communitiesBalcan, M-F; Borgs, C; Braverman, Mark; Chayes, J; Teng, S-H
2-Oct-2013A hard-to-compress interactive task?Braverman, Mark
2016Information complexity is computableBraverman, Mark; Schneider, J
2016Interpolating between truthful and non-truthful mechanisms for combinatorial auctionsBraverman, Mark; Mao, J; Weinberg, SM
2017LIST and unique coding for interactive communication in the presence of adversarial noiseBraverman, Mark; Efremenko, K
28-Feb-2017List and unique coding for interactive communication in the presence of adversarial noiseBraverman, Mark; Efremenko, K
17-Dec-2015Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of DisjointnessBraverman, Mark; Garg, A; Ko, YK; Mao, J; Touchette, D
1-Jul-2013Noise vs computational intractability in dynamicsBraverman, Mark; Grigo, A; Rojas, C
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.