[Prev][Next][Index][Thread]
Program for ICC'03
PROGRAM FOR THE 5TH WORKSHOP ON IMPLICIT COMPUTATIONAL COMPLEXITY
The Implicit Computational Complexity Workshop (ICC'03) will be
held on 26 - 27 June 2003 in Ottawa, Canada as a satellite workshop
of the Logic in Computer Science Conference (LICS'03).
PROVISIONAL PROGRAM
Thursday, 26 June 2003
09.30 - 10.30
Harry Mairson
Explaining resource-bounded lambda calculi to a finite model theorist.
10.30 - 11.00
Coffee
11.00 - 11.45
Olivier Bournez, Felipe Cuker, Paulin Jacobe de Naurois
and Jean-Yves Marion.
Safe recursion over an arbitrary structure: PAR, PH and DPH.
11.45 - 12.30
Lars Kristiansen and Karl-Heinz Niggl
The garland measure and computational complexity of imperative
programs.
12.30 - 14.30
Lunch
14.30 - 15.30
Erich Graedel
Once upon a time in the west: On determinacy, definability, and
complexity of path games.
15.30 - 16.00
Coffee
16.00 - 16.45
Tsuyoshi Morioka
The relative complexity of local search heuristics and the
iteration principle.
16.45 - 17.30
Alan Skelley
A third-order bounded arithmetic theory for PSPACE.
Friday, 27 June 2003
09.30 - 10.30
Albert Atserias
TBA.
10.30 - 11.00
Coffee
11.00 - 12.00
Annie Liu
Iterate, incrementalize, and implement: A systematic approach to
efficiency improvement and guarantees.
12.00 - 12.45
Emanuele Covino and Giovanni Pani
Space complexity analysis for stack programs.
==================================
REGISTRATION AND LOCAL INFORMATION
For registration, hotel, and other local information on ICC'03,
LICS'03, and other satellite workshops, see:
http://www.mathstat.uottawa.ca/lfc/lics2003/localinfo.html
Note: The early registration deadline is May 20.
ACKNOWLEDGMENTS
This year the ICC workshop is supported in part by a generous
grant by Le Centre de Recherches Mathematiques de l'Universite
de Montreal.
WEB PAGES
ICC home page: http://www.cis.syr.edu/~royer/icc/
LICS home page: http://www.lfcs.informatics.ed.ac.uk/lics