William Gasarch
William Ian Gasarch | |
---|---|
Born | 1959 (age 61–62) |
Nationality | United States |
Alma mater | Stony Brook University Harvard University |
Known for | , Computability Theory, , Ramsey Theory |
Scientific career | |
Fields | Computer science |
Institutions | University of Maryland, College Park |
Doctoral advisor | Harry R. Lewis |
Website | www http://blog.computationalcomplexity.org/ |
William Ian Gasarch (born 1959[1]) is an American computer scientist known for his work in computational complexity theory, computability theory, computational learning theory, and Ramsey theory. He is currently a professor at the University of Maryland Department of Computer Science with an affiliate appointment in Mathematics.
As of 2015 he has supervised over 40 high school students on research projects,[citation needed] including Jacob Lurie. He has co-blogged on computational complexity with Lance Fortnow since 2007. He was the book review editor for ACM SIGACT NEWS from 1997-2015 before resigning and turning the job over to Fred Green, a professor of Computer science at Clark University.
Education[]
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.[2] 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.[citation needed]
Work[]
Gasarch co-founded (with Richard Beigel) the field of Bounded Queries in Recursion Theory[3] 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.[4] He's published books such as Problems with a Point,[5] 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.[6] He also co-founded the subfield of recursion-theoretic inductive inference named Learning via Queries[7] with Carl Smith. More recently he has been more involved with combinatorics, notably Ramsey Theory.[8][9][10] He has written two surveys of what theorists think of the P vs NP problem.[11][12]
Blog[]
Lance Fortnow began writing a blog on theoretical computer science with an emphasis on complexity theory in 2002.[13] Gasarch was a frequent guest blogger until 2007 when he became an official co-blogger.
References[]
- ^ "Still Typecasting from Dagstuhl". Computational Complexity Weblog. Lance Fortnow and William Gasarch. Retrieved 27 September 2018.
- ^ William Gasarch at the Mathematics Genealogy Project
- ^ http://www.cs.umd.edu/~gasarch/papers/gems.pdf Gems in the Field of Bounded Queries by William Gasarch, 2003
- ^ https://www.springer.com/us/book/9780817639662 Bounded Queries in Recursion Theory (with Georgia Martin), Birkhauser, 1999
- ^ https://www.worldscientific.com/worldscibooks/10.1142/11261 Problems with a Point Exploring Math and Computer Science, 2019
- ^ https://www.worldscientific.com/doi/abs/10.1142/9789813279735_0014 Chapter 14: Is This Problem Too Hard for a High School Math Competition?, 2019
- ^ http://www.cs.umd.edu/~gasarch/papers/lvqsur.pdf A Survey of Inductive Inference with an Emphasis on Queries, Gasarch and Smith, 1997
- ^ Gasarch, William; Haeupler, Bernhard (2011). "Lower Bounds on the van der Waerden Numbers: Randomized- and Deterministic-Constructive". Electronic Journal of Combinatorics. 18 (64). arXiv:1005.3749. doi:10.37236/551.
- ^ Gasarch, William; Haeupler, Bernhard (2010). "Rectangle Free Coloring of Grids". arXiv:1005.3750 [math.CO].
- ^ Gasarch, William; Haeupler, Bernhard (2011). "Proving programs terminate using well orderings, Ramsey Theory, and Matrices". arXiv:1108.3347 [math.CO].
- ^ http://www.cs.umd.edu/~gasarch/papers/poll.pdf The P=?NP Poll, William Gasarch, Guest Column in SIGACT NEWS Complexity Theory Column 36, 2002
- ^ http://www.cs.umd.edu/~gasarch/papers/poll2012.pdf The Second P=?NP Poll, William Gasarch, Guest Column in SIGACT NEWS Complexity THeory Column 74, 2012
- ^ http://blog.computationalcomplexity.org/ Computational Complexity Weblog
External links[]
- Living people
- American computer scientists
- Computability theorists
- University of Maryland, College Park faculty
- Harvard University alumni
- Science bloggers
- 1959 births