Publications

Found 4228 results
[ Author(Desc)] Title Type Year
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 
F
Favre, B., & Bohnet B. (2009).  ICSI-CRF: The Generation of References to the Main Subject and Named Entities Using Conditional Random Fields. 99-100.
Fayazbakhsh, S. Kaveh, Lin Y., Tootoonchian A., Ghodsi A., Koponen T., Maggs B. M., et al. (2013).  Less Pain, Most of the Gain: Incrementally Deployable ICN. 147-158.
Federrath, H. (2000).  Workshop on Design Issues in Anonymity and Unobservability (Preproceedings).
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., P. Godfrey B., Panda A., Schapira M., Shenker S. J., & Singla A. (2012).  Brief Announcement: On the Resilience of Routing Tables. 237-238.
Feigenbaum, M. J., Kadanoff L. P., & Shenker S. J. (1982).  Quasiperiodicity in Dissipative Systems: A Renormalization Group Analysis. Physica D: Nonlinear Phenomena. 5(2-3), 370-386.
Feigenbaum, J., & Shenker S. J. (2002).  Incentives and Internet Computation. 33(4), 37-54.
Feigenbaum, J., P. Godfrey B., Panda A., Schapira M., Shenker S. J., & Singla A. (2012).  On the Resilience of Routing Tables. 1-7.
Feigenbaum, J., & Shenker S. J. (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., Papadimitriou C. H., & Shenker S. J. (2001).  Sharing the Cost of Multicast Transmissions. Journal of Computer and System Sciences. 63(1), 21-41.
Feigenbaum, J., Sami R., & Shenker S. J. (2006).  Mechanism Design for Policy Routing. Distributed Computing. 18, 11-20.
Feigenbaum, J., Ramachandran V., & Schapira M. (2006).  Incentive-Compatible Interdomain Routing. Proceedings of the 7th ACM Conference on Electronic Commerce (EC'06). 130-139.
Feigenbaum, J., Papadimitriou C. H., & Shenker S. J. (2000).  Sharing the Cost of Multicast Transmissions. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000). 218-227.
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.
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., Schapira M., & Shenker S. J. (2007).  Distributed Algorithmic Mechanism Design. 363-384.
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., Sami R., & Shenker S. J. (2003).  Mechanism Design for Policy Routing.
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., 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., 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., Nisan N., Ramachandran V., Sami R., & Shenker S. J. (2002).  Agents' Privacy In Distributed Algorithmic Mechanisms (Position Paper).
Feldman, J. (1982).  Four Frames Suffice: A Provisionary Model of Vision and Space.
Feldman, J. (1969).  Grammatical Inference and Grammatical Complexity.
Feldman, J., & Porat S. (1988).  Learning Automata from Ordered Examples. Proceedings of the COLT Conference.

Pages