FIELDS/MITACS WORKSHOP
Probabilistic Methods in Wireless Networks
August 21-24 (Sunday to Wednesday), 2011
Carleton University
Ottawa
TUTORIALS
1) Random Geometric Graphs
Luc Devroy (McGill University),
2) Stochastic Geometry and Wireless Networks
Francois Baccelli (INRIA and ENS)
3) Queueing Theory and Wireless Networks
Doug Down (McMaster University),
PLENARY TALKS
1) Clustering for Colourings of Random Graphs
Mike Molloy (University of Toronto),
2) Disjoint Hamilton Cycles in the Random Geometric Graph
Nick Wormald (University of Waterloo),
3) The Cover Time of Random Geometric Graphs
Alan Frieze (CMU),
4) Colouring Random Geometric Graphs
Colin McDiarmid (Oxford University).
===
To submit contributed talk send title and abstract to
either of the organizers
Evangelos Kranakis and Yiqiang Zhao
Depending on fund availability, limited financial
support may be possible for out-of-Ottawa students
registered in Canadian Universities. To be considered
please indicate so no later than July 15.
For registration and additional details see:
http://people.scs.carleton.ca/~kranakis/conferences/pmnet.html
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
