Michael Saks received his SB in Mathematics (1976) and PhD in Mathematics (1980) from MIT. He has held positions at UCLA, UCSD, and Bell Communications Research and is currently Distinguished Professor of Mathematics at Rutgers University. He has broad research interests within the theory of computing and has worked in a variety of areas including data structure lower bounds, online algorithms, derandomization, sublinear algorithms, satisfiability algorithms, communication complexity, decision tree complexity, quantum query complexity, and distributed computing.