Generating trees and other combinatorial objects lexicographically /

"UILU-ENG 77 1762."

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.

Clustering by clique generation /

Originally presented as the author's thesis (M.A.), University of Illinois at Urbana-Champaign.

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."

A procedure for detecting intersections and its application.

Bibliography: p. 72-74.

Cours de mathematique : troisieme partie : elemens de mechanique statique : tome second /

Mode of access: Internet.