STACS 2017 - 34th International Symposium on Theoretical Aspects of Computer Science

Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science. Typical areas include (but are not limited to):
algorithms and data structures,
including: design of parallel, distributed, approximation, and randomized algorithms; analysis of algorithms and combinatorics of data structures; computational geometry, cryptography, algorithmic learning theory, algorithmic game theory;
automata and formal languages,
including algebraic and categorical methods, coding theory;
complexity and computability,
including: computational and structural complexity theory, parameterized complexity, randomness in computation;
logic in computer science,
including: finite model theory, database theory, semantics, specification verification, rewriting and deduction;
current challenges,
for example: natural computing, quantum computing, mobile and net computing.
Program Committee
Olaf Beyersdorff, Leeds
Francine Blanchet-Sadri, Greensboro
Beate Bollig, Dortmund
Nicolas Bonichon, Bordeaux
Jean Cardinal, Bruxelles
Nicolò Cesa-Bianchi, Milano
Leo Ducas, Amsterdam
Arnaud Durand, Paris
Michael Elberfeld, Aachen
Emmanuel Filliot, Bruxelles
Pinar Heggernes, Bergen
Martin Hoefer, Saarbrücken
Giuseppe Italiano, Roma
Emmanuel Jeandel, Nancy
Christian Komusiewicz, Jena
Nutan Limaye, Bombay
Florin Manea, Kiel
Filip Murlak, Warszawa
Seth Pettie, Ann Arbor
Irena Rusu, Nantes
Sylvain Schmitz, Cachan
Frank Stephan, Singapore
Brigitte Vallée, Caen (co-chair)
Heribert Vollmer, Hannover (co-chair)
Ronald de Wolf, Amsterdam
Florian Zuleger, Wien
Invited Speakers
Artur Jeż, Wroclaw, Poland
Antoine Joux, Paris, France
Till Tantau, Lübeck, Germany
Tutorial
Juha Kontinen, Helsinki, Finland