Analysis of Random Processes via And-Or Tree Evaluation (1998)

by Michael G. Luby , Michael Mitzenmacher , M. Amin Shokrollahi
Venue:In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms
Citations:73 - 23 self

Active Bibliography

1 Analysis of Random Processes via Or-And Tree Evaluation – Michael G. Luby, Michael Mitzenmacher, M. Amin Shokrollahi - 1998
254 Efficient erasure correcting codes – Michael G. Luby, Michael Mitzenmacher, M. Amin Shokrollahi, Daniel A. Spielman - 2001
1 Efficient Erasure Codes – Michael G. Luby, Michael Mitzenmacher, M. Amin Shokrollahi, Daniel A. Spielman, Volker Stemann - 2001
6 Gibbs Measures and Phase Transitions on Sparse Random Graphs – Amir Dembo, Andrea Montanari
15 Poisson cloning model for random graphs – Jeong Han Kim - 2004
7 Finite size scaling for the core of large random hypergraphs – Amir Dembo, Andrea Montanari - 2008
17 Rigorous results for random (2 + p)-SAT – Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc - 2001
2 Low-Density Parity-Check Codes and their Rateless Relatives – Nicholas Bonello, Sheng Chen, Lajos Hanzo
6 One-Way Communication Complexity And The Neciporuk Lower Bound on Formula Size – Hartmut Klauck
21 The quantum adversary method and classical formula size lower bounds – Sophie Laplante, Troy Lee, Mario Szegedy
Amplification By Read-Once Formulas – Moshe Dubiner Uri, Uri Zwick - 1997
10 Amplification and Percolation – Moshe Dubiner, Uri Zwick - 1992
5 How Do Read-Once Formulae Shrink? – Moshe Dubiner, Uri Zwick - 1994
4 Amplification by Read-Once Formulae – Moshe Dubiner, Uri Zwick - 1995
6 The boolean functions computed by random boolean formulas or how to grow the right function. Random Structures and Algorithms – Alex Brodsky - 2005
83 Oracles and Queries that are Sufficient for Exact Learning – Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon - 1996
1 Random graph processes and optimisation – Julie Anne Cain - 2006
Greedy Online Bipartite Matching on Random Graphs ∗ – Andrew Mastin, Patrick Jaillet - 2013
2 Codes and Graphs – M. Amin Shokrollahi - 2000