Bounds to Complexities of Networks for Sorting and for Switching.
On Approximate Computer System Models.
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters.
A Simple Planarity Criterion.
A Generalized Multi-Entrance Time-Sharing Priority Queue.
The Linear Complexity of Computation.
Corrigendum: "Allocating Storage for Extendible Arrays".
A Processor in Series with Demand-Interrupting Devices - A Stochastic Model.
An Extension of the String-to-String Correction Problem.
Efficiency of a Good But Not Linear Set Union Algorithm.
Multivariate Polynomial Factorization.
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers.