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/2018/newsitem/9668/13-
 July-2018-19th-International-Workshop-on-Logic-and
 -Computational-Complexity-LCC-2018-Oxford-England
DTSTAMP:20180208T152906
SUMMARY:19th International Workshop on Logic and C
 omputational Complexity (LCC 2018), Oxford, Englan
 d
DTSTART;VALUE=DATE:20180713
DTEND;VALUE=DATE:20180713
LOCATION:Oxford, England
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 2018 will be part of FLoC 2018.  The pro
 gram will consist of invited lectures by Mikolaj B
 ojanczyk (University of Warsaw) and Ugo Dal Lago (
 University of Bologna and INRIA Sophia Antipolis),
  as well as contributed talks selected by the Prog
 ram Committee.  We welcome submissions of abstract
 s based on work submitted or published elsewhere, 
 provided that all pertinent information is disclos
 ed at submission time. There will be no formal rev
 iewing as is usually understood in peer-reviewed c
 onferences with published proceedings. The program
  committee checks relevance and may provide additi
 onal feedback. Submissions must be in English and 
 in the form of an abstract of about 3-4 pages.
X-ALT-DESC;FMTTYPE=text/html:<div>\n  <p>LCC meeti
 ngs are aimed at the foundational interconnections
  between logic and computational complexity, as pr
 esent, for example, in implicit computational comp
 lexity; deductive formalisms as they relate to com
 plexity; complexity aspects of finite model theory
  and databases; complexity-mindful program derivat
 ion and verification; computational complexity at 
 higher type; and proof complexity. LCC 2018 will b
 e part of FLoC 2018.</p>\n\n  <p>The program will 
 consist of invited lectures by Mikolaj Bojanczyk (
 University of Warsaw) and Ugo Dal Lago (University
  of Bologna and INRIA Sophia Antipolis), as well a
 s contributed talks selected by the Program Commit
 tee.</p>\n</div><div>\n  <p>We welcome submissions
  of abstracts based on work submitted or published
  elsewhere, provided that all pertinent informatio
 n is disclosed at submission time. There will be n
 o formal reviewing as is usually understood in pee
 r-reviewed conferences with published proceedings.
  The program committee checks relevance and may pr
 ovide additional feedback. Submissions must be in 
 English and in the form of an abstract of about 3-
 4 pages.</p>\n</div>
URL:http://www.cs.swansea.ac.uk/lcc/
END:VEVENT
END:VCALENDAR