000099187 001__ 99187
000099187 005__ 20180317094150.0
000099187 037__ $$aCONF
000099187 245__ $$aAnalysis of random processes via AND/OR tree evaluations
000099187 260__ $$c1998
000099187 269__ $$a1998
000099187 336__ $$aConference Papers
000099187 520__ $$aWe 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
000099187 6531_ $$aalgoweb_ldpc
000099187 700__ $$aLuby, M.
000099187 700__ $$aMitzenmacher, M.
000099187 700__ $$0241952$$aShokrollahi, A$$g156849
000099187 773__ $$q364-373$$tProceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1998
000099187 8564_ $$uhttp://www.icsi.berkeley.edu/~luby/PAPERS/tree.ps$$zURL
000099187 909CO $$ooai:infoscience.tind.io:99187$$pIC$$pconf
000099187 909C0 $$0252198$$pALGO$$xU10735
000099187 937__ $$aALGO-CONF-1998-001
000099187 970__ $$aLuby1998/ALGO
000099187 973__ $$aOTHER$$rREVIEWED$$sPUBLISHED
000099187 980__ $$aCONF