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:99 - 26 self

Active Bibliography

1 Analysis of Random Processes via Or-And Tree Evaluation – Michael G. Luby, Michael Mitzenmacher, M. Amin Shokrollahi - 1998
266 Efficient erasure correcting codes – Michael G. Luby, Michael Mitzenmacher, M. Amin Shokrollahi, Daniel A. Spielman - 2001
Analysis of Random Michael G. Luby* Processes via And-Or Tree Evaluation – Michael Mitzenmachert, M. Amin Shokrollahiz
462 Design of capacity-approaching irregular low-density parity-check codes – Thomas J. Richardson, M. Amin Shokrollahi, RĂ¼diger L. Urbanke - 2001
2429 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
1006 Oceanstore: An architecture for global-scale persistent storage – John Kubiatowicz, David Bindel, Yan Chen, Steven Czerwinski, Patrick Eaton, Dennis Geels, Ramakrishna Gummadi, Sean Rhea, Hakim Weatherspoon, Westley Weimer, Chris Wells, Ben Zhao - 2000
1289 Factor Graphs and the Sum-Product Algorithm – Frank R. Kschischang, Brendan J. Frey, Hans-Andrea Loeliger - 1998
655 Learning in graphical models – Michael I. Jordan - 2004
398 The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding – Thomas J. Richardson, RĂ¼diger L. Urbanke - 2001