default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Braverman
Person information
- affiliation: Princeton University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c97]Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition of k-Player Projection Games. APPROX/RANDOM 2024: 54:1-54:16- [c96]Mark Braverman
, Rotem Oshman, Tal Roth:
Multi-Party Set Disjointness and Intersection with Bounded Dependence. PODC 2024: 332-342 - [c95]Mark Braverman, Sumegha Garg, Qian Li, Shuo Wang, David P. Woodruff, Jiapeng Zhang:
A New Information Complexity Measure for Multi-pass Streaming with Applications. STOC 2024: 1781-1792 - [i101]Mark Braverman, Sumegha Garg, Qian Li, Shuo Wang, David P. Woodruff, Jiapeng Zhang:
A New Information Complexity Measure for Multi-pass Streaming with Applications. CoRR abs/2403.20283 (2024) - [i100]Mark Braverman, Mahsa Derakhshan, Tristan Pollner, Amin Saberi, David Wajc:
New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling. CoRR abs/2407.15285 (2024) - [i99]Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition for 3-Player XOR Games. CoRR abs/2408.09352 (2024) - [i98]Mark Braverman, Or Zamir:
Optimality of Frequency Moment Estimation. Electron. Colloquium Comput. Complex. TR24: TR24-175 (2024) - 2023
- [c94]Mark Braverman, Subhash Khot, Dor Minzer:
Parallel Repetition for the GHZ Game: Exponential Decay. FOCS 2023: 1337-1341 - [c93]Nikunj Saunshi, Arushi Gupta, Mark Braverman, Sanjeev Arora:
Understanding Influence Functions and Datamodels via Harmonic Analysis. ICLR 2023 - [c92]Mark Braverman, Subhash Khot, Guy Kindler, Dor Minzer:
Improved Monotonicity Testers via Hypercube Embeddings. ITCS 2023: 25:1-25:24 - [c91]Mark Braverman, Dor Minzer:
Rounding via Low Dimensional Embeddings. ITCS 2023: 26:1-26:30 - [c90]Itai Ashlagi, Mark Braverman, Geng Zhao:
Welfare Distribution in Two-sided Random Matching Markets. EC 2023: 122 - [p1]Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam:
Pebbles and Branching Programs for Tree Evaluation. Logic, Automata, and Computational Complexity 2023: 261-318 - [i97]Itai Ashlagi, Mark Braverman, Geng Zhao:
Welfare Distribution in Two-sided Random Matching Markets. CoRR abs/2302.08599 (2023) - [i96]Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition of k-Player Projection Games. CoRR abs/2312.04783 (2023) - [i95]Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition of k-Player Projection Games. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j32]Mark Braverman, Klim Efremenko, Ran Gelles, Michael A. Yitayew:
Optimal Short-Circuit Resilient Formulas. J. ACM 69(4): 26:1-26:37 (2022) - [c89]Yufei Zheng, Xiaoqi Chen, Mark Braverman, Jennifer Rexford:
Unbiased Delay Measurement in the Data Plane. APOCS 2022: 15-30 - [c88]Mark Braverman, Mahsa Derakhshan, Antonio Molina Lovett:
Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark. EC 2022: 967-985 - [e1]Mark Braverman:
13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA. LIPIcs 215, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-217-4 [contents] - [i94]Mark Braverman, Mahsa Derakhshan, Antonio Molina Lovett:
Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark. CoRR abs/2206.01270 (2022) - [i93]Grace Guan, Mark Braverman:
Empirical Characteristics of Affordable Care Act Risk Transfer Payments. CoRR abs/2208.02372 (2022) - [i92]Nikunj Saunshi, Arushi Gupta, Mark Braverman, Sanjeev Arora:
Understanding Influence Functions and Datamodels via Harmonic Analysis. CoRR abs/2210.01072 (2022) - [i91]Mark Braverman, Subhash Khot, Guy Kindler, Dor Minzer:
Improved Monotonicity Testers via Hypercube Embeddings. CoRR abs/2211.09229 (2022) - [i90]Mark Braverman, Dor Minzer:
Rounding via Low Dimensional Embeddings. CoRR abs/2211.09729 (2022) - [i89]Mark Braverman, Subhash Khot, Dor Minzer:
Parallel Repetition for the GHZ Game: Exponential Decay. CoRR abs/2211.13741 (2022) - [i88]Mark Braverman, Klim Efremenko, Gillat Kol, Raghuvansh Saxena, Zhijun Zhang:
Round-vs-Resilience Tradeoffs for Binary Feedback Channels. Electron. Colloquium Comput. Complex. TR22 (2022) - [i87]Mark Braverman, Subhash Khot, Dor Minzer:
Parallel Repetition for the GHZ Game: Exponential Decay. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c87]Mark Braverman, Dor Minzer:
Optimal Tiling of the Euclidean Space Using Permutation-Symmetric Bodies. CCC 2021: 5:1-5:48 - [c86]Mark Braverman, Gillat Kol, Shay Moran, Raghuvansh R. Saxena:
Near Optimal Distributed Learning of Halfspaces with Two Parties. COLT 2021: 724-758 - [c85]Mark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer:
An Invariance Principle for the Multi-slice, with Applications. FOCS 2021: 228-236 - [c84]Olivier Bousquet, Mark Braverman, Gillat Kol, Klim Efremenko, Shay Moran:
Statistically Near-Optimal Hypothesis Selection. FOCS 2021: 909-919 - [c83]Mark Braverman, Sumegha Garg, Or Zamir:
Tight Space Complexity of the Coin Problem. FOCS 2021: 1068-1079 - [c82]Mark Braverman, Subhash Khot, Dor Minzer:
On Rich 2-to-1 Games. ITCS 2021: 27:1-27:20 - [c81]Itai Ashlagi, Mark Braverman, Amin Saberi, Clayton Thomas, Geng Zhao:
Tiered Random Matching Markets: Rank Is Proportional to Popularity. ITCS 2021: 46:1-46:16 - [c80]Mark Braverman, Jon Schneider, S. Matthew Weinberg:
Prior-free Dynamic Mechanism Design With Limited Liability. EC 2021: 204-223 - [c79]Mark Braverman, Dor Minzer:
New separations results for external information. STOC 2021: 248-258 - [i86]Mark Braverman, Jon Schneider, S. Matthew Weinberg:
Prior-free Dynamic Mechanism Design With Limited Liability. CoRR abs/2103.01868 (2021) - [i85]Mark Braverman, Dor Minzer:
New Separations Results for External Information. CoRR abs/2103.04049 (2021) - [i84]Mark Braverman:
Optimization-friendly generic mechanisms without money. CoRR abs/2106.07752 (2021) - [i83]Olivier Bousquet, Mark Braverman, Klim Efremenko, Gillat Kol, Shay Moran:
Statistically Near-Optimal Hypothesis Selection. CoRR abs/2108.07880 (2021) - [i82]Mark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer:
An Invariance Principle for the Multi-slice, with Applications. CoRR abs/2110.10725 (2021) - [i81]Mark Braverman, Sumegha Garg, Or Zamir:
Tight Space Complexity of the Coin Problem. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j31]Itai Ashlagi, Mark Braverman, Yash Kanoria, Peng Shi:
Clearing Matching Markets Efficiently: Informative Signals and Match Recommendations. Manag. Sci. 66(5): 2163-2193 (2020) - [j30]Mark Braverman, Gil Cohen, Sumegha Garg:
Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs. SIAM J. Comput. 49(5) (2020) - [c78]Mark Braverman, Elad Hazan, Max Simchowitz, Blake E. Woodworth:
The Gradient Complexity of Linear Regression. COLT 2020: 627-647 - [c77]Mark Braverman, Sumegha Garg, David P. Woodruff:
The Coin Problem with Applications to Data Streams. FOCS 2020: 318-329 - [c76]Mark Braverman, Sumegha Garg:
The Role of Randomness and Noise in Strategic Classification. FORC 2020: 9:1-9:20 - [c75]Mark Braverman, Xinyi Chen, Sham M. Kakade, Karthik Narasimhan, Cyril Zhang, Yi Zhang:
Calibration, Entropy Rates, and Memory in Language Models. ICML 2020: 1089-1099 - [c74]Xiaoqi Chen, Shir Landau Feibish, Mark Braverman, Jennifer Rexford:
BeauCoup: Answering Many Network Traffic Queries, One Memory Update at a Time. SIGCOMM 2020: 226-239 - [i80]Mark Braverman, Sumegha Garg:
The Role of Randomness and Noise in Strategic Classification. CoRR abs/2005.08377 (2020) - [i79]Itai Ashlagi, Mark Braverman, Clayton Thomas, Geng Zhao:
Tiered Random Matching Markets: Rank is Proportional to Popularity. CoRR abs/2009.05124 (2020) - [i78]Mark Braverman, Dor Minzer:
Optimal tiling of the Euclidean space using symmetric bodies. CoRR abs/2011.04071 (2020) - [i77]Mark Braverman, Sumegha Garg, David P. Woodruff:
The Coin Problem with Applications to Data Streams. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j29]Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Reliable communication over highly connected noisy networks. Distributed Comput. 32(6): 505-515 (2019) - [j28]Mark Braverman, Brendan Juba:
The Price of Uncertain Priors in Source Coding. IEEE Trans. Inf. Theory 65(2): 1165-1171 (2019) - [c73]Mark Braverman, Klim Efremenko, Ran Gelles, Michael A. Yitayew:
Optimal Short-Circuit Resilient Formulas. CCC 2019: 10:1-10:22 - [c72]Mark Braverman, Jieming Mao, Yuval Peres:
Sorted Top-k in Rounds. COLT 2019: 342-382 - [c71]Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg:
Multi-armed Bandit Problems with Strategic Arms. COLT 2019: 383-416 - [c70]Mark Braverman, Gillat Kol, Rotem Oshman, Avishay Tal:
On the Computational Power of Radio Channels. DISC 2019: 8:1-8:17 - [i76]Mark Braverman, Cristobal Rojas, Jonathan Schneider:
Space-bounded Church-Turing thesis and computational tractability of closed systems. CoRR abs/1905.03610 (2019) - [i75]Mark Braverman, Jieming Mao, Yuval Peres:
Sorted Top-k in Rounds. CoRR abs/1906.05208 (2019) - [i74]Mark Braverman, Xinyi Chen, Sham M. Kakade, Karthik Narasimhan, Cyril Zhang, Yi Zhang:
Calibration, Entropy Rates, and Memory in Language Models. CoRR abs/1906.05664 (2019) - [i73]Mark Braverman, Gillat Kol, Shay Moran, Raghuvansh R. Saxena:
Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility. CoRR abs/1909.03547 (2019) - [i72]Mark Braverman, Elad Hazan, Max Simchowitz, Blake E. Woodworth:
The gradient complexity of linear regression. CoRR abs/1911.02212 (2019) - [i71]Mark Braverman, Subhash Khot, Dor Minzer:
On Rich $2$-to-$1$ Games. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j27]Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Constant-Rate Coding for Multiparty Interactive Communication Is Impossible. J. ACM 65(1): 4:1-4:41 (2018) - [j26]Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness. SIAM J. Comput. 47(6): 2277-2314 (2018) - [c69]Mark Braverman, Young Kun-Ko:
Semi-Direct Sum Theorem and Nearest Neighbor under l_infty. APPROX-RANDOM 2018: 6:1-6:17 - [c68]Mark Braverman, Anat Ganor, Gillat Kol, Ran Raz:
A Candidate for a Strong Separation of Information and Communication. ITCS 2018: 11:1-11:13 - [c67]Mark Braverman, Young Kun-Ko:
Information Value of Two-Prover Games. ITCS 2018: 12:1-12:15 - [c66]Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg:
Selling to a No-Regret Buyer. EC 2018: 523-538 - [c65]Mark Braverman, Jieming Mao, S. Matthew Weinberg:
On Simultaneous Two-player Combinatorial Auctions. SODA 2018: 2256-2273 - [c64]Mark Braverman, Gil Cohen, Sumegha Garg:
Hitting sets with near-optimal error for read-once branching programs. STOC 2018: 353-362 - [c63]Mark Braverman, Gillat Kol:
Interactive compression to external information. STOC 2018: 964-977 - [i70]Mark Braverman, Klim Efremenko, Ran Gelles, Michael A. Yitayew:
Optimal Short-Circuit Resilient Formulas. CoRR abs/1807.05014 (2018) - [i69]Mark Braverman, Brendan Juba:
The Price of Uncertain Priors in Source Coding. CoRR abs/1811.08976 (2018) - 2017
- [j25]Allan Borodin, Mark Braverman, Brendan Lucier, Joel Oren:
Strategyproof Mechanisms for Competitive Influence in Networks. Algorithmica 78(2): 425-452 (2017) - [j24]Mark Braverman, Klim Efremenko:
List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise. SIAM J. Comput. 46(1): 388-428 (2017) - [j23]Mark Braverman:
Interactive Information Complexity. SIAM Rev. 59(4): 803-846 (2017) - [j22]Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky:
Coding for Interactive Communication Correcting Insertions and Deletions. IEEE Trans. Inf. Theory 63(10): 6256-6270 (2017) - [j21]Maria-Florina Balcan, Mark Braverman:
Nash Equilibria in Perturbation-Stable Games. Theory Comput. 13(1): 1-31 (2017) - [c62]Mark Braverman, Rotem Oshman:
A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness. FOCS 2017: 144-155 - [c61]Mark Braverman, Sumegha Garg, Ariel Schvartzman:
Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All. ITCS 2017: 18:1-18:18 - [c60]Itai Ashlagi, Mark Braverman, Yash Kanoria, Peng Shi:
Communication Requirements and Informative Signaling in Matching Markets. EC 2017: 263 - [c59]Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein:
ETH Hardness for Densest-k-Subgraph with Perfect Completeness. SODA 2017: 1326-1341 - [i68]Mark Braverman, Jieming Mao, S. Matthew Weinberg:
On Simultaneous Two-player Combinatorial Auctions. CoRR abs/1704.03547 (2017) - [i67]Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg:
Multi-armed Bandit Problems with Strategic Arms. CoRR abs/1706.09060 (2017) - [i66]Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg:
Selling to a No-Regret Buyer. CoRR abs/1711.09176 (2017) - [i65]Mark Braverman, Gil Cohen, Sumegha Garg:
Hitting Sets with Near-Optimal Error for Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR17 (2017) - [i64]Mark Braverman, Young Kun-Ko:
Information Value of Two-Prover Games. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j20]Mark Braverman, David P. Woodruff:
Guest Editorial for Information Complexity and Applications. Algorithmica 76(3): 595-596 (2016) - [j19]Mark Braverman, Omri Weinstein:
A Discrepancy Lower Bound for Information Complexity. Algorithmica 76(3): 846-864 (2016) - [j18]Mark Braverman, Jing Chen, Sampath Kannan:
Optimal Provision-After-Wait in Healthcare. Math. Oper. Res. 41(1): 352-376 (2016) - [j17]Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein:
Information Lower Bounds via Self-Reducibility. Theory Comput. Syst. 59(2): 377-396 (2016) - [c58]Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky:
Coding for Interactive Communication Correcting Insertions and Deletions. ICALP 2016: 61:1-61:14 - [c57]Mark Braverman, Jon Schneider:
Information Complexity Is Computable. ICALP 2016: 87:1-87:10 - [c56]Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Reliable Communication over Highly Connected Noisy Networks. PODC 2016: 165-173 - [c55]Mark Braverman, Jieming Mao, S. Matthew Weinberg:
Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions. SODA 2016: 1444-1457 - [c54]Mark Braverman, Jieming Mao, S. Matthew Weinberg:
Parallel algorithms for select and partition with noisy comparisons. STOC 2016: 851-862 - [c53]Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Constant-rate coding for multiparty interactive communication is impossible. STOC 2016: 999-1010 - [c52]Mark Braverman, Ankit Garg, Tengyu Ma, Huy L. Nguyen, David P. Woodruff:
Communication lower bounds for statistical estimation problems via a distributed data processing inequality. STOC 2016: 1011-1020 - [i63]Mark Braverman, Jieming Mao, S. Matthew Weinberg:
Parallel Algorithms for Select and Partition with Noisy Comparisons. CoRR abs/1603.04941 (2016) - [i62]Mark Braverman, Sumegha Garg, Ariel Schvartzman:
Network coding in undirected graphs is either very helpful or not helpful at all. CoRR abs/1608.06545 (2016) - [i61]Mark Braverman, Ran Gelles, Michael A. Yitayew:
Optimal Resilience for Short-Circuit Noise in Formulas. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j16]Mark Braverman:
Interactive Information Complexity. SIAM J. Comput. 44(6): 1698-1739 (2015) - [c51]Mark Braverman, Brendan Juba:
The price of uncertainty in communication. Allerton 2015: 924-927 - [c50]Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness. FOCS 2015: 773-791 - [c49]Mark Braverman, Jieming Mao:
Simulating Noisy Channel Interaction. ITCS 2015: 21-30 - [c48]Mark Braverman, Rotem Oshman:
On Information Complexity in the Broadcast Model. PODC 2015: 355-364 - [c47]Mark Braverman, Young Kun-Ko, Omri Weinstein:
Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis. SODA 2015: 970-982 - [c46]Mark Braverman, Ankit Garg:
Small Value Parallel Repetition for General Games. STOC 2015: 335-340 - [c45]Mark Braverman, Omri Weinstein:
An Interactive Information Odometer and Applications. STOC 2015: 341-350 - [i60]Mark Braverman, Jon Schneider:
Information complexity is computable. CoRR abs/1502.02971 (2015) - [i59]Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein:
ETH Hardness for Densest-$k$-Subgraph with Perfect Completeness. CoRR abs/1504.08352 (2015) - [i58]Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-optimal bounds on bounded-round quantum communication complexity of disjointness. CoRR abs/1505.03110 (2015) - [i57]Mark Braverman, Ankit Garg, Tengyu Ma, Huy L. Nguyen, David P. Woodruff:
Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality. CoRR abs/1506.07216 (2015) - [i56]Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky:
Coding for interactive communication correcting insertions and deletions. CoRR abs/1508.00514 (2015) - [i55]Mark Braverman, Cristobal Rojas, Jon Schneider:
Tight space-noise tradeoffs in computing the ergodic measure. CoRR abs/1508.05372 (2015) - [i54]Mark Braverman, Jieming Mao, S. Matthew Weinberg:
Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions. CoRR abs/1511.02831 (2015) - [i53]Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Reliable Communication over Highly Connected Noisy Networks. Electron. Colloquium Comput. Complex. TR15 (2015) - [i52]Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Constant-rate coding for multiparty interactive communication is impossible. Electron. Colloquium Comput. Complex. TR15 (2015) - [i51]Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-optimal bounds on bounded-round quantum communication complexity of disjointness. Electron. Colloquium Comput. Complex. TR15 (2015) - [i50]Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein:
ETH Hardness for Densest-k-Subgraph with Perfect Completeness. Electron. Colloquium Comput. Complex. TR15 (2015) - [i49]Mark Braverman, Rotem Oshman:
The Communication Complexity of Number-In-Hand Set Disjointness with No Promise. Electron. Colloquium Comput. Complex. TR15 (2015) - [i48]Mark Braverman, Jon Schneider:
Information complexity is computable. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j15]Itai Ashlagi, Mark Braverman, Avinatan Hassidim:
Stability in Large Matching Markets with Complementarities. Oper. Res. 62(4): 713-732 (2014) - [j14]Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff:
Pseudorandom Generators for Regular Branching Programs. SIAM J. Comput. 43(3): 973-986 (2014) - [j13]Mark Braverman, Anup Rao:
Information Equals Amortized Communication. IEEE Trans. Inf. Theory 60(10): 6058-6069 (2014) - [j12]Mark Braverman, Anup Rao:
Toward Coding for Maximum Errors in Interactive Communication. IEEE Trans. Inf. Theory 60(11): 7248-7255 (2014) - [c44]Mark Braverman, Klim Efremenko:
List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise. FOCS 2014: 236-245 - [c43]Mark Braverman, Ankit Garg:
Public vs Private Coin in Bounded-Round Information. ICALP (1) 2014: 502-513 - [c42]Mark Braverman, Kanika Pasricha:
The computational hardness of pricing compound options. ITCS 2014: 103-104 - [c41]Mark Braverman, Jing Chen, Sampath Kannan:
Optimal provision-after-wait in healthcare. ITCS 2014: 541-542 - [i47]Mark Braverman, Gal Oshri:
Contracting Experts With Unknown Cost Structures. CoRR abs/1404.7239 (2014) - [i46]Mark Braverman, Jieming Mao:
Simulating Noisy Channel Interaction. CoRR abs/1409.4290 (2014) - [i45]Mark Braverman, Klim Efremenko:
List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise. Electron. Colloquium Comput. Complex. TR14 (2014) - [i44]Mark Braverman, Ankit Garg:
Small value parallel repetition for general games. Electron. Colloquium Comput. Complex. TR14 (2014) - [i43]Mark Braverman, Young Kun-Ko, Omri Weinstein:
Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis. Electron. Colloquium Comput. Complex. TR14 (2014) - [i42]Mark Braverman, Jieming Mao:
Simulating Noisy Channel Interaction. Electron. Colloquium Comput. Complex. TR14 (2014) - [i41]Mark Braverman, Kanika Pasricha:
The computational hardness of pricing compound options. Electron. Colloquium Comput. Complex. TR14 (2014) - [i40]Mark Braverman, Omri Weinstein:
An Interactive Information Odometer with Applications. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j11]Mark Braverman:
Computing with real numbers, from Archimedes to Turing and beyond. Commun. ACM 56(9): 74-83 (2013) - [j10]Boaz Barak, Mark Braverman, Xi Chen, Anup Rao:
How to Compress Interactive Communication. SIAM J. Comput. 42(3): 1327-1363 (2013) - [j9]Maria-Florina Balcan, Mark Braverman, Daniel A. Spielman:
Special Section on the Fiftieth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009). SIAM J. Comput. 42(6): 2286 (2013) - [j8]Per Austrin, Mark Braverman, Eden Chlamtac:
Inapproximability of NP-Complete Variants of Nash Equilibrium. Theory Comput. 9: 117-142 (2013) - [c40]Mark Braverman:
A hard-to-compress interactive task? Allerton 2013: 8-12 - [c39]Mark Braverman:
Noise versus Computational Intractability in Dynamics. CiE 2013: 32 - [c38]Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein:
Information Lower Bounds via Self-reducibility. CSR 2013: 183-194 - [c37]Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan:
A Tight Bound for Set Disjointness in the Message-Passing Model. FOCS 2013: 668-677 - [c36]Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff:
Direct Products in Communication Complexity. FOCS 2013: 746-755 - [c35]Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff:
Direct Product via Round-Preserving Compression. ICALP (1) 2013: 232-243 - [c34]Arnab Bhattacharyya, Mark Braverman, Bernard Chazelle, Huy L. Nguyen:
On the convergence of the Hegselmann-Krause system. ITCS 2013: 61-66 - [c33]Maria-Florina Balcan, Christian Borgs, Mark Braverman, Jennifer T. Chayes, Shang-Hua Teng:
Finding Endogenously Formed Communities. SODA 2013: 767-783 - [c32]Mark Braverman, Gal Oshri:
Search using queries on indistinguishable items. STACS 2013: 610-621 - [c31]Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein:
From information to exact communication. STOC 2013: 151-160 - [c30]Mark Braverman, Ankur Moitra:
An information complexity approach to extended formulations. STOC 2013: 161-170 - [c29]Allan Borodin, Mark Braverman, Brendan Lucier, Joel Oren:
Strategyproof mechanisms for competitive influence in networks. WWW 2013: 141-150 - [i39]Mark Braverman, Gal Oshri:
Search using queries on indistinguishable items. CoRR abs/1302.0892 (2013) - [i38]Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan:
Tight Bounds for Set Disjointness in the Message Passing Model. CoRR abs/1305.4696 (2013) - [i37]Mark Braverman, Jing Chen, Sampath Kannan:
Optimal Provision-After-Wait in Healthcare. CoRR abs/1312.1955 (2013) - [i36]Mark Braverman, Ankit Garg:
Public vs private coin in bounded-round information. Electron. Colloquium Comput. Complex. TR13 (2013) - [i35]Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff:
Direct product via round-preserving compression. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j7]Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam:
Pebbles and Branching Programs for Tree Evaluation. ACM Trans. Comput. Theory 3(2): 4:1-4:43 (2012) - [c28]Mark Braverman:
Coding for interactive computation: Progress and challenges. Allerton Conference 2012: 1914-1921 - [c27]Mark Braverman, Omri Weinstein:
A Discrepancy Lower Bound for Information Complexity. APPROX-RANDOM 2012: 459-470 - [c26]Mark Braverman, Alexander Grigo, Cristobal Rojas:
Noise vs computational intractability in dynamics. ITCS 2012: 128-141 - [c25]Mark Braverman:
Towards deterministic tree code constructions. ITCS 2012: 161-167 - [c24]Mark Braverman:
Interactive information complexity. STOC 2012: 505-524 - [i34]Mark Braverman, Alexander Grigo, Cristobal Rojas:
Noise vs computational intractability in dynamics. CoRR abs/1201.0488 (2012) - [i33]Maria-Florina Balcan, Christian Borgs, Mark Braverman, Jennifer T. Chayes, Shang-Hua Teng:
I Like Her more than You: Self-determined Communities. CoRR abs/1201.4899 (2012) - [i32]Allan Borodin, Mark Braverman, Brendan Lucier, Joel Oren:
Truthful Mechanisms for Competing Submodular Processes. CoRR abs/1202.2097 (2012) - [i31]Arnab Bhattacharyya, Mark Braverman, Bernard Chazelle, Huy L. Nguyen:
On the Convergence of the Hegselmann-Krause System. CoRR abs/1211.1909 (2012) - [i30]Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein:
From Information to Exact Communication. Electron. Colloquium Comput. Complex. TR12 (2012) - [i29]Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein:
Information lower bounds via self-reducibility. Electron. Colloquium Comput. Complex. TR12 (2012) - [i28]Mark Braverman, Ankur Moitra:
An Information Complexity Approach to Extended Formulations. Electron. Colloquium Comput. Complex. TR12 (2012) - [i27]Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff:
Direct Products in Communication Complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j6]Mark Braverman:
Poly-logarithmic independence fools bounded-depth boolean circuits. Commun. ACM 54(4): 108-115 (2011) - [c23]Per Austrin, Mark Braverman, Eden Chlamtac:
Inapproximability of NP-Complete Variants of Nash Equilibrium. APPROX-RANDOM 2011: 13-25 - [c22]Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor:
The Grothendieck Constant is Strictly Smaller than Krivine's Bound. FOCS 2011: 453-462 - [c21]Mark Braverman, Anup Rao:
Information Equals Amortized Communication. FOCS 2011: 748-757 - [c20]Mark Braverman, Avinatan Hassidim, Yael Tauman Kalai:
Leaky Pseudo-Entropy Functions. ICS 2011: 353-366 - [c19]Itai Ashlagi, Mark Braverman, Avinatan Hassidim:
Matching with couples revisited. EC 2011: 335-336 - [c18]Mark Braverman, Anup Rao:
Towards coding for maximum errors in interactive communication. STOC 2011: 159-166 - [i26]Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor:
The Grothendieck constant is strictly smaller than Krivine's bound. CoRR abs/1103.6161 (2011) - [i25]Per Austrin, Mark Braverman, Eden Chlamtac:
Inapproximability of NP-Complete Variants of Nash Equilibrium. CoRR abs/1104.3760 (2011) - [i24]Mark Braverman, Anup Rao:
Information Equals Amortized Communication. CoRR abs/1106.3595 (2011) - [i23]Mark Braverman, Omri Weinstein:
A discrepancy lower bound for information complexity. CoRR abs/1112.2000 (2011) - [i22]Mark Braverman:
Towards deterministic tree code constructions. Electron. Colloquium Comput. Complex. TR11 (2011) - [i21]Mark Braverman:
Interactive information complexity. Electron. Colloquium Comput. Complex. TR11 (2011) - [i20]Mark Braverman, Omri Weinstein:
A discrepancy lower bound for information complexity. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j5]Mark Braverman:
Polylogarithmic independence fools AC0 circuits. J. ACM 57(5): 28:1-28:10 (2010) - [c17]Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff:
Pseudorandom Generators for Regular Branching Programs. FOCS 2010: 40-47 - [c16]Boaz Barak, Mark Braverman, Xi Chen, Anup Rao:
How to compress interactive communication. STOC 2010: 67-76 - [i19]Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam:
Pebbles and Branching Programs for Tree Evaluation. CoRR abs/1005.2642 (2010) - [i18]Maria-Florina Balcan, Mark Braverman:
Approximate Nash Equilibria under Stability Conditions. CoRR abs/1008.1827 (2010) - [i17]Itai Ashlagi, Mark Braverman, Avinatan Hassidim:
Matching with Couples Revisited. CoRR abs/1011.2121 (2010) - [i16]Mark Braverman, Anup Rao:
Efficient Communication Using Partial Information. Electron. Colloquium Comput. Complex. TR10 (2010) - [i15]Mark Braverman, Anup Rao:
Towards Coding for Maximum Errors in Interactive Communication. Electron. Colloquium Comput. Complex. TR10 (2010) - [i14]Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff:
Pseudorandom Generators for Regular Branching Programs. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [b2]Mark Braverman, Michael Yampolsky:
Computability of Julia Sets. Algorithms and computation in mathematics 23, Springer 2009, ISBN 978-3-540-68546-3, pp. I-XIII, 1-151 - [j4]Mark Braverman, Raghav Kulkarni, Sambuddha Roy:
Space-Efficient Counting in Graphs on Surfaces. Comput. Complex. 18(4): 601-649 (2009) - [c15]Mark Braverman:
Computability and Complexity of Julia Sets (Invited Talk). CCA 2009 - [c14]Mark Braverman:
Poly-logarithmic Independence Fools AC0 Circuits. CCC 2009: 3-8 - [c13]Maria-Florina Balcan, Mark Braverman:
Finding Low Error Clusterings. COLT 2009 - [c12]Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr:
Fractional Pebbling and Thrifty Branching Programs. FSTTCS 2009: 109-120 - [c11]Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr:
Branching Programs for Tree Evaluation. MFCS 2009: 175-186 - [c10]Ilia Binder, Mark Braverman:
The complexity of simulating Brownian Motion. SODA 2009: 58-67 - [i13]Mark Braverman, Elchanan Mossel:
Sorting from Noisy Information. CoRR abs/0910.1191 (2009) - [i12]Boaz Barak, Mark Braverman, Xi Chen, Anup Rao:
Direct Sums in Randomized Communication Complexity. Electron. Colloquium Comput. Complex. TR09 (2009) - [i11]Mark Braverman:
Poly-logarithmic independence fools AC0 circuits. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [b1]Mark Braverman:
Computability and complexity of Julia sets. University of Toronto, Canada, 2008 - [j3]Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi:
The complexity of properly learning simple concept classes. J. Comput. Syst. Sci. 74(1): 16-34 (2008) - [c9]Mark Braverman:
On ad hoc routing with guaranteed delivery. PODC 2008: 418 - [c8]Mark Braverman, Elchanan Mossel:
Noisy sorting without resampling. SODA 2008: 268-276 - [i10]Mark Braverman:
On ad hoc routing with guaranteed delivery. CoRR abs/0804.0862 (2008) - 2007
- [j2]Ilia Binder, Mark Braverman, Michael Yampolsky:
Filled Julia Sets with Empty Interior Are Computable. Found. Comput. Math. 7(4): 405-416 (2007) - [c7]Ilia Binder, Mark Braverman:
Derandomization of Euclidean Random Walks. APPROX-RANDOM 2007: 353-365 - [c6]Mark Braverman, Raghav Kulkarni, Sambuddha Roy:
Parity Problems in Planar Graphs. CCC 2007: 222-235 - [c5]Mark Braverman, Michael Yampolsky:
Constructing non-computable Julia sets. STOC 2007: 709-716 - [i9]Mark Braverman, Elchanan Mossel:
Noisy Sorting Without Resampling. CoRR abs/0707.1051 (2007) - [i8]Mark Braverman, Raghav Kulkarni, Sambuddha Roy:
Parity Problems in Planar Graphs. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c4]Mark Braverman:
Termination of Integer Linear Programs. CAV 2006: 372-385 - [i7]Mark Braverman, Michael Yampolsky:
Constructing Non-Computable Julia Sets. CoRR abs/math/0604371 (2006) - 2005
- [c3]Mark Braverman:
On the Complexity of Real Functions. FOCS 2005: 155-164 - [i6]Mark Braverman:
On the Complexity of Real Functions. CoRR abs/cs/0502066 (2005) - [i5]Mark Braverman, Stephen A. Cook:
Computing over the Reals: Foundations for Scientific Computing. CoRR abs/cs/0509042 (2005) - [i4]Ilia Binder, Mark Braverman, Michael Yampolsky:
On computational complexity of Siegel Julia sets. CoRR abs/math/0502354 (2005) - [i3]Ilia Binder, Mark Braverman, Michael Yampolsky:
On computational complexity of Riemann mapping. CoRR abs/math/0505617 (2005) - 2004
- [c2]Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi:
Learnability and Automatizability. FOCS 2004: 621-630 - [c1]Mark Braverman:
Hyperbolic Julia Sets are Poly-Time Computable. CCA 2004: 17-30 - [i2]Mark Braverman, Michael Yampolsky:
Non-computable Julia sets. CoRR math.DS/0406416 (2004) - [i1]Ilia Binder, Mark Braverman, Michael Yampolsky:
Filled Julia sets with empty interior are computable. CoRR math.DS/0410580 (2004) - 2001
- [j1]Mark Braverman, Shay Gueron:
A Monte Carlo Algorithm for a Lottery Problem. Monte Carlo Methods Appl. 7(1-2): 73-80 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 20:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
