On-line analysis of the TCP acknowledgment delay problem.
Improved master theorems for divide-and-conquer recurrences.
A general approach to dynamic packet routing with bounded buffers.
Concurrent threads and optimal parallel minimum spanning trees algorithm.
Convex quadratic and semidefinite programming relaxations in scheduling.
Approximation algorithms for metric facility location and
Short proofs are narrow - resolution made simple.