1. A Non-linear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems;Dobkin;Yale Computer Science Research Report No. 52,1975
2. D. Dobkin, and R. Lipton, The complexity of searching lines in the plane, to appear.
3. On some generalizations of binary search;Dobkin,1974
4. On the complexity of computations under varying sets of primitive operations;Dobkin,1975
5. Reducibilities among combinatorial problems;Karp,1972