Parallel algorithms for network routing problems and recurrences /

"Grant no. US NSF MCS75-21758."

A method for factoring the action of asynchronous circuits /

"Presented at the AIEE fall general meeting, Chicago, Illinois, October l1, 1960. This work was supported in part by the Office of Naval Research under contract Nonr-1834 (27)."

Methods for automatic error analysis of numerical algorithms /

Vita.

Speedup of iterative programs in multiprocessing systems /

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

Average analysis of simple path algorithms /

"UILU-ENG 77 1759."

Bounds on scheduling algorithms for heterogeneous computing systems /

Includes bibliographical references.

Algorithms for sparse Gaussian elimination with partial pivoting /

Bibliography: p. 17.

A class of algorithms for automatic evaluation of certain elementary functions in a binary computer.

"Supported in part...under Grant No. US NSF GJ812 and Grant No. US NSF GJ813."

The execute statement : design, examples, and implementation algorithms /

"UILU-ENG 80 1741"--Cover.

Iterative and direct methods for solving Poisson's equation and their adaptability to ILLIAC IV,

Includes bibliography.

The pattern articulation unit of Illiac III; homogenous Boolean functions in the iterative array,

"Supported in part by Contract AT(11-1) 1018 with the U.S. Atomic Energy Commission and the Advanced Research Projects Agency."

Sensitivity analysis for heuristic algorithms /

"UILU-ENG 78 1731."