| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Joan Feigenbaum Jack S. Breese , Joan Feigenbaum, Margo I. Seltzer : Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), New York, NY, USA, May 17-20, 2004 ACM 2004 James Aspnes , Joan Feigenbaum, Aleksandr Yampolskiy , Sheng Zhong : Towards a Theory of Data Entanglement: (Extended Abstract). ESORICS 2004 : 177-192 Joan Feigenbaum, Sampath Kannan , Andrew McGregor , Siddharth Suris , Jian Zhang : On Graph Problems in a Semi-streaming Model. ICALP 2004 : 531-543 Joan Feigenbaum, Rahul Sami , Scott Shenker : Mechanism design for policy routing. PODC 2004 : 11-20 Joan Feigenbaum, Sampath Kannan , Jian Zhang : Computing Diameter in the Streaming and Sliding-Window Models. Algorithmica 41 (1): 25-41 (2004) Joan Feigenbaum: Security and Privacy in Digital Rights Management, ACM CCS-9 Workshop, DRM 2002, Washington, DC, USA, November 18, 2002, Revised Papers Springer 2003 Joan Feigenbaum, Lance Fortnow , David M. Pennock , Rahul Sami : Computation in a distributed information market. ACM Conference on Electronic Commerce 2003 : 156-165 Joan Feigenbaum, Arvind Krishnamurthy , Rahul Sami , Scott Shenker : Approximation and collusion in multicast cost sharing. ACM Conference on Electronic Commerce 2003 : 280 Ninghui Li , Benjamin N. Grosof , Joan Feigenbaum: Delegation logic: A logic-based approach to distributed authorization. ACM Trans. Inf. Syst. Secur. 6 (1): 128-171 (2003) Joan Feigenbaum, Scott Shenker : Distributed algorithmic mechanism design: recent results and future directions, Distributed Computing Column. Bulletin of the EATCS 79 : 101-121 (2003) Joan Feigenbaum, Arvind Krishnamurthy , Rahul Sami , Scott Shenker : Hardness results for multicast cost sharing. Theor. Comput. Sci. 1-3 (304): 215-236 (2003) Joan Feigenbaum, Scott Shenker : Distributed algorithmic mechanism design: recent results and future directions. DIAL-M 2002 : 1-13 Joan Feigenbaum, Arvind Krishnamurthy , Rahul Sami , Scott Shenker : Hardness Results for Multicast Cost Sharing. FSTTCS 2002 : 133-144 Joan Feigenbaum, Christos H. Papadimitriou , Rahul Sami , Scott Shenker : A BGP-based mechanism for lowest-cost routing. PODC 2002 : 173-182 Joan Feigenbaum, Sampath Kannan , Martin Strauss , Mahesh Viswanathan : Testing and Spot-Checking of Data Streams. Algorithmica 34 (1): 67-80 (2002) Joan Feigenbaum, Sampath Kannan , Martin Strauss , Mahesh Viswanathan : An Approximate L1-Difference Algorithm for Massive Data Streams. SIAM J. Comput. 32 (1): 131-151 (2002) Joan Feigenbaum, Arvind Krishnamurthy , Rahul Sami , Scott Shenker : Approximation and collusion in multicast cost sharing (extended abstract). ACM Conference on Electronic Commerce 2001 : 253-255 Ernest Miller , Joan Feigenbaum: Taking the Copy Out of Copyright. Digital Rights Management Workshop 2001 : 233-244 Joan Feigenbaum, Michael J. Freedman , Tomas Sander , Adam Shostack : Privacy Engineering for Digital Rights Management Systems. Digital Rights Management Workshop 2001 : 76-105 Ninghui Li , Joan Feigenbaum: Nonmonotonicity, User Interfaces, and Risk Assessment in Certificate Revocation. Financial Cryptography 2001 : 166-177 Joan Feigenbaum, Yuval Ishai , Tal Malkin , Kobbi Nissim , Martin Strauss , Rebecca N. Wright : Secure Multiparty Computation of Approximations. ICALP 2001 : 927-938 Joan Feigenbaum, Christos H. Papadimitriou , Scott Shenker : Sharing the Cost of Multicast Transmissions. J. Comput. Syst. Sci. 63 (1): 21-41 (2001) Ninghui Li , Benjamin N. Grosof , Joan Feigenbaum: A Practically Implementable and Tractable Delegation Logic. IEEE Symposium on Security and Privacy 2000 : 27-42 Joan Feigenbaum, Sampath Kannan , Martin Strauss , Mahesh Viswanathan : Testing and spot-checking of data streams (extended abstract). SODA 2000 : 165-174 Joan Feigenbaum, Christos H. Papadimitriou , Scott Shenker : Sharing the cost of muliticast transmissions (preliminary version). STOC 2000 : 218-227 Ninghui Li , Joan Feigenbaum, Benjamin N. Grosof : A Logic-based Knowledge Representation for Authorization with Delegation. CSFW 1999 : 162-174 Joan Feigenbaum, Sampath Kannan , Martin Strauss , Mahesh Viswanathan : An Approximate L 1 -Difference Algorithm for Massive Data Streams. FOCS 1999 : 501-511 Jon Callas , Joan Feigenbaum, David M. Goldschlag , Erin Sawyer : Fair Use, Intellectual Property, and the Information Economy (Panel Session Summary). Financial Cryptography 1999 : 173-183 Matt Blaze , Joan Feigenbaum, Moni Naor : A Formal Treatment of Remotely Keyed Encryption. SODA 1999 : 868-869 Matt Blaze , Joan Feigenbaum, Angelos D. Keromytis : The Role of Trust Management in Distributed Systems Security. Secure Internet Programming 1999 : 185-210 Joan Feigenbaum, Sampath Kannan , Moshe Y. Vardi , Mahesh Viswanathan : The Complexity of Problems on Graphs Represented as OBDDs. Chicago J. Theor. Comput. Sci. 1999 : (1999) Matt Blaze , Joan Feigenbaum, Moni Naor : A Formal Treatment of Remotely Keyed Encryption. EUROCRYPT 1998 : 251-265 Matt Blaze , Joan Feigenbaum, Martin Strauss : Compliance Checking in the PolicyMaker Trust Management System. Financial Cryptography 1998 : 254-274 Joan Feigenbaum, Sampath Kannan , Moshe Y. Vardi , Mahesh Viswanathan : Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract). STACS 1998 : 216-226 Roger M. Needham , E. Stewart Lee , Joan Feigenbaum, Virgil D. Gligor , Bruce Christianson : Panel Session - Future Directions. Security Protocols Workshop 1998 : 227-239 Joan Feigenbaum: Overview of the AT&T Labs Trust-Management Project (Position Paper). Security Protocols Workshop 1998 : 45-50 Joan Feigenbaum: Overview of the AT&T Labs Trust-Management Project (Transcript of Discussion). Security Protocols Workshop 1998 : 51-58 Matt Blaze , Joan Feigenbaum, Angelos D. Keromytis : KeyNote: Trust Management for Public-Key Infrastructures (Position Paper). Security Protocols Workshop 1998 : 59-63 Lenore Cowen , Joan Feigenbaum, Sampath Kannan : A Formal Framework for Evaluating Heuristic Programs. Ann. Math. Artif. Intell. 22 (3-4): 193-206 (1998) Joan Feigenbaum, Lance Fortnow , Sophie Laplante , Ashish V. Naik : On Coherence, Random-Self-Reducibility, and Self-Correction. Computational Complexity 7 (2): 174-191 (1998) Joan Feigenbaum, Martin Strauss : An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract). STACS 1997 : 523-534 Yang-Hua Chu , Joan Feigenbaum, Brian A. LaMacchia , Paul Resnick , Martin Strauss : REFEREE: Trust Management for Web Applications. Computer Networks 29 (8-13): 953-964 (1997) Donald Beaver , Joan Feigenbaum, Joe Kilian , Phillip Rogaway : Locally Random Reductions: Improvements and Applications. J. Cryptology 10 (1): 17-36 (1997) Anne Condon , Joan Feigenbaum, Carsten Lund , Peter W. Shor : Random Debaters and the Hardness of Approximating Stochastic Functions. SIAM J. Comput. 26 (2): 369-400 (1997) Lenore Cowen , Joan Feigenbaum, Sampath Kannan : A Formal Framework for Evaluating Heuristic Programs. ICALP 1996 : 634-645 Joan Feigenbaum, Lance Fortnow , Sophie Laplante , Ashish V. Naik : On Coherence, Random-self-reducibility, and Self-correction. IEEE Conference on Computational Complexity 1996 : 59-67 Joan Feigenbaum, G. David Forney Jr. , Brian H. Marcus , Robert J. McEliece , Alexander Vardy : Introduction to the special issue on codes and complexity. IEEE Transactions on Information Theory 42 (6): 1649-1659 (1996) Joan Feigenbaum, Daphne Koller , Peter W. Shor : A Game-Theoretic Classification of Interactive Complexity Classes. Structure in Complexity Theory Conference 1995 : 227-237 Anne Condon , Joan Feigenbaum, Carsten Lund , Peter W. Shor : Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. Chicago J. Theor. Comput. Sci. 1995 : (1995) Anne Condon , Joan Feigenbaum, Carsten Lund , Peter W. Shor : Random Debaters and the Hardness of Approximating Stochastic Functions. Structure in Complexity Theory Conference 1994 : 280-293 Joan Feigenbaum, Lance Fortnow , Carsten Lund , Daniel A. Spielman : The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. Computational Complexity 4 : 158-174 (1994) Anne Condon , Joan Feigenbaum, Carsten Lund , Peter W. Shor : Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. STOC 1993 : 305-314 Joan Feigenbaum, Lance Fortnow : Random-Self-Reducibility of Complete Sets. SIAM J. Comput. 22 (5): 994-1005 (1993) Joan Feigenbaum, Jeremy A. Kahn , Carsten Lund : Complexity Results for Pomset Languages. SIAM J. Discrete Math. 6 (3): 432-442 (1993) Joan Feigenbaum: Advances in Cryptology - CRYPTO '91, 11th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1991, Proceedings Springer 1992 Joan Feigenbaum, Lance Fortnow , Carsten Lund , Daniel A. Spielman : The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. Structure in Complexity Theory Conference 1992 : 338-346 Richard Beigel , Joan Feigenbaum: On Being Incoherent Without Being Very Hard. Computational Complexity 2 : 1-17 (1992) Joan Feigenbaum, Rafail Ostrovsky : A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems. ASIACRYPT 1991 : 352-359 Joan Feigenbaum, Jeremy A. Kahn , Carsten Lund : Complexity Results for POMSET Languages. CAV 1991 : 343-353 Richard Beigel , Mihir Bellare , Joan Feigenbaum, Shafi Goldwasser : Languages that Are Easier than their Proofs FOCS 1991 : 19-28 Joan Feigenbaum, Lance Fortnow : On the Random-Self-Reducibility of Complete Sets. Structure in Complexity Theory Conference 1991 : 124-132 Donald Beaver , Joan Feigenbaum, Victor Shoup : Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract). CRYPTO 1990 : 326-338 Donald Beaver , Joan Feigenbaum, Joe Kilian , Phillip Rogaway : Security with Low Communication Overhead. CRYPTO 1990 : 62-76 Donald Beaver , Joan Feigenbaum: Hiding Instances in Multioracle Queries. STACS 1990 : 37-48 Joan Feigenbaum, Sampath Kannan , Noam Nisan : Lower Bounds on Random-Self-Reducibility. Structure in Complexity Theory Conference 1990 : 100-109 Martín Abadi , Joan Feigenbaum: Secure Circuit Evaluation. J. Cryptology 2 (1): 1-12 (1990) Martín Abadi , Joan Feigenbaum, Joe Kilian : On Hiding Information from an Oracle. J. Comput. Syst. Sci. 39 (1): 21-50 (1989) Joan Feigenbaum, Ramsey W. Haddad : On Factorable Extensions and Subgraphs of Prime Graphs. SIAM J. Discrete Math. 2 (2): 197-218 (1989) Martín Abadi , Eric Allender , Andrei Z. Broder , Joan Feigenbaum, Lane A. Hemachandra : On Generating Solved Instances of Computational Problems. CRYPTO 1988 : 297-310 Martín Abadi , Joan Feigenbaum: A Simple Protocol for Secure Circuit Evaluation. STACS 1988 : 264-272 Martín Abadi , Joan Feigenbaum, Joe Kilian : On Hiding Information from an Oracle (Extended Abstract) STOC 1987 : 195-203 Devika Subramanian , Joan Feigenbaum: Factorization in Experiment Generation. AAAI 1986 : 518-522 Joan Feigenbaum, Alejandro A. Schäffer : Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism. 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? CRYPTO 1985 : 477-488 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. ACM Trans. Database Syst. 9 (3): 331-347 (1984) 1 [ 5 ] [ 6 ] [ 7 ] [ 9 ] [ 10 ] 2 [ 7 ] 3 [ 74 ] 4 [ 12 ] [ 13 ] [ 14 ] [ 33 ] 5 [ 16 ] [ 19 ] 6 [ 16 ] 7 [ 38 ] [ 43 ] [ 44 ] [ 46 ] [ 47 ] 8 [ 75 ] 9 [ 7 ] 10 [ 48 ] 11 [ 41 ] 12 [ 34 ] 13 [ 24 ] [ 26 ] [ 27 ] [ 32 ] 14 [ 31 ] [ 37 ] 15 [ 29 ] 16 [ 15 ] [ 20 ] [ 23 ] [ 25 ] [ 30 ] [ 36 ] [ 69 ] 17 [ 57 ] 18 [ 1 ] 19 [ 41 ] 20 [ 48 ] 21 [ 16 ] 22 [ 50 ] [ 53 ] [ 67 ] 23 [ 8 ] 24 [ 7 ] 25 [ 55 ] 26 [ 17 ] [ 22 ] 27 [ 11 ] [ 31 ] [ 37 ] [ 42 ] [ 45 ] [ 49 ] [ 52 ] [ 60 ] [ 61 ] [ 71 ] [ 73 ] 28 [ 38 ] [ 46 ] 29 [ 5 ] [ 9 ] [ 13 ] [ 33 ] 30 [ 28 ] 31 [ 1 ] 32 [ 59 ] [ 63 ] [ 65 ] [ 68 ] 33 [ 1 ] 34 [ 34 ] 35 [ 30 ] [ 36 ] 36 [ 41 ] 37 [ 50 ] [ 53 ] [ 56 ] [ 67 ] 38 [ 17 ] [ 20 ] [ 22 ] [ 24 ] [ 25 ] [ 26 ] [ 27 ] [ 32 ] 39 [ 55 ] 40 [ 29 ] 41 [ 29 ] 42 [ 73 ] 43 [ 58 ] 44 [ 30 ] [ 36 ] 45 [ 44 ] [ 47 ] 46 [ 41 ] 47 [ 11 ] 48 [ 55 ] 49 [ 18 ] 50 [ 51 ] [ 54 ] [ 62 ] 51 [ 69 ] 52 [ 34 ] 53 [ 13 ] [ 33 ] 54 [ 59 ] [ 62 ] [ 63 ] [ 65 ] [ 68 ] [ 69 ] [ 72 ] 55 [ 57 ] 56 [ 48 ] 57 [ 3 ] 58 [ 75 ] 59 [ 51 ] [ 54 ] [ 59 ] [ 62 ] [ 63 ] [ 64 ] [ 65 ] [ 66 ] [ 68 ] [ 72 ] 60 [ 24 ] [ 26 ] [ 27 ] [ 28 ] [ 32 ] 61 [ 57 ] 62 [ 14 ] 63 [ 20 ] [ 25 ] 64 [ 34 ] [ 35 ] [ 43 ] [ 49 ] [ 52 ] [ 55 ] [ 60 ] [ 61 ] 65 [ 4 ] 66 [ 73 ] 67 [ 1 ] 68 [ 42 ] [ 45 ] 69 [ 29 ] 70 [ 42 ] [ 45 ] [ 49 ] [ 52 ] [ 60 ] [ 61 ] 71 [ 55 ] 72 [ 74 ] 73 [ 71 ] [ 73 ] 74 [ 74 ]  ©2005 Association for Computing Machinery |
