Skip to main content Skip to navigation

Computer Science News

Select tags to filter on

Outstanding MSc students

The department would like to congratulate our 2021-2022 MSc students on their end-of-year results. Additional congratulations go to the following outstanding students, who have been awarded academic prizes:

photo thumbnail for 2192453
  • Herby Bowen - best overall graduating MSc student in Computer Science
photo thumbnail for 2087644
  • George Wright - best MSc dissertation in Computer Science entitled "Countering Antimicrobial Resistance with Machine Learning"
photo thumbnail for 2188740
  • Kartik Jain - best overall graduating MSc student in Data Analytics and best MSc dissertation in Data Analytics entitled "Football analytics: A novel approach to estimate success"
Thu 05 Jan 2023, 15:54 | Tags: People Courses Highlight Research Faculty of Science Teaching

Dr Igor Oliveira awarded an ERC Starting Grant

The European Research Council (ERC) has announced that Dr Igor OliveiraLink opens in a new window is among the winners of its prestigious Starting Grant competition. According to the European Research Council: "The funding is worth in total €636 million and is part of the Horizon Europe programme. It will help excellent younger scientists, who have 2 to 7 years’ experience after their PhDs, to launch their own projects, form their teams and pursue their most promising ideas."

Igor OliveiraLink opens in a new window has been awarded a €1.5M ERC Starting grant for a 5-year project entitled "Synergies Between Complexity and Learning". The project aims to exchange ideas and techniques between Complexity Theory and Learning Theory to accelerate progress in both fields, broaden the arsenal of tools available to attack their open problems, as well as to obtain a deeper understanding of the nature of efficient computation and of its logical aspects.

Two projects in Computer Science and Informatics (PE6 panel) in the United Kingdom were awarded ERC Starting Grants in the 2022 round. The press releaseLink opens in a new window contains more information about the ERC funding programme.

Wed 23 Nov 2022, 07:39 | Tags: Highlight Research Theory and Foundations

SC22 Best Visualization Award Win for the Full Aero-Engine Compressor Visualization by Warwick Researchers

Numerical simulations and visualizations developed by researchers from the High Performance and Scientific Computing (HPSC) group at Warwick’s Department of Computer Science in collaboration with Rolls-Royce, PPCU Hungary and Universities of Surrey and Birmingham has won the award for the best Visualization in the Scientific Visualization and Data Analytics Showcase at the 2022 Supercomputing (SC) Conference, held in Dallas TX. SC is the premier international conference on supercomputing providing a major forum for presenting the highest level of accomplishments in high-performance computing, networking, storage, and analysis. It is held annually in the US and attended by over 10000 attendees from all over the world.

Christian Ikenmeyer joins the Department of Computer Science and the Warwick Mathematics Institute as a Professor

We are happy to announce that Prof Christian Ikenmeyer joined the Department of Computer Science and the Warwick Mathematics Institute on October 1st 2022. In his research, he combines ideas and challenges from theoretical computer science, algorithmic algebra, algebraic complexity theory, algebraic geometry, representation theory, and algebraic combinatorics. We welcome him to the department!

Wed 09 Nov 2022, 12:49 | Tags: People Highlight Theory and Foundations

Best Paper Award at SODA 2023

We are delighted to announce that the paper "Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time", coauthored by Sayan Bhattacharya and Peter Kiss from the Theory and Foundations Research Division at Warwick, along with Thatchaphol Saranurak (University of Michigan) and David Wajc (Stanford University), has received the best paper award at SODA 2023.

Computing a maximum matching in a graph is a fundamental problem in combinatorial optimisation. The paper considers this problem in a dynamic graph, which keeps changing over time via a sequence of edge insertions and deletions. It was a decade-old open question to decide whether one can beat the performance guarantee of the simple greedy algorithm for this problem (which gives 2 approximation), in a dynamic setting. The paper answers this question in the affirmative, and provides the first efficient dynamic algorithm which can maintain a better-than 2 approximation to the size of the maximum matching in the input graph.

Wed 19 Oct 2022, 21:55 | Tags: Highlight Research Theory and Foundations

Ian Mertz joins the department as a Research Fellow

We're happy to announce that Ian Mertz has joined the department as a Research Fellow. He is currently funded by the project "New approaches to unconditional computational lower bounds", with support from the Royal Society.

Ian Mertz completed his PhD at the University of Toronto in 2022 under the supervision of Toniann Pitassi, with stints at the Simons Institute for the Theory of Computing (UC Berkeley) and at the Institute for Advanced Study in Princeton.

Ian's primary research area is computational complexity theory. His interests at the moment include catalytic computing, lifting theorems, arithmetic circuit complexity, and proof complexity.

Tue 11 Oct 2022, 09:19 | Tags: People Highlight Theory and Foundations

Latest two academic promotions

We are happy to announce two promotions in the department.

Dr Fayyaz Minhas has been promoted to Associate Professor from 1 July 2022.

Dr Rossella Suma has been promoted to Assistant Professor from 1 August 2022.

Many congratulations to our colleagues for all their achievements!

Fri 22 Jul 2022, 10:10 | Tags: People Highlight Applied Computing

Older news