M. Dubiner and U. Zwick. Amplification by read-once formulas. SIAM Journal on Computing, 26(1):15--38, January 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Analysis of Random Processes via Or-And Tree Evaluation - Luby, Mitzenmacher.. (1998) (1 citation) (Correct)
....of Random Processes via Or And Tree Evaluation Michael G. Luby Michael Mitzenmacher y M. Amin Shokrollahi z 1 Introduction We introduce a new set of probabilistic analysis tools related to the amplification method introduced by [12] and further developed and used in [13] [5]. These tools provide a unifying, intuitive, and powerful framework for carrying out the analysis of several previously studied random processes of interest, including the random loss resilient codes introduced in [9] the greedy algorithm for matchings in random graphs studied in [7] and the ....
....of the Deutsche Forschungsgemeinschaft, Grant Sh 57 1 1. 1 tree is (d or ,d and ) regular if each OR node has d or children and each AND node has d and children. Our analysis is related to the study of amplification, initiated by Moore and Shannon [12] and continued in several works [13] [5]. Consider the probability the root of the tree evaluates to 0 when the value of each leaf is independently chosen to be 0 with probability p. Let us denote this probability as y . One typical amplification question with respect to Or And trees is whether or not there is a threshold phenomena, ....
[Article contains additional citation context not shown here]
M. Dubiner, U. Zwick, "Amplification by Read-Once Formulas", Siam J. on Computing, Vol. 26, No. 1, Feb. 1997, pp. 15--38.
Analysis of Random Processes via And-Or Tree Evaluation - Luby, Mitzenmacher.. (1998) (14 citations) (Correct)
....not previously analyzed to be analyzed in a straightforward manner. We illustrate our methodology on the three problems listed above. 1 Introduction We introduce a new set of probabilistic analysis tools related to the amplification method introduced by [12] and further developed and used in [13, 5]. These tools provide a unifying, intuitive, and powerful framework for carrying out the analysis of several previously studied random processes of interest, including the random loss resilient codes introduced in [9] the greedy algorithm for matchings in random graphs studied in [7] and the ....
....gate (and it evaluates to the AND of its children) We say the tree is (d or ,d and ) regular if each OR node has d or children and each AND node has d and children. Our analysis is related to the study of amplification, initiated by Moore and Shannon [12] and continued in several works [13, 5]. Consider the probability that the root of the tree evaluates to 0 when the value of each leaf is independently chosen to be 0 with probability p. Let us denote this probability as y . One typical amplification question with respect to And Or trees is whether or not there is a threshold ....
[Article contains additional citation context not shown here]
M. Dubiner, U. Zwick, "Amplification by Read-Once Formulas", Siam J. on Computing, Vol. 26, No. 1, Feb. 1997, pp. 15--38.
Analysis of Random Processes via And-Or Tree Evaluation - Luby, Mitzenmacher.. (1998) (14 citations) (Correct)
....der Universitat Bonn, Germany. Research supported by a Habilitationsstipendium of the Deutsche Forschungsgemeinschaft, Grant Sh 57 1 1. 1 Introduction We introduce a new set of probabilistic analysis tools related to the amplification method introduced by [15] and further developed and used in [17, 6]. These tools provide a unifying, intuitive, and powerful framework for carrying out the analysis of several previously studied random processes, including the random loss resilient codes introduced in [11] the greedy algorithm for matchings in random graphs studied in [9] the threshold for ....
....gate (and it evaluates to the AND of its children) We say the tree is (d or ,d and ) regular if each OR node has d or children and each AND node has d and children. Our analysis is related to the study of amplification, initiated by Moore and Shannon [15] and continued in several works [17, 6]. Consider the probability that the root of T evaluates to 0 when the value of each leaf is independently chosen to be 0 with probability p. Let us denote this probability as y . One typical amplification question with respect to And Or trees is whether or not there is a threshold phenomenon, ....
[Article contains additional citation context not shown here]
M. Dubiner, U. Zwick, "Amplification by Read-Once Formulas", Siam J. on Computing, Vol. 26, No. 1, Feb. 1997, pp. 15--38.
The Boolean Functions Computed by Random Boolean Formulas - Or How To (Correct)
No context found.
M. Dubiner and U. Zwick. Amplification by read-once formulas. SIAM Journal on Computing, 26(1):15--38, January 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC