2026 Michael Saks: Mathematics Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Mathematics	58	654	555	329	260	209	9715
Computer Science	58	3704	3599	1766	1702	214	9630

Michael Saks publication distribution in Mathematics in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Mathematics in 2026. The highlighted bar marks where Michael Saks sits on this spectrum.

42 publications 537+

This scientist: 209 publications — 65th percentile

65% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 537 publications or more.

Michael Saks D-index placement in Mathematics in 2026

The chart shows the D-index (discipline H-index) distribution of Mathematics scientists ranked by Research.com in 2026. The highlighted bar marks where Michael Saks sits on this spectrum.

30 D-Index 86+

This scientist: 58 D-Index — 83rd percentile

83% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 86 D-Index or more.

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

590
Citations
The cell probe complexity of dynamic data structures

M. Fredman;M. Saks

462
Citations
An improved exponential-time algorithm for k-SAT

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

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

Michael Saks;Fotios Zaharoglou

307
Citations
An optimal online algorithm for metrical task systems

A. Borodin;N. Linial;M. Saks

268
Citations
Probabilistic Boolean decision trees and the complexity of evaluating game trees

Michael Saks;Avi Wigderson

251
Citations
Weak monotonicity suffices for truthfulness on convex domains

Michael Saks;Lan Yu

229
Citations
A topological approach to evasiveness

Jeff Kahn;Michael E. Saks;Dean Sturtevant

220
Citations
Low diameter graph decompositions

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

216
Citations
An improved exponential-time algorithm for k-SAT

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

184
Citations
An on-line graph coloring algorithm with sublinear performance ratio

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

183
Citations
Orthogonal representations and connectivity of graphs

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

174
Citations
Lattices, mobius functions and communications complexity

L. Lovasz;M. Saks

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

Michael Saks;Fotios Zaharoglou

160
Citations
Maximum induced trees in graphs

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

151
Citations
Every decision tree has an influential variable

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

151
Citations
The Efficiency of Resolution and Davis--Putnam Procedures

Paul Beame;Richard Karp;Toniann Pitassi;Michael Saks

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

Paul Beame;Richard Karp;Toniann Pitassi;Michael Saks

144
Citations
The periodic balanced sorting network

Martin Dowd;Yehoshua Perl;Larry Rudolph;Michael Saks

140
Citations
On the cover time of random walks on graphs

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

135
Citations

Frequent Co-Authors

Nathan Linial Hebrew University of Jerusalem

Ramamohan Paturi University of California, San Diego

Paul Beame University of Washington

László Lovász Eötvös Loránd University

Eric Allender Rutgers, The State University of New Jersey

Jeff Kahn Rutgers, The State University of New Jersey

Toniann Pitassi Columbia University

Avi Wigderson Institute for Advanced Study

Howard Barnum University of New Mexico

Aravind Srinivasan University of Maryland, College Park

External Links

Wikipedia of Michael Saks Personal website of Michael Saks Google Scholar page

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

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.