Mark Braverman

4.0k total citations
113 papers, 1.6k citations indexed

About

Mark Braverman is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Mark Braverman has authored 113 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 74 papers in Computational Theory and Mathematics, 45 papers in Artificial Intelligence and 29 papers in Computer Networks and Communications. Recurrent topics in Mark Braverman's work include Complexity and Algorithms in Graphs (51 papers), Computability, Logic, AI Algorithms (34 papers) and Cryptography and Data Security (23 papers). Mark Braverman is often cited by papers focused on Complexity and Algorithms in Graphs (51 papers), Computability, Logic, AI Algorithms (34 papers) and Cryptography and Data Security (23 papers). Mark Braverman collaborates with scholars based in United States, Canada and Israel. Mark Braverman's co-authors include Anup Rao, Michael Yampolsky, Itai Ashlagi, Avinatan Hassidim, Elchanan Mossel, Omri Weinstein, Boaz Barak, Ankur Moitra, Stephen Cook and Mikhail Shubin and has published in prestigious journals such as Physical Review Letters, SHILAP Revista de lepidopterología and PLoS ONE.

In The Last Decade

Mark Braverman

108 papers receiving 1.4k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Mark Braverman United States	25	772	636	312	262	229	113	1.6k
Gil Kalai Israel	30	1.3k 1.7×	515 0.8×	248 0.8×	167 0.6×	273 1.2×	77	2.6k
Artur Czumaj Germany	20	511 0.7×	415 0.7×	595 1.9×	308 1.2×	187 0.8×	121	1.4k
Michael Krivelevich Israel	29	2.2k 2.8×	571 0.9×	501 1.6×	122 0.5×	62 0.3×	203	3.0k
David Gamarnik United States	23	421 0.5×	280 0.4×	496 1.6×	176 0.7×	72 0.3×	104	1.5k
Boris Pittel United States	27	669 0.9×	604 0.9×	470 1.5×	248 0.9×	216 0.9×	119	2.7k
Subhash Khot United States	26	2.3k 3.0×	924 1.5×	897 2.9×	106 0.4×	104 0.5×	116	2.9k
Milena Mihail United States	21	370 0.5×	242 0.4×	1.0k 3.3×	116 0.4×	63 0.3×	36	1.7k
Shayan Oveis Gharan United States	14	232 0.3×	142 0.2×	234 0.8×	149 0.6×	52 0.2×	34	715
Peter Bro Miltersen Denmark	18	628 0.8×	712 1.1×	252 0.8×	164 0.6×	106 0.5×	78	1.1k
Pinyan Lu China	17	371 0.5×	174 0.3×	97 0.3×	258 1.0×	127 0.6×	78	835

Countries citing papers authored by Mark Braverman

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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 of co-authors of Mark Braverman

This figure shows the co-authorship network connecting the top 25 collaborators of Mark Braverman. A scholar is included among the top collaborators of Mark Braverman based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Mark Braverman. Mark Braverman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Ashlagi, Itai, et al.. (2023). Welfare Distribution in Two-sided Random Matching Markets. 122–122. 1 indexed citations

Braverman, Mark & Dor Minzer. (2021). Optimal Tiling of the Euclidean Space Using Permutation-Symmetric Bodies. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).

Braverman, Mark, et al.. (2020). The Role of Randomness and Noise in Strategic Classification. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Braverman, Mark, Elad Hazan, Max Simchowitz, & Blake Woodworth. (2020). The Gradient Complexity of Linear Regression. Conference on Learning Theory. 627–647. 2 indexed citations

Ashlagi, Itai, Mark Braverman, Yash Kanoria, & Peng Shi. (2019). Clearing Matching Markets Efficiently: Informative Signals and Match Recommendations. Management Science. 66(5). 2163–2193. 25 indexed citations

Braverman, Mark & Brendan Juba. (2018). The Price of Uncertain Priors in Source Coding. IEEE Transactions on Information Theory. 65(2). 1165–1171. 1 indexed citations

Braverman, Mark, et al.. (2017). . Theory of Computing. 13(1). 1–31. 3 indexed citations

Braverman, Mark & Rotem Oshman. (2015). The Communication Complexity of Number-In-Hand Set Disjointness with No Promise.. Electronic colloquium on computational complexity. 22. 2.

Braverman, Mark, et al.. (2015). Approximating the best nash equilibrium in no(log n)-time breaks the exponential time hypothesis. Symposium on Discrete Algorithms. 970–982. 13 indexed citations

10.

Austrin, Per, Mark Braverman, & Eden Chlamtáč. (2013). . Theory of Computing. 9(1). 117–142. 10 indexed citations

11.

Braverman, Mark. (2013). A hard-to-compress interactive task?. 8–12. 8 indexed citations

12.

Borodin, Allan, Mark Braverman, Brendan Lucier, & Joel Oren. (2013). Strategyproof mechanisms for competitive influence in networks. 141–150. 11 indexed citations

13.

Braverman, Mark, Anup Rao, Omri Weinstein, & Amir Yehudayoff. (2013). Direct product via round-preserving compression.. Electronic colloquium on computational complexity. 20. 35. 3 indexed citations

14.

Braverman, Mark, et al.. (2012). Information lower bounds via self-reducibility.. Electronic colloquium on computational complexity. 19. 177. 1 indexed citations

15.

Braverman, Mark & Ankur Moitra. (2012). An Information Complexity Approach to Extended Formulations.. Electronic colloquium on computational complexity. 19. 131. 2 indexed citations

16.

Braverman, Mark, Anup Rao, Omri Weinstein, & Amir Yehudayoff. (2012). Direct Products in Communication Complexity.. Electronic colloquium on computational complexity. 19. 143. 5 indexed citations

17.

Braverman, Mark. (2011). Towards deterministic tree code constructions.. Electronic colloquium on computational complexity. 18. 64. 1 indexed citations

18.

Braverman, Mark & Anup Rao. (2010). Efficient Communication Using Partial Information.. Electronic colloquium on computational complexity. 17(2). 83–415. 2 indexed citations

19.

Braverman, Mark, et al.. (2009). The complexity of simulating Brownian Motion. Symposium on Discrete Algorithms. 58–67. 2 indexed citations

20.

Braverman, Mark. (2004). Computational Complexity of Euclidean Sets: Hyperbolic Julia Sets are Poly-Time Computable. Molecular Therapy — Nucleic Acids. 26. 49–62. 15 indexed citations

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.

Explore authors with similar magnitude of impact