We are pleased to report that members of the department's Theory and Foundations research theme have had 6 papers accepted to the 47th International Colloquium on Automata, Languages and Programming, the main European conference in Theoretical Computer Science and annual meeting of the European Association for Theoretical Computer Science. The papers are:
- On the central levels problem by Petr Gregor, Ondřej Mička and Torsten Mütze
- Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming by Timothy Chan, Jacob Cooper, Martin Koutecký, Dan Král and Kristýna Pekárková
- The Complexity of Verifying Loop-free Programs as Differentially Private by Marco Gaboardi, Kobbi Nissim and David Purser
- Rational subsets of Baumslag-Solitar groups by Michaël Cadilhac, Dmitry Chistikov and Georg Zetzsche
- The Strahler number of a parity game by Laure Daviaud, Marcin Jurdzinski and K. S. Thejaswini
- On the power of ordering in linear arithmetic theories by Dmitry Chistikov and Christoph Haase
The Department of Computer Science and the Mathematics Institute jointly hosted, last Saturday 7th December, the Christmas Meeting for 2019 of the British Society for the History of Mathematics.
Our Departments have a long and strong association with the BSHM which has an established tradition of having its Christmas meeting in the Midlands. With about 50 participants, including some staff and students from both our Departments, there were 8 talks in the day ranging from figurate numbers in the 9th century, Islamic use of sexagesimal calculation for π and sine values in the 15th century, to fascinating details of Victorian data processing and the mathematical semantics of programming languages in more recent times.
There were plenty of interesting questions arising and lively discussions in the refreshment intervals. There was also a presentation of the BSHM Neumann Prize and the Society's AGM.
The day was widely acclaimed as enjoyable and successful. Our thanks are due to both Departments for their sponsorship, to the admin and technical support in Computer Science, and to the local organising work of Steve Russ and Adam Jones. Further information about the BSHM is at https://www.bshm.ac.uk/.
Full list of speakers:
- Helen Ross - Dicuil and triangular numbers
- Steve Russ - Visions in the night: Bolzano's anticipations of continuity
- Jane Wess - From Newton to Newcomen: mathematics and technology 1687-1800
- Troy Astarte - On the difficulty of describing difficult things
- Catalin Iorga - Known and unknown in Al-Kashi's mathematics
- Robin Wilson - Hunting and counting trees: the world of Cayley and Sylvester
- Chris Pritchard - From collecting coins to searching the archives: personal reflections on becoming a historian of mathematics
- Martin Campbell-Kelly - Victorian data processing
We are pleased to report that members of the department's Theory and Foundations research theme have had 7 papers accepted to the 31st Annual ACM-SIAM Symposium on Discrete Algorithms, to be held in Salt Lake City, Utah, USA, January 5-8, 2020. SODA is the premier international conference on algorithms research, and the papers are:
- Parameterized Complexity and Approximability of Directed Odd Cycle Transversal by M. S. Ramanujan, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
- An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs by Sayan Bhattacharya, Janardhan Kulkarni
- Coarse-Grained Complexity for Dynamic Algorithms by Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak
- Combinatorial Generation via Permutation Languages by Elizabeth Hartung, Hung P. Hoang, Torsten Mütze, Aaron Williams
- On the Power of Relaxed Local Decoding Algorithms by Tom Gur, Oded Lachish
- Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity by Alessandro Chiesa, Tom Gur, Igor Shinkar
- Sublinear time approximation of the cost of a metric k-nearest neighbor graph by Artur Czumaj, Christian Sohler
The contribution The Reachability Problem for Petri Nets is Not Elementary by Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jerome Leroux and Filip Mazowiecki has won a Best Paper Award at the 51st Annual ACM Symposium on the Theory of Computing, to be held on June 23-26, 2019 in Phoenix, AZ.
This work, which was supported by a Leverhulme Research Fellowship, shows that the central verification problem for Petri nets is much harder than has been known since the landmark result of Richard Lipton in 1976. Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and database systems, as well as chemical, biological and business processes.
This year’s Warwick Postgraduate Colloquium in Computer Science, WPCCS 2018, took place on Friday 29th June. The colloquium, an annual student-run event, showcased research performed by the postgraduate research (PGR) students in Computer Science, the Centre for Discrete Mathematics and its Applications (DIMAP) and the CDT in Urban Science and Progress.
Continuing a new tradition for the colloquium, this year’s event was held in The Oculus, University of Warwick. In addition to presentations from students in each of the department’s research areas, staff and external speakers offered guest talks. These centred on language design patterns in 2018, the evolution and horizons of Field Programmable Gate Arrays (FPGAs), and WebEXR, an online high dynamic range image viewer.
Florin Ciucu, the director of postgraduate research studies in the Department of Computer Science, said of the event:
WPCCS is an excellent opportunity for our students to widely expose where they currently stand in their research. It’s a fantastic way for them to contribute by sharing their research experiences, ideas and visions with their peers and the wider research community.
WPCCS 2018 showcased over 45 presentations and 25 posters of the latest research in the Department of Computer Science. WPCCS aims to foster an air of collaborative research amongst the department’s PGR students and open many conversations between the department’s postgraduate researchers and others. Thank you to all who attended and participated, we look forward to seeing you again next year.
To find out more about WPCCS 2018 or to provide feedback, please visit https://warwick.ac.uk/wpccs18.
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
DIMAP Logic Day 2015
On June 1st 2015, our Division of Theory and Foundations, jointly with DIMAP, organized DIMAP Logic Day 2015. The goal of the event was to bring together the UK community of researchers and graduate students interested in the study of logics, automata and games.
The event had an outstanding list of invited speakers from leading academic institutions and research labs (Nathalie Bertrand, INRIA Rennes; Antonin Kucera, Brno; Slawomir Lasota, Warsaw; Davide Sangiorgi, Bologna, INRIA Sophia Antipolis; Sylvain Schmitz, Cachan, INRIA Saclay, Warwick; James Worrell, Oxford) presenting recent advances in logic in computer science, and attracted over 40 participants from the UK and abroad.