[TYPES] CFP: Workshop on Logic & Computational Complexity Workshop
Jim Royer
royer at ecs.syr.edu
Wed May 12 17:29:18 EDT 2004
Sixth International Workshop on
LOGIC AND COMPUTATIONAL COMPLEXITY (LCC 2004)
(formerly, Implicit Computational Complexity)
12-13 July 2004 Turku, Finland
The Logic and Computational Complexity Workshop (LCC'04) will be a
satellite workshop of both the 31st International Colloquium on Automata,
Languages and Programming (ICALP'04) and the Nineteenth Annual IEEE
Symposium on Logic in Computer Science (LICS 2004).
The early registration deadline is May 31. See below for registration
information.
PRELIMINARY PROGRAM
MONDAY MORNING, JULY 12
Stephen Cook (University of Toronto)
Making Sense of Bounded Arithmetic
Victor Dalmau (University of Oxford)
The Complexity of Retraction Problems
Andrei Bulatov (University of Oxford)
Polymorphisms of Relational Structures
MONDAY AFTERNOON, JULY 12
Phokion Kolaitis (University of California, Santa Cruz)
Data Exchange: Aspects of Logic and Complexity
Patrick Baillot (University of Paris 13)
Type Inference for Light Affine Logic Via Constraints on Words
Jean-Yves Marion (LORIA Nancy)
Resource Analysis by Quasi-Interpretations
TUESDAY MORNING, JULY 13
Daniel Leivant (Indiana University Bloomington)
Implicit Complexity Via Logics of Programs
Kazushige Terui (National Institute of Informatics)
Decomposition of Computation Via Linear Logic
James Royer (Syracuse University)
Adventures in Time and Space
Abstracts of these talks are available at the workshop homepage:
http://www.cis.syr.edu/~royer/icc/LCC04/
REGISTRATION
The registration pages for ICALP, LICS, LCC, and all other ICALP-LICS
workshops can be found at
http://www.math.utu.fi/ICALP04/registration.html
Please note that May 31 is the deadline for early registration.
More information about the Types-list
mailing list