The Complexity of Finite Memory Programs with Recursion.
A Direct Descent Binary Knapsack Algorithm.
Stable Sorting in Asymptotically Optimal Time and Extra Space.
The Complexity of Some Problems on Subsequences and Supersequences.
k+1 Heads Are Better than k.
On the Efficiency of a Polynomial Irreducibility Test.
All Algebraic Functions Can Be Computed Fast.
Analysis and Applications of the Delay Cycle for the M/M/c Queueing System.
An Example of a Skewing Function.
Pivot Strategies for Primal-Simplex Network Codes.
Asynchronous Iterative Methods for Multiprocessors.
Optimal Arrangement of Keys in a Hash Table.
Effective Automatic Indexing Using Term Addition and Deletion.