Mark Braverman
Impact in
- Computational Theory and Mathematics top 0.5%
- Complexity and Algorithms in Graphs
- Computability, Logic, AI Algorithms
- Cellular Automata and Applications
-
- Auction Theory and Applications
Papers in
-
- Complexity and Algorithms in Graphs 52
- Computability, Logic, AI Algorithms 34
- Cellular Automata and Applications 14
- Advanced Graph Theory Research 13
-
- Cryptography and Data Security 23
- Co-authors
- Anup Rao (12 shared papers)Michael Yampolsky (9 shared papers)Itai Ashlagi (7 shared papers)Avinatan Hassidim (3 shared papers)Elchanan Mossel (2 shared papers)Omri Weinstein (14 shared papers)Boaz Barak (3 shared papers)Ankur Moitra (2 shared papers)
- Journals
- SIAM Journal on Computing (4 papers)IEEE Transactions on Information Theory (3 papers)Algorithmica (2 papers)Theory of Computing (2 papers)Journal of the ACM (2 papers)
- Partner nations
- United StatesCanadaIsrael
In The Last Decade
Mark Braverman
109 papers receiving 1.5k citations
Peers
Comparison fields: 5 of 107
- Computational Theory and Mathematics 787
- Management Science and Operations Research 263
- Artificial Intelligence 635
- Mathematical Physics 173
- Computer Networks and Communications 315
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-authors
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
Showing the 20 most-cited of 117 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2014 | 91 | |
| 2 | 2010 | 67 | |
| 3 | 2014 | 64 | |
| 4 | 2007 | 63 | |
| 5 | 2020 | 57 | |
| 6 | 2002 | 55 | |
| 7 | 2012 | 51 | |
| 8 | 2010 | 51 | |
| 9 | 2005 | 47 | |
| 10 | 2013 | 41 | |
| 11 | 2008 | 39 | |
| 12 | 2010 | 36 | |
| 13 | 2013 | 36 | |
| 14 | Computing over the Reals: Foundations for Scientific Computing | 2005 | 31 |
| 15 | 2012 | 30 | |
| 16 | 2013 | 30 | |
| 17 | 2004 | 29 | |
| 18 | 2013 | 28 | |
| 19 | 2009 | 28 | |
| 20 | 2013 | 28 |
About Mark Braverman
Mark Braverman is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Management Science and Operations Research and Economics and Econometrics, having authored 117 papers that have together received 1.6k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (52 papers), Computability, Logic, AI Algorithms (34 papers), Cryptography and Data Security (23 papers), Cellular Automata and Applications (14 papers), Auction Theory and Applications (14 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 (787 citations), Management Science and Operations Research (263 citations), Artificial Intelligence (635 citations), Mathematical Physics (173 citations) and Computer Networks and Communications (315 citations). Mark Braverman has collaborated with scholars based in United States, Canada and Israel. Frequent co-authors include Anup Rao, Michael Yampolsky, Itai Ashlagi, Avinatan Hassidim, 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 Journal 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.