"Strong" NP-Completeness Results: Motivation, Examples, and Implications.
Analysis and Design of Fanout-Free Networks of Positive Symmetric Gates.
The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis.
A Time-Space Trade-Off.
On the Tape Complexity of Deterministic Context-Free Languages.
Properties of Conflict-Free and Persistent Petri Nets.
Some Properties of Predicate Transformers.
Regenerative Simulation of Response Times in Networks of Queues.
Generation of Binary Trees from Ballot Sequences.
A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane.
Another Generalization of Resolution.
Performance Analysis of Cache Memories.
Dynamic Placement of Records in Linear Storage.
An Algorithm to Design the Memory Configuration of a Computer Network.