Publications

Found 10 results
Author Title [ Type(Desc)] Year
Filters: Author is Rahul Sami  [Clear All Filters]
Conference Paper
Feigenbaum, J., Krishnamurthy A., Sami R., & Shenker S. J. (2001).  Approximation and Collusion in Multicast Cost Sharing. Proceedings of the Third ACM Conference on Electronic Commerce (ACM-EE 2001). 253-255.
Feigenbaum, J., Papadimitriou C. H., Sami R., & Shenker S. J. (2002).  A BGP-Based Mechanism for Lowest-Cost Routing. Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002). 173-182.
Feigenbaum, J., Krishnamurthy A., Sami R., & Shenker S. J. (2002).  Hardness Results for Multicast Cost Sharing. Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002). 133-144.
Feigenbaum, J., Sami R., & Shenker S. J. (2004).  Mechanism Design for Policy Routing. Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004). 11-20.
Journal Article
Feigenbaum, J., Archer A.., Krishnamurthy A., Sami R., & Shenker S. J. (2004).  Approximation and Collusion in Multicast Cost Sharing. Games and Economic Behavior. 47(1), 36-71.
Feigenbaum, J., Papadimitriou C. H., Sami R., & Shenker S. J. (2005).  A BGP-Based Mechanism for Lowest-Cost Routing. Distributed Computing. 18(1), 61-72.
Feigenbaum, J., Krishnamurthy A., Sami R., & Shenker S. J. (2003).  Hardness Results for Multicast Cost Sharing. Theoretical Computer Science. 304(1-3), 215-236.
Feigenbaum, J., Sami R., & Shenker S. J. (2006).  Mechanism Design for Policy Routing. Distributed Computing. 18, 11-20.