University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm

Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani .

Combinatorics and Statistical Mechanics

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Faculty of Education, 184 Hills Road, Cambridge, CB2 8PQ, DMB, Room TBC Rooms SG1 & SG2, Alison Richard Building, 7 West Road, Cambridge, CB3 9DT Institute of Metabolic Science (IMS), Level 4 ATC, Seminar rooms 1,2 & 3

Other talks

Morning Tea and Coffee Professor Philip Rosenstiel, W3 Professor of Clinical Molecular Biology, Director, Institute of Clinical Molecular Biology (IKMB), Kiel University Title to be confirmed The United States of America at 250: Reflections on the Past, Present and Future of Independence Title to be confirmed Early cancer clinical trials
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity