Sciweavers

APPROX
2007
Springer
88views Algorithms» more  APPROX 2007»
14 years 1 months ago
Derandomization of Euclidean Random Walks
We consider the problem of derandomizing random walks in the Euclidean space Rk . We show that for k = 2, and in some cases in higher dimensions, such walks can be simulated in Lo...
Ilia Binder, Mark Braverman