Derandomization of Euclidean Random Walks

DOI10.1007/978-3-540-74208-1_26zbMath1171.68863OpenAlexW1582332289MaRDI QIDQ3603477

Mark Braverman, Ilia A. Binder

Publication date: 17 February 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_26

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Randomized algorithms (68W20)

Related Items (6)

Computability in harmonic analysis ⋮ Computable Carathéodory theory ⋮ The rate of convergence of the walk on spheres algorithm ⋮ Computability of Brolin-Lyubich measure ⋮ Computable Complex Analysis ⋮ Computable Geometric Complex Analysis and Complex Dynamics

This page was built for publication: Derandomization of Euclidean Random Walks