On the Expected Depth of Random Circuits

Combinatorics Probability and Computing

Volumn 8, Issue 3, 1999, Pages 209-228

  Arya, Sunil ^a   Golin, Mordecai J ^a   Mehlhorn, Kurt ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033463748     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096354839900382X     Document Type: Article

References (9)

1. Diaz, J., Serna, M. J., Spirakis, P. and Toran, J. (1994) On the expected depth of Boolean circuits. Report LSI-94-7-R, Departament de Llenguatges i Sistemes, Universitat Politècnica Calalunya Pau Gargallo 5, Barcelona.
2. Grimmett, G. R. and Stirzaker, D. R. (1992) Probability and Random Processes (2nd edn), Clarendon Press, Oxford.
3. Mahmoud, H. and Smythe, R. T. (1991) On the distribution of leaves in rooted subtrees of recursive trees. Ann. Appl. Probab. 1 406-418.
4. Meir, A. and Moon, J. (1974) Recursive trees with no nodes of outdegree one. Congr. Numer. 66 49-62.
5. Moon, J. (1974) The distance between nodes in recursive trees. In Vol. 13 of London Math. Soc. Lecture Notes, Cambridge University Press, pp. 125-132.
6. Na, H. and Rapaport, A. (1970) Distribution of nodes of a tree by degree. Math. Biosci. 6 313-329.
7. Pittel, B. (1994) Notes on the heights of random recursive trees and random m-ary search trees, Random Struct. Alg. 5 337-347.
8. Szymanski, J. (1990) On the maximum degree and the height of a random recursive tree. In Random Graphs '87 (M. Karoński, J. Jaworski and A. Ruciński, eds), Wiley, New York, pp. 431-524.
9. Tsukiji, T. and Xhafa, F. (1996) On the depth of randomly generated circuits. In Proc. 4th Annual Symposium on Algorithms, Springer, pp. 208-220.