Skip to main content
School of Mathematical Sciences

Research grant projects and collaborations

Currently funded projects

Other funded projects

  • EPSRC, Standard Grant, Algorithms that count: exploring the limits of tractability, PI Mark Jerrum, 2015 - 2019. The value of the award is £452,465.
  • EPSRC, Standard Grant, Computational Counting, PI Mark Jerrum, 2011 - 2014. The value of the award is £443,533.
  • EPSRC, Postdoctoral Fellowship, PI Olof Sisask, 2010 - 2012. The value of the award is £212,178.

 

 

 

External collaborations

  • Justin Ward has been invited to talk at both Yahoo! Labs and Google Research in New York

  • Some of Bill Jackson’s work on rigidity of frameworks has been conducted jointly with J. C. Owen of Siemens. Mark Walter’s collaboration with IBM applied ideas from the theory of random structures to the analysis of the IBM Gaian database [4].

  • The interests of the group even extend to applications in the area of oil production [3].

    Not all of the group's external projects can be mentioned, owing to confidentially considerations.

Involvement with external conferences

  • Bill Jackson was an organiser for two international workshops on rigidity: DIMACS Workshop on Distance Geometry: Theory and Applications (link is external), Rutgers University, USA in July 2016; Geometric Rigidity Theory and Applications (link is external), ICMS, Edinburgh May 30 to June 3, 2016.

  • Mark Jerrum was awarded, jointly with Leslie Goldberg of Oxford University, the prize for the best paper in Track A of the International Colloquium on Automata Languages and Programming, the leading European conference on theoretical computer science [1].  He spoke at the IMA meeting on 'The power of randomness in computation' at Georgia Tech. and was an organiser for the meeting 'Phase transitions in discrete structures and computational problems' at Warwick in 2014. 

  • Mark Walters was invited to speak at the conferences `Additive Combinatorics' at Bristol and `Extremal and Probabilistic Combinatorics at Birmingham in 2015.

  • David Ellis gave invited talks at the Clay Mathematics Workshop on Extremal and Probabilistic Combinatorics in 2014 and at the workshop `Non-combinatorial Combinatorics' at Warwick in 2015. 

  • Felix Fischer and his co-authors P. Dütting, P. Jirapinyo, J. Lai and B. Lubin won the best paper award at the 13th ACM Conference on Electronic Commerce [1].

  • Justin Ward was on the program committee for ICALP ’16 and has given talks at other prestigious conferences on theoretical computer science such as FOX and SODA.

 

References

[1] P. Dütting, F. Fischer, P. Jirapinyo, J. Lai, B. Lubin, and D. C. Parkes, Payment rules through discriminant-based classifiers, Proceedings of the 13th ACM Conference on Electronic Commerce, 477–494. ACM Press, 2012

[2] Leslie Ann Goldberg and Mark Jerrum, The complexity of computing the sign of the Tutte polynomial (and consequent #P-hardness of approximation), Proc. 39th International Colloquium on Automata Languages and Programming (ICALP 2012).


[3] Dudley Stark, Oil production models with normal rate curves, Probability in the Engineering and Informational Sciences, 25 (2011) 205–217.

[4] Mark Walters, Paul Stone, Patrick Dantressangle and Abbe Mowshowitz, The Evolution of Gaian Preferential Attachment Graphs, Annual Conference of the International Technology Alliance, Southampton, September 2012.