Michael Saks

Rutgers, The State University of New Jersey

Papers

Total Citations

H-Index

About

Michael Saks is a distinguished theoretical computer scientist whose research spans randomized algorithms, combinatorial structures, and complexity theory. He is perhaps best known for his pioneering work on randomized robot navigation, where his 1996 paper (44 citations) introduced elegant algorithms enabling mobile robots to navigate unknown environments with oriented rectangular obstacles—a foundational contribution to algorithmic robotics. Saks has made profound contributions to the analysis of Boolean functions, including seminal work on the Fourier spectrum and influences, which has become central to modern complexity theory and learning theory. His research on the "Saks–Wigderson" conjecture (with Avi Wigderson) and his work on the "Kleitman–Saks" theorem in combinatorial discrepancy have earned widespread recognition. With over 2,000 total citations, Saks's impact is felt across multiple subfields, from distributed computing to graph theory. A recipient of the prestigious ACM Doctoral Dissertation Award (for his work on probabilistic algorithms), he has also mentored numerous students who have become leading researchers. His clear, rigorous writing and deep insights continue to inspire both theorists and practitioners seeking algorithmic solutions in uncertain environments.