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

Studies in graph algorithms : generation and labeling problems /

Thesis--Illinois.

Radix 16 division, multiplication, logarithmic and exponential algorithms based on continued product representations,

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

An analysis of scheduling algorithms in multiprocessor computing systems /

"UIUCDCS-R-75-724"

Memory search algorithms for an iterative processor.

Includes bibliographical references.

Heuristic algorithms for constructing near-optimal decision trees /

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

Storage allocation algorithms in the tranquil compiler.

Issued also as thesis (M.S.) University of Illinois.

Quadratic algorithms for minimizing joins in restricted relational expressions /

"October 1979."

A study of data manipulation algorithms in magnetic bubble memories /

Thesis--Illinois.

Continued-product algorithms for division, logarithm, exponential and square root in radix ten /

Typescript.

Algorithms for parsing search queries in inverted file document retrieval systems /

Includes bibliographical references.

On Jacobi and Jacobi-like algorithms for a parallel computer /

Includes bibliographies.