Mark Braverman
Impact in
- Computational Theory and Mathematics top 0.2%
- Complexity and Algorithms in Graphs
- Computability, Logic, AI Algorithms
- Artificial Intelligence top 1%
- Cryptography and Data Security
- Coding theory and cryptography
- Quantum Information and Cryptography
- Algorithms and Data Compression
Papers in
-
- Complexity and Algorithms in Graphs 74
- Computability, Logic, AI Algorithms 17
-
- Cryptography and Data Security 13
- Coding theory and cryptography 10
- Algorithms and Data Compression 9
- Co-authors
- Anup Rao (13 shared papers)Michael Yampolsky (9 shared papers)Omri Weinstein (13 shared papers)Ankit Garg (7 shared papers)Itai Ashlagi (6 shared papers)Avinatan Hassidim (5 shared papers)Boaz Barak (3 shared papers)Klim Efremenko (4 shared papers)
- Journals
- SIAM Journal on Computing (6 papers)IEEE Transactions on Information Theory (4 papers)Moscow Mathematical Journal (2 papers)Theory of Computing (2 papers)Journal of the ACM (2 papers)
- Partner nations
- United StatesCanadaIsrael
In The Last Decade
Mark Braverman
121 papers receiving 2.4k citations
Peers
Comparison fields: 5 of 83
- Computational Theory and Mathematics 1.2k
- Artificial Intelligence 859
- Mathematical Physics 221
- Computer Networks and Communications 347
- Management Science and Operations Research 223
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 128 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2010 | 94 | |
| 2 | 2014 | 89 | |
| 3 | 2011 | 82 | |
| 4 | 2006 | 76 | |
| 5 | 2016 | 76 | |
| 6 | 2002 | 72 | |
| 7 | 2005 | 68 | |
| 8 | 2012 | 67 | |
| 9 | 2020 | 62 | |
| 10 | 2011 | 60 | |
| 11 | 2013 | 60 | |
| 12 | 2013 | 59 | |
| 13 | 2014 | 56 | |
| 14 | 2008 | 55 | |
| 15 | 2013 | 52 | |
| 16 | 2010 | 49 | |
| 17 | 2013 | 42 | |
| 18 | 2013 | 42 | |
| 19 | 2012 | 40 | |
| 20 | 2013 | 40 |
About Mark Braverman
Mark Braverman is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Mathematical Physics, Management Science and Operations Research and Computer Networks and Communications, having authored 128 papers that have together received 2.5k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (74 papers), Computability, Logic, AI Algorithms (17 papers), Cryptography and Data Security (13 papers), Game Theory and Applications (11 papers), Mathematical Dynamics and Fractals (10 papers), Game Theory and Voting Systems (10 papers), Coding theory and cryptography (10 papers) and Algorithms and Data Compression (9 papers). The work is most often cited by research in Computational Theory and Mathematics (1.2k citations), Artificial Intelligence (859 citations), Mathematical Physics (221 citations), Computer Networks and Communications (347 citations) and Management Science and Operations Research (223 citations). Mark Braverman has collaborated with scholars based in United States, Canada and Israel. Frequent co-authors include Anup Rao, Michael Yampolsky, Omri Weinstein, Ankit Garg, Itai Ashlagi, Avinatan Hassidim, Boaz Barak, Klim Efremenko, Amir Yehudayoff and Huy Lê Nguyễn. Their work appears in journals such as SIAM Journal on Computing, IEEE Transactions on Information Theory, Moscow Mathematical Journal, 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.