Add to ORKGABSTRACT. R. Morris has proposed a probabilistic algorithm to count up to n using only about log e log e n bits. In this paper a slightly more general concept is introduced that allows to obtain a smoother average case behaviour. This concept is general enough to cover the analysis of an algorithm where the randomness is simulated by coin tossings.
Noções de Estatística.A simulation of the statistical properties of the outcome of tosses of many co...
International audienceThe seminal works of Wilf and Nijenhuis in the late 70s have led to efficient ...
International audienceThe seminal works of Wilf and Nijenhuis in the late 70s have led to efficient ...
Abstract. This text is an informal review of several randomized algorithms that have appeared over t...
This paper is an exposition of the solution to the following problem: N players each tosses a fair c...
What is the average number of coin tosses needed before a particular sequence of heads and tails fir...
What is the average number of coin tosses needed before a particular sequence of heads and tails fir...
What is the average number of coin tosses needed before a particular sequence of heads and tails fir...
We present an algorithm for effectively generating binary sequences which would be rated by people a...
AbstractTo examine the concept of random generation in bounded, as opposed to expected, polynomial t...
AbstractTo examine the concept of random generation in bounded, as opposed to expected, polynomial t...
Consider the following guessing game: Lucy thinks of a number that is in between 0 and 100 and James...
Consider the problem of computing the majority of a stream of n i.i.d. uniformly random bits. This p...
In this paper a general method for the generation of discrete uniform random deviates from random bi...
This monograph studies two classical computational problems: counting the elements of a finite set o...
Noções de Estatística.A simulation of the statistical properties of the outcome of tosses of many co...
International audienceThe seminal works of Wilf and Nijenhuis in the late 70s have led to efficient ...
International audienceThe seminal works of Wilf and Nijenhuis in the late 70s have led to efficient ...
Abstract. This text is an informal review of several randomized algorithms that have appeared over t...
This paper is an exposition of the solution to the following problem: N players each tosses a fair c...
What is the average number of coin tosses needed before a particular sequence of heads and tails fir...
What is the average number of coin tosses needed before a particular sequence of heads and tails fir...
What is the average number of coin tosses needed before a particular sequence of heads and tails fir...
We present an algorithm for effectively generating binary sequences which would be rated by people a...
AbstractTo examine the concept of random generation in bounded, as opposed to expected, polynomial t...
AbstractTo examine the concept of random generation in bounded, as opposed to expected, polynomial t...
Consider the following guessing game: Lucy thinks of a number that is in between 0 and 100 and James...
Consider the problem of computing the majority of a stream of n i.i.d. uniformly random bits. This p...
In this paper a general method for the generation of discrete uniform random deviates from random bi...
This monograph studies two classical computational problems: counting the elements of a finite set o...
Noções de Estatística.A simulation of the statistical properties of the outcome of tosses of many co...
International audienceThe seminal works of Wilf and Nijenhuis in the late 70s have led to efficient ...
International audienceThe seminal works of Wilf and Nijenhuis in the late 70s have led to efficient ...