The Isaac Newton Institute for Mathematical Sciences

Markov-chain Monte Carlo Methods

Montenegro, 2008-03-26: A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm

[no_frames] [help] [search]

Multimedia

presentation material as:
[Adobe PDF 593kB]

Video

entire talk as:
Flash 87MB [download][play]
MP4 193MB [download]
QuickTime 73MB [download][play]
Real 158MB [download][play]
WMV 79MB [download]

Sound

entire talk as:
[MP3 11MB]

Pictures

section 1 section 2 section 3 section 4 section 5 section 6 section 7 section 8 section 9 section 10 section 11 section 12 section 13 section 14 section 15 section 16 section 17 section 18 section 19 section 20 section 21 section 22 section 23 section 24 section 25 section 26 section 27 section 28 section 29 section 30 section 31