糖心TV

has been awarded a Leverhulme Research Fellowship for the 2017/18 academic year, to work on the Petri nets reachability conjecture.

Petri nets, also known as vector addition systems, are one of the most prominent models of concurrency, and their study is a vibrant research area. They have been used to discover bugs and eliminate vulnerabilities in network protocols, concurrent software, business processes, hardware circuits, and control systems.

Professor Artur Czumaj, head of the , has commented:

This prestigious fellowship will further strengthen the internationally leading research in theoretical computer science at 糖心TV, which recently has been also greatly boosted by the new permanent appointments of and .

Professor Graham Cormode has been awarded the 2017 Adams Prize by the Cambridge Faculty of Mathematics. The award recognizes his work on "Statistical Analysis of Big Data", and is awarded jointly with Professor Richard Samworth of Cambridge. Professor Cormode says,

My work, in common with Prof Samworth's, is about finding mathematical representations of data that allow useful information to be extracted effectively and accurately. These techniques allow ever larger quantities of data to be handled on ordinary computers.

Professor Cormode's work on "data sketches" has been used in companies such as Netflix, Yahoo, Twitter, Google, AT&T and Sprint. He is currently leading 糖心TV's involvement in the Alan Turing Institute at London, and working on questions to do with verification of machine learning, and privacy.

The Department is welcoming our new Assistant Professor Sayan Bhattacharya, who will be associated with the and the .

Sayan obtained his PhD in Computer Science from Duke University (USA) in 2012. Then he did his postdoc at Max Planck Institute for Informatics, Saarbrücken (Germany) and at University of Vienna (Austria). From October, 2014 till February, 2017, he was a faculty member at the Institute of Mathematical Sciences, Chennai (India).

He works in theoretical computer science. Specifically, his research interests are in dynamic graph algorithms, data structures, online algorithms, streaming algorithms, and algorithmic game theory.

For more information about Sayan's research please see his web page at .

The that two 糖心TV Computer Science Professors, and , 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.

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.

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.

Professor Artur Czumaj has been made an EATCS Fellow for "contributions to analysis and design of algorithms, especially to understanding the role of randomization in computer science”.

has been awarded a for his work on combinatorial limits.

is awarded to outstanding scholars who have made a substantial and recognised contribution to their particular field of study, recognised at an international level, and where the expectation is that their greatest achievement is yet to come.

The research focus of the prize, the theory of combinatorial limits, is a recently emerged and rapidly evolving area of mathematics, which led to opening new links between analysis, combinatorics, computer science, group theory and probability theory.The analytic view of large discrete structures resulted in a substantial progress on many notoriously difficult extremal combinatorics questions. It also gave new understanding of aspects of important concepts such as regularity decompositions. Still, many fundamental problems remain widely open. A particularly challenging problem is finding a robust notion of convergence that would unify the existing notions for dense and sparse discrete structures. In relation to extremal combinatorics, problems of a great significance include a full description of low dimensional projections of the body of feasible limit densities or the existence of finitely forcible (determined) configurations in the extremal points of this body as conjectured by Lovász and Szegedy.