Artigos com autorizações de acesso público - Mark BravermanSaiba mais
41 artigos disponíveis publicamente
Communication lower bounds for statistical estimation problems via a distributed data processing inequality
M Braverman, A Garg, T Ma, HL Nguyen, DP Woodruff
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
Autorizações: US National Science Foundation
Beaucoup: Answering many network traffic queries, one memory update at a time
X Chen, S Landau-Feibish, M Braverman, J Rexford
Proceedings of the Annual conference of the ACM Special Interest Group on …, 2020
Autorizações: US National Science Foundation
Selling to a no-regret buyer
M Braverman, J Mao, J Schneider, M Weinberg
Proceedings of the 2018 ACM Conference on Economics and Computation, 523-538, 2018
Autorizações: US National Science Foundation
List and unique coding for interactive communication in the presence of adversarial noise
M Braverman, K Efremenko
SIAM Journal on Computing 46 (1), 388-428, 2017
Autorizações: US National Science Foundation, European Commission
Parallel algorithms for select and partition with noisy comparisons
M Braverman, J Mao, SM Weinberg
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
Autorizações: US National Science Foundation
A discrepancy lower bound for information complexity
M Braverman, O Weinstein
Algorithmica 76, 846-864, 2016
Autorizações: US National Science Foundation
Clearing matching markets efficiently: informative signals and match recommendations
I Ashlagi, M Braverman, Y Kanoria, P Shi
Management Science 66 (5), 2163-2193, 2020
Autorizações: US National Science Foundation
Coding for interactive communication correcting insertions and deletions
M Braverman, R Gelles, J Mao, R Ostrovsky
IEEE Transactions on Information Theory 63 (10), 6256-6270, 2017
Autorizações: US National Science Foundation, US Department of Defense
ETH Hardness for Densest-k-Subgraph with Perfect Completeness
M Braverman, YK Ko, A Rubinstein, O Weinstein
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
Autorizações: US National Science Foundation
Reliable communication over highly connected noisy networks
N Alon, M Braverman, K Efremenko, R Gelles, B Haeupler
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
Autorizações: US National Science Foundation
Constant-rate coding for multiparty interactive communication is impossible
M Braverman, K Efremenko, R Gelles, B Haeupler
Journal of the ACM (JACM) 65 (1), 1-41, 2017
Autorizações: US National Science Foundation
Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
M Braverman, A Garg, YK Ko, J Mao, D Touchette
SIAM Journal on Computing 47 (6), 2277-2314, 2018
Autorizações: US National Science Foundation, US Department of Defense, Natural Sciences …
Calibration, entropy rates, and memory in language models
M Braverman, X Chen, S Kakade, K Narasimhan, C Zhang, Y Zhang
International Conference on Machine Learning, 1089-1099, 2020
Autorizações: US National Science Foundation
The gradient complexity of linear regression
M Braverman, E Hazan, M Simchowitz, B Woodworth
Conference on Learning Theory, 627-647, 2020
Autorizações: US National Science Foundation
Analysis of medicare pay-for-performance contracts
H Bastani, M Bayati, M Braverman, R Gummadi, R Johari
Available at SSRN 2839143, 2016
Autorizações: US National Science Foundation
Information lower bounds via self-reducibility
M Braverman, A Garg, D Pankratov, O Weinstein
Theory of Computing Systems 59, 377-396, 2016
Autorizações: US National Science Foundation
Max-weight online stochastic matching: Improved approximations against the online benchmark
M Braverman, M Derakhshan, A Molina Lovett
Proceedings of the 23rd ACM Conference on Economics and Computation, 967-985, 2022
Autorizações: US National Science Foundation
Pseudorandom pseudo-distributions with near-optimal error for read-once branching programs
M Braverman, G Cohen, S Garg
SIAM Journal on Computing 49 (5), STOC18-242-STOC18-299, 2019
Autorizações: US National Science Foundation
The coin problem with applications to data streams
M Braverman, S Garg, DP Woodruff
2020 ieee 61st annual symposium on foundations of computer science (focs …, 2020
Autorizações: US National Science Foundation
On simultaneous two-player combinatorial auctions
M Braverman, J Mao, SM Weinberg
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
Autorizações: US National Science Foundation
As informações de publicação e financiamento são determinadas automaticamente por um programa de computador