Handbook of randomized computing. 1

Front Cover
Sanguthevar Rajasekaran
Springer Science & Business Media, 2001 - Computers - 941 pages
 

What people are saying - Write a review

User Review - Flag as inappropriate

I am finding this book exceptionally useful.

Contents

Introduction
1
2
23
How?
24
References
34
3
35
Why?
63
When?
66
5
69
References
394
Randomized Communication in Radio Networks
401
Introduction
402
SingleHop Networks
405
Preliminaries 3 Sequential Derandomization 4 Parallel Derandomization and Kwise Independence 5 Hypergraph2Coloring and Discrepancies 6 Hype...
410
Classifying Markov Chains
416
InfinitelyMany Users Models
419
FinitelyMany Users Models
429

References
97
Conclusion
126
References
128
Randomized vs Deterministic Algorithms for BlackBox Programs Vladik Kretnovich and Raul Trejo 1 2 3
129
4
131
5
133
6
151
References
188
7
203
References
218
References
250
Statistical Setting Error Estimation for Indirect Measurement Interval Setting Necessity and Possibility of Parallelization Error Estimation for Indirect ...
261
References
305
10
313
18
323
Random Walks and Expander Properties in Random Regular Graphs with Edge Faults
356
Robust Decentralized Computations Through Randomization
365

Other editions - View all

Common terms and phrases

Popular passages

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...

Bibliographic information