Michael Saks

from Wikipedia, the free encyclopedia

Michael Ezra Saks is an American computer scientist and mathematician.

Saks received his PhD in 1980 from the Massachusetts Institute of Technology under Daniel J. Kleitman (Duality Properties of Finite Set Systems). He is a professor at Rutgers University .

Saks deals with complexity theory , combinatorics and graph theory .

In 2004 he received the Gödel Prize with Maurice Herlihy , Nir Shavit and Fotios Zaharoglou for his essay with Zaharoglou: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge (SIAM Journal on Computing, Volume 29, 2000). This recognized her discovery of the role of topology in distributed computing, which enables the question of the existence of protocols for certain problems to be freed from their dynamic nature and reduced to a topological problem. Zaharoglou was his PhD student at the University of California, San Diego in 1993 .

Web links

Individual evidence

  1. Michael Saks in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  2. Laudation Gödel Prize 2004