Logic and Computational Complexity

An International Workshop Series


 

Home

Call for papers

Steering-Com

Past-meetings

LCC'12 MEETING

The 13th International Workshop on Logic and Computational Complexity (LCC'12) will be held in Dubrovnik on Sunday, June 24, 2012, as an affiliated meeting of LiCS'12.

LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in descriptive complexity; implicit computational complexity; 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'12 program will consist of invited lectures as well as contributed papers selected by the program committee.

INVITED SPEAKERS

  • Yijia Chen (Shanghai)
  • Etienne Grandjean (Caen)
  • Ugo Dal Lago (Bologna)
  • Olivier Laurent (Lyon)
  • Leonid Libkin (Edinburgh)
  • Ulrich Schöpp (Munich)
  • Iddo Tzameret (Beijing)

PROGRAMME (pdf)

9:00 - 9:50
Yijia Chen (Shanghai): Levin's optimal inverters
9:50 - 10:20
Coffee break
10:20 - 11:10
Etienne Grandjean (Caen): An invitation to linear time complexity
11:10 - 12:00
Ugo Dal Lago (Bologna): Implicit complexity: Some new perspectives
12:00 - 12:20
Daniel Leivant (Bloomington): Alternating Turing machines and the analytical hierarchy
12:20 - 14:00
Lunch break
14:00 - 14:50
Olivier Laurent (Lyon): Complexity-directed denotational models of linear logic
14:50 - 15:40
Leonid Libkin (Edinburgh): Finite validity via model checking: computing certain answers
15:40 -16:00
Coffee break
16:00 - 16:50
Ulrich Schöpp (Munich): On type systems for logarithmic space and compiling with continuations
16:50 - 17:40
Iddo Tzameret (Beijing): Recent developments in algebraic and proof complexity
17:40 - 18:00
Reinhard Kahle (Lisboa): From provably total functions to algorithms
18:00 - 18:20
Matthieu Perrinel (Lyon): On the expressivity of linear logic subsystems characterizing polynomial time

PROGRAM COMMITTEE

  • Albert Atserias (Barcelona)
  • Patrick Baillot (Lyon)
  • Arnold Beckmann (Swansea)
  • Guillaume Bonfante (Nancy)
  • Steve Cook (Toronto)
  • Jörg Flum (Freiburg, Co-Chair)
  • Martin Grohe (Berlin)
  • Isabel Oitavem (Lisbon, Co-Chair)
  • Thomas Schwentick (Dortmund)
  • Denis Therien (Montreal)

IMPORTANT DATES

  • Paper submission deadline: April 13, 2012
  • Authors' notification: May 1, 2012

REGISTRATION

Registration for LCC 2012 jointly with LICS can be done via the LiCS web page. Registration for LCC 2012 alone is also possible via that page.