Enumerations of ordered trees /

Errata slip inserted.

Generating binary trees lexicographically /

Bibliography: p. 26.

Analysis of algorithms for finding all spanning trees of a graph.

"Supported in part by the following grants: US NSF GJ 217, US NSF GJ 812, and project BUILD."

Illinois trees and shrubs: their insect enemies

Mode of access: Internet.

Generating trees and other combinatorial objects lexicographically /

"UILU-ENG 77 1762."

Heuristic algorithms for constructing near-optimal decision trees /

Thesis (M.S.)--University of Illinois.

Notes on AVL trees /

"Written as supplementary material for a course in data structures given by the Dept. of Computer Science of the University of Illinois at Urbana-Champaign, during the second semester of the 1970-71 academic year"--Leaf 1.

An O(/E/loglog/V/) algorithm for finding minimum spanning trees /

Includes bibliographical references.

Illinois trees and shrubs: their insect enemies

Mode of access: Internet.

Two upper bounds for the weighted path length of binary trees.

Thesis (M.S.)--University of Illinois at Urbana-Champaign.

Generating k-ary trees lexicographically /

"UILU-ENG 77 1758."

Designing extended entry decision tables and optimal decision trees using decision diagrams /

Bibliography: p. 52-53.

The use of backscattered gamma rays for evaluating defects in logs and trees /

"Contract No. AT-(40-1)-2513."

The Three Trees

Rembrandt van Rijn; 8 25/64 in. x 10 15/16 in.; etching, drypoint and engraving

Catalog of hardy trees and shrubs, a list of the woody plants in cultivation outdoors at the New York Botanical Garden in 1942, with notes, a map, and twenty illustrations ...

Folded plan mounted on p. [3] of cover.