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/2007/newsitem/1585/17-
 22-June-2007-Analysis-of-Algorithms-AofA-07-Juan-l
 es-Pins-France
DTSTAMP:20061102T000000
SUMMARY:Analysis of Algorithms (AofA'07), Juan les
  Pins, France
DTSTART;VALUE=DATE:20070617
DTEND;VALUE=DATE:20070622
LOCATION:Juan les Pins, France
DESCRIPTION:Analysis of algorithms is a scientific
  basis for computation, providing a link between a
 bstract algorithms and the performance characteris
 tics of their implementations in the real world. T
 he general effort to precisely predict the perform
 ance of algorithms has come to involve research in
  analytic combinatorics, the analysis of random di
 screte structures, asymptotic analysis, exact and 
 limiting distributions, and other fields of inquir
 y in computer science, probability theory, and enu
 merative combinatorics.   For more information, se
 e http://www.aofa2007.org/.   The Programme Commit
 tee invites papers in  -analytic algorithmics and 
 combinatorics,  - probabilistic analysis of algori
 thms,  - randomized algorithms.  Submission deadli
 ne is February 19, 2007.
X-ALT-DESC;FMTTYPE=text/html:<div>\n      <p>Analy
 sis of algorithms is a scientific basis for comput
 ation, providing \n        a link between abstract
  algorithms and the performance characteristics \n
         of their implementations in the real world
 .\n        The general effort to precisely predict
  the performance of algorithms \n        has come 
 to involve research in analytic combinatorics, the
  analysis of \n        random discrete structures,
  asymptotic analysis, exact and limiting \n       
  distributions, and other fields of inquiry in com
 puter science,\n        probability theory, and en
 umerative combinatorics.\n      </p>\n    \n      
 \n      <p>For more information, see\n        <a t
 arget="_blank" href="http://www.aofa2007.org/">htt
 p://www.aofa2007.org/</a>.\n      </p>\n    </div>
 <div>\n      <p>The Programme Committee invites pa
 pers in<br /> \n        -analytic algorithmics and
  combinatorics,<br />\n        - probabilistic ana
 lysis of algorithms,<br />\n        - randomized a
 lgorithms.<br />\n        Submission deadline is F
 ebruary 19, 2007.\n      </p>\n      </div>
URL:/NewsandEvents/Archives/2007/newsitem/1585/17-
 22-June-2007-Analysis-of-Algorithms-AofA-07-Juan-l
 es-Pins-France
END:VEVENT
END:VCALENDAR
