معرفی
William Gasarch is a Professor of Computer Science at the University of Maryland, College Park, with an affiliation in Mathematics. He holds a Ph.D. from Harvard University (1985) and a B.S. from SUNY Stony Brook (1980). His research focuses on complexity theory, combinatorics, and Ramsey Theory, with applications to computer science theory.
Education:
- Ph.D., Harvard University, 1985 (Computer Science)
- B.S., SUNY Stony Brook, 1980 (Math and Applied Math)
Research Interests:
Gasarch specializes in theoretical computer science, particularly applying Ramsey Theory to computational problems. His work bridges combinatorics, logic, and algorithm design, emphasizing foundational questions in complexity theory. He is known for exploring how Ramsey Theory informs program termination proofs and lower bounds in computational models.
Labs/Teams:
Affiliated with the Computer Science department’s theory group, he contributes to collaborative projects on Ramsey applications and combinatorial algorithms. His REU (Research Experiences for Undergraduates) program highlights mentorship in combinatorial algorithms.
Advising & Grants:
- Mentored numerous high school and undergraduate students, including Breakthrough Prize winner Jacob Lurie and Intel Science Talent finalist Louis Wasserman.
- Active in NSF-funded initiatives through UMD’s theory group (details unspecified).
