Michael Saks

Michael Saks is a Distinguished Professor of Mathematics at Rutgers, The State University of New Jersey. He is affiliated with both the Department of Mathematics and the Computer Science Department as a graduate faculty member. His research focuses on theory of computation and discrete algorithms, with applications in computational complexity, combinatorics, and algorithmic analysis.

His recent publications include work on edit distance approximations, randomized algorithms, discrepancy of random matrices, and Boolean function analysis, reflecting a strong emphasis on theoretical foundations. He has contributed to journals such as Combinatorica, Journal of Graph Theory, and Discrete Applied Mathematics, and served on editorial boards and conference program committees, including the 2014 IEEE Conference on Computational Complexity.

Michael Saks maintains active research and teaching pages, including guidance for graduate applicants and links to seminars like the Discrete Mathematics/Theory of Computing Seminar. He also participates in initiatives such as the Center for Computational Intractability and DIMACS.