Parallel methods and bounds of evaluating polynomials.

Bibliography: p. 24.

Quadratic algorithms for minimizing joins in restricted relational expressions /

"October 1979."

Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program /

Bibliography: p. 39 (2d group)

Scantrix: a scanned LED matrix display /

Bibliography: p. 35.

Simulation analysis of a pay-for-priority scheme for the IBM 360/75 /

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

Stability of variable-step methods for ordinary differential equations /

Bibliography: leaf 11.

A study of data manipulation algorithms in magnetic bubble memories /

Thesis--Illinois.

A study of the efficiency of Illiac IV in hydrodynamic calculations /

Includes bibliographies.

Synthesis of texture,

"Contract US AEC AT(11-1)2118."

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

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

The use of Riccati equation in digital computer arithmetic /

Includes bibliographical references.

A brief description of the routines in the ILLIAC active program library /

"March 16, 1955"

An error analysis of solutions to sparse linear programming problems,

"Supported in part by the Advanced Research Projects Agency ... contract no. US AF 30(602) 4144."

The evolution of programs : program abstraction and instantiation /

"NSF-MCS-79-04897."

Generalized decomposition of incomplete finite automata /

Vita.