| EP/I011528/2 | Computational Counting | (P) |
| EP/I011528/1 | Computational Counting | (P) |
| EP/G069239/1 | Efficient Decentralised Approaches in Algorithmic Game Theory | (C) |
| EP/E062482/1 | The Complexity of Counting in Constraint Satisfaction Problems | (P) |
| GR/S76168/02 | Discontinuous Behaviour in the Complexity of Randomized Algorithms | (P) |
| GR/T07343/02 | Algorithms of Nework-sharing Games | (C) |
| GR/T07343/01 | Algorithms of Nework-sharing Games | (C) |
| GR/S76168/01 | Discontinuous Behaviour in the Complexity of Randomized Algorithms | (P) |
| GR/R64513/01 | Markov chains-algorithms,applications and theory: A London Mathematical Society Durham S | (R) |
| GR/R44560/01 | Analysing Markov-Chain Based Random Sampling Algorithms | (P) |
| GR/M96940/01 | SHARPER ANALYSIS OF RANDOMISED ALGORITHMS: A COMPUTATIONAL APPROACH | (P) |
| GR/L60982/01 | DESIGN AND ANALYSIS OF CONTENTION-RESOLUTION PROTOCOLS | (P) |