Joan Feigenbaum
From Tetherless World Wiki
| Joan Feigenbaum [ Edit ] | |
|---|---|
| Photo: |
|
| Name: | Joan Feigenbaum |
| Occupation: | |
| Affiliation(s): | |
| Homepage(s): | |
| Email(s): | |
| Phone: | |
| Fax: | |
| Interests: | |
| Other tags: | |
| Alias: | |
| Please also add"{{alias}}" to your alias pages. | |
Publication
- Joan Feigenbaum, David C. Parkes, David M. Pennock. Computational challenges in e-commerce, In Commun. ACM, 52(1):70-74, 2009 .
- [TW-2008-30] Daniel J. Weitzner, Harold Abelson, Tim Berners-Lee, Joan Feigenbaum, James A. Hendler, Gerald Jay Sussman. Information accountability, In Commun. ACM, 51(6):82-87, 2008 .
- [TW-2008-05] Danny Weitzner, Hal Abelson, Tim Berners-Lee, Joan Feigenbaum, James A. Hendler, Gerald Sussman. Information Accountability, In CACM, 51(6):82-86, June, 2008 (Download) .
- Danny Weitzner, Hal Abelson, Tim Berners-Lee, Joan Feigenbaum, James A. Hendler, Gerald Sussman. Information Accountability, In MIT CSAIL Technical Report, (MIT-CSAIL-TR-2007), June, 2007 (Download) .
- Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami. Subjective-cost policy routing, In Theor. Comput. Sci., 378(2):175-189, 2007 .
- Joan Feigenbaum, Aaron Johnson, Paul F. Syverson. Probabilistic analysis of onion routing in a black-box model, In WPES, pp. 1-10, 2007 .
- James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong. Towards a theory of data entanglement, In Theor. Comput. Sci., 389(1-2):26-43, 2007 .
- Felipe Saint-Jean, Aaron Johnson, Dan Boneh, Joan Feigenbaum. Private web search, In WPES, pp. 84-90, 2007 .
- Joan Feigenbaum, Aaron Johnson, Paul F. Syverson. A Model of Onion Routing with Provable Anonymity, In Financial Cryptography, pp. 57-71, 2007 .
- Joan Feigenbaum, Vijay Ramachandran, Michael Schapira. Incentive-compatible interdomain routing, In ACM Conference on Electronic Commerce, pp. 130-139, 2006 .
- Joan Feigenbaum, Michael Mitzenmacher. Towards a theory of networked computation, In SIGACT News, 37(4):22-26, 2006 .
- Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright. Secure multiparty computation of approximations, In ACM Transactions on Algorithms, 2(3):435-472, 2006 .
- Jian Zhang, Joan Feigenbaum. Finding highly correlated pairs efficiently with powerful pruning, In CIKM, pp. 152-161, 2006 (Download) .
- Joan Feigenbaum, Rahul Sami, Scott Shenker. Mechanism design for policy routing, In Distributed Computing, 18(4):293-305, 2006 .
- Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang. On graph problems in a semi-streaming model, In Theor. Comput. Sci., 348(2-3):207-216, 2005 .
- Joan Feigenbaum, Christos H. Papadimitriou, Rahul Sami, Scott Shenker. A BGP-based mechanism for lowest-cost routing, In Distributed Computing, 18(1):61-72, 2005 .
- Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang. Graph distances in the streaming model: the value of space, In SODA, pp. 745-754, 2005 .
- Joan Feigenbaum, Lance Fortnow, David M. Pennock, Rahul Sami. Computation in a distributed information market, In Theor. Comput. Sci., 343(1-2):114-132, 2005 .
- Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami. Subjective-Cost Policy Routing, In WINE, pp. 174-183, 2005 .
- Jian Zhang, Jennifer Rexford, Joan Feigenbaum. Learning-based anomaly detection in BGP updates, In MineNet, pp. 219-220, 2005 .
- Joan Feigenbaum, Sampath Kannan, Jian Zhang. Computing Diameter in the Streaming and Sliding-Window Models, In Algorithmica, 41(1):25-41, 2004 .
- James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong. Towards a Theory of Data Entanglement: (Extended Abstract), In ESORICS, pp. 177-192, 2004 .
- Dan Boneh, Joan Feigenbaum, Abraham Silberschatz, Rebecca N. Wright. PORTIA: Privacy, Obligations, and Rights in Technologies of Information Assessment, In IEEE Data Eng. Bull., 27(1):10-18, 2004 .
- Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang. On Graph Problems in a Semi-streaming Model, In ICALP, pp. 531-543, 2004 .
- Joan Feigenbaum, Scott Shenker. Distributed algorithmic mechanism design: recent results and future directions, Distributed Computing Column, In Bulletin of the EATCS, 79:101-121, 2003 .
- Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker. Approximation and collusion in multicast cost sharing, In ACM Conference on Electronic Commerce, pp. 280, 2003 .
- Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker. Hardness results for multicast cost sharing, In Theor. Comput. Sci., 1-3(304):215-236, 2003 .
- Ninghui Li, Benjamin N. Grosof, Joan Feigenbaum. Delegation logic: A logic-based approach to distributed authorization, In ACM Trans. Inf. Syst. Secur., 6(1):128-171, 2003 .
- Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan. Testing and Spot-Checking of Data Streams, In Algorithmica, 34(1):67-80, 2002 .
- Joan Feigenbaum, Scott Shenker. Distributed algorithmic mechanism design: recent results and future directions, In DIAL-M, pp. 1-13, 2002 .
- Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan. An Approximate L1-Difference Algorithm for Massive Data Streams, In SIAM J. Comput., 32(1):131-151, 2002 .
- Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker. Hardness Results for Multicast Cost Sharing, In FSTTCS, pp. 133-144, 2002 .
- Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright. Secure Multiparty Computation of Approximations, In ICALP, pp. 927-938, 2001 .
- Joan Feigenbaum, Michael J. Freedman, Tomas Sander, Adam Shostack. Privacy Engineering for Digital Rights Management Systems, In Digital Rights Management Workshop, pp. 76-105, 2001 .
- Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker. Sharing the Cost of Multicast Transmissions, In J. Comput. Syst. Sci., 63(1):21-41, 2001 .
- Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker. Approximation and collusion in multicast cost sharing (extended abstract), In ACM Conference on Electronic Commerce, pp. 253-255, 2001 .
- Ernest Miller, Joan Feigenbaum. Taking the Copy Out of Copyright, In Digital Rights Management Workshop, pp. 233-244, 2001 .
- Ninghui Li, Joan Feigenbaum. Nonmonotonicity, User Interfaces, and Risk Assessment in Certificate Revocation, In Financial Cryptography, pp. 157-168, 2001 .
- Ninghui Li, Benjamin N. Grosof, Joan Feigenbaum. A Practically Implementable and Tractable Delegation Logic, In IEEE Symposium on Security and Privacy, pp. 27-42, 2000 .
- Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan. Testing and spot-checking of data streams (extended abstract), In SODA, pp. 165-174, 2000 .
- Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker. Sharing the cost of muliticast transmissions (preliminary version), In STOC, pp. 218-227, 2000 .
- Matt Blaze, Joan Feigenbaum, Moni Naor. A Formal Treatment of Remotely Keyed Encryption, In SODA, pp. 868-869, 1999 .
- Ninghui Li, Joan Feigenbaum, Benjamin N. Grosof. A Logic-based Knowledge Representation for Authorization with Delegation, In CSFW, pp. 162-174, 1999 .
- Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan. The Complexity of Problems on Graphs Represented as OBDDs, In Chicago J. Theor. Comput. Sci., 1999, 1999 .
- Matt Blaze, Joan Feigenbaum, Angelos D. Keromytis. The Role of Trust Management in Distributed Systems Security, In Secure Internet Programming, pp. 185-210, 1999 .
- Jon Callas, Joan Feigenbaum, David M. Goldschlag, Erin Sawyer. Fair Use, Intellectual Property, and the Information Economy (Panel Session Summary), In Financial Cryptography, pp. 173-183, 1999 .
- Matt Blaze, Joan Feigenbaum, Angelos D. Keromytis. KeyNote: Trust Management for Public-Key Infrastructures (Position Paper), In Security Protocols Workshop, pp. 59-63, 1998 .
- Matt Blaze, Joan Feigenbaum, Martin Strauss. Compliance Checking in the PolicyMaker Trust Management System, In Financial Cryptography, pp. 254-274, 1998 .
- Lenore Cowen, Joan Feigenbaum, Sampath Kannan. A Formal Framework for Evaluating Heuristic Programs, In Ann. Math. Artif. Intell., 22(3-4):193-206, 1998 .
- Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan. Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract), In STACS, pp. 216-226, 1998 .
- Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik. On Coherence, Random-Self-Reducibility, and Self-Correction, In Computational Complexity, 7(2):174-191, 1998 .
- Roger M. Needham, E. Stewart Lee, Joan Feigenbaum, Virgil D. Gligor, Bruce Christianson. Panel Session - Future Directions, In Security Protocols Workshop, pp. 227-239, 1998 .
- Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor. Random Debaters and the Hardness of Approximating Stochastic Functions, In SIAM J. Comput., 26(2):369-400, 1997 .
- Joan Feigenbaum, Martin Strauss. An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract), In STACS, pp. 523-534, 1997 .
- Donald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway. Locally Random Reductions: Improvements and Applications, In J. Cryptology, 10(1):17-36, 1997 .
- Yang-Hua Chu, Joan Feigenbaum, Brian A. LaMacchia, Paul Resnick, Martin Strauss. REFEREE: Trust Management for Web Applications, In Computer Networks, 29(8-13):953-964, 1997 .
- Matt Blaze, Joan Feigenbaum, Jack Lacy. Decentralized Trust Management, In IEEE Symposium on Security and Privacy, pp. 164-173, 1996 .
- Joan Feigenbaum, G. David Forney Jr., Brian H. Marcus, Robert J. McEliece, Alexander Vardy. Introduction to the special issue on codes and complexity, In IEEE Transactions on Information Theory, 42(6):1649-1659, 1996 .
- Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik. On Coherence, Random-self-reducibility, and Self-correction, In IEEE Conference on Computational Complexity, pp. 59-67, 1996 .
- Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor. Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions, In Chicago J. Theor. Comput. Sci., 1995, 1995 .
- Joan Feigenbaum, Daphne Koller, Peter W. Shor. A Game-Theoretic Classification of Interactive Complexity Classes, In Structure in Complexity Theory Conference, pp. 227-237, 1995 .
- Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman. The Power of Adaptiveness and Additional Queries in Random-Self-Reductions, In Computational Complexity, 4:158-174, 1994 .
- Joan Feigenbaum, Lance Fortnow. Random-Self-Reducibility of Complete Sets, In SIAM J. Comput., 22(5):994-1005, 1993 .
- Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund. Complexity Results for Pomset Languages, In SIAM J. Discrete Math., 6(3):432-442, 1993 .
- Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor. Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions, In STOC, pp. 305-314, 1993 .
- Richard Beigel, Joan Feigenbaum. On Being Incoherent Without Being Very Hard, In Computational Complexity, 2:1-17, 1992 .
- Joan Feigenbaum, Alejandro A. Sch \"a ffer. Finding the prime factors of strong direct product graphs in polynomial time, In Discrete Mathematics, 109(1-3):77-102, 1992 .
- Richard Beigel, Mihir Bellare, Joan Feigenbaum, Shafi Goldwasser. Languages that Are Easier than their Proofs, In FOCS, pp. 19-28, 1991 .
- Joan Feigenbaum, Rafail Ostrovsky. A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems, In ASIACRYPT, pp. 352-359, 1991 .
- Joan Feigenbaum, Lance Fortnow. On the Random-Self-Reducibility of Complete Sets, In Structure in Complexity Theory Conference, pp. 124-132, 1991 .
- Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund. Complexity Results for POMSET Languages, In CAV, pp. 343-353, 1991 .
- David Eppstein, Joan Feigenbaum, Chung-Lun Li. Equipartitions of graphs, In Discrete Mathematics, 91(3):239-248, 1990 .
- Donald Beaver, Joan Feigenbaum. Hiding Instances in Multioracle Queries, In STACS, pp. 37-48, 1990 .
- Donald Beaver, Joan Feigenbaum, Victor Shoup. Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract), In CRYPTO, pp. 326-338, 1990 .
- Mart\' \i n Abadi, Joan Feigenbaum. Secure Circuit Evaluation, In J. Cryptology, 2(1):1-12, 1990 .
- Joan Feigenbaum, Sampath Kannan, Noam Nisan. Lower Bounds on Random-Self-Reducibility, In Structure in Complexity Theory Conference, pp. 100-109, 1990 .
- Donald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway. Security with Low Communication Overhead, In CRYPTO, pp. 62-76, 1990 .
- Joan Feigenbaum, Ramsey W. Haddad. On Factorable Extensions and Subgraphs of Prime Graphs, In SIAM J. Discrete Math., 2(2):197-218, 1989 .
- Mart\' \i n Abadi, Joan Feigenbaum, Joe Kilian. On Hiding Information from an Oracle, In J. Comput. Syst. Sci., 39(1):21-50, 1989 .
- Mart\' \i n Abadi, Eric Allender, Andrei Z. Broder, Joan Feigenbaum, Lane A. Hemachandra. On Generating Solved Instances of Computational Problems, In CRYPTO, pp. 297-310, 1988 .
- Mart\' \i n Abadi, Joan Feigenbaum. A Simple Protocol for Secure Circuit Evaluation, In STACS, pp. 264-272, 1988 .
- Mart\' \i n Abadi, Joan Feigenbaum, Joe Kilian. On Hiding Information from an Oracle (Extended Abstract), In STOC, pp. 195-203, 1987 .
- Devika Subramanian, Joan Feigenbaum. Factorization in Experiment Generation, In AAAI, pp. 518-522, 1986 (Download) .
- Joan Feigenbaum, Alejandro A. Sch \"a ffer. Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism, In SIAM J. Comput., 15(2):619-627, 1986 .
- Joan Feigenbaum. Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him?, In CRYPTO, pp. 477-488, 1985 .
- Henry F. Korth, Gabriel M. Kuper, Joan Feigenbaum, Allen Van Gelder, Jeffrey D. Ullman. System/U: A Database System Based on the Universal Relation Assumption, In ACM Trans. Database Syst., 9(3):331-347, 1984 .
External Links
More information on Google, and DBLP
Facts about Joan FeigenbaumRDF feed
| Foaf:depiction | Anonymous.png + |
| Foaf:firstName | Joan + |
| Foaf:name | Joan Feigenbaum + |
| Foaf:surname | Feigenbaum + |
| Has identifier | Joan Feigenbaum + |

