|
| Name: |
Professor ME Dyer |
| Organisation: |
University of Leeds |
| Department: |
Sch of Computing |
| Current EPSRC-Supported Research
Topics: |
|
Fundamentals of Computing
|
|
|
| Current EPSRC Support |
|
| Previous EPSRC Support |
| EP/M004953/1 | Randomized algorithms for computer networks | (P) |
| EP/J006300/1 | Random walks on computer networks | (C) |
| EP/I012087/1 | Computational Counting | (P) |
| EP/E062172/1 | The Complexity of Counting in Constraint Satisfaction Problems | (P) |
| EP/D00232X/1 | Amorphous computation, random graphs and complex biological networks | (C) |
| GR/S76151/01 | Discontinuous Behaviour in the Complexity of Randomized Algorithms | (P) |
| GR/M96902/01 | SHARPER ANALYSIS OF RANDOMISED ALGORITHMS:A COMPUTATIONAL APPROACH | (P) |
| GR/M53370/01 | RANDOMIZED AND PROBABILISTIC METHODS IN ALGORITHM DESIGN | (P) |
| GR/H77811/01 | A STUDY OF SCALABLE PARALLEL ALGORITHMS FOR LARGE LINEAR PROGRAMMING PROBLEMS | (C) |
| GR/F31847/01 | CO89 SYMPOSIUM ON COMBINATORIAL OPTIMIZATION | (C) |
|
|
Key: (P)=Principal Investigator, (C)=Co-Investigator, (R)=Researcher Co-Investigator
|
| |
|
|
|
|