McGill University - School of Computer Science

Algorithms Seminar Winter 2000

Everybody is welcome.

The Algorithms Seminar (formerly "Computational Geometry Seminar") usually takes place on Wednesdays, 16h30-17h30, in room 320 of the McConnell building. Occasionally, it may be moved to Fridays 12h00-13h00. 

Seminars in Winter 2000:
Wednesday, May 17th 3:30pm-4:30pm, 2000:    Dr. Jeong Kim, Microsoft Research
Phase Transitions of Random Graph and Random Satisfiability Problem  
Thursday, April 20th 11:00am-12:00pm, 2000:   Claudia Iturriaga, University of New Brunswick: Faculty of Computer Science
Labeling Maps with Elastic Labels  
Wednesday, March 29th 4:30pm-5:30pm, 2000:  Colin McDiarmid, Oxford University  
Graph Imperfection  
Wednesday, March 15th 4:30pm-5:30pm, 2000:  Artur Czumaj, New Jersey Institute of Technology  
Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem  
Tuesday, February 2nd 4:30pm-5:30pm, 2000:  Mike Molloy, Dept. of Computer Science, University of Toronto  
The mixing rate of the Glauber dynamics on graph colourings  
Tuesday, January 4th 4:30pm-5:30pm, 2000:  Mark Grundland,  
Generating Aperiodic Tilings Using Quasicrystals 

Other related seminars and talks:
Seminars in Fall 1999
Seminars in Fall 1998
Seminars in Winter 1998
Seminars in Fall 1997

Direct questions, comments, additions to and removals from the mailing list, and suggestions for speakers to us at