The doctoral thesis completed at Harvard University in 1985 titled Recursion-Theoretic Techniques in Complexity Theory and Combinatorics marked the beginning of the academic career of William Gasarch. Born in 1959, this American mathematician and computer scientist maintains a long-standing professorial appointment at the University of Maryland, focusing his research on algorithmic foundations and complex theoretical systems.
Academic Progression at Maryland
Gasarch joined the University of Maryland in 1985, securing a tenure-track position within the Department of Computer Science. His professional advancement followed a traditional trajectory within the institution, reaching the rank of associate professor with tenure in 1991. By 1998, he earned promotion to the position of full professor, additionally holding an affiliate appointment within the mathematics faculty.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Research and Computational Theory
His primary contributions span the intersections of computer science, applied mathematics, and combinatorics. In collaboration with Carl Smith, he helped establish the subfield of inductive inference known as Learning via Queries. His work frequently addresses recursion theory, specifically the study of bounded queries. To document these findings, he co-authored Bounded Queries in Recursion Theory with Georgia Martin.
Mathematics and Complexity Surveys
Beyond his research on recursive structures, Gasarch maintains an interest in broader mathematical discourse. He served as the book review editor for ACM SIGACT NEWS between 1997 and 2015. He contributed to the literature of the field through various texts, including Problems with a Point, written with Clyde Kruskal and David Eppstein, and Mathematical Muffin Morsels with Erik Metz, Jacob Prinz, and Daniel Smolyak. Additionally, he produced analytical surveys regarding theoretical perspectives on the P vs NP problem in 2002, 2012, and 2019.
Mentorship and Digital Engagement
Gasarch engages with the wider academic community through both mentorship and digital publication. He actively supports high school student research projects, mentoring students such as Jacob Lurie, whose project secured the 1996 Westinghouse Science Talent Search. Since 2007, he has maintained a presence in digital academic discourse by co-blogging on topics related to computational complexity.
Fast facts
- Born: 1959
- Nationality: United States
- Education: Harvard University
- Doctoral Advisor: Harry R. Lewis
- Primary Employer: University of Maryland
- Active Fields: Computer science, applied mathematics, combinatorics
- Professional Roles: University teacher, computer scientist, mathematician
Questions readers ask
Where did William Gasarch earn his doctorate?
He received his doctorate in computer science from Harvard University in 1985.
What subjects does William Gasarch teach and research?
His work covers computational complexity, computability theory, combinatorics, applied mathematics, and informatics.
Achievements
- Held posts at University of Maryland
- Fields: computer science, applied mathematics and informatics
