Mark Braverman
- Computational Theory and Mathematics top 0.5%
- Complexity and Algorithms in Graphs 51
- Computability, Logic, AI Algorithms 34
- Cellular Automata and Applications 13
- Advanced Graph Theory Research 13
-
- Auction Theory and Applications 14
- Artificial Intelligence top 2%
- Cryptography and Data Security 23
- Mathematical Physics top 5%
-
- Optimization and Search Problems 13
-
- Game Theory and Voting Systems 13
- Co-authors
- Anup RaoMichael YampolskyAvinatan HassidimItai AshlagiElchanan MosselOmri WeinsteinBoaz BarakAnkur Moitra
- Cited by
- Computational Theory and MathematicsManagement Science and Operations ResearchArtificial Intelligence
- Journals
- SIAM Journal on Computing (4 papers)IEEE Transactions on Information Theory (3 papers)Algorithmica (2 papers)
- Partner nations
- United StatesCanadaIsrael
In The Last Decade
Mark Braverman
108 papers receiving 1.4k citations
Peers
Comparison fields: 5 of 109
- Computational Theory and Mathematics 772
- Management Science and Operations Research 262
- Artificial Intelligence 636
- Mathematical Physics 164
- Computer Networks and Communications 312
Countries citing papers authored by Mark Braverman
This map shows the geographic impact of Mark Braverman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Mark Braverman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mark Braverman more than expected).
Fields of papers citing papers by Mark Braverman
This network shows the impact of papers produced by Mark Braverman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Mark Braverman. The network helps show where Mark Braverman may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Mark Braverman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2021 | 0 | |
| 2 | 2020 | 1 | |
| 3 | The Gradient Complexity of Linear Regression | 2020 | 2 |
| 4 | 2018 | 1 | |
| 5 | 2016 | 4 | |
| 6 | 2015 | 13 | |
| 7 | An Interactive Information Odometer with Applications. | 2014 | 7 |
| 8 | Public vs private coin in bounded-round information. | 2013 | 0 |
| 9 | Direct product via round-preserving compression. | 2013 | 3 |
| 10 | Direct Products in Communication Complexity. | 2012 | 5 |
| 11 | From Information to Exact Communication. | 2012 | 1 |
| 12 | I Like Her more than You: Self-determined Communities | 2012 | 6 |
| 13 | An Information Complexity Approach to Extended Formulations. | 2012 | 2 |
| 14 | Information lower bounds via self-reducibility. | 2012 | 1 |
| 15 | Leaky Pseudo-Entropy Functions | 2011 | 3 |
| 16 | Towards deterministic tree code constructions. | 2011 | 1 |
| 17 | 2010 | 2 | |
| 18 | Direct Sums in Randomized Communication Complexity | 2009 | 2 |
| 19 | Parity Problems in Planar Graphs. | 2007 | 2 |
| 20 | Computing over the Reals: Foundations for Scientific Computing | 2005 | 31 |
About Mark Braverman
Mark Braverman is a scholar working on Computational Theory and Mathematics, Management Science and Operations Research, Artificial Intelligence, Computer Networks and Communications and Discrete Mathematics and Combinatorics, having authored 113 papers that have together received 1.6k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (51 papers), Computability, Logic, AI Algorithms (34 papers), Cryptography and Data Security (23 papers), Auction Theory and Applications (14 papers), Cellular Automata and Applications (13 papers), Optimization and Search Problems (13 papers), Game Theory and Voting Systems (13 papers) and Advanced Graph Theory Research (13 papers). The work is most often cited by research in Computational Theory and Mathematics (772 citations), Management Science and Operations Research (262 citations), Artificial Intelligence (636 citations), Mathematical Physics (164 citations) and Computer Networks and Communications (312 citations). Mark Braverman has collaborated with scholars based in United States, Canada and Israel. Frequent co-authors include Anup Rao, Michael Yampolsky, Avinatan Hassidim, Itai Ashlagi, Elchanan Mossel, Omri Weinstein, Boaz Barak, Ankur Moitra, Stephen Cook and Mikhail Shubin. Their work appears in journals such as SIAM Journal on Computing, IEEE Transactions on Information Theory, Algorithmica, Theory of Computing and Communications of the ACM.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.