Computer Science News
Ian Mertz joins the department as a Research Fellow
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.
PhD positions at the University of Warwick, UK (Application deadline: 4 November, 2022)
PhD positions are available at the Theory and Foundations group in the Department of Computer Science, University of Warwick, UK. The group works on various aspects of theoretical computer science such as:
* automata and formal languages,
* logic and games,
* algorithmic game theory,
* online and dynamic algorithms,
* sublinear and streaming algorithms,
* parameterized complexity and structural graph theory,
* string algorithms,
* parallel algorithms,
* approximation algorithms,
* combinatorial and graph algorithms,
* random structures and randomized algorithms,
* computational complexity,
* privacy-preserving algorithms, cryptography and quantum computing.
The group has strong ties with the Centre for Discrete Mathematics and its Applications (DIMAP), established in 2007 jointly with Warwick Mathematics Institute and Warwick Business School. Together with DIMAP, the group is one of the leading theory groups in Europe, with regular publications in top international conferences and journals in theoretical computer science.
The Department of Computer Science at Warwick offers an excellent research environment. It was ranked 4th in the latest UK research assessment in Research Excellence Framework (REF) in 2021. The University of Warwick is one of the founding members of the Alan Turing Institute.
The university campus is located on the border of two counties, West Midlands and Warwickshire, is about one hour train ride from London, and 15 minutes from Birmingham International Airport.
The applicants are expected to have a strong background in discrete mathematics, algorithms, or related topics with undergraduate and/or Master's degrees in Computer Science, Mathematics, or related disciplines. The position(s) will be fully funded, and the successful applicant(s) will be receiving a stipend at rate in line with current Research Councils UK rates.
If you are interested in this opening, please send an email to either Dr Sayan Bhattacharya (S.Bhattacharya@warwick.ac.uk) or Dr Tom Gur (Tom.Gur@warwick.ac.uk), with a SINGLE .pdf file containing your CV and the names and email addresses of two references, by 4 November 2022. You are strongly encouraged to informally contact faculty members in the group you might want to work with prior to submitting your application.
Shortlisted candidates will be interviewed informally during the week of 14 November - 18 November, 2022.
List of faculty members in the group:
https://warwick.ac.uk/focs/people/<https://warwick.ac.uk/fac/sci/dcs/research/focs/people/>
Centre for Discrete Mathematics and its Applications:
https://warwick.ac.uk/dimap/<https://warwick.ac.uk/fac/cross_fac/dimap/>
Interdisciplinary CS-Physics EPSRC New Horizons Award in Quantum Computing
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.
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.
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.
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!
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.