Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

CORR
2008
Springer

favoriteEmaildiscussreport

108views Education» more CORR 2008»

Tight Bounds for Blind Search on the Integers

13 years 4 months ago

Tight Bounds for Blind Search on the Integers

Download drops.dagstuhl.de

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

Real-time Traffic

CORR 2008 | Education | Probability Distribution | Random | Simple Random Process |

claim paper

Related Content

» MultiTerminal Net Routing for Partial CrossbarBased MultiFPGA Systems

» An InOut Approach to Disjunctive Optimization

» A local search approximation algorithm for kmeans clustering

» The cell probe complexity of dynamic range counting

Post Info
More Details (n/a)

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)