On Solving Equations and Disequations.
Motion Planning in the Presence of Moving Obstacles.
Computing Bounds on Steady State Availability of Repairable Computer Systems.
Are Wait-Free Algorithms Fast?
Channel Routing of Multiterminal Nets.
Linear Approximation of Shortest Superstrings.
The Relationship between Greedy Parsing and Symbolwise Text Compression.
Efficient Decomposition Methods for the Analysis of Multi-Facility Blocking Models.