On the depth of randomly generated circuits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1136, Issue , 1996, Pages 208-220

  Tsukiji, Tatsuie ^a   Xhafa, Fatos ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS TIME SYSTEMS;

BOOLEAN CIRCUIT; BRANCHING PROCESS; CIRCUIT VALUE PROBLEM; CONTINUOUS-TIME; COUPLING TECHNIQUES; DISCRETE TIME; HIGH PROBABILITY; UNIFORM DISTRIBUTION;

RECONFIGURABLE HARDWARE;

EID: 84958043428     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_57     Document Type: Conference Paper

References (11)

1. Balcázar J.L., Díaz, J. and Gabarró, J.: Structural Complexity I Springer Verlag (1995)
2. Codenotti, B., Gemmell, P., and Simon, J.: Average Circuit Depth and Average Communication Complexity. In Third European Symposium on Algorithms, Lecture Notes in Comp. So. Springer-Verlag (1995) 102-112
3. Díaz, J., Serna, M.J., Spirakis, P., Torán, J. and Tsukiji, T.: On the expected depth of Boolean circuits. Technical Report LSI-94-7-1, Univ. Politic. de Catalunya Dept. LSI (1994)
4. Kingman, J.: The first birth problem for an edge-dependent branching process. Ann. Prob. 3 (1975) 790-801
5. Lindvall, T.: Lectures on the Coupling Method. Wiley Interscience Pub., (1992)
6. Mahmoud, H.: Limiting distributions for path lengths in recursive trees. Prob. in the Eng. and lnf. Sc. 5 (1991) 53-59
7. Mahmoud, H.M. and Smythe, R.T.: On the Distribution of Leaves in Rooted Subtrees of Recursive Trees. The Ann. of Appl. Prob. 1 (3) (1991) 406-418
8. Pittd, B.: Note on the Heights of Random Recuresive Trees and Random m-ary Search Trees. Random Struct. and Alg. 5 (1994) 337-347
9. Smythe, R.T. and Mahmoud, H.M.: A Survey of Recursive Trees. Teorya Imovirnosty ta Mat. Stat. (in Ukrainian) 51 (1994) 1-29
10. Strassen, V.: The existence of probability measures with given maxginals. Ann. Math. Star. 36 (1965) 423-439
11. Szymatlski, J.: On the maximum degree and height of a random recursive tree. Wiley New York (1990)