\n

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

\n \n \nFor more information, see\n htt p://www.aofa2007.org/.\n

\n\n

URL:/NewsandEvents/Events/Conferences/newsitem/158
5/17-22-June-2007-Analysis-of-Algorithms-AofA-07-J
uan-les-Pins-France
END:VEVENT
END:VCALENDAR
The Programme Committee invites pa
pers in

\n -analytic algorithmics and
combinatorics,

\n - probabilistic ana
lysis of algorithms,

\n - randomized a
lgorithms.

\n Submission deadline is F
ebruary 19, 2007.\n