On the Complexity of Algorithms on Recursive Trees. - Jerzy Szymanski (Theor. Comput. Sci., 1990)

On the Structure of Random Plane-oriented Recursive Trees and Their Branches. - Hosam M. Mahmoud; Robert T. Smythe; Jerzy Szymanski (Random Struct. Algorithms, 1993)

Random Recursive Forests. - Krystyna T. Balinska; Louis V. Quintas; Jerzy Szymanski (Random Struct. Algorithms, 1994)

A Kinetic Approach to the Random F-graph Process. Paths, Cycles and Components. - Krystyna T. Balinska; Henryk Galina; Louis V. Quintas; Jerzy Szymanski (Discret. Appl. Math., 1996)

A Kinetic Approach to the Random f-Graph Process with Nonuniform Edge Probabilities. - Krystyna T. Balinska; Henryk Galina; Louis V. Quintas; Jerzy Szymanski (J. Chem. Inf. Comput. Sci., 1996)

Digraphs Whose Nodes are Multigraphs Having Exactly Two Degrees f and 2. - Louis V. Quintas; Jerzy Szymanski (Ars Comb., 2002)

Concentration of vertex degrees in a scale-free random graph process. - Jerzy Szymanski (Random Struct. Algorithms, 2005)