A study of concrete computational complexity /

"UIUCDCS-R-75-716"

Structured testing : a testing methodology using the cyclomatic complexity metric /

Mode of access: Internet.

Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n /

"UILU-ENG 79 1716."

Complete problems in the first-order predicate calculus /

"UILU-ENG 79 1726."

An exponential lower bound for a restricted class of monotone formulae for 2-unsatisfiability /

"UILU-ENG 78-1734."

A note on simplification orderings /

"April 1979."

A general method for evaluation of functions and computations in a digital computer /

Vita.