Efficient solutions to some transportation problems with applications to minimizing robot arm travel. Probing convex polygons with X-rays. Deferred data structuring. On sets truth-table reducible to sparse sets. An approximation scheme for finding Steiner trees with obstacles.
Nondeterministic space is closed under complementation.
Varieties of iteration theories. On the complexity of computing the volume of a polyhedron. Cynthia Dwork , David Peleg , Nicholas Pippenger , and Eli Upfal . Fault tolerance in networks of bounded degree. Natural self-reducible sets.