Sciweavers

Share
CORR
2008
Springer

Tight Bounds for Blind Search on the Integers

8 years 3 months ago
Tight Bounds for Blind Search on the Integers
We analyze a simple random process in which a token is moved in the interval A = {0, . . . , n}: Fix a probability distribution
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wege
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Comments (0)
books