# William Gasarch

> American computer scientist

**Wikidata**: [Q21825565](https://www.wikidata.org/wiki/Q21825565)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/William_Gasarch)  
**Source**: https://4ort.xyz/entity/william-gasarch

## Summary
William Gasarch is an American computer scientist and mathematician known for his contributions to computability theory, algorithms, and combinatorics. He is a professor at the University of Maryland, where he has advised numerous doctoral students and published influential research in theoretical computer science.

## Biography
- **Born**: 1959
- **Nationality**: United States
- **Education**: Ph.D. from Harvard University
- **Known for**: Research in computability theory, algorithms, and combinatorics
- **Employer(s)**: University of Maryland
- **Field(s)**: Computer science, applied mathematics, informatics, algorithms, combinatorics, computability theory

## Contributions
William Gasarch has made significant contributions to theoretical computer science, particularly in computability theory and algorithms. His work includes research on the complexity of computational problems, the structure of Turing degrees, and the application of combinatorial methods to computational questions. He has published numerous papers in peer-reviewed journals and conferences, advancing the understanding of fundamental limits in computation. Gasarch has also supervised several doctoral students, including Mark Gregory Pleszkoch, Evan Golub, and Katia Silva Guimarães, who have gone on to contribute to the field. His research often bridges gaps between pure mathematics and computer science, providing insights that are both theoretically deep and practically relevant.

## FAQs
### Q: Who is William Gasarch?
A: William Gasarch is an American computer scientist and mathematician specializing in computability theory, algorithms, and combinatorics. He is a professor at the University of Maryland and has advised multiple doctoral students in these fields.

### Q: What is William Gasarch known for?
A: He is known for his research in computability theory, algorithms, and combinatorics, as well as his role as a doctoral advisor at the University of Maryland.

### Q: Where did William Gasarch earn his Ph.D.?
A: He earned his Ph.D. from Harvard University.

### Q: Who were William Gasarch's doctoral advisors?
A: His doctoral advisors were Harry R. Lewis and Albert R. Meyer, both prominent computer scientists and mathematicians.

### Q: What fields does William Gasarch work in?
A: His primary fields of work include computer science, applied mathematics, informatics, algorithms, combinatorics, and computability theory.

## Why They Matter
William Gasarch's work has advanced the understanding of fundamental questions in computer science, particularly in computability theory and algorithms. His research has influenced both theoretical and applied aspects of the field, providing frameworks for understanding the limits and capabilities of computation. As a doctoral advisor, he has mentored several researchers who have gone on to make their own contributions, extending his impact through the academic community. His interdisciplinary approach, bridging mathematics and computer science, has helped shape modern computational theory.

## Notable For
- Professor of Computer Science at the University of Maryland.
- Doctoral advisor to several notable computer scientists, including Mark Gregory Pleszkoch and Evan Golub.
- Research contributions to computability theory, algorithms, and combinatorics.
- Author of numerous influential papers in theoretical computer science.
- Ph.D. from Harvard University under the supervision of Harry R. Lewis and Albert R. Meyer.

## Body
### Early Life and Education
William Gasarch was born in 1959. He earned his Ph.D. in computer science from Harvard University, where he was advised by Harry R. Lewis and Albert R. Meyer, both prominent figures in theoretical computer science.

### Academic Career
Gasarch is a professor at the University of Maryland, where he has supervised multiple doctoral students. His research focuses on computability theory, algorithms, and combinatorics. He has published extensively in these areas, contributing to the theoretical foundations of computer science.

### Research Contributions
Gasarch's work in computability theory explores the boundaries of what can be computed, particularly in the context of Turing degrees and the complexity of computational problems. His research in algorithms and combinatorics has provided insights into the efficiency and structure of computational processes.

### Doctoral Students
Gasarch has advised several doctoral students who have gone on to contribute to the field, including:
- Mark Gregory Pleszkoch (Ph.D. 1990)
- Evan Golub (Ph.D. 1999)
- Katia Silva Guimarães
- James Richard Glenn
- Walid Gomma
- Carl Anderson

### Fields of Work
Gasarch's research spans multiple areas, including:
- Computer science
- Applied mathematics
- Informatics
- Algorithms
- Combinatorics
- Computability theory

## Schema Markup
```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "William Gasarch",
  "jobTitle": "Professor of Computer Science",
  "worksFor": {
    "@type": "Organization",
    "name": "University of Maryland"
  },
  "nationality": {
    "@type": "Country",
    "name": "United States"
  },
  "birthDate": "1959",
  "alumniOf": [
    {
      "@type": "EducationalOrganization",
      "name": "Harvard University"
    }
  ],
  "knowsAbout": [
    "Computer Science",
    "Applied Mathematics",
    "Informatics",
    "Algorithms",
    "Combinatorics",
    "Computability Theory"
  ],
  "sameAs": [
    "https://www.wikidata.org/wiki/Q8042173",
    "https://en.wikipedia.org/wiki/William_Gasarch"
  ],
  "description": "American computer scientist and mathematician known for contributions to computability theory, algorithms, and combinatorics."
}
```

## References

1. [BnF authorities](https://catalogue.bnf.fr/ark:/12148/cb16763440h)
2. Czech National Authority Database
3. Mathematics Genealogy Project
4. Virtual International Authority File
5. CiNii Research
6. [Source](https://blog.computationalcomplexity.org/2018/09/still-typecasting-from-dagstuhl.html)
7. National Library of Israel Names and Subjects Authority File