2009 | ||
---|---|---|
100 | EE | Joan Feigenbaum, David C. Parkes, David M. Pennock: Computational challenges in e-commerce. Commun. ACM 52(1): 70-74 (2009) |
2008 | ||
99 | Joan Feigenbaum, Yang Richard Yang: Proceedings of the ACM SIGCOMM 2008 Workshop on Economics of Networked Systems, NetEcon 2008, Seattle, WA, USA, August 22, 2008 ACM 2008 | |
98 | EE | Daniel J. Weitzner, Harold Abelson, Tim Berners-Lee, Joan Feigenbaum, James A. Hendler, Gerald J. Sussman: Information accountability. Commun. ACM 51(6): 82-87 (2008) |
97 | EE | Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang: Graph Distances in the Data-Stream Model. SIAM J. Comput. 38(5): 1709-1727 (2008) |
2007 | ||
96 | EE | Joan Feigenbaum, Aaron Johnson, Paul F. Syverson: A Model of Onion Routing with Provable Anonymity. Financial Cryptography 2007: 57-71 |
95 | EE | Joan Feigenbaum, Aaron Johnson, Paul F. Syverson: Probabilistic analysis of onion routing in a black-box model. WPES 2007: 1-10 |
94 | EE | Felipe Saint-Jean, Aaron Johnson, Dan Boneh, Joan Feigenbaum: Private web search. WPES 2007: 84-90 |
93 | EE | Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami: Subjective-cost policy routing. Theor. Comput. Sci. 378(2): 175-189 (2007) |
92 | EE | James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong: Towards a theory of data entanglement. Theor. Comput. Sci. 389(1-2): 26-43 (2007) |
2006 | ||
91 | Joan Feigenbaum, John C.-I. Chuang, David M. Pennock: Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), Ann Arbor, Michigan, USA, June 11-15, 2006 ACM 2006 | |
90 | EE | Joan Feigenbaum, Vijay Ramachandran, Michael Schapira: Incentive-compatible interdomain routing. ACM Conference on Electronic Commerce 2006: 130-139 |
89 | EE | Jian Zhang, Joan Feigenbaum: Finding highly correlated pairs efficiently with powerful pruning. CIKM 2006: 152-161 |
88 | EE | Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright: Secure multiparty computation of approximations. ACM Transactions on Algorithms 2(3): 435-472 (2006) |
87 | EE | Joan Feigenbaum, Rahul Sami, Scott Shenker: Mechanism design for policy routing. Distributed Computing 18(4): 293-305 (2006) |
86 | EE | Joan Feigenbaum, Michael Mitzenmacher: Towards a theory of networked computation. SIGACT News 37(4): 22-26 (2006) |
2005 | ||
85 | EE | Jian Zhang, Jennifer Rexford, Joan Feigenbaum: Learning-based anomaly detection in BGP updates. MineNet 2005: 219-220 |
84 | EE | Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang: Graph distances in the streaming model: the value of space. SODA 2005: 745-754 |
83 | EE | Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami: Subjective-Cost Policy Routing. WINE 2005: 174-183 |
82 | EE | Joan Feigenbaum, Christos H. Papadimitriou, Rahul Sami, Scott Shenker: A BGP-based mechanism for lowest-cost routing. Distributed Computing 18(1): 61-72 (2005) |
81 | EE | Joan Feigenbaum, Lance Fortnow, David M. Pennock, Rahul Sami: Computation in a distributed information market. Theor. Comput. Sci. 343(1-2): 114-132 (2005) |
80 | EE | Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang: On graph problems in a semi-streaming model. Theor. Comput. Sci. 348(2-3): 207-216 (2005) |
2004 | ||
79 | 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 | |
78 | EE | James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong: Towards a Theory of Data Entanglement: (Extended Abstract). ESORICS 2004: 177-192 |
77 | EE | Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang: On Graph Problems in a Semi-streaming Model. ICALP 2004: 531-543 |
76 | EE | Joan Feigenbaum, Rahul Sami, Scott Shenker: Mechanism design for policy routing. PODC 2004: 11-20 |
75 | EE | Joan Feigenbaum, Sampath Kannan, Jian Zhang: Computing Diameter in the Streaming and Sliding-Window Models. Algorithmica 41(1): 25-41 (2004) |
74 | EE | Dan Boneh, Joan Feigenbaum, Abraham Silberschatz, Rebecca N. Wright: PORTIA: Privacy, Obligations, and Rights in Technologies of Information Assessment. IEEE Data Eng. Bull. 27(1): 10-18 (2004) |
2003 | ||
73 | 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 | |
72 | EE | Joan Feigenbaum, Lance Fortnow, David M. Pennock, Rahul Sami: Computation in a distributed information market. ACM Conference on Electronic Commerce 2003: 156-165 |
71 | EE | Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker: Approximation and collusion in multicast cost sharing. ACM Conference on Electronic Commerce 2003: 280 |
70 | EE | 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) |
69 | Joan Feigenbaum, Scott Shenker: Distributed algorithmic mechanism design: recent results and future directions, Distributed Computing Column. Bulletin of the EATCS 79: 101-121 (2003) | |
68 | EE | Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker: Hardness results for multicast cost sharing. Theor. Comput. Sci. 1-3(304): 215-236 (2003) |
2002 | ||
67 | EE | Joan Feigenbaum, Scott Shenker: Distributed algorithmic mechanism design: recent results and future directions. DIAL-M 2002: 1-13 |
66 | EE | Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker: Hardness Results for Multicast Cost Sharing. FSTTCS 2002: 133-144 |
65 | EE | Joan Feigenbaum, Christos H. Papadimitriou, Rahul Sami, Scott Shenker: A BGP-based mechanism for lowest-cost routing. PODC 2002: 173-182 |
64 | EE | Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan: Testing and Spot-Checking of Data Streams. Algorithmica 34(1): 67-80 (2002) |
63 | EE | 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) |
2001 | ||
62 | EE | 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 |
61 | EE | Ernest Miller, Joan Feigenbaum: Taking the Copy Out of Copyright. Digital Rights Management Workshop 2001: 233-244 |
60 | EE | Joan Feigenbaum, Michael J. Freedman, Tomas Sander, Adam Shostack: Privacy Engineering for Digital Rights Management Systems. Digital Rights Management Workshop 2001: 76-105 |
59 | EE | Ninghui Li, Joan Feigenbaum: Nonmonotonicity, User Interfaces, and Risk Assessment in Certificate Revocation. Financial Cryptography 2001: 157-168 |
58 | EE | Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright: Secure Multiparty Computation of Approximations. ICALP 2001: 927-938 |
57 | Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker: Sharing the Cost of Multicast Transmissions. J. Comput. Syst. Sci. 63(1): 21-41 (2001) | |
2000 | ||
56 | EE | Ninghui Li, Benjamin N. Grosof, Joan Feigenbaum: A Practically Implementable and Tractable Delegation Logic. IEEE Symposium on Security and Privacy 2000: 27-42 |
55 | EE | Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan: Testing and spot-checking of data streams (extended abstract). SODA 2000: 165-174 |
54 | EE | Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker: Sharing the cost of muliticast transmissions (preliminary version). STOC 2000: 218-227 |
1999 | ||
53 | EE | Ninghui Li, Joan Feigenbaum, Benjamin N. Grosof: A Logic-based Knowledge Representation for Authorization with Delegation. CSFW 1999: 162-174 |
52 | EE | Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan: An Approximate L1-Difference Algorithm for Massive Data Streams. FOCS 1999: 501-511 |
51 | EE | 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 |
50 | EE | Matt Blaze, Joan Feigenbaum, Moni Naor: A Formal Treatment of Remotely Keyed Encryption. SODA 1999: 868-869 |
49 | Matt Blaze, Joan Feigenbaum, Angelos D. Keromytis: The Role of Trust Management in Distributed Systems Security. Secure Internet Programming 1999: 185-210 | |
48 | EE | 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) |
1998 | ||
47 | EE | Matt Blaze, Joan Feigenbaum, Moni Naor: A Formal Treatment of Remotely Keyed Encryption. EUROCRYPT 1998: 251-265 |
46 | EE | Matt Blaze, Joan Feigenbaum, Martin Strauss: Compliance Checking in the PolicyMaker Trust Management System. Financial Cryptography 1998: 254-274 |
45 | Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan: Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract). STACS 1998: 216-226 | |
44 | EE | Roger M. Needham, E. Stewart Lee, Joan Feigenbaum, Virgil D. Gligor, Bruce Christianson: Panel Session - Future Directions. Security Protocols Workshop 1998: 227-239 |
43 | EE | Joan Feigenbaum: Overview of the AT&T Labs Trust-Management Project (Position Paper). Security Protocols Workshop 1998: 45-50 |
42 | EE | Joan Feigenbaum: Overview of the AT&T Labs Trust-Management Project (Transcript of Discussion). Security Protocols Workshop 1998: 51-58 |
41 | EE | Matt Blaze, Joan Feigenbaum, Angelos D. Keromytis: KeyNote: Trust Management for Public-Key Infrastructures (Position Paper). Security Protocols Workshop 1998: 59-63 |
40 | Lenore Cowen, Joan Feigenbaum, Sampath Kannan: A Formal Framework for Evaluating Heuristic Programs. Ann. Math. Artif. Intell. 22(3-4): 193-206 (1998) | |
39 | Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik: On Coherence, Random-Self-Reducibility, and Self-Correction. Computational Complexity 7(2): 174-191 (1998) | |
1997 | ||
38 | Joan Feigenbaum, Martin Strauss: An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract). STACS 1997: 523-534 | |
37 | EE | 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) |
36 | Donald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway: Locally Random Reductions: Improvements and Applications. J. Cryptology 10(1): 17-36 (1997) | |
35 | 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) | |
1996 | ||
34 | Lenore Cowen, Joan Feigenbaum, Sampath Kannan: A Formal Framework for Evaluating Heuristic Programs. ICALP 1996: 634-645 | |
33 | EE | 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 |
32 | EE | Matt Blaze, Joan Feigenbaum, Jack Lacy: Decentralized Trust Management. IEEE Symposium on Security and Privacy 1996: 164-173 |
31 | 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) | |
1995 | ||
30 | Joan Feigenbaum, Daphne Koller, Peter W. Shor: A Game-Theoretic Classification of Interactive Complexity Classes. Structure in Complexity Theory Conference 1995: 227-237 | |
29 | EE | 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) |
1994 | ||
28 | 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 | |
27 | 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) | |
1993 | ||
26 | EE | Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor: Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. STOC 1993: 305-314 |
25 | Joan Feigenbaum, Lance Fortnow: Random-Self-Reducibility of Complete Sets. SIAM J. Comput. 22(5): 994-1005 (1993) | |
24 | Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund: Complexity Results for Pomset Languages. SIAM J. Discrete Math. 6(3): 432-442 (1993) | |
1992 | ||
23 | Joan Feigenbaum: Advances in Cryptology - CRYPTO '91, 11th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1991, Proceedings Springer 1992 | |
22 | 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 | |
21 | Richard Beigel, Joan Feigenbaum: On Being Incoherent Without Being Very Hard. Computational Complexity 2: 1-17 (1992) | |
20 | EE | Joan Feigenbaum, Alejandro A. Schäffer: Finding the prime factors of strong direct product graphs in polynomial time. Discrete Mathematics 109(1-3): 77-102 (1992) |
1991 | ||
19 | Joan Feigenbaum, Rafail Ostrovsky: A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems. ASIACRYPT 1991: 352-359 | |
18 | Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund: Complexity Results for POMSET Languages. CAV 1991: 343-353 | |
17 | Richard Beigel, Mihir Bellare, Joan Feigenbaum, Shafi Goldwasser: Languages that Are Easier than their Proofs FOCS 1991: 19-28 | |
16 | Joan Feigenbaum, Lance Fortnow: On the Random-Self-Reducibility of Complete Sets. Structure in Complexity Theory Conference 1991: 124-132 | |
1990 | ||
15 | EE | Donald Beaver, Joan Feigenbaum, Victor Shoup: Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract). CRYPTO 1990: 326-338 |
14 | EE | Donald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway: Security with Low Communication Overhead. CRYPTO 1990: 62-76 |
13 | Donald Beaver, Joan Feigenbaum: Hiding Instances in Multioracle Queries. STACS 1990: 37-48 | |
12 | Joan Feigenbaum, Sampath Kannan, Noam Nisan: Lower Bounds on Random-Self-Reducibility. Structure in Complexity Theory Conference 1990: 100-109 | |
11 | EE | David Eppstein, Joan Feigenbaum, Chung-Lun Li: Equipartitions of graphs. Discrete Mathematics 91(3): 239-248 (1990) |
10 | Martín Abadi, Joan Feigenbaum: Secure Circuit Evaluation. J. Cryptology 2(1): 1-12 (1990) | |
1989 | ||
9 | Martín Abadi, Joan Feigenbaum, Joe Kilian: On Hiding Information from an Oracle. J. Comput. Syst. Sci. 39(1): 21-50 (1989) | |
8 | Joan Feigenbaum, Ramsey W. Haddad: On Factorable Extensions and Subgraphs of Prime Graphs. SIAM J. Discrete Math. 2(2): 197-218 (1989) | |
1988 | ||
7 | EE | Martín Abadi, Eric Allender, Andrei Z. Broder, Joan Feigenbaum, Lane A. Hemachandra: On Generating Solved Instances of Computational Problems. CRYPTO 1988: 297-310 |
6 | Martín Abadi, Joan Feigenbaum: A Simple Protocol for Secure Circuit Evaluation. STACS 1988: 264-272 | |
1987 | ||
5 | Martín Abadi, Joan Feigenbaum, Joe Kilian: On Hiding Information from an Oracle (Extended Abstract) STOC 1987: 195-203 | |
1986 | ||
4 | Devika Subramanian, Joan Feigenbaum: Factorization in Experiment Generation. AAAI 1986: 518-522 | |
3 | Joan Feigenbaum, Alejandro A. Schäffer: Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism. SIAM J. Comput. 15(2): 619-627 (1986) | |
1985 | ||
2 | EE | Joan Feigenbaum: Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him? CRYPTO 1985: 477-488 |
1984 | ||
1 | EE | 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) |