STACS 2015 - 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)

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: parallel, distributed, approximation, and randomized algorithms, computational geometry, cryptography, algorithmic learning theory, algorithmic game theory, analysis of algorithms;
automata and formal languages;
computational complexity, parameterized complexity, randomness in computation;
logic in computer science, including: semantics, specification and verification, rewriting and deduction;
current challenges, for example: natural computing, quantum computing, mobile and net computing.
PROGRAM COMMITTEE
Andris Ambainis, FPM, U Riga
Hagit Attiya, CS, Technion, Haifa
Johannes Blömer, CS, U Paderborn
Mikołaj Bojańczyk, II, U Warsaw
Tomáš Brázdil, Masaryk U, Brno
Niv Buchbinder, SOR, Tel Aviv U
Anuj Dawar, CL, U Cambridge
Adrian Dumitrescu, CS, U Wisconsin-Milwaukee
Matthias Englert, DIMAP/DCS, U Warwick
Funda Ergun, SoIC, Indiana U
Fedor Fomin, IN, U Bergen
Tobias Friedrich, FMI, FSU Jena
Christian Glaßer, I1, U Würzburg
Etienne Grandjean, GREYC, Caen
Tomasz Jurdzinski, U Wroclaw
Manfred Kufleitner, FMI, U Stuttgart
Jerome Leroux, CNRS, LaBRI, Bordeaux
Ernst W. Mayr, TUM, München (co-chair)
Peter Bro Miltersen, CS, U Aarhus
Nicolas Ollinger, LIFO, Orléans (co-chair)
Sylvain Perifel, LIAFA, Paris 7
Jayalal Sarma, IIT, Madras
Nicolas Schabanel, CNRS, LIAFA, Paris 7
Lutz Schröder, FAU Erlangen-Nürnberg
Dimitrios M. Thilikos, CNRS, LIRMM, Montpellier
Gerhard Woeginger, TUE, Eindhoven
INVITED SPEAKERS
Sanjeev Arora, CS, Princeton
Manuel Bodirsky, CNRS, LIX, Palaiseau
Peter Sanders, KIT, Karlsruhe
TUTORIAL
Felix Brandt, TUM, München: Computational Social Choice
tba: Algorithmic Game Theory