Important (but usual) note: The files available below are provided with the aim of timely and broad dissemination of scholarly and technical work. Copyright and all intellectual rights are retained by the authors and/or other copyright holders. Copying and using the files provided here implies that you agree to adhere to fair use guidelines and to the terms and constraints invoked by each copyright holder.
A bibtex (or pdf) file for all published work
Or you want to browse by type or research area?
2007 and after
2006
Implementation and Evaluation of Secure Routing Primitives. (abstract, pdf)
With Atul Singh, Peter Druschel, and Dan S. Wallach.
Technical Report TR05-459, Rice University, Jan. 2006.
2005
Towards a Dependable, Heterogeneity-Aware P2P System. (pdf, slides)
With Atul Singh, Peter Druschel, and Dan S. Wallach.
In South Central Information Security Symposium (SCISS'05)
(Austin, Texas), April 2005.
A Tighter Extra-Resource Analysis of Online Deadline Scheduling.
(abstract, ps)
With Tak-Wah Lam and Kar-Keung To.
Journal of Combinatorial Optimization, 9(2), pages 157-165, Mar 2005.
2004
Incentives-Compatible Peer-to-Peer Multicast.
(abstract, pdf, slides)
With Dan S. Wallach and Peter Druschel.
In 2nd Workshop on the Economics of Peer-to-Peer Systems (Cambridge, Massachusetts), June 2004.
On Designing Incentives-Compatible Peer-to-Peer Systems.
(abstract, pdf)
With Animesh Nandi, Atul Singh, Dan S. Wallach and Peter Druschel.
In 2nd Bertinoro Workshop on Future Directions in Distributed Computing (FuDiCo II: S.O.S.) (Bertinoro, Italy), June 2004.
Incentives and Fair Sharing in Peer-to-Peer Systems.
(abstract, pdf)
Master of Science Thesis, Rice University, 2004.
Advisor: Dan S. Wallach.
Extra Processors versus Future Information in Optimal Deadline Scheduling.
(abstract, ps)
With Chiu-Yuen Koo, Tak-Wah Lam, and Kar-Keung To.
Theory of Computing Systems, 37(3), pages 323-341, May 2004.
On Designing Resource Sharing Peer-to-Peer Systems. (pdf, slides)
With Dan S. Wallach.
In South Central Information Security Symposium (SCISS'04)
(Houston, Texas), April 2004.
Aggressive Online Deadline Scheduling.
With Tak-Wah Lam, Kar-Keung To, and Prudence W.-H. Wong.
In Computing: The Australasian Theory Symposium (CATS 2004) (Dunedin, New Zealand), ENTCS 91, pages 148-157, Feb 2004.
This paper is superseded by the full version titled "A Tighter Extra-Resource Analysis of Online Deadline Scheduling."
2003
Economic Behavior of Peer-to-Peer Storage Networks.
(abstract, pdf)
With Andrew C. Fuqua and
Dan S. Wallach.
In Proceedings of the Workshop on Economics of Peer-to-Peer Systems (Berkeley, California), June 2003.
Towards Fair Sharing of Peer-to-Peer Resources. (pdf, slides)
With Dan S. Wallach and
Peter Druschel.
In South Central Information Security Symposium (SCISS'03)
(Denton, Texas), April 2003.
Competitive Deadline Scheduling via Additional
or Faster Processors.
(abstract, ps)
With Chiu-Yuen Koo, Tak-Wah Lam, and Kar-Keung To.
Journal of Scheduling (special issue on on-line scheduling), 6(2), pages 213-223, March 2003.
On-line Scheduling with Tight Deadlines.
(abstract, ps)
With Chiu-Yuen Koo, Tak-Wah Lam, Kunihiko Sadakane, and Kar-Keung To.
Theoretical Computer Science (TCS), 295(1-3), pages 251-261, February 2003.
Enforcing Fair Sharing of Peer-to-Peer Resources.
(abstract, pdf, slides)
With Dan S. Wallach and Peter Druschel.
2nd International Workshop on Peer-to-Peer Systems (IPTPS),
(Berkeley, California),
LNCS 2735,
pages 149-159, February 2003.
2002
Extra Processors versus Future Information in Optimal Deadline Scheduling.
(abstract, pdf)
With Chiu-Yuen Koo, Tak-Wah Lam, and Kar-Keung To.
In Proceedings of the 14th
ACM Symposium on Parallel Algorithms and Architectures (SPAA)
(Winnipeg, Manitoba, Canada),
pages 133-142, August 2002.
2001
On the Speed Requirement for Optimal Deadline Scheduling
in Overloaded Systems.
(abstract, ps)
With Tak-Wah Lam and Kar-Keung To.
In Proceedings of the 15th
International Parallel and Distributed Processing Symposium (IPDPS)
(San Francisco, California),
pages 2173-2177, April 2001.
Last modified: