| LCC'06 | 8th International Workshop on Logic and Computational Complexity Seattle, August 10 - 11, 2006 |
Program
All sessions will take place in Suite 3128 unless otherwise indicated.
Thursday, August 10th
Thursday's program is also available with abstracts or side by side with other meetings.
09:25‑09:30 Welcome to LCC06
09:30‑10:30 Session 1: Invited Talk
| 09:30 | Toniann Pitassi (Department of Computer Science, University of Toronto) TBA |
10:30‑11:00 Break
11:00‑12:30 Session 2
| 11:00 | Patrick Baillot
, Ugo Dal Lago
and Jean-Yves Moyen
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity |
| 11:45 | Marion Jean-Yves and Pechoux Romain Quasi-friendly sup-interpretations |
12:30‑14:00 Lunch break
14:00‑15:30 Session 3
| 14:00 | Antonina Kolokolova, Yongmei Liu, David Mitchell
and Eugenia Ternovska Complexity of Expanding a Finite Structure and Related Tasks |
| 14:45 | Murray Patterson
, Yongmei Liu, Eugenia Ternovska and Arvind Gupta Grounding for Model Expansion in $k$-Guarded Formulas |
15:30‑16:00 Break
16:00‑17:00 Session 4: Invited Talk
| 16:00 | Neil Jones (Department of Computer Science, University of Copenhagen) The Spectrum Problem from a Computer Science Perspective [pdf] |
Friday, August 11th
Friday's program is also available with abstracts or side by side with other meetings.
09:30‑10:30 Session 5: Invited Talk
| 09:30 | John C Mitchell (Computer Science Department, Stanford University) Computationally Sound Formal Logic for Network Security Protocols [ppt] |
10:30‑11:00 Break
11:00‑12:30 Session 6
12:30‑14:00 Lunch break
14:00‑14:45 Session 7
| 14:00 | Johann A. Makowsky
Logical and Computational Aspects of Graph Polynomials: A Survey |
