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

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

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

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cellular Genetic Disease Seminar Computer Laboratory Security Seminar Rainbow Interaction Seminars

Other talks

Mathematical applications of little string theory Drugs and Alcohol Identification of Active Species and Mechanistic Pathways in the Enantioselective Catalysis with 3d Transition Metal Pincer Complexes Synthetic Cellularity via Protocell Design of Soft Matter Interfaces Mesembs - Actual and Digital Developing a single-cell transcriptomic data analysis pipeline Towards bulk extension of near-horizon geometries Formation and disease relevance of axonal endoplasmic reticulum, a "neuron within a neuron”. Single Cell Seminars (August) 'The Japanese Mingei Movement and the art of Katazome' Single Cell Seminars (October) Missing friars: rethinking late medieval medicine
 

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