Skip to main content Skip to navigation

Computer Science News

Select tags to filter on

Latest academic promotions

We are happy to announce five promotions in the department, with effect from 1st August 2023.

  • Dr James Archbold has been promoted to Associate Professor (Teaching Focussed)
  • Dr Richard Kirk has been promoted to Assistant Professor (Teaching Focussed)
  • Dr Claire Rocks has been promoted to Reader (Teaching Focussed)
  • Dr Ian Saunders has been promoted to Associate Professor (Teaching Focussed)
  • Dr Sathya Subramanian has been promoted to Assistant Professor (Research Focussed)

Many congratulations to our colleagues for all their achievements!

Promotion to Assistant Professor

We are happy to share the news that Dr Alex Dixon has been promoted to the position of Assistant Professor, effective from 1 May 2023. Alex joined our department as a Teaching Fellow in September 2021, while still completing his PhD research. Despite juggling both roles, he has made significant contributions to the department's activities. Many congratulations to Alex for his accomplishments in completing his PhD research and for earning this well-deserved promotion.

Tue 09 May 2023, 09:00 | Tags: People Highlight Theory and Foundations

Amina Asif joins the department as a Teaching Fellow

We are happy to announce that Dr Amina Asif has joined the Department of Computer Science as a Teaching Fellow. Amina has previously worked with us as part of the Tissue Image Analytics (TIA) centre, where her research focussed on weak supervision and model robustness in Computational Pathology. We welcome her to the department!

Mon 20 Mar 2023, 16:09 | Tags: People Highlight Applied Computing

Cambridge-Oxford-Warwick Quantum Computing Project

An EPSRC Robust and Reliable Quantum Computing Grant will be awarded to Anuj Dawar (Cambridge), Tom Gur (Warwick), Tom Melham (Oxford), and Sergii Strelchuk (Cambridge). The project sets out to explore the role of symmetry and structure in quantum computation, with applications to classical verification and simulation of quantum computation.

In addition, the project aims to strengthen and create new connections and collaborations between Cambridge, Oxford, and Warwick in the field of Quantum Computing (building on existing initiatives such as the Cambridge-Warwick Quantum Colloquium) and establish new partnerships with Warwick Quantum.

Tue 28 Feb 2023, 13:54 | Tags: Grants Theory and Foundations

5+ papers accepted to STOC 2023

ACM logoSTOC logo SIGACT logo

Several papers from the Theory and Foundations (FoCS) Research Group and the Centre for Discrete Mathematics and its Applications (DIMAP) have been accepted to the 55th ACM SIGACT Symposium on Theory of Computing (STOC 2023), the ACM flagship conference in theoretical computer science that will be held on June 20-23, 2023 in Orlando, Florida, USA:

Further, there are two more accepted papers autored by Shuichi Hirahara, who was affiliated with the department and the FoCS group during the submission time, in Autumn 2022:

  • "Capturing one-way functions via NP-hardness of meta-complexity" by Shuichi Hirahara.
  • "Hardness self-amplification: Simplified, optimized, and unified" by Shuichi Hirahara and Nobutaka Shimizu.
Sun 19 Feb 2023, 12:18 | Tags: Research Theory and Foundations

Prof. Adi Shamir receives Honorary Doctorate from Warwick

Prof. Adi ShamirProf. Adi Shamir (Weizmann Institute of Science), the world-renowned cryptographer and a recipient of the ACM Turing Award 2002 (the highest honour in computer science received jointly with Prof. Ronald Rivest and Prof. Leonard M. Adleman), visited our campus in January 2023 to collect an Honorary Doctorate from the University of Warwick. During his visit, Prof. Shamir gave also a research talk at the DIMAP seminar and CS Colloquium entitled "Efficient Detection of High Probability Cryptanalytic Properties of Boolean Functions."

Prof. Paterson introducing Prof. Shamir in DIMAP seminarProf. Shamir has been known in Warwick since 1976, when he spent a year as a post-doc with our own Prof. Mike Paterson. Directly after Warwick Prof. Shamir went to MIT, where together with Adleman and Rivest he invented the famous RSA public-key cryptography algorithm for encoding and decoding messages, used nowadays by millions to securely transmit messages over the internet. The work on RSA has been immensely influential and led to the 2002 A.M. Turing Award for the three co-inventors, cited for the “ingenious contribution for making public-key cryptography useful in practice.” Other noticeable awards (for RSA and other numerous contributions to cryptography and computing) received by Prof. Shamir include the 2000 Institute of Electrical and Electronics Engineers Koji Kobayashi Computers and Communications Award, the Israel Mathematical Union Erdős Prize in Mathematics (1983), the Vatican Pontifical Academy PIUS XI Gold Medal (1992), the Association for Computing Machinery Paris Kannellakis Theory and Practice Award (1996), the Israel Prize in Computer Science (2008), and the Japan Prize in the field of electronics, information, and technology (2017), and the Foreign Member of the Royal Society (2018).

Complexity breakthrough by Dr Shuichi Hirahara

Dr Shuichi Hirahara, a research fellow affiliated with the Theory and FoundationsLink opens in a new window group and an Associate Professor at the National Institute of Informatics in Tokyo, has made a significant advance towards our understanding of the limits and possibilities of efficient computations. In his recent paper "NP-Hardness of Learning Programs and Partial MCSP", published at the 63rd IEEE Annual Symposium on Foundations of Computer Science (FOCS 2022), Dr Hirahara established the NP-hardness of learning efficient programs and of estimating the circuit complexity of an explicitly given partial Boolean function. The main result of the paper addresses a question that dates back to the pioneering work of Stephen Cook and Leonid Levin on the theory of NP-completeness from the 1970s.

The new result has been presented at several institutions, including UT Austin, Columbia University, Warwick (Online Complexity Seminar), MIT, and the Simons Institute for the Theory of Computing at UC Berkeley. The latter is running a semester-long program on "Meta-Complexity" that is closely related to Hirahara's recent contributions.

You can read more about it at the popular Computational Complexity Blog, where the discovery has been named "Complexity Result of the Year" (see also Gödel’s Lost Letter and P=NP).
Fri 03 Feb 2023, 17:36 | Tags: People Highlight Research Theory and Foundations

Older news