An O(n²(m + n log n)log n) min-cost flow algorithm.
Consensus in the presence of partial synchrony.
Optimal directory placement on disk storage devices.
Church-Rosser Thue systems and formal languages.
The time complexity of maximum matching by simulated annealing.
Comparing the combinational complexities of arithmetic functions.
The schematic protection model: its definition and analysis for acyclic attenuating schemes.
Efficient tests for top-down termination of logical rules.
On the shortest paths between two convex polyhedra.
On the complexity of branching programs and decision trees for clique functions.