Computer science research at Langley : proceedings of a workshop held at Langley Research Center, November 2-5-, 1981 /

Subject Category 59.

Projects in the hardware research group of the department of computer science of the University of Illinois,

Illustrations, p. 30-52, numbered as leaves.

1979 SIGNUM Meeting on Numerical Ordinary Differential Equations, April 3-5, 1979, University Inn, Champaign, Illinois : jointly sponsored by Association for Computing Machinery, Special Interest Group on Numerical Mathematics; Department of Computer Science, University of Illinois at Urbana-Champaign; National Science Foundation /

Includes bibliographical references.

The graduate program in computer science.

Bibliography: p. 7-9.

Syllabus for low level performance for the qualifying examination in computer science /

"April, 1970"

ACSES : the automated computer science education system at the University of Illinois /

Bibliography: p. 141-143.

Record of achievements and plans of the Information Engineering Laboratory in the Department of Computer Science of the University of Illinois at Urbana-Champaign, 1955-1973

Mode of access: Internet.

ROBOCAR : educating the layman in computer science /

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

Bibliography of technical reports in the fields of computer science and computer engineering issued at the University of Waterloo from 1967 to 1987 /

Includes indexes.

A new system of practical astronomy : made plain and easy to those who have not studied mathematics : containing the elementary principles of the science, all the rules and tables necessary for making all the calculations for an almanac ... /

Includes index.

A code for designing optimal networks by implicit enumeration using the all-interconnection inequality formulation : (a programming manual for ILLODIE-AIF) /

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

On algorithms for finding all circuits of a graph

Bibliography: p. [37]-[39]

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