STACS 2014 CALL FOR PARTICIPATION
31st International Symposium on Theoretical Aspects of Computer Science
March 5 -March 8, 2014, Lyon, France
http://stacs2014.sciencesconf.org/
************************************************************************
The 31st International Symposium on Theoretical Computer Science
(STACS) will be held from March 5 to March 8, 2014 (Wednesday through
Saturday), on the premises of the ENS Lyon, France.
SCIENTIFIC PROGRAM
******************
The program, which is available at
http://stacs2014.sciencesconf.org/ ,
is composed of 54 contributed and three invited talks as well as a
tutorial and miniworkshop.
INVITED TALKS AND TUTORIAL
**************************
- Javier Esparza, TUM-Technische Universität München
Keeping a Crowd Safe: On the Complexity of Parameterized Verification
- Peter Bro Miltersen, Aarhus University
Semi-algebraic geometry in computational game theory - a consumer's perspective
-Luc Segoufin, INRIA, École Normale Supérieure de Cachan
A glimpse on constant delay enumeration
- Neeraj Kayal, Microsoft Research India (tutorial)
Arithmetic Circuit Complexity
REGISTRATION
************
Registration will be through the conference website and will open on
Friday, January the 24th.
http://stacs2014.sciencesconf.org/
INFORMATION
***********
For detailed information on STACS 2014, visit the conference website,
http://stacs2014.sciencesconf.org/
There is a limited amount of modest funding to help students: to
apply, write to stacs2014@sciencesconf.org with a letter of your
advisor before Wednesday, February 12th.