Analysis of random processes via AND/OR tree evaluations

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


Publié dans:
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1998, 364-373
Année
1998
Mots-clefs:
Laboratoires:




 Notice créée le 2007-01-16, modifiée le 2018-03-17

Lien externe:
Télécharger le document
URL
Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)