Skip to main content Skip to navigation

Theory and Foundations News

Archive news content can be found here.

Select tags to filter on

Interdisciplinary CS-Physics EPSRC New Horizons Award

We are delighted to report that Dr Tom Gur (Warwick CS) and Dr Animesh Datta (Warwick Physics) have been awarded an EPSRC New Horizons on "Property Testing for Quantum Engineering". This project aims to bring together computer scientists and physicists towards the end of designing new approaches for fault-tolerant quantum computing.

Thu 29 Sep 2022, 09:44 | Tags: Research Theory and Foundations

Shuichi Hirahara joins the department as a Research Fellow

We're happy to announce that Shuichi Hirahara has joined the department as a Research Fellow.

Shuichi completed his PhD at the University of Tokyo in 2019. He is currently an Associate Professor at the National Institute of Informatics, Tokyo.

Shuichi's primary research area is computational complexity theory. During his stay at Warwick, he will be involved in the activities of a joint project with the University of Oxford on the limits and possibilities of efficient algorithms.

Wed 07 Sep 2022, 21:56 | Tags: People Theory and Foundations

Best paper award at MFCS 2022

We are happy to announce that Torsten Mütze (left in the picture), assistant professor in the Theory and Foundations Research Division, has won the Best Paper Award at the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022) for the paper "The Hamilton compression of highly symmetric graphs", authored jointly with his student Arturo Merino (TU Berlin; middle) and Petr Gregor (Charles University Prague; right). The paper proposes a new graph parameter that measures the amount of symmetry present in its Hamilton cycles, and it investigates this parameter for a wide range of interesting highly-symmetric graphs. It combines methods from combinatorics, number theory and algebra, and connects the new parameter to several related problems that researchers have studied intensively. The MFCS best paper award is sponsored by the European Association for Theoretical Computer Science.

Mon 05 Sep 2022, 12:00 | Tags: Theory and Foundations

Promotion to Associate Professor

We are happy to announce that Dr Dmitry Chistikov has been promoted to Associate Professor from 1 April 2022. Since joining Warwick in 2017, Dmitry has made a significant contribution to the department with his research, teaching, and administrative and supportive roles. Many congratulations to Dmitry for all his achievements!

Wed 06 Apr 2022, 16:03 | Tags: People Highlight Theory and Foundations

Four papers accepted to STOC 2022

We are pleased to report that members of the department's Theory and Foundations research theme have had four papers accepted to the 54th ACM Symposium on Theory of Computing (STOC 2022), the ACM flagship conference in theoretical computer science. The papers are:

  • "Deterministic Massively Parallel Connectivity" by Sam Coy and Artur Czumaj.
  • "Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios", by Matthias Englert, Nicolaos Matsakis, and Pavel Veselý.
  • "Hypercontractivity on High Dimensional Expanders" by Tom Gur, Noam Lifshitz, and Siqi Liu.
  • "Worst-Case to Average-Case Reductions via Additive Combinatorics" by Vahid R. Asadi, Alexander Golovnev, Tom Gur, and Igor Shinkar.
Sat 12 Feb 2022, 22:54 | Tags: Research Theory and Foundations

Best Student Paper Award at ITCS 2022

We are delighted to announce that Peter Kiss, a PhD student in the Theory and Foundations Research Division, has won the Best Student Paper Award at the Innovations in Theoretical Computer Science (ITCS) 2022 conference for his single-author paper on "Deterministic Dynamic Matching in Worst-Case Update Time". Computing a maximum matching in a graph is one of the most fundamental problems in design and analysis of algorithms. The paper makes important progress on this problem in a setting where the input graph is changing over time via a sequence updates, and one wishes to maintain a large matching efficiently in such a dynamic graph. Along the way, the paper develops a general purpose technique for converting any dynamic algorithm with amortised update time into one with worst-case update time, provided the initial algorithm is able to handle a more general form of batch updates.

Tue 18 Jan 2022, 18:21 | Tags: Conferences Research Theory and Foundations

Alex Dixon joins the department as a Teaching Fellow

We are very pleased to welcome Alex Dixon, a new Teaching Fellow in our department.

Alex first joined the department in 2013, originally as an undergraduate student, and then as a postgraduate student studying automata theory. He has a keen interest in logic, automata, and functional programming.

We look forward to having him in the team!

Fri 01 Oct 2021, 16:09 | Tags: People Highlight Theory and Foundations

Older news