4-7 March 2015, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), Garching, Germany

The scope of the conference includes algorithms and data structures, automata and formal languages, computational complexity, and logic in computer science, ass well as current challenges such as natural computing, quantum computing and mobile and net computing. The conference features invited speakers Sanjeev Arora (CS, Princeton), Manuel Bodirsky (CNRS, LIX, Palaiseau) and Peter Sanders (KIT, Karlsruhe), as well as tutorials on Computational Social Choice (by Felix Brandt, TUM, Munich) and Algorithmic Game Theory (TBA).

For more information, see http://www14.in.tum.de/STACS2015 or email pc-chairs-stacs2015 at easychair.org (for information regarding paper submission).