Leonard Adleman , Kenneth Manders , and Gary Miller . On taking roots in finite fields. Saving space in fast string-matching. A new proof of the linearity of the Boyer-Moore string searching algorithm. On the average number of registers required for evaluating arithmetic expressions.
Fast approximation algorithms for knapsack problems.
Combinatorial analysis of an efficient algorithm for processor and storage allocation. Andrew Chi-Chih Yao . Errol Lynn Lloyd . On triangulations of a set of points in the plane. David A. Plaisted .