|
LCC'09 MEETING
A Preliminary program (pdf) is now available.
For registration, accommodations, and local
information follow the appropriate links at the LiCS'09
page.
The Tenth International Workshop on Logic and Computational Complexity
(LCC'09, www.cs.indiana.edu/lcc)
will be held in Los Angeles on August 10, 2009, as an affiliated meeting
of LiCS'09
and in conjunction with SAS'09.
LCC meetings are aimed at the foundational interconnections between
logic and computational complexity, as present, for example, in
implicit computational complexity (descriptive and type-theoretic methods);
deductive formalisms as they relate to complexity (e.g. ramification,
weak comprehension, bounded arithmetic, linear logic and resource logics);
complexity aspects of finite model theory and databases;
complexity-mindful program derivation and verification;
computational complexity at higher type; and proof complexity.
The LCC'09 program consists of invited lectures as well as
contributed papers selected by the program committee.
This year there will be no published proceedings, and work submitted
or published elsewhere was welcome, provided all pertinent information
is disclosed at submission time.
LCC'09 INVITED SPEAKERS
LCC'09 PROGRAM COMMITTEE
- Patrick Baillot (CNRS-ENS Lyons, Co-chair)
- Markus Lohrey (Leipzig, Co-Chair)
- Albert Atserias (UP de Catalunya)
- Pablo Barcelo (U de Chile)
- Arnold Beckmann (Swansea)
- Lauri Hella (Tampere)
- Andrei Krokhin (Durham)
- Chris Pollett (San Jose SU)
STEERING COMMITTEE
- Michael Benedikt (Oxford, Co-chair)
- Daniel Leivant (Indiana U, Co-chair)
- Robert Constable (Cornell)
- Anuj Dawar (Cambridge)
- Fernando Ferreira (Lisbon)
- Martin Hofmann (U Munich)
- Neil Immerman (U Mass. Amherst)
- Neil Jones (Copenhagen)
- Bruce Kapron (U Victoria)
- Jean-Yves Marion (LORIA Nancy)
- Luke Ong (Oxford)
- Martin Otto (Darmstadt)
- James Royer (Syracuse)
- Helmut Schwichtenberg (U Munich)
- Pawel Urzyczyn (Warsaw)
|
