#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1979

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Krystyna T. Balinska, Louis V. Quintas, Jerzy Szymanski
- Random Struct. Algorithms
- 1994

A random recursive forest is defined as a union of random recursive trees. We find the expected number of trees in the uniform random recursive forest as well as the number of vertices of given degree, the maximum degree, the height of vertices, the order of branches, the root of the component containing a given vertex, and the last root of such forests.

- Eric M. Wahl, Louis V. Quintas, Lorraine L. Lurie, Michael L. Gargano
- Microvascular research
- 2004

A graph theory model and its invariants are used to compare previously published renal glomerular networks of six adult rats, one adult uremic rat, and one newborn rat. Invariants calculated include order, size, cycle rank, eccentricity, root distance, planarity, and vertex degree distribution. These invariants enabled the differentiation of six normal… (More)

- Krystyna T. Balinska, Louis V. Quintas
- Discrete Mathematics
- 1996

- Gyula O. H. Katona, Louis V. Quintas
- Discrete Mathematics
- 1993

- Zbigniew Palka, Louis V. Quintas
- Discrete Mathematics
- 1984

- John W. Kennedy, Louis V. Quintas
- Discrete Applied Mathematics
- 1983

- Krystyna T. Balinska, Louis V. Quintas
- Computers & Chemistry
- 1990

- Robert Gross, Martin L. Yarmush, John W. Kennedy, Louis V. Quintas
- Discrete Applied Mathematics
- 1988

- Pavol Hell, Louis V. Quintas
- Journal of Graph Theory
- 1979

- Eldon Dyer, R. Creighton Buck, +94 authors Bodo Pareigis
- 2010

240. 9. B. Pareigis and A . Rosenberg, Addendum to Amitsur's complex f o r p u r e l y i n separable fields," Osaka Math. J . (to appear). CORNELL UNIVERSITY AND UNIVERSITÄT HEIDELBERG