Postdoc position in algorithms (closing March 31st 2016)

We are seeking to recruit a postdoctoral research fellow to work in the area of designing algorithms for analysing large data sets.

You will be expected to perform high quality research under the supervision of Professor Graham Cormode, as part of the ERC funded project ‘Small Summaries for Big Data’. This can encompass streaming algorithms, sketching and dimensionality reduction, distributed monitoring and mergeable summaries, verification of outsourced computation, or other related topics. The expectation is that you will produce breakthrough research results in the summarisation of large volumes of data, and publish these results in top rated venues.

You will possess a PhD or an equivalent qualification in Computer Science or a very closely-related discipline (or you will shortly be obtaining it). You should have a strong background in one or more of the following areas: randomized and approximation algorithms; communication complexity and lower bounds; streaming or sublinear algorithms.

The post is based in the Department of Computer Science at University of Warwick, but collaborations with closely related research organisations such as the Centre for Discrete Mathematics and its Applications (DIMAP), the Warwick Institute for the Science of Cities (WISC); and the newly formed Alan Turing Institute (ATI) will be strongly encouraged. You will join a team of researchers led by Professor Cormode including other postdoctoral researchers and PhD students.

Candidates should provide with their application form a CV, a list of publications and a research statement.

Closing date: 31st March 2016

More information:


Microsoft EMEA Scholarship in Algorithms for Massive Data Analysis (closed)

This position has been filled.

A Microsoft Research scholarship place is available to study algorithms for massive data analysis, leading to a PhD in Computer Science. Increasingly, we are faced with larger and larger volumes of data from which to extract insights and intelligence. Of particular interest is data that can be represented as a graph or (adjacency) matrix. A promising approach is to look for ways to “sketch” such structures: to build a representation that is much more compact than the input, but which allows some function of interest on the original data to be approximated accurately using the sketch. Such sketches are well-known and widely used for data that can be represented as a vector (such as to identify the most frequent elements, or to count the number of distinct items). The goal of this scholarship project is to develop new algorithms for sketching of massive graphs and matrices, and to demonstrate their usefulness via theoretical analysis and empirical evaluation. The hope is to advance our knowledge of the theory in this area, and design algorithms which can be used in practice, such as for querying data represented as a (massive) graph, clustering/partitioning graph structured data, and optimization problems over large graphs.

The scholarship will support tuition fees and stipend to study at University of Warwick, under the guidance of Professor Graham Cormode and Dr. Milan Vojnovic of Microsoft Research. The Microsoft PhD Scholarship Programme recognises and supports exceptional students who show the potential to make an outstanding contribution to science and computing. Each Microsoft scholarship consists of an annual bursary for up to a maximum of three years.

During the course of their PhD, Scholars are invited to Microsoft Research in Cambridge for an annual Summer School that includes a series of talks of academic interest and posters sessions, which provides the Scholars the opportunity to present their work to Microsoft researchers and a number of Cambridge academics. There is also the possibility of internships at Microsoft Research. Applicants require a first-class Honours degree or equivalent in Computer Science, Mathematics or Computer Engineering, experience in programming and aptitude for mathematical subjects. Knowledge of algorithms, linear algebra, graph theory and probability is essential. A Masters degree is desirable. Before the Scholarship can be awarded the candidate must also undergo the formal admission procedure to the university of Warwick, and approval from Microsoft Research. The scholarship covers fees for students from European Union countries. In exceptional cases, it may be possible to support students from outside the EU.

To apply, please contact Graham Cormode or Milan Vojnovic directly with a CV and description of your experience relevant to this project. Please apply by January 31 2015 for full consideration. Further details and suggested reading is available from Prof. Graham Cormode (

Royal Society Wolfson Research Merit Award

Professor Graham Cormode from the Department of Computer Science, has been awarded a Royal Society Wolfson Research Merit Award.

The Wolfson Research Merit Award is one of the most prestigious UK awards, supported by the Royal Society, the UK’s national academy of science. The scheme provides up to 5 years’ funding after which the award holder continues with a permanent post at the host university. Jointly funded by the Wolfson Foundation and the Department for Business, Innovation and Skills (BIS), the scheme aims to provide universities with additional support to enable them to attract science talent from overseas and retain respected UK scientists of outstanding achievement and potential. Professor Graham Cormode’s research will focus on “Small summaries for big data”.

The Wolfson Foundation is a grant-making charity established in 1955. Funding is given to support excellence and the focus of the award is a salary enhancement.

The Royal Society is a self-governing Fellowship of many of the world’s most distinguished scientists drawn from all areas of science, engineering, and medicine. The Society’s fundamental purpose, reflected in its founding Charters of the 1660s, is to recognise, promote, and support excellence in science and to encourage the development and use of science for the benefit of humanity.

(See also The Royal Society announcement; University of Warwick announcement).

PrivBayes paper presented at SIGMOD 2014

The paper “Privbayes: Private data release via bayesian networks” was presented at the ACM SIGMOD 2014 conference in Utah in June 2014. The paper is a collaboration between Graham Cormode (University of Warwick), Magda Procopiuc, Divesh Srivastava (AT&T Labs Research), Xiaokui Xiao, and Jun Zhang (NTU Singapore). It shows how the private data can be released under the model of differential privacy while preserving much of the original structure of the original data, by using the model of Bayesian networks. These identify the important correlations between attributes in the data, while avoiding the “curse of dimensionality”.