Title :
Probability and Computation
Author_Institution :
Dept. of Inf., Kyushu Univ., Fukuoka, Japan
fDate :
Nov. 30 2011-Dec. 2 2011
Abstract :
What is the property that a randomized algorithm really requires for randomness? This note reviews some randomized algorithms which the author has been concerned with, having been motivated by the above question.
Keywords :
probability; randomised algorithms; probability; randomized algorithm; randomness; Algorithm design and analysis; Approximation algorithms; Approximation methods; Markov processes; Monte Carlo methods; Polynomials; Prediction algorithms; Markov chain Monte Carlo; coupling from the past; randomized algorithms; rotor-router model;
Conference_Titel :
Networking and Computing (ICNC), 2011 Second International Conference on
Conference_Location :
Osaka
Print_ISBN :
978-1-4577-1796-3
DOI :
10.1109/ICNC.2011.67
