William Ian Gasarch is an American computer scientist known for his work in computational complexity theory, computability theory, computational learning theory, and Ramsey theory.
12 Facts About William Gasarch
William Gasarch is currently a professor at the University of Maryland Department of Computer Science with an affiliate appointment in Mathematics.
William Gasarch has co-blogged on computational complexity with Lance Fortnow since 2007.
William Gasarch was book review editor for ACM SIGACT NEWS from 1997 to 2015.
William Gasarch's thesis was titled Recursion-Theoretic Techniques in Complexity Theory and Combinatorics.
William Gasarch was hired into a tenure track professorial job at the University of Maryland in the Fall of 1985.
William Gasarch was promoted to Associate Professor with Tenure in 1991, and to Full Professor in 1998.
William Gasarch co-founded the field of Bounded Queries in Recursion Theory 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.
William Gasarch has published books such as Problems with a Point, 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.
William Gasarch co-founded the subfield of recursion-theoretic inductive inference named Learning via Queries with Carl Smith.
William Gasarch has written three surveys of what theorists think of the P vs NP problem: in 2002,2012, and 2019.
William Gasarch was a frequent guest blogger until 2007 when he became an official co-blogger.