On the routing problem in faulty supercubes. Effective use of memory in iterative deepening search. Nimrod Megiddo . A note on approximate linear programming. Alok Aggarwal , Herbert Edelsbrunner , Prahakar Raghavan , and Prasoon Tiwari .
Optimal time bounds for some proximity problems in the plane.
Scheduling real-time computations with separation constraints. Additive weights of a special class of nonuniformly distributed backtrack trees. Batch checking with applications to linear functions. The parallel complexity of coarsest set partition problems. Optimal total exchange for a 3-D torus of processors.