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/2015/newsitem/5822/4-7
 -March-2015-32nd-International-Symposium-on-Theore
 tical-Aspects-of-Computer-Science-STACS-2015-Garch
 ing-Germany
DTSTAMP:20140629T000000
SUMMARY:32nd International Symposium on Theoretica
 l Aspects of Computer Science (STACS 2015), Garchi
 ng, Germany
DTSTART;VALUE=DATE:20150304
DTEND;VALUE=DATE:20150307
LOCATION:Garching, Germany
DESCRIPTION:The scope of the conference includes a
 lgorithms and data structures, automata and formal
  languages, computational complexity, and logic in
  computer science, ass well as current challenges 
 such as natural computing, quantum computing and m
 obile and net computing. The conference features i
 nvited speakers Sanjeev Arora (CS, Princeton), Man
 uel Bodirsky (CNRS, LIX, Palaiseau) and Peter Sand
 ers (KIT, Karlsruhe), as well as tutorials on Comp
 utational Social Choice (by Felix Brandt, TUM, Mun
 ich) and Algorithmic Game Theory (TBA).   For more
  information, see http://www14.in.tum.de/STACS2015
  or email pc-chairs-stacs2015 at easychair.org (fo
 r information regarding paper submission).    Auth
 ors are invited to submit papers presenting origin
 al and unpublished research on theoretical aspects
  of computer science. Submission deadline: Sep 21,
  2014.
X-ALT-DESC;FMTTYPE=text/html:<div>\n      <p>\n   
      The scope of the conference includes algorith
 ms and data structures, automata and formal langua
 ges,  computational complexity, and logic in compu
 ter science, ass well as current challenges such a
 s natural computing, quantum computing and mobile 
 and net computing.\n        The conference feature
 s invited speakers\n        Sanjeev Arora (CS, Pri
 nceton), Manuel Bodirsky (CNRS, LIX, Palaiseau) an
 d Peter Sanders (KIT, Karlsruhe), as well as tutor
 ials on Computational Social Choice (by Felix Bran
 dt, TUM, Munich) and Algorithmic Game Theory (TBA)
 .\n      </p>\n    \n      \n      <p>For more inf
 ormation, see\n        <a target="_blank" href="ht
 tp://www14.in.tum.de/STACS2015">http://www14.in.tu
 m.de/STACS2015</a>\n        or email <a class="ema
 il">pc-chairs-stacs2015 <span class="at">at</span>
  easychair.org</a> (for information regarding pape
 r submission).\n      </p>\n    </div><div>\n     
  <p>\n        Authors are invited to submit papers
  presenting original and unpublished\n        rese
 arch on theoretical aspects of computer science. \
 n        Submission deadline: Sep 21, 2014.\n     
  </p>\n      </div>
URL:/NewsandEvents/Archives/2015/newsitem/5822/4-7
 -March-2015-32nd-International-Symposium-on-Theore
 tical-Aspects-of-Computer-Science-STACS-2015-Garch
 ing-Germany
END:VEVENT
END:VCALENDAR
