Sciweavers

3495 search results - page 31 / 699
» On the random satisfiable process
Sort
View
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 10 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...
CPC
2002
80views more  CPC 2002»
13 years 10 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger