Quality-of-Service Provisioning via Stochastic Path Selection under Weibullian Link Delays. Proceedings of the Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QShine'07), 2007. (With S. Uludag, A. Kashkanova, and K. Akkaya.)
A
Case for Application-Aware Grid Services. Proceedings of Computing in High
Energy Physics (CHEP06), Mumbai, India, Feb 2006.
(With G. Garzoglio, A. Baranovski, P. Mhashilkar, and A.
Rajendra.)
Bounding the firing synchronization problem on a ring. Theoretical Computer Science, 320(2-3): 213-228, 2004. (With André Berthiaume, Todd Bittner, Amber Settle, and Janos Simon.)
Genus Characterizes the Complexity of Graph Problems: Some
Tight Results. Proceedings of the 30th International
Colloquium on Automata, Languages, and Programming (ICALP),
Lecture Notes in Computer Science (LNCS),
2719:845 -856, 2003. (With J. Chen, E. Sedgwick, and
G. Xia.)
New Bounds for the Firing Squad Problem on a Ring. In proceedings of the 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Carleton Scientific, 17-31, 2002. (With A. Berthiaume, A. Settle, and J. Simon.)
An Improved Algorithm for Finding Tree Decompositions of Small Width. In International Journal on Foundations of Computer Science, 11, 3:365--372, 2000. (With B. Reed.)
An Improved Algorithm for Finding Tree Decompositions of Small Width. Proceedings of the 25th International Workshop on Graph Theoretic Concepts in Computer Science (WG'99), Lecture Notes in Computer Science (LNCS), 1665:148-155, 1999.
Edge Coloring, Polyhedra and Probability (PhD dissertation). Technical Report CMU-CS-98-176, School of Computer Science, Carnegie Mellon University, 1998.
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Combinatorics, Probability and Computing, 2, 3:271-284, 1993. (With. M Dyer, A. Frieze, R. Kannan, A. Kapoor, and U. Vazirani.)