Tübingen's Frontiers of Theory: Lectures and Research (TüFTLeR)
Next meeting: June 5th to June 10th
Tübingen's Frontiers of Theory: Lectures and Research (TüFTLeR) is a twice-yearly week-long seminar dedicated to the study of several aspects of theoretical computer science, including but not limited to:
- Circuit complexity,
- Automata theory,
- Algebraic techniques in automata theory and beyond,
- Logic, descriptive complexity, and formal systems.
The TüFTLeR is organized by the Theoretische Informatik (theoretical computer science) laboratory of the University of Tübingen. Attendance to the seminar is offered to the members of the laboratory and to additional invited top researchers, in similar proportions. The schedule is evenly split between lectures and work sessions.
The TüFTLeR takes place in a country-style cottage around Tübingen at the end of Summer and of Winter, typically lasting 5 days. A suggested program is handed a couple of weeks before by the organizers, for discussion. The participants are encouraged to present their work in progress, rather than past work, in order to stimulate the work sessions.
The remote and calm environment provides an ideal workplace for researchers, while also enabling good social interaction. In particular, the participants share all of their meals, and an afternoon is usually reserved for a hike through the surrounding forest.
The first TüFTLeR took place in 2014. Here follows a list of all the previous TüFTLeR, the topic list not being meant to be exhaustive:
Winter 2017 (February 27th to March 4th):
Peter Chini, Silke Czarnetzki, Demen Güler, Henning Fernau, Benjamin Gras, Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig, Roland Meyer, Meenakshi Paramasivan, Sebastian Muskalla, Ingo Skupin, Petra Wolf
Visibly pushdown automata, parametrized complexity, verification, game theory, formality
Summer 2016 (September 5th to September 9th):
Silke Czarnetzki, Henning Fernau, Lukas Fleischer, Till Fluschnik, Moses Ganardi, Danny Hermelin, Andreas Krebs, Klaus-Jörn Lange, Markus Lohrey, Michael Ludwig, Hendrik Molter, Rolf Niedermeier, Ingo Skupin, Thomas Stüber, Jan Philipp Wächter, Petra Wolf
Algebraic and topological methods, visibly pushdown automata, tree languages, parametrized complexity
Winter 2016 (February 9th to February 14th):
Michaël Cadilhac, Silke Czarnetzki, Demen Güler, Andreas Krebs, Klaus-Jörn Lange, Martin Lavoie, Michael Ludwig, Pierre McKenzie, Charles Paperman, Sebastian Schöner, Ingo Skupin, Karteek Sreenivasaiah, Thomas Stüber, Petra Wolf
Stone duality, catalytic space, algebraic automata theory, formality, visibly pushdown automata
Winter 2015 (February 16th to February 21st):
Tree automata and forest algebras, proof systems, Parikh automata, transducers and circuits, duality
Summer 2014 (August 25th to August 30th):
Algebraic and topological methods, visibly pushdown automata, dense completeness, uniformity in branching programs