Network Information Flow: Does the Model Need Tuning?, with Eric Lehman. Symposium on
Discrete Algorithms (SODA '05). To appear, January 2005. Network Information Flow: Does the Model Need Tuning?, with Eric Lehman. Symposium on
Discrete Algorithms (SODA '05). To appear, January 2005.
Complexity Classification of Network Information Flow Problems, with Eric Lehman.
Symposium on Discrete Algorithms (SODA '04). January 2004. Approximating the Smallest Grammar:
Kolmogorov Complexity in Natural Models, with M. Charikar, E. Lehman,
D. Liu, M. Prabhakaran, A. Sahai, and A. Shelat. Symposium on Theory of
Computing (STOC '02).Wide-sense Nonblocking WDM Cross-connects,
with P. Haxell, G. Wilfong and P. Winkler. European Symposium on
Algorithms (ESA '02).Route Oscillations in I-BGP with Route
Reflection, with A. Basu, L. Ong, F. B. Shepherd and
G. Wilfong. (SIGCOMM '02).Existence Theorems, Lower Bounds and
Algorithms for Scheduling to Meet Two Objectives, with Eric Torng, Cliff
Stein, and Patchrawat Uthaisombut. Symposium on Discrete
Algorithms(SODA'02). Strictly non-blocking WDM cross-connects for
heterogeneous networks, with Gordon Wilfong. Symposium on Theory
of Computation(STOC'00). Proceedings of STOC '00. Strictly non-blocking WDM
cross-connects, with Gordon Wilfong. Eleventh ACM-SIAM Symposium
on Discrete Algorithms(SODA'00). Proceedings of SODA '00. On List Update and Work Function Algorithms,
with Eric J. Anderson, Kristen Hildrum, Anna Karlin and Micheal
Saks. Seventh European Symposium on Algorithms(ESA'99). Proceedings
of ESA '99. Improved Bicriteria Existence
Theorems for Scheduling, with Jay Aslam, Cliff Stein and Neal
Young. Tenth ACM-SIAM Symposium on Discrete Algorithms(SODA'99).
Proceedings of SODA '99. Network Coding. Massachusetts Institute of Technology, Department of
Electrical Engineering and Computer Science, Feb, 2005. Strictly Non-blocking WDM
Cross-connects. Massachusetts Institute of Technology, Department of
Electrical Engineering and Computer Science, June, 2001.
Existence Theorems for Scheduling to Meet Two Objectives. Dartmouth College Computer Science Technical Report PCS-TR99-347, June 1999.