LCC'20 First Call for Contributions

Martin Avanzini martin.avanzini at
Tue Mar 10 14:15:42 EDT 2020

-------------- next part --------------
(Apologies for cross posting.)

              First Call for Contributions
                       LCC 2020

21th International Workshop on Logic and Computational Complexity
             July 7, 2020, Saarbruecken, Germany
               Collocated with LICS/ICALP 2020

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
program will consist of invited lectures as well as contributed talks
selected by the Program Committee.


 * submission     April 22, 2020
 * notification   May 13, 2020
 * workshop       July 7, 2020


Submissions must be in English and in the form of an abstract of about
3-4 pages. All submissions should be submitted through Easychair at:

We also welcome submissions of abstracts based on work submitted or
published elsewhere, provided that all pertinent information is
disclosed at submission time. There will be no formal reviewing as is
usually understood in peer-reviewed conferences with published
proceedings. The program committee checks relevance and may provide
additional feedback.


Martin Avanzini (INRIA Sophia Antipolis Méditerranée, France, co-chair) 
Diego Figueira  (CNRS Bordeaux, France)
Joanna Ochremiak (CNRS Bordeaux, France)
Magdalena Ortiz (TU Wien, Austria)
Thomas Seiller (CNRS Paris, France)
Jakob Grue Simonsen (University of Copenhagen, Denmark) 
Thomas Zeume (TU Dortmund, Germany, co-chair)


To contact the workshop organizers, please send an e-mail to lcc20 at

More information about the FOM mailing list