William Gasarch

Source: Wikipedia, the free encyclopedia.
William Ian Gasarch
Professor Bill Gasarch at UMD
Born1959 (age 64–65)
NationalityAmerican
Alma materStony Brook University
Harvard University
Known forComputational complexity theory
Computability theory
Computational learning theory
Ramsey theory
Scientific career
FieldsComputer science
InstitutionsUniversity of Maryland, College Park
Doctoral advisorHarry R. Lewis
Websitewww.cs.umd.edu/~gasarch
http://blog.computationalcomplexity.org/

William Ian Gasarch (

University of Maryland
Department of Computer Science with an affiliate appointment in Mathematics.

Gasarch is a frequent mentor of high school student research projects; one of these, with

Westinghouse Science Talent Search for Lurie.[3] He has co-blogged on computational complexity with Lance Fortnow since 2007. He was book review editor for ACM SIGACT
NEWS from 1997 to 2015.

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.[4] 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.[5]

Work

Gasarch co-founded (with Richard Beigel) the field of Bounded Queries in Recursion Theory

P vs NP problem: in 2002, 2012, and 2019.[14][15][16] In 2020 he wrote Mathematical Muffin Morsels: Nobody Wants a Small Piece with Erik Metz, Jacob Prinz, and Daniel Smolyak. [17]

Blog

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

References

  1. ^ "Rectangle Free Colorings – William Gasarch". YouTube. May 8, 2017. Retrieved 12 October 2022.
  2. ^ "Still Typecasting from Dagstuhl". Computational Complexity Weblog. Lance Fortnow and William Gasarch. Retrieved 27 September 2018.
  3. ^ Conway, John H.; Jackson, Allyn (July 1996). "Budding Mathematician Wins Westinghouse Competition" (PDF). Notices of the American Mathematical Society. Retrieved 2016-09-26.
  4. ^ William Gasarch at the Mathematics Genealogy Project
  5. ^ Gasarch, William (March 16, 2023). "Curriculum vitae" (PDF). U. Maryland Computer Science. Retrieved 2024-02-14.
  6. ^ http://www.cs.umd.edu/~gasarch/papers/gems.pdf Gems in the Field of Bounded Queries by William Gasarch, 2003
  7. ^ https://www.springer.com/us/book/9780817639662 Bounded Queries in Recursion Theory (with Georgia Martin), Birkhauser, 1999
  8. ^ https://www.worldscientific.com/worldscibooks/10.1142/11261 Problems with a Point Exploring Math and Computer Science, 2019
  9. ^ https://www.worldscientific.com/doi/abs/10.1142/9789813279735_0014 Chapter 14: Is This Problem Too Hard for a High School Math Competition?, 2019
  10. ^ http://www.cs.umd.edu/~gasarch/papers/lvqsur.pdf A Survey of Inductive Inference with an Emphasis on Queries, Gasarch and Smith, 1997
  11. S2CID 534179
    .
  12. arXiv:1005.3750 [math.CO
    ].
  13. arXiv:1108.3347 [math.CO
    ].
  14. S2CID 36828694
    .
  15. S2CID 52847337
    .
  16. S2CID 83458626
    .
  17. ISBN 978-981-12-1519-3
    .
  18. ^ http://blog.computationalcomplexity.org/ Computational Complexity Weblog

External links

Retrieved from "https://en.wikipedia.org/w/index.php?title=William_Gasarch&oldid=1219637721"