Michael Saks

Statistics

Publications

108

Citations

6.6K

H-Index

Active since

1979

Affiliations

Rutgers, The State University of New Jersey(Current)

Hebrew University of Jerusalem

University of California San Diego

Massachusetts Institute of Technology

Core Competence

Michael Saks is an author at Rutgers, The State University of New Jersey specializing in engineering, computer science, and combinatorial optimization.

ORCID

Top concepts

EngineeringComputer ScienceComputational ComplexityDiscrete MathematicsCombinatorial OptimizationMathematical ProgrammingCircuit ComplexityAutomated ReasoningProbabilityGraph Theory

Publications per year

1979–2018

108

Publications

108

The cell probe complexity of dynamic data structures

Michael L. Fredman, Michael Saks · 1989 · 354 citations · Full text

Engineering, Dynamic Data, Computational Complexity +19

An optimal on-line algorithm for metrical task system

Allan Borodin, Nathan Linial, Michael Saks · Journal of the ACM · 1992 · 328 citations · Full text

Mathematical Programming, Artificial Intelligence, Engineering +22

Wait-Free <i>k</i>-Set Agreement is Impossible: The Topology of Public Knowledge

Michael Saks, Fotios Zaharoglou · SIAM Journal on Computing · 2000 · 301 citations

Cluster Computing, Engineering, Collective Knowledge +23

Probabilistic Boolean decision trees and the complexity of evaluating game trees

Michael Saks, Avi Wigderson · 1986 · 218 citations

Circuit Complexity, Computational Complexity Theory, Engineering +23

An improved exponential-time algorithm for <i>k</i> -SAT

Ramamohan Paturi, Pavel Pudlák, Michael Saks et al. · Journal of the ACM · 2005 · 212 citations

Theory Of Computing, Circuit Complexity, Computational Complexity Theory +15

Rows per page

1–5 of 108