What people are saying - Write a review
Randomized Communication in Radio Networks
Preliminaries 3 Sequential Derandomization 4 Parallel Derandomization and Kwise Independence 5 Hypergraph2Coloring and Discrepancies 6 Hype...
Classifying Markov Chains
InfinitelyMany Users Models
FinitelyMany Users Models
Randomized vs Deterministic Algorithms for BlackBox Programs Vladik Kretnovich and Raul Trejo 1 2 3
Statistical Setting Error Estimation for Indirect Measurement Interval Setting Necessity and Possibility of Parallelization Error Estimation for Indirect ...
Random Walks and Expander Properties in Random Regular Graphs with Edge Faults
Robust Decentralized Computations Through Randomization
Other editions - View all
ACM Symposium analysis applications arrival rate backoff balls balls-and-bins problem bins broadcast channel Chernoff bounds choose combinatorial computational geometry Computer Science configuration consider constant Contraction Algorithm convex hull delay sequence denote deterministic algorithm distribution edges elements estimate event expected number exponential fixed function Geom geometric geometric optimization problems given high probability IEEE independent input integer intersection Lazy PRM Lemma linear programming live processors logn lower bound Markov chain maximum flow messages minimum cut Monte Carlo nodes O(logn optimization problems packet Parallel Algorithms partition performed permutation planner points polynomial PRAM probabilistic probability at least Proc proof protocol pruning query queue radio networks Rajasekaran random graph random sampling random variables randomized algorithm randomized rounding randomly recursive roadmap robot Section selection server simulation skip list sorting stations step subproblem subset superstep technique Theorem threads total number vertex vertices witness tree
Page xi - ... one which bases some of its decisions on the outcomes of coin flips. We can think of the algorithm with one possible sequence of outcomes for the coin flips to be different from the same algorithm with a different sequence of outcomes for the coin flips. Therefore, a randomized algorithm is really a family of algorithms. For a given input, some of the algorithms in this family might run for an indefinitely long time. The objective in the design of a...