IFIP Theoretical Computer Science 2012


Personal tools
From TCS 2012
Revision as of 12:11, 25 September 2012 by Michiel Helvensteijn (Talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

The following are all TCS 2012 participants who agreed to be on the online participants list. We update this list every day or so.

Name Affiliation Areas of Interest
Tomasz Brengos Faculty of Mathematics and Information Sciences, Warsaw University of Technology coalgebra
Emmanuel Beffara IML, Université d'Aix-Marseille & CNRS Proof theory, semantics, concurrency, food.
Benedek Nagy University of Debrecen formal languages, computing paradigms
Bas Luttik Eindhoven University of Technology
Steffen van Bakel Imperial College London Type theory, Semantics
Tomas Masopust Institute of Mathematics, Academy of Sciences of the Czech Republic
Hans Bodlaender Utrecht University algorithms
Michela Paolini IMT - Lucca Security and Privacy
Petr Jancar Techn. Univ. Ostrava, CZ
Walter Vogler University of Augsburg concurrency theory
Lei Song IT University of Copenhagen Process Algebra, Probabilistic Model Checking
Yuan Feng University of Technology Sydney Quantum computing and programming
Uwe Nestmann Technische Universität Berlin concurrency theory, distributed algorithms
Andreas Malcher Universität Giessen, Germany
Philipp Küfner TU-Berlin Distributed Algorithms, Verification, Isabelle
Christina Rickmann Technische Universität Berlin
Philippe Schnoebelen LSV / CNSR & ENS Cachan
Colin Riba LIP - ENS Lyon
Naoki Kobayashi University of Tokyo
Ugo Montanari Dipartimento di Informatica, University of Pisa Models of computation
Davide Ancona DIBRIS - Università di Genova Object-oriented programming
Salvatore La Torre University of Salerno
Falak Sher RWTH Aachen
Markus Müller-Olm Universität Münster
Alexander Kurz University of Leicester automata, nominal sets, coalgebras, modal logic, ...
Ulrich Ultes-Nitsche University of Fribourg automata theory
Fabio Gadducci University of Pisa concurrency, logic, semantics
Arnaud Carayol LIGM - Univeristé Paris-Est
Federico Della Croce D.A.I. Politecnico di Torino, Italy Combinatorial optimization
Hongyu Liang Tsinghua University approximation algorithm; combinatorial optimization
Hans Zantema Eindhoven University of Technology algorithms, program correctness, rewriting
Michele Boreale Universita' di Firenze
Thomas Ball Microsoft Research Programming languages, program analysis
Jos Baeten CWI Amsterdam Concurrency, Logic
Frank de Boer CWI Amsterdam Formal Methods
Michiel Helvensteijn CWI Amsterdam Formal Methods, Programming Languages
Hans Hidskes CWI Amsterdam
Joost Winter CWI Amsterdam Coalgebra, Modal Logic
Susanne van Dam CWI Amsterdam
Yuri Gurevich Microsoft Research computer science
Rajeev Alur University of Pennsylvania
Jiří Wiedermann Academy of Sciences of the Czech Republic unconventional computing; cognitive computing; hypercomputing; complexity theory; Church- Turing Thesis