Workshop on Combinatorics, Probability and Algorithms
|
Registration and Accomodation Schedule Titles and abstracts
Nota bene: Encrypted registration has been optimized for Internet Explorer and Netscape browsers only |
Description of the workshop
Leave nothing to chance. This cliché embodies the common belief that randomness has no place in well-planned methodologies, every i should be dotted and every t should be crossed. In discrete mathematics, at least, nothing could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of probabilistic tools has led to the resolution of combinatorial problems which have resisted attack for decades. A month-long concentration period will take place around this general theme. Lecturers at the school will introduce participants to a number of weapons, mostly from the probabilistic arsenal, and their applications in combinatorics and in the study of algorithms. We anticipate a significant amount of collaboration between participants at the school during the month. |
Speakers
V. Chvatal (Rutgers), A. Frieze (Carnegie-Mellon), G. Lugosi (Pompeu Fabra, Barcelona), C. McDiarmid (Oxford), M. Molloy (Toronto), J. Pach (City College New York and Hungarian Academy of Sciences), ainsi que des conférences de N. Alon (Technion). Aisenstadt Chair speakers are L. Lovàsz (Microsoft Research) and E. Szemeredi (Rutgers). |
Student support
Support is available for graduate students and post-doctoral fellows attending this event. A request for funds must be accompanied by a reference letter from the student's research director and a C.V. Please send your application for financial aid by March 31, 2003 to: Scientific Activities Centre de recherches mathématiques Université de Montréal C.P. 6128, Succursale Centre-ville, Montréal (Québec) CANADA H3C 3J7
|
Links to further information |
March 21, 2003, webmestre@CRM.UMontreal.CA