27 Feb - 2 Mar 2013
Kiel, Germany
************************************************************************ STACS 2013 CALL FOR PARTICIPATION 30th International Symposium on Theoretical Aspects of Computer Science February 27-March 2, 2013, Kiel, Germany http://www.stacs2013.uni-kiel.de ************************************************************************ The 30th International Symposium on Theoretical Computer Science (STACS) will be held from February 27 to March 2, 2013 (Wednesday through Saturday), on the premises of the Christian-Albrechts-Universitt zu Kiel. SCIENTIFIC PROGRAM ****************** The program, which is available at http://www.stacs2013/uni-kiel.de/ , is composed of 54 contributed and three invited talks as well as a tutorial. INVITED TALKS AND TUTORIAL ************************** - Kousha Etessami, University of Edinburgh The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games - Kurt Mehlhorn, MPI Saarbrcken and Saarland University Physarum can compute shortest paths - Stphan Thomass, Ecole Normale Suprieure de Lyon Graph Coloring, Communication Complexity and the Stubborn Problem - Dniel Marx, MTA SZTAKI, Hungarian Academy of Sciences (tutorial) Algorithmic Graph Structure Theory REGISTRATION ************ Registration is through the conference website, http://www.stacs2013.uni-kiel.de/ . INFORMATION *********** For detailed information on STACS 2013, visit the conference website, http://www.stacs2013.uni-kiel.de/ . IMPORTANT DATES *************** Early registration deadline: Jan 14, 2013 Regular registration: Jan 15 - Feb 14, 2013 Late registration: Feb 15 - Mar 2, 2013 Symposium: Feb 27 - Mar 2, 2013 CONTACT INFORMATION ******************* info@stacs2013.uni-kiel.de