Erik Demaine's List of Events

Disclaimer Turn on help bubbles

Calendar for    
Search for keywords in sorted by    
           Note: Searching for nothing will return all events, sorted as you like.
Filter for events with dates no earlier than days, months, and years in the past.
Filter for events with dates no later than days, months, and years in the future.
Subfilter: include entries that match filters, not whole events.
Generate iCalendar

STACS 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000

STACS 2013: 30th International Symposium on Theoretical Aspects of Computer Science

Due: September 21, 2012
When: February 27 – March 2, 2013
Where: Kiel, Germany
Accept: December 7, 2012
Final: January 9, 2013
URL: http://www.stacs2013.uni-kiel.de/ [Wayback]
Topics: algorithms, automata, complexity, logic
Paper
count:
266 submitted

STACS 2012: 29th International Symposium on Theoretical Aspects of Computer Science

Due: September 23, 2011
When: February 29 – March 3, 2012
Where: Paris, France
Accept: November 29, 2011
Final: January 2, 2012
URL: http://stacs2012.lip6.fr/ [Wayback]
Topics: algorithms, automata, complexity, logic

STACS 2011: 28th International Symposium on Theoretical Aspects of Computer Science

Due: September 24, 2010
When: March 10–12, 2011
Where: TU Dortmund, Dortmund, Germany
Accept: November 29, 2010
Final: January 3, 2011
URL: http://www.stacs2011.de/ [Wayback]
Topics: algorithms, automata, complexity, logic

STACS 2010: 27th International Symposium on Theoretical Aspects of Computer Science

Due: September 22, 2009
When: March 4–6, 2010
Where: LORIA, Nancy, France
Accept: November 26, 2009
Final: December 18, 2009
URL: http://stacs.loria.fr/ [Wayback]
Topics: algorithms, automata, complexity, logic

STACS 2009: 26th International Symposium on Theoretical Aspects of Computer Science

Due: September 15, 2008 (23:59 CET)
When: February 26–28, 2009
Where: Freiburg, Germany
Accept: November 19, 2008
Final: December 12, 2008
URL: http://stacs2009.informatik.uni-freiburg.de/ [Wayback]
Topics: algorithms, automata, complexity, logic
PC: Susanne Albers (cochair; Univ. of Freiburg), Andris Ambainis (Univ. of Latvia), Philippe Baptiste (Ecole Polytechnique & CNRS LIX), Holger Bast (MPI Saarbrücken), Patricia Bouyer (CNRS & ENS Cachan), Martin Dietzfelbinger (TU Ilmenau), Zoltán Ésik (Univ. of Szeged & Univ. of Tarragona), Christiane Frougny (Univ. Paris 8 & LIAFA CNRS), Leonid Libkin (Univ. of Edinburgh), Meena Mahajan (Inst. of Math. Sciences Chennai), Jean-Yves Marion (cochair; Nancy-Univ. & Loria), K. Narayan Kumar (Chennai Math. Inst.), Friedrich Otto (Univ. of Kassel), Joël Ouaknine (Oxford Univ.), Harald Räcke (Univ. of Warwick), Eric Rémila (CNRS & Univ. St-Etienne), Adi Rosén (CNRS & Univ. of Paris 11), Martin Skutella (TU Berlin), Jeremy Spinrad (Vanderbilt Univ.), Kavitha Telikepalli (IISc Bangalore), Thomas Wilke (Univ. of Kiel), Philipp Woelfel (Univ. of Calgary)
Plenary: Monika Henzinger (EPFL Lausanne), Jean-Éric Pin (CNRS & Univ. Paris 7), Nicole Schweikardt (Univ. of Frankfurt)
Paper
count:
282 submitted (100.0%)
54 accepted (19.1%)

STACS 2008: 25th International Symposium on Theoretical Aspects of Computer Science

Due: September 17, 2007 (12:00 GMT+2; extended from September 14, 2007)
When: February 21–23, 2008
Where: Bordeaux, France
Accept: December 2, 2007
Final: December 23, 2007
Register: January 15, 2008 (early)
URL: http://www.stacs-conf.org [Wayback]; http://stacs08.labri.fr [Wayback]
Topics: algorithms, automata, complexity, logic
PC: Manindra Agrawal, Susanne Albers (cochair), Danièle Beauquier, Mikoaj Bojaczyk, Nadia Creignou, Anna Gál, Naveen Garg, Kazuo Iwama, Juhani Karhumäki, Hartmut Klauck, Kamal Lodaya, Christof Löding, Frédéric Magniez, Peter Bro Miltersen, Vahab Mirrokni, Seth Pettie, Eric Rivals, Nicole Schweikardt, Christian Sohler, Howard Straubing, Klaus Wagner, Pascal Weil (cochair)
Plenary: Maxime Crochemore, Thomas Schwentick, Mihalis Yannakakis

STACS 2007: 24th International Symposium on Theoretical Aspects of Computer Science

Due: September 18, 2006
When: February 22–24, 2007
Where: Aachen, Germany
Accept: November 22, 2006
Final: December 15, 2006
URL: http://www-i7.informatik.rwth-aachen.de/stacs07 [Wayback]
Topics: algorithms, automata, complexity, logic
PC: E. Asarin, C. Bazgan, M.-P. Béal, G.S. Brodal, H. Fernau, R. Fleischer, R. Gavaldà, J. Giesen, E. Hemaspaandra, M. Hofmann, S. Laplante, R. Raman, R. Ramanujam, C. Scheideler, A. Srivastav, W. Thomas (cochair), P. Weil (cochair)
OC: E. Grädel, Ch. Löding, P. Rossmanith, W. Thomas, B. Vöcking
Plenary: Serge Abiteboul, Moshe Y. Vardi, Dorothea Wagner
Fee: EUR 250 (early), EUR 320 (late)

STACS 2006: 23rd International Symposium on Theoretical Aspects of Computer Science

Due: September 19, 2005 (extended from September 16, 2005)
When: February 23–25, 2006
Where: Marseille, France
Accept: November 23, 2005
Final: December 14, 2005
URL: http://www.lif.univ-mrs.fr/STACS06 [Wayback]
Topics: algorithms, automata, complexity, logic
Plenary: Philippe Flajolet, Leonid Levin, Helmut Seidl

STACS 2005: 22nd International Symposium on Theoretical Aspects of Computer Science

Due: September 7, 2004
When: February 24–26, 2005
Where: Stuttgart, Germany
Accept: November 4, 2004
Final: December 6, 2004
URL: http://stacs05.fmi.uni-stuttgart.de/ [Wayback]
Topics: algorithms, automata, complexity, logic
Plenary: Manindra Agrawal, Mireille Bousquet-Mélou, Uwe Schöning

STACS 2004: 21th International Symposium on Theoretical Aspects of Computer Science

Due: September 15, 2003
When: March 25–27, 2004
Where: Montpellier, France
Accept: November 24, 2003
Final: January 15, 2004
URL: http://www.lirmm.fr/stacs2004/ [Wayback]
Topics: algorithms, automata, complexity, logic
Plenary: Claire Kenyon, Erich Grädel, Robin Thomas

STACS 2003: 20th International Symposium on Theoretical Aspects of Computer Science

Due: September 7, 2002
When: February 27 – March 1, 2003
Where: Berlin, Germany
Accept: November 6, 2002
Final: December 6, 2002
URL: http://page.inf.fu-berlin.de/~stacs03/ [Wayback]
Topics: algorithms, automata, complexity, logic
Plenary: Victor Vianu, Alain Viari

STACS 2002: 19th International Symposium on Theoretical Aspects of Computer Science

Due: September 21, 2001 (extended from September 14, 2001)
When: March 14–16, 2002
Where: Antibes Juan-les-Pins, France
Accept: November 21, 2001
Final: December 14, 2001
URL: http://www-sop.inria.fr/stacs2002/ [Wayback]
Topics: algorithms, automata, complexity, logic
Plenary: Michael O. Rabin, Christian Scheideler, Gilles Dowek

STACS 2001: 18th International Symposium on Theoretical Aspects of Computer Science

Due: August 28, 2000
When: February 15–17, 2001
Where: Dresden, Germany
Accept: November 3, 2000
Final: November 29, 2000
URL: http://wwwtcs.inf.tu-dresden.de/STACS2001/ [Wayback]
Topics: algorithms, automata, complexity, logic
Plenary: Julien Cassaigne, Martin Grohe, Dexter Kozen

STACS 2000: 17th International Symposium on Theoretical Aspects of Computer Science

Due: September 5, 1999
When: February 17–19, 2000
Where: University of Lille, Lille, France
Accept: November 5, 1999
Final: November 29, 1999
Register: January 17, 2000 (early)
Hotel: January 17, 2000
URL: http://www.lifl.fr/stacs2000/ [Wayback]
Topics: algorithms, automata, complexity, logic
Plenary: Mohammad Amin Shokrollahi, Tom Henzinger, Pascal Koiran