Rahul Sami - Publications

• A Sublinear Algorithm for Weakly Approximating Edit Distance
  Tugkan Batu, Funda Ergun, Joseph Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld and Rahul Sami.
  In the 2003 ACM Symposium on the Theory of Computation (STOC-03).
  

• Computation in a Distributed Information Market
  Joan Feigenbaum, Lance Fortnow, David Pennock, and Rahul Sami.
  In the 2003 ACM Conference on Electronic Commerce (EC-03).
  

• Hardness Results for Multicast Cost Sharing
  Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, and Scott Shenker.
  Theoretical Computer Science 304 (2003).
  Extended abstract appeared in the Proceedings of the 2002 Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS '02).
  

• A BGP-based Mechanism for Lowest-Cost Routing
  Joan Feigenbaum, Christos Papadimitriou, Rahul Sami, and Scott Shenker.
  In the 2002 ACM Symposium on Principles of Distributed Computing (PODC '02).
  

• Memory Bypassing: Not Worth the Effort
  Gabriel H. Loh, Rahul Sami, and Daniel H. Friendly.
  In the Workshop on Duplicating, Deconstructing, and Debunking (WDDD '02) (held in conjunction with ISCA '02).
  

• Speculative Clustered Caches for Clustered Processors
  Dana S. Henry, Gabriel H. Loh, and Rahul Sami.
  In the 4th International Symposium on High Performance Computing (ISHPC-IV), May 2002.
  

• Approximation and Collusion in Multicast Cost Sharing
  Aaron Archer, Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, and Scott Shenker.
  To appear in Games and Economic Behavior.
  

• Circuits for Wide-Window Superscalar Processors
  Dana S. Henry, Bradley C. Kuszmaul, Gabriel H. Loh, and Rahul Sami.
  In the 27th ACM International Symposium on Computer Architecture (ISCA '00), July 2000, pp. 236--247.