World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
58
Citations
9630
World Ranking
3704
National Ranking
1765

Mathematics

D-Index
58
Citations
9715
World Ranking
654
National Ranking
328

Research.com Recognitions

  • 2016 - ACM Fellow For contributions to computational complexity, theory of distributed computing, and design and analysis of algorithms.

Overview

Michael Saks is a researcher affiliated with Rutgers, The State University of New Jersey in the United States. Their work is primarily situated in the fields of Computer Science and Mathematics, with a strong emphasis on computational theory and mathematics.

The central areas of research for Michael Saks include:

  • Computational Theory and Mathematics
  • Algebra and Number Theory
  • Artificial Intelligence
  • Numerical Analysis
  • Applied Mathematics

The primary topics covered in their research are:

  • Complexity and Algorithms in Graphs
  • Advanced Graph Theory Research
  • Quantum Computing Algorithms and Architecture
  • Graph Labeling and Dimension Problems
  • Advanced Algebra and Logic
  • Semigroups and Automata Theory
  • Machine Learning and Algorithms

Michael Saks has published papers in various venues, including:

  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • arXiv (Cornell University)
  • COMBINATORICA
  • OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)
  • Random Structures and Algorithms

Their recent papers include:

  • Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • On the discrepancy of random matrices with many columns, 2020, Random Structures and Algorithms
  • On the rational relationships among pseudo-roots of a non-commutative polynomial, 2020, Journal of Pure and Applied Algebra

Notably, Michael Saks is a co-author of several publications with frequent collaborators such as Aditi Dudeja, Rashmika Goswami, Mohit Gurumukhani, Ramamohan Paturi, and Navid Talebanfard, each having two co-authored works with Saks.

In recognition of their work, Michael Saks was named an ACM Fellow in 2016 for contributions to computational complexity, the theory of distributed computing, and the design and analysis of algorithms.

Best Publications

  • An optimal on-line algorithm for metrical task system

    Allan Borodin;Nathan Linial;Michael E. Saks

  • The cell probe complexity of dynamic data structures

    M. Fredman;M. Saks

  • An improved exponential-time algorithm for k-SAT

    Ramamohan Paturi;Pavel Pudlák;Michael E. Saks;Francis Zane

  • Wait-Free k -Set Agreement is Impossible: The Topology of Public Knowledge

    Michael Saks;Fotios Zaharoglou

  • An optimal online algorithm for metrical task systems

    A. Borodin;N. Linial;M. Saks

  • Probabilistic Boolean decision trees and the complexity of evaluating game trees

    Michael Saks;Avi Wigderson

  • Weak monotonicity suffices for truthfulness on convex domains

    Michael Saks;Lan Yu

  • A topological approach to evasiveness

    Jeff Kahn;Michael E. Saks;Dean Sturtevant

  • Low diameter graph decompositions

    Nathan Linial;Michael E. Saks;Michael E. Saks

  • An improved exponential-time algorithm for k-SAT

    R. Paturi;P. Pudlik;M.E. Saks;F. Zane

  • An on-line graph coloring algorithm with sublinear performance ratio

    L. Lovsz;M. Saks;W. T. Trotter

  • Orthogonal representations and connectivity of graphs

    L. Lovász;L. Lovász;M. Saks;A. Schrijver;A. Schrijver

  • Lattices, mobius functions and communications complexity

    L. Lovasz;M. Saks

  • Wait-free k-set agreement is impossible: the topology of public knowledge

    Michael Saks;Fotios Zaharoglou

  • Maximum induced trees in graphs

    Paul Erdös;Michael Saks;Vera T Sós

  • Every decision tree has an influential variable

    R. O'Donnell;M. Saks;O. Schramm;R.A. Servedio

  • The Efficiency of Resolution and Davis--Putnam Procedures

    Paul Beame;Richard Karp;Toniann Pitassi;Michael Saks

  • On the complexity of unsatisfiability proofs for random k-CNF formulas

    Paul Beame;Richard Karp;Toniann Pitassi;Michael Saks

  • The periodic balanced sorting network

    Martin Dowd;Yehoshua Perl;Larry Rudolph;Michael Saks

  • On the cover time of random walks on graphs

    Jeff D. Kahn;Nathan Linial;Nathan Linial;Noam Nisan;Michael E. Saks;Michael E. Saks

Frequent Co-Authors

Nathan Linial
Nathan Linial Hebrew University of Jerusalem
Ramamohan Paturi
Ramamohan Paturi University of California, San Diego
Paul Beame
Paul Beame University of Washington
László Lovász
László Lovász Eötvös Loránd University
Eric Allender
Eric Allender Rutgers, The State University of New Jersey
Jeff Kahn
Jeff Kahn Rutgers, The State University of New Jersey
Toniann Pitassi
Toniann Pitassi Columbia University
Avi Wigderson
Avi Wigderson Institute for Advanced Study
Howard Barnum
Howard Barnum University of New Mexico
Aravind Srinivasan
Aravind Srinivasan University of Maryland, College Park

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

Studying Mathematics in the USA opens numerous pathways, including advanced degrees and dynamic careers. For those interested in complementing mathematical skills with business expertise, pursuing one of the easy online MBA programs can be an excellent choice. These programs offer flexibility and accessibility, allowing students to enhance leadership abilities without overwhelming coursework.

For professionals aiming to deepen their knowledge at the doctoral level, affordable options like DBA programs online provide a practical route. These doctorates focus on applied research in business, which can be valuable for mathematicians interested in analytics or operational management.

Another relevant path is the finance sector. Many math graduates find success in financial modeling, risk analysis, or investment management by acquiring credentials through cheap online masters in finance. These affordable programs prepare students for competitive roles without excessive debt.

Lastly, for those looking to quickly accelerate their careers, the fastest online MBA options offer condensed coursework and faster completion times. These programs allow students to gain managerial skills rapidly, which complements a math background well in business-oriented roles.

Best Scientists Citing Michael Saks

Trending Scientists