Sensitivity analysis for heuristic algorithms /

"UILU-ENG 78 1731."

On algorithms for finding all circuits of a graph

Bibliography: p. [37]-[39]

The automatic generation of deterministic parsing algorithms /

ILIAC IV document no. 248

Dynamic storage allocation : simulation techniques and efficient algorithms /

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

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