Publications

Found 22 results
Author [ Title(Asc)] Type Year
Filters: Author is Joan Feigenbaum  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
T
Bergemann, D., Feigenbaum J., Shenker S., & Smith J. M. (2004).  Towards an Economic Analysis of Trusted Systems (Position Paper). Proceedings of the Third Workshop on Economics and Information Security, Minneapolis, Minnesota.
Bergemann, D., Feigenbaum J., Shenker S., & Smith J. M. (2004).  Towards an Economic Analysis of Trusted Systems.
S
Feigenbaum, J., Papadimitriou C. H., & Shenker S. (2001).  Sharing the Cost of Multicast Transmissions. Journal of Computer and System Sciences. 63(1), 21-41.
Feigenbaum, J., Papadimitriou C. H., & Shenker S. (2000).  Sharing the Cost of Multicast Transmissions. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000). 218-227.
M
Feigenbaum, J., Sami R., & Shenker S. (2006).  Mechanism Design for Policy Routing. Distributed Computing. 18, 11-20.
Feigenbaum, J., Sami R., & Shenker S. (2003).  Mechanism Design for Policy Routing.
Feigenbaum, J., Sami R., & Shenker S. (2004).  Mechanism Design for Policy Routing. Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004). 11-20.
I
Feigenbaum, J., & Shenker S. (2002).  Incentives and Internet Computation. 33(4), 37-54.
Feigenbaum, J., Ramachandran V., & Schapira M. (2006).  Incentive-Compatible Interdomain Routing. Proceedings of the 7th ACM Conference on Electronic Commerce (EC'06). 130-139.
H
Feigenbaum, J., Krishnamurthy A., Sami R., & Shenker S. (2003).  Hardness Results for Multicast Cost Sharing. Theoretical Computer Science. 304(1-3), 215-236.
Feigenbaum, J., Krishnamurthy A., Sami R., & Shenker S. (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.
F
Bergemann, D., Eisenbach T.., Feigenbaum J., & Shenker S. (2005).  Flexibility as an Instrument in DRM Systems. Proceedings of 2005 Workshop on the Economics of Information Security (WEIS 2005).
D
Feigenbaum, J., & Shenker S. (2002).  Distributed Algorithmic Mechanism Design: Recent Results and Future Directions. Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM'02). 1-13.
Feigenbaum, J., Schapira M., & Shenker S. (2007).  Distributed Algorithmic Mechanism Design. 363-384.
B
Feigenbaum, J., P. Godfrey B., Panda A., Schapira M., Shenker S., & Singla A. (2012).  Brief Announcement: On the Resilience of Routing Tables. 237-238.
Feigenbaum, J., Papadimitriou C. H., Sami R., & Shenker S. (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., Papadimitriou C. H., Sami R., & Shenker S. (2005).  A BGP-Based Mechanism for Lowest-Cost Routing. Distributed Computing. 18(1), 61-72.