The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joan Feigenbaum: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  87. A Model of Onion Routing with Provable Anonymity. [Citation Graph (, )][DBLP]


  88. Preventing Active Timing Attacks in Low-Latency Anonymous Communication. [Citation Graph (, )][DBLP]


  89. Approximate privacy: foundations and quantification (extended abstract). [Citation Graph (, )][DBLP]


  90. Private web search. [Citation Graph (, )][DBLP]


  91. Probabilistic analysis of onion routing in a black-box model. [Citation Graph (, )][DBLP]


  92. Learning-based anomaly detection in BGP updates. [Citation Graph (, )][DBLP]


  93. Information accountability. [Citation Graph (, )][DBLP]


  94. Computational challenges in e-commerce. [Citation Graph (, )][DBLP]


  95. Approximate Privacy: Foundations and Quantification [Citation Graph (, )][DBLP]


  96. Approximate Privacy: PARs for Set Problems [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002