First Montreal-Ottawa Analysis of Algorithms Day

We are starting this year a series of meetings dedicated to the analysis of algorithms. The organizers are Luc Devroye (McGill) and Daniel Panario (Carleton). The idea of the meeting is to congregate the people of the region that are interested in mathematical analysis of algorithms and their tools. We mean by that: average-case and probabilistic analysis of algorithms, with tools from probability, asymptotic enumeration, and so on. For more information on this area of research check the Analysis of Algorithms Home Page.

The 1st Montreal-Ottawa AofA Day will be held in room 4351 of the Herzberg Laboratories, Carleton University, Ottawa, Ontario, Canada on Saturday June 23, 2001. The schedule is as follows:

• Friday 22: people arrive at Ottawa; informal talks during the day; dinner together.
• Saturday 23: talks during the day; party at night.
• Sunday 24: informal talks; brunch together; end of meeting.

The idea is to pass a weekend together in a relaxed, friendly, and productive environment. Thus, we are thinking of a small number of talks leaving a lot of free time for discussions. Information regarding the tentative list of participants and titles of talks, abstracts of the talks, accommodation, and parking are or will be available below, and will be updated regularly.

It would be very helpful if you would let the organizers know if you plan to attend. Please be so kind as to forward this webpage link to any colleagues and students who might be interested. Thank you and hope to see you at the conference.

• Luc Devroye (McGill University)
• Jason Gao (Carleton University)
• Pawel Hitczenko (Drexel University)
• Hsien-Kuei Hwang (Academia Sinica, Taiwan)
• Conrado Martinez (Universitat Politecnica de Catalunya, Spain)
• Amram Meir (York University) (not confirmed)
• Ralph Neininger (McGill University)
• Daniel Panario (Carleton University)
• Boris Pittel (The Ohio State University, USA)
• Bruce Reed (CNRS, France)
• Bruce Richmond (University of Waterloo)
• Gilles Schaeffer (LORIA, France)
• Alfredo Viola (Universidad de la Republica, Uruguay)

Program

Saturday June 22, 2001

• 9:00 Hsien-Kuei Hwang : ``Analysis in distribution of two randomized maximum-finding algorithms in a broadcast communication model''
• 10:05 Ralph Neininger : ``The contraction method''
• 11:00 Coffee break
• 11:30 Boris Pittel : ``Random proposal graphs, or why not give nerds a second chance''
• 12:30 Lunch and walk along the river

• 2:30 Conrado Martinez : ``On the complexity of unranking and ordered generation of labelled combinatorial structures''
• 3:05 Gilles Schaeffer : ``Random generation of triangulations''
• 4:00 Pawel Hitczenko : ``Random partitions with rth differences nonnegative''
• 4:30 Coffee break
• 5:00 Alfredo Viola : ``The effect of deletions on different insertion disciplines for hash tables''
• 5:35 Bruce Reed : ``The variance of the height of random binary search trees''
• 6:30 End of meeting

See the abstracts of the talks.

Accommodation

• Residence: for a room in residence on campus see
  http://www.carleton.ca/housing/tourandconf/individualbookings.htm
• Bed and Breakfast:
  • By-the-Way, 310 First Avenue, Ottawa, K1S 2G8,
    Fax/Tel: (613) 232-6840.
  • By-the-Pond, 18 Wilton Crescent, Ottawa, K1S 2T5,
    Tel: (613) 236-5693; Fax: (613) 236-9302.
• Hotel: for hotel accomomodations see http://www.ottawa.com and go to accommodations.

Parking

If you are planning to park your car on Carleton's campus on Friday June 22, please e-mail the organizer for a parking permit well in advance of the conference. You should park in one of the ``pay and display'' parking lots (lots P2 and P6) with your permit displayed. Otherwise, you will have to pay. A map of the campus can be found at http://www.carleton.ca/cu/campus/. Parking is free on Saturday June 23 and Sunday June 24.

Address