We are delighted to report that Dr Theo Damoulas and Dr Gihan Mudalige have successfully completed their probations early, and become Associate Professors at the start of this month. Quoting from their probationary review reports,

Gihan has had a number of successes with attracting substantial research funding, most recently for two projects with AWE PLC, and one with Rolls Royce PLC. A further major success is Gihan’s Royal Society Industrial Fellowship, which will run over the next 4 academic years at 50% of Gihan’s time. ... Dr Gihan Mudalige is an outstanding and valuable member of the department’s academic staff, whose many likely future contributions to both research and teaching we are looking forward to.

and

Dr Theo Damoulas is a valuable asset to both Computer Science and Statistics departments in all of the research, teaching, administration and collegiality areas. Theo is already a next-generation research leader at the national and international levels, in particular enhancing the university's partnerships with the Alan Turing Institute, CUSP London, King's College London, and New York University.

it remains to say many congratulations!

Adi Shamir, the Paul and Marlene Borman Professor of Applied Mathematics at the Weizmann Institute of Science, has been elected this week a Foreign Member of the Royal Society. He is a co-inventor of the RSA algorithm (along with Ron Rivest and Len Adleman), a co-inventor of the Feige–Fiat–Shamir identification scheme (along with Uriel Feige and Amos Fiat), one of the inventors of differential cryptanalysis and has made numerous contributions to the fields of cryptography and computer science.

In 1976/77, Adi was a post-doctoral researcher in Computer Science at Warwick!

In the Logic, Semantics, Automata and Theory of Programming track of the 45th International Colloquium on Automata, Languages, and Programming (ICALP), three out of 30 accepted papers are by members of the department. ICALP is one of the most selective and longest established international conferences in computer science, and the flagship annual event of the European Association for Theoretical Computer Science. The papers are:

• Reducing CMSO Model Checking to Highly Connected Graphs by Ramanujan M. S., Daniel Lokshtanov, Saket Saurabh and Meirav Zehavi
• O-Minimal Invariants for Linear Loops by Shaull Almagor, Dmitry Chistikov, Joel Ouaknine and James Worrell
• When is Containment Decidable for Probabilistic Automata? by Laure Daviaud, Ranko Lazić, Marcin Jurdziński, Filip Mazowiecki, Guillermo Perez and James Worrell