Dr Marcin Jurdzinski and Dr Ranko Lazic from Warwick's DIMAP inter-disciplinary centre and the Computer Science department, jointly with Dr Sven Schewe, Dr John Fearnley and Dr Dominik Wojtczak from the University of Liverpool, will lead a new research project on solving parity games in theory and practice, to run 2017-2020.

The project will be supported by approx. £750K from the EPSRC across the two sites. The proposal was ranked top at its funding prioritisation panel, and the reviewers said:

This is the strongest and best designed proposal on theoretical computer science I have seen in the last five years.

as well as

The proposal is about fundamental research, but there is a clear path connecting the expected results to concrete industrial needs on program verification and program synthesis.

Professor Artur Czumaj, head of DIMAP and of the Theory and Foundations research division, commented:

This exciting new EPSRC project builds on excellence in theoretical computer science for which Warwick is internationally renowned. It strengthens our collaborative links with Computer Science at Liverpool, who were likewise one of the leading departments for research outputs in the most recent REF.

The European Research Council (ERC) has just announced that two Warwick Computer Science Professors, Graham Cormode and Dan Kráľ, have been among the winners of its Consolidator Grant competition. ERC Consolidator Grants is funding 372 top mid-career scientists with €713 million to pursue their best ideas, as part of the European Union Research and Innovation programme Horizon 2020. Grants are worth up to €2.75 million each, with an average of €1.91 million per grant. The funding will enable them to consolidate their research teams and to develop their most innovative ideas.

Graham Cormode has been awarded an ERC Consolidator grant for a project entitled "Small Summaries for Big Data". The project focuses on the area of the design and analysis of compact summaries: data structures which capture key features of the data, and which can be created effectively over distributed data sets. The project will substantially advance the state of the art in data summarization, to the point where accurate and effective summaries are available for a wide array of problems, and can be used seamlessly in applications that process big data.

Dan Kráľ has been awarded an ERC Consolidator grant for a project entitled "Large Discrete Structures". The project will advance theory of combinatorial limits, which combines methods from analysis, combinatorics, computer science, group theory and probability theory to analyze and approximate large discrete structures (such as graphs, which can be used to represent large computer networks). The project will lead to proposing new mathematical methods to represent such discrete structures and to applications of the new methods to specific problems in extremal combinatorics and algorithm design.

The department and DIMAP are delighted to welcome Sylvain Schmitz from LSV, ENS Cachan, CNRS and INRIA Saclay, who has joined us this week as Leverhulme Visiting Professor.

Funded by the Leverhulme Trust, Dr Schmitz will spend 6 months at Warwick, collaborating with Dr Ranko Lazic and other colleagues on logics and games for algorithmic verification, and delivering three research lectures.