BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A birthday paradox for Markov chains\, with an optimal bound for c
 ollision in the Pollard Rho algorithm for discrete logarithm - Montenegro\
 , R (Massachusetts Lowell)
DTSTART:20080326T143500Z
DTEND:20080326T150500Z
UID:TALK11288@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR