Loading...
conference paper
Analysis of low-density codes and improved designs using irregular graphs
1998
Proceedings of the 30th annual ACM Symposium on Theory of Computing, STOC 1998
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, includingrandom loss-resilient codes, solving random k-SAT formula using the pure literal rule, and thegreedy 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
Type
conference paper
Authors
Publication date
1998
Publisher
Published in
Proceedings of the 30th annual ACM Symposium on Theory of Computing, STOC 1998
Start page
249
End page
258
Subjects
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
January 26, 2007
Use this identifier to reference this record