Dynamic Programming and the Graphical Traveling Salesman Problem.
The Impossibility of Implementing Reliable Communication in the Face of Crashes.
Parallel Queues with Resequencing.
Kinodynamic Motion Planning.
Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach.
Extremal Scheduling of Parallel Processing with and without Real-Time Constraints.
On the Communication Complexity of Distributed Algebraic Computation.
On the Optimality of Strategies for Multiple Joins.
On the Sojourn Time Distribution in a Finite Capacity Processor Shared Queue.
An Algebraic Theory of Graph Reduction.
Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling.