William Gasarch

Gasarch received his doctorate in computer science from Harvard in 1985, advised by Harry R. Lewis. His thesis was titled Recursion-Theoretic Techniques in Complexity Theory and Combinatorics.[3] He was hired into a tenure track professorial job at the University of Maryland in the Fall of 1985. He was promoted to Associate Professor with Tenure in 1991, and to Full Professor in 1998.

Gasarch co-founded (with Richard Beigel) the field of Bounded Queries in Recursion Theory[4] and has written many papers in the area capped off by a book on the topic co-authored with Georgia Martin, titled Bounded Queries in Recursion Theory.[5] He has published books such as Problems with a Point,[6] a book with a broad view on mathematics and theoretical computer science which he co-authored with Clyde Kruskal and includes works by other professors such as David Eppstein.[7] He also co-founded the subfield of recursion-theoretic inductive inference named Learning via Queries[8] with Carl Smith. More recently he has been more involved with combinatorics, notably Ramsey Theory.[9][10][11] He has written three surveys of what theorists think of the P vs NP problem: in 2002, 2012, and 2019.[12][13][14] In 2020 he wrote Mathematical Muffin Morsels: Nobody Wants a Small Piece with Erik Metz, Jacob Prinz, and Daniel Smolyak. [15]

Lance Fortnow began writing a blog on theoretical computer science with an emphasis on complexity theory in 2002.[16] Gasarch was a frequent guest blogger until 2007 when he became an official co-blogger.

• Gasarch's Homepage