# Martin Dyer

> British computer scientist

**Wikidata**: [Q6775362](https://www.wikidata.org/wiki/Q6775362)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Martin_Dyer)  
**Source**: https://4ort.xyz/entity/martin-dyer

## Summary
Martin Dyer is a British computer scientist known for foundational work in randomized algorithms and counting complexity. He is a long-time academic affiliated with the University of Leeds and has received major honors including the Fulkerson Prize (1991), the EATCS Award (2013), and the Gödel Prize (2021).

## Biography
- Born: 1946-07-16, Ryde
- Nationality: United Kingdom
- Education: Imperial College London; University of Leeds
- Known for: Contributions to randomized algorithms (notably a random polynomial-time algorithm for approximating the volume of convex bodies) and leadership in the complexity of counting problems
- Employer(s): University of Leeds (School of Computing); Faculty of Environment (start 1987)
- Field(s): Computer science

## Contributions
Martin Dyer is co-recipient (with Ravindran Kannan and Alan M. Frieze) of the Fulkerson Prize (1991) for the work titled "A random polynomial-time algorithm for approximating the volume of convex bodies," a concrete algorithmic result that established randomized polynomial-time approximation methods for geometric volume computation. He served as principal investigator on the research project "The Complexity of Counting in Constraint Satisfaction Problems" (grant EP/E062172/1), leading funded work on counting complexity for constraint satisfaction. Dyer has supervised doctoral students including Russ Bubley and Sammani Abdullahi and was advised by Les G. Proll. His scholarly output is indexed under identifiers such as DBLP author id 82/6798 and MR author id 61195. Major recognitions include the EATCS Award (2013) and the Gödel Prize (2021), reflecting substantive published contributions to theoretical computer science and complexity theory.

## FAQs
### Q: Who is Martin Dyer?
A: Martin Dyer is a British computer scientist and academic, born in 1946, known for work on randomized algorithms and counting complexity. He has been affiliated with the University of Leeds and educated at Imperial College London.

### Q: What is Martin Dyer best known for?
A: He is best known for the random polynomial-time algorithm for approximating the volume of convex bodies, work that earned him the Fulkerson Prize in 1991 alongside Ravindran Kannan and Alan M. Frieze.

### Q: What awards has Martin Dyer received?
A: Dyer received the Fulkerson Prize in 1991, the EATCS Award in 2013, and the Gödel Prize in 2021.

## Why They Matter
Martin Dyer's work helped establish rigorous randomized methods for problems in computational geometry and complexity. The algorithm for approximating the volume of convex bodies demonstrated that randomized polynomial-time approximation was possible for a central geometric problem; this result was recognized by the Fulkerson Prize in 1991 and signaled a significant advance in randomized algorithms. As principal investigator on a project titled "The Complexity of Counting in Constraint Satisfaction Problems" (EP/E062172/1), Dyer led focused research into counting complexity for constraint satisfaction, a core area in theoretical computer science that underpins understanding of tractability and hardness in counting problems. His later recognitions, including the EATCS Award (2013) and the Gödel Prize (2021), mark sustained influence in complexity theory. Through supervision of doctoral students and a long academic career at the University of Leeds, Dyer has contributed to training researchers and advancing foundational theory in algorithms and counting complexity.

## Notable For
- Co-recipient of the Fulkerson Prize (1991) for "A random polynomial-time algorithm for approximating the volume of convex bodies" (with Ravindran Kannan and Alan M. Frieze).
- Recipient of the EATCS Award (2013).
- Recipient of the Gödel Prize (2021).
- Principal investigator of the project "The Complexity of Counting in Constraint Satisfaction Problems" (grant EP/E062172/1).
- Long-term academic affiliation with the University of Leeds (School of Computing) and past association with the Faculty of Environment (start 1987).

## Body

### Personal and identity
- Full name: Martin Edward Dyer (also known as Martin E. Dyer).
- Born on 16 July 1946 in Ryde.
- Citizenship: United Kingdom.
- Sex/gender: male.

### Education and mentorship
- Educated at Imperial College London.
- Educated at the University of Leeds.
- Doctoral advisor: Les G. Proll.
- Doctoral students: Russ Bubley; Sammani Abdullahi.

### Employment and affiliations
- Employer: University of Leeds, affiliated with the School of Computing.
- Employer record includes service in the Faculty of Environment beginning 1987.
- Affiliated with Imperial College London (education and related links).

### Research projects and roles
- Principal investigator for "The Complexity of Counting in Constraint Satisfaction Problems" (grant EP/E062172/1). The project listing identifies him as principal investigator for work on counting complexity and constraint satisfaction.
- Publications and indexing:
  - DBLP author id: 82/6798.
  - MR author id: 61195.
  - Scopus author id: 7201700600.
  - zbMath author id: dyer.martin-e.
  - Dimensions author id: 010610754257.21.

### Key publications and recognized work
- "A random polynomial-time algorithm for approximating the volume of convex bodies" — work recognized by the Fulkerson Prize in 1991; co-authored with Ravindran Kannan and Alan M. Frieze.
- Further contributions in theoretical computer science and complexity theory are reflected by major awards (EATCS Award 2013; Gödel Prize 2021) and extensive bibliographic records.

### Awards and honors
- Fulkerson Prize, 1991 — awarded for the random polynomial-time algorithm for approximating the volume of convex bodies (co-authors: Ravindran Kannan, Alan M. Frieze).
- EATCS Award, 2013.
- Gödel Prize, 2021.

### Identifiers and authority data
- ISNI: 0000000396349081.
- VIAF id: 291303093.
- GND id: 1079122311.
- Freebase id: /m/0cm9n4s.
- PRABOOK id: 2274567.
- WorldCat entities id: E39PBJtX3wkyHYyqQc3JcWCvpP.
- Mathematics Genealogy Project id: 89465.

### Languages and maintenance
- Languages spoken/written: English.
- Maintained by WikiProject Mathematics (per metadata).

## References

1. Mathematics Genealogy Project
2. [Source](https://engineering.leeds.ac.uk/staff/52/martin_dyer)
3. [ORCID Public Data File 2023](https://pub.orcid.org/v3.0/0000-0002-2018-0374/employment/3525122)
4. [Source](http://www.ams.org/prizes-awards/pabrowse.cgi?parent_id=17&year=1991)
5. [Source](https://www.eatcs.org/images/awards/EATCSAward2013Laudatio.pdf)
6. [Source](https://sigact.org/prizes/g%C3%B6del.html)
7. Virtual International Authority File