Dynamic Programming as Graph Searching: An Algebraic Approach.
Algorithms for Scheduling Tasks on Unrelated Processors.
On the complexity of integer programming.
An Algorithm for the K Best Solutions of the Resource Allocation Problem.
Algorithmic Analysis of a Multiprogramming-Multiprocessor Computer System.
On the Complexity of Testing Implications of Functional and Join Dependencies.
On Matrices with Connections.
Deciding Linear Inequalities by Computing Loop Residues.
A Lower Bound on the Complexity of Orthogonal Range Queries.
A Morphic Representation of Complements of Recursively Enumerable Sets.
A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars.
Deleting Repeated Goals in the Problem Reduction Format.
A Lower Bound to Finding Convex Hulls.