Analysis of Random Processes via And-Or Tree Evaluation (1998)
Cached
Download Links
- [www.eecs.harvard.edu]
- [ftp.icsi.berkeley.edu]
- [www.eecs.harvard.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms |
| Citations: | 67 - 23 self |
BibTeX
@INPROCEEDINGS{Luby98analysisof,
author = {Michael G. Luby and Michael Mitzenmacher and M. Amin Shokrollahi},
title = {Analysis of Random Processes via And-Or Tree Evaluation},
booktitle = {In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms},
year = {1998},
pages = {364--373}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework for carrying out the analysis of several previously studied random processes of interest, including random loss-resilient codes, solving random k-SAT formula using the pure literal rule, and the greedy algorithm for matchings in random graphs. In addition, these tools allow generalizations of these problems not previously analyzed to be analyzed in a straightforward manner. We illustrate our methodology on the three problems listed above. 1 Introduction We introduce a new set of probabilistic analysis tools related to the amplification method introduced by [12] and further developed and used in [13, 5]. These tools provide a unifying, intuitive, and powerful framework for carrying out the analysis of several previously studied random processes of interest, including the random loss-resilient codes introduced ...
