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:
\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
\n \n \nFor more inf ormation, see\n http://www14.in.tu m.de/STACS2015\n or email pc-chairs-stacs2015 at easychair.org (for information regarding pape r submission).\n
\n Authors are invited to submit papers prese nting original and unpublished\n research o n theoretical aspects of computer science. \n Submission deadline: Sep 21, 2014.\n
\ n