Eleven papers (co)authored by members of the Oxford University Departement of Computer Science have been accepted at the 43rd International Colloquium on Automata, Languages, and Programming (ICALP), one of the premier conferences in theoretical computer science, taking place in Rome in July.
The Oxford papers:
Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas and
David Richerby. Amplifiers for the Moran Process
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo and Daniel
Štefankovič . Approximation via Correlation Decay when Strong Spatial
Andreas Galanis, Leslie Ann Goldberg and Mark Jerrum. A complexity
trichotomy for approximately counting list H-colourings
Amos Fiat, Anna Karlin, Elias Koutsoupias, Claire Mathieu and Rotem Zach.
Carpooling in Social Networks
Olivier Bournez, Daniel Graça and Amaury Pouly. Polynomial Time
corresponds to Solutions of Polynomial Ordinary Differential Equations of
Polynomial Length. The General Purpose Analog Computer and Computable
Analysis are two efficiently equivalent models of computations
Maria Bruna, Radu Grigore, Stefan Kiefer, Joel Ouaknine and James Worrell.
Proving the Herman-Protocol Conjecture
Ventsislav Chonev, Joel Ouaknine and James Worrell. On the Skolem Problem
for Continuous Linear Dynamical Systems
Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi and
James Worrell. On Restricted Nonnegative Matrix Factorization
Thomas Colcombet and Nathanaël Fijalkow. The Bridge Between Regular Cost
Functions and Omega-Regular Languages
Logic of Local Inference for Contextuality in Quantum Physics
Dmitry Chistikov and Christoph Haase. The Taming of the Semi-Linear Set