|
| Name: |
Professor M Jerrum |
| Organisation: |
Queen Mary University of London |
| Department: |
Sch of Mathematical Sciences |
| Current EPSRC-Supported Research
Topics: |
|
Fundamentals of Computing
|
|
|
| Current EPSRC Support |
|
| Previous EPSRC Support |
| EP/N004221/1 | Algorithms that count: exploring the limits of tractability | (P) |
| EP/I011935/1 | Computational Counting | (P) |
| EP/E064906/1 | The Complexity of Counting in Constraint Satisfaction Problems | (P) |
| GR/S76175/01 | Discontinuous Behaviour in the Complexity of Randomized Algorithms | (C) |
| GR/R42245/01 | Infinite State Processes | (C) |
| GR/N64106/01 | PHASE TRANSITIONS IN INFINITE SYSTEMS AND THEIR RELATION TO THE DYNAMICS OF FINITE SYSTEMS | (P) |
| GR/M96957/01 | SHARPER ANALYSIS OF RANDOMISED ALGORITHMS:A COMPUTATIONAL APPROACH | (P) |
| GR/M06468/01 | ALGRITHMIC ISSUES IN CONCURRENCY THEORY: MODEL CHECKING AND EQUIVALENCE TESTING | (P) |
| GR/L17610/01 | ICMS WORKSHOP ON THE VAPNIK - CHEVONENKIS DIMENSION | (P) |
| GR/K83243/01 | DECISION PROCEDURES FOR BEHAVIOURAL EQUIVALENCES ON CONCURRENT PROCESSES | (P) |
| GR/H55499/01 | RESEARCH PROGRAMMES RANDOMNESS AND COMPUTATION AND ALGEBRAIC GRAPH THEORY | (P) |
| GR/F90363/01 | QUANTITATIVE ANALYSIS OF STOCHASTIC SYSTEMS IN COMPUTER SCIENCE | (C) |
|
|
Key: (P)=Principal Investigator, (C)=Co-Investigator, (R)=Researcher Co-Investigator
|
| |
|
|
|
|