On this recent article in the Quanta magazine, Alex Dixon, who wrote in Haskell the first solver for the problem, commented:

For the past 50 years, Vector Addition Systems—a simple but powerful computational model—have been a topic of great interest in theoretical CS. The reachability problem in that model asks whether we can get from some configuration to another.

The problem sounds relatively easy on a first glance, and an exponential lower bound held firm for over 40 years. Work by excellent theoreticians, including familiar names from Warwick DCS, finally closed the difficulty of the problem in 2021, concluding that it is very, very difficult indeed.

We are happy to announce that Dr Paris Giampouras has joined the Department of Computer Science as an Assistant Professor. Originally from Greece, he has relocated to Warwick from Baltimore, where he spent four years working as a Postdoctoral Fellow and later as a Research Faculty member at the Mathematical Institute for Data Science at Johns Hopkins University. His expertise lies in machine learning theory and its applications in image processing and computer vision. More specifically, his research has focused on exploring parsimonious representations to address various inverse problems and adversarial robustness.

Currently, he is focusing on two main areas: a) leveraging structured representation in Generative AI applications, and b) developing algorithms that enable continual learning of various tasks for deep learning systems. His goal is to contribute to the foundational understanding of AI algorithms, with a focus on robustness, applications of AI in medicine, and climate change.

We welcome him to the department!

We are happy to announce that Dr Fanghui Liu and Dr Debmalya Mandal have joined the Department of Computer Science as Assistant Professors.

Fanghui finished his PhD degree at Institute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University in 2019. Then he gained the research experience in Europe as a postdoc researcher, at ESAT-STADIUS, KU Leuven from 2019 to 2021 and Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland from 2021 to 2023, respectively. His research interests include machine learning, statistical learning theory as well as applications in trustworthy machine learning systems.

Debmalya completed his Master’s degree in Computer Science and Automation from Indian Institute of Science, and his PhD in Computer Science from Harvard University, where he was also part of the EconCS group. He then gained experience as a postdoctoral researcher at the Data Science Institute of Columbia University, and at the Max Planck Institute of Software Systems. He is broadly interested in the theoretical foundations of AI/ML systems and often incorporate tools from computational social choice, game theory, and machine learning theory in his research. He is currently working on fairness in machine learning, reinforcement learning, and the exciting problem of AI alignment.

We welcome them both to the department!

We are happy to announce that Dr Ayse Saliha Sunar has joined the Department of Computer Science as a Teaching Fellow. She completed her Master's degree on Intelligent Tutoring Systems at Nagoya University and her PhD on Big Educational Data Analysis and Recommender Systems at the University of Southampton.

She then gained experience in teaching in Turkey and in research collaboration, including European project proposals in Slovenia on integrating cutting-edge technologies into educational and other social contexts. Her current research interests include technology-enhanced learning to improve teachers' and faculties' pedagogical skills, as well as applications of natural language processing in classrooms and hybrid teaching models.

We welcome her to the department!

We are delighted to announce that Peter Kiss, a PhD student in the Theory and Foundations Research Division, has received the best student paper award at European Symposium on Algorithms (ESA) 2023, for his joint work with Joakim Bilkstad for the paper: "Incremental (1-eps)-approximate dynamic matching in O(poly(1/eps)) update time". The paper considers the problem of maintaining a large matching in a graph that is undergoing a sequence of edge insertions. They present an algorithm for this fundamental problem in dynamic graph algorithms, which has near-optimal approximation ratio and an update time that does not grow at all with the size of the input and is also polynomial in 1/\eps (the error parameter). In addition, their approach is simpler than previous algorithms on the same problem that achieved weaker guarantees.

Edgaras Purauskas, Technician in the Department of Computer Science received the Warwick Technician Commitment Award for Outstanding Achievement. Edgaras was one of two recipients of these inaugural awards, which received over 40 nominations campus wide. Edgaras had a number of nominations for his "consistently exceptional work" and his "deep understanding of computer systems, software, and hardware". Many congratulations Edgaras and thank you for your extraordinary efforts!

We are happy to announce that Dr Gihan Mudalige and Dr Victor Sanchez have both been promoted to Professor from 1st August 2023.

Many congratulations to our colleagues for all their achievements!