World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
42
Citations
6671
World Ranking
8467
National Ranking
3619

Mathematics

D-Index
38
Citations
5357
World Ranking
2375
National Ranking
998

Research.com Recognitions

  • 2019 - National Science Foundation Alan T. Waterman Award Computer Science
  • 2011 - Fellow of Alfred P. Sloan Foundation

Overview

Mark Braverman is affiliated with Princeton University in the United States and has a research focus within the field of Computer Science, with a total of 49 publications. Their work spans several subfields including Computational Theory and Mathematics, Artificial Intelligence, Management Science and Operations Research, Economics and Econometrics, and Computer Networks and Communications.

The primary topics covered in Mark Braverman's work include:

  • Complexity and Algorithms in Graphs
  • Game Theory and Voting Systems
  • Auction Theory and Applications
  • Advanced Graph Theory Research
  • Machine Learning and Algorithms
  • Optimization and Search Problems
  • Advanced Bandit Algorithms Research

Mark Braverman has published frequently in venues such as:

  • arXiv (Cornell University) with 22 publications
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl) with 4 publications
  • SIAM Journal on Computing with 2 publications
  • Proceedings of the 23rd ACM Conference on Economics and Computation with 1 publication
  • Journal of Public Economics with 1 publication

Notable recent papers include:

  • "Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark," 2022, Proceedings of the 23rd ACM Conference on Economics and Computation
  • "The Role of Randomness and Noise in Strategic Classification," 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs," 2020, SIAM Journal on Computing
  • "The Role of Randomness and Noise in Strategic Classification," 2020, arXiv (Cornell University)
  • "Data-driven incentive alignment in capitation schemes," 2022, Journal of Public Economics

Frequent collaborators in their research include Dor Minzer, Subhash Khot, Mahsa Derakhshan, Sumegha Garg, and Amin Saberi. The collaboration with these co-authors ranges from three to twelve joint publications, indicating ongoing partnerships in their research efforts.

Mark Braverman has received awards such as the National Science Foundation Alan T. Waterman Award in 2019 for work categorized under Computer Science, and was named a Fellow of the Alfred P. Sloan Foundation in 2011.

Best Publications

  • Secured Electronic Transaction System

    Philipp Frank Hermann Udo Hertel;Alexander Wolfgang Karl Kurt Hertel;John David Trevor Graham;Mark Braverman

  • How to Compress Interactive Communication

    Boaz Barak;Mark Braverman;Xi Chen;Anup Rao

  • Interactive Information Complexity

    Mark Braverman

  • Dispensing digital objects to an electronic wallet

    Philipp Frank Hermann Udo Hertel;Alexander Wolfgang Karl Kurt Hertel;John David Trevor Graham;Mark Braverman

  • Information equals amortized communication

    Mark Braverman;Anup Rao

  • Noisy sorting without resampling

    Mark Braverman;Elchanan Mossel

  • Pseudorandom generators for regular branching programs

    Mark Braverman;Anup Rao;Ran Raz;Amir Yehudayoff

  • Termination of integer linear programs

    Mark Braverman

  • Communication lower bounds for statistical estimation problems via a distributed data processing inequality

    Mark Braverman;Ankit Garg;Tengyu Ma;Huy L. Nguyen

  • List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise

    Mark Braverman;Klim Efremenko

  • Toward Coding for Maximum Errors in Interactive Communication

    Mark Braverman;Anup Rao

  • Computing over the Reals: Foundations for Scientific Computing

    Mark Braverman;Stephen A. Cook

  • Polylogarithmic independence fools AC0 circuits

    Mark Braverman

  • Towards coding for maximum errors in interactive communication

    Mark Braverman;Anup Rao

  • Stability in Large Matching Markets with Complementarities

    Itai Ashlagi;Mark Braverman;Avinatan Hassidim

  • Sorting from Noisy Information

    Mark Braverman;Elchanan Mossel

  • From information to exact communication

    Mark Braverman;Ankit Garg;Denis Pankratov;Omri Weinstein

  • An information complexity approach to extended formulations

    Mark Braverman;Ankur Moitra

  • Non-computable Julia sets

    Mark Braverman;Michael Yampolsky

  • Monotonicity and Implementability

    Itai Ashlagi;Mark Braverman;Avinatan Hassidim;Dov Monderer

  • Poly-logarithmic Independence Fools AC^0 Circuits

    Mark Braverman

Frequent Co-Authors

Maria-Florina Balcan
Maria-Florina Balcan Carnegie Mellon University
Stephen A. Cook
Stephen A. Cook University of Toronto
Avinatan Hassidim
Avinatan Hassidim Bar-Ilan University
Shang-Hua Teng
Shang-Hua Teng University of Southern California
Ran Raz
Ran Raz Princeton University
Christian Borgs
Christian Borgs University of California, Berkeley
Jennifer Chayes
Jennifer Chayes University of California, Berkeley
Toniann Pitassi
Toniann Pitassi Columbia University
Rafail Ostrovsky
Rafail Ostrovsky University of California, Los Angeles

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring related online degrees can broaden your career options after studying Mathematics in the USA. For those interested in combining analytical skills with business, an online MBA can be an attractive option. Some candidates prioritize programs that are known for being the easiest MBA specialization to enter, helping make the transition smoother and more accessible.

Moreover, if flexibility is a top priority, students should consider enrolling in an easy online MBA program, which offers the convenience of remote learning without compromising quality.

For those leaning towards advanced leadership roles in business, pursuing a Doctorate in Business Administration can be a strategic choice. Several DBA online programs make this path more affordable and accessible, enabling students to specialize further.

Additionally, graduates interested in finance can explore the cheapest online master's in finance, providing a cost-effective way to gain expertise and enhance career prospects in financial analysis, risk management, or investment banking.

Best Scientists Citing Mark Braverman

Trending Scientists

Recently Published Articles