BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2011/newsitem/3845/25-
 June-2011-Twelfth-International-Workshop-on-Logic-
 and-Computational-Complexity-LCC-11-Toronto-ON-Can
 ada
DTSTAMP:20110317T000000
SUMMARY:Twelfth International Workshop on Logic an
 d Computational\n      Complexity (LCC'11), Toront
 o ON, Canada
DTSTART;VALUE=DATE:20110625
DTEND;VALUE=DATE:20110625
LOCATION:Toronto ON, Canada
DESCRIPTION:LCC meetings are aimed at the foundati
 onal interconnections between logic and computatio
 nal complexity, as present, for example, in implic
 it computational complexity, deductive formalisms 
 as they relate to complexity, complexity aspects o
 f finite model theory and databases, complexity-mi
 ndful program derivation and verification, computa
 tional complexity at higher type, and proof comple
 xity.   LCC'11 will be held as an affiliated meeti
 ng of LiCS'11. The LCC'11 program will consist of 
 invited lectures as well as contributed papers sel
 ected by the program committee.   For additional i
 nformation see http://www.cs.swansea.ac.uk/lcc2011
 / or contact u.berger at swansea.ac.uk or denis at
  cs.mcgill.ca.    This year there will be no publi
 shed proceedings, and we welcome informal presenta
 tions about work in progress, survey papers, as we
 ll as work submitted or published elsewhere. Paper
  submission deadline is 20 April.
X-ALT-DESC;FMTTYPE=text/html:<div>\n      <p>LCC m
 eetings are aimed at the foundational interconnect
 ions between\n        logic and computational comp
 lexity, as present, for example,  in\n        impl
 icit computational complexity,\n        deductive 
 formalisms as they relate to complexity,\n        
 complexity aspects of finite model theory and data
 bases,\n        complexity-mindful program derivat
 ion and verification,\n        computational compl
 exity at higher type, and proof complexity.\n     
  </p>\n      <p>LCC'11 will be held as an affiliat
 ed meeting of LiCS'11.\n        The LCC'11 program
  will consist of invited lectures as well as\n    
     contributed papers selected by the program com
 mittee.\n      </p>\n    \n      \n      <p>For ad
 ditional information see\n        <a target="_blan
 k" href="http://www.cs.swansea.ac.uk/lcc2011/">htt
 p://www.cs.swansea.ac.uk/lcc2011/</a>\n        or 
 contact <a class="email">u.berger <span class="at"
 >at</span> swansea.ac.uk</a>\n        or <a class=
 "email">denis <span class="at">at</span> cs.mcgill
 .ca</a>.\n      </p>\n    </div><div>\n      <p>\n
         This year there\n        will be no publis
 hed proceedings, and we welcome informal\n        
 presentations about work in progress, survey paper
 s, as well as work\n        submitted or published
  elsewhere.\n        Paper submission deadline is 
 20 April.\n      </p>\n      </div>
URL:/NewsandEvents/Archives/2011/newsitem/3845/25-
 June-2011-Twelfth-International-Workshop-on-Logic-
 and-Computational-Complexity-LCC-11-Toronto-ON-Can
 ada
END:VEVENT
END:VCALENDAR