News & Events
Publication success at ICALP'19
The department has been very successful at the upcoming International Colloquium on Automata, Languages and Programming (ICALP 2019), with five papers being accepted for presentation, covering all three tracks.
The accepted papers are:
Track A (Algorithms, complexity and games):
Unique End of Potential Line - John Fearnley, Spencer Gordon, Ruta Mehta and Rahul Savani.
Track B (Automata, logic, semantics, and theory of programming):
Büchi Objectives in Countable MDPs - Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi and Patrick Totzke.
Track C (Foundations of networks and multi-agent systems):
How fast can we reach a target vertex in stochastic temporal graphs? - Eleni C. Akrida, George Mertzios, Sotiris Nikoletseas, Christoforos
Raptopoulos, Paul Spirakis and Viktor Zamaraev.
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem - Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos and Paul Spirakis.
Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader - Dariusz Kowalski and Miguel A. Mosteiro.