Joan Feigenbaum

From Tetherless World Wiki

Jump to: navigation, search
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

Update publication from DBLP

  1. Joan FeigenbaumDavid C. ParkesDavid M. Pennock. Computational challenges in e-commerce, In Commun. ACM, 52(1):70-74, 2009 .
  2. [TW-2008-05] Danny WeitznerHal AbelsonTim Berners-LeeJoan FeigenbaumJames A. HendlerGerald Sussman. Information Accountability, In CACM, 51(6):82-86, June, 2008 (Download) .
  3. [TW-2008-30] Daniel J. WeitznerHarold AbelsonTim Berners-LeeJoan FeigenbaumJames A. HendlerGerald Jay Sussman. Information accountability, In Commun. ACM, 51(6):82-87, 2008 .
  4. Joan FeigenbaumAaron JohnsonPaul F. Syverson. Probabilistic analysis of onion routing in a black-box model, In WPES, pp. 1-10, 2007 .
  5. James AspnesJoan FeigenbaumAleksandr YampolskiySheng Zhong. Towards a theory of data entanglement, In Theor. Comput. Sci., 389(1-2):26-43, 2007 .
  6. Felipe Saint-JeanAaron JohnsonDan BonehJoan Feigenbaum. Private web search, In WPES, pp. 84-90, 2007 .
  7. Joan FeigenbaumAaron JohnsonPaul F. Syverson. A Model of Onion Routing with Provable Anonymity, In Financial Cryptography, pp. 57-71, 2007 .
  8. Danny WeitznerHal AbelsonTim Berners-LeeJoan FeigenbaumJames A. HendlerGerald Sussman. Information Accountability, In MIT CSAIL Technical Report, (MIT-CSAIL-TR-2007), June, 2007 (Download) .
  9. Joan FeigenbaumDavid R. KargerVahab S. MirrokniRahul Sami. Subjective-cost policy routing, In Theor. Comput. Sci., 378(2):175-189, 2007 .
  10. Joan FeigenbaumMichael Mitzenmacher. Towards a theory of networked computation, In SIGACT News, 37(4):22-26, 2006 .
  11. Jian ZhangJoan Feigenbaum. Finding highly correlated pairs efficiently with powerful pruning, In CIKM, pp. 152-161, 2006 (Download) .
  12. Joan FeigenbaumYuval IshaiTal MalkinKobbi NissimMartin J. StraussRebecca N. Wright. Secure multiparty computation of approximations, In ACM Transactions on Algorithms, 2(3):435-472, 2006 .
  13. Joan FeigenbaumRahul SamiScott Shenker. Mechanism design for policy routing, In Distributed Computing, 18(4):293-305, 2006 .
  14. Joan FeigenbaumVijay RamachandranMichael Schapira. Incentive-compatible interdomain routing, In ACM Conference on Electronic Commerce, pp. 130-139, 2006 .
  15. Joan FeigenbaumSampath KannanAndrew McGregorSiddharth SuriJian Zhang. Graph distances in the streaming model: the value of space, In SODA, pp. 745-754, 2005 .
  16. Joan FeigenbaumLance FortnowDavid M. PennockRahul Sami. Computation in a distributed information market, In Theor. Comput. Sci., 343(1-2):114-132, 2005 .
  17. Joan FeigenbaumDavid R. KargerVahab S. MirrokniRahul Sami. Subjective-Cost Policy Routing, In WINE, pp. 174-183, 2005 .
  18. Jian ZhangJennifer RexfordJoan Feigenbaum. Learning-based anomaly detection in BGP updates, In MineNet, pp. 219-220, 2005 .
  19. Joan FeigenbaumSampath KannanAndrew McGregorSiddharth SuriJian Zhang. On graph problems in a semi-streaming model, In Theor. Comput. Sci., 348(2-3):207-216, 2005 .
  20. Joan FeigenbaumChristos H. PapadimitriouRahul SamiScott Shenker. A BGP-based mechanism for lowest-cost routing, In Distributed Computing, 18(1):61-72, 2005 .
  21. Joan FeigenbaumSampath KannanJian Zhang. Computing Diameter in the Streaming and Sliding-Window Models, In Algorithmica, 41(1):25-41, 2004 .
  22. James AspnesJoan FeigenbaumAleksandr YampolskiySheng Zhong. Towards a Theory of Data Entanglement: (Extended Abstract), In ESORICS, pp. 177-192, 2004 .
  23. Dan BonehJoan FeigenbaumAbraham SilberschatzRebecca N. Wright. PORTIA: Privacy, Obligations, and Rights in Technologies of Information Assessment, In IEEE Data Eng. Bull., 27(1):10-18, 2004 .
  24. Joan FeigenbaumSampath KannanAndrew McGregorSiddharth SuriJian Zhang. On Graph Problems in a Semi-streaming Model, In ICALP, pp. 531-543, 2004 .
  25. Joan FeigenbaumArvind KrishnamurthyRahul SamiScott Shenker. Hardness results for multicast cost sharing, In Theor. Comput. Sci., 1-3(304):215-236, 2003 .
  26. Ninghui LiBenjamin N. GrosofJoan Feigenbaum. Delegation logic: A logic-based approach to distributed authorization, In ACM Trans. Inf. Syst. Secur., 6(1):128-171, 2003 .
  27. Joan FeigenbaumScott Shenker. Distributed algorithmic mechanism design: recent results and future directions, Distributed Computing Column, In Bulletin of the EATCS, 79:101-121, 2003 .
  28. Joan FeigenbaumArvind KrishnamurthyRahul SamiScott Shenker. Approximation and collusion in multicast cost sharing, In ACM Conference on Electronic Commerce, pp. 280, 2003 .
  29. Joan FeigenbaumSampath KannanMartin StraussMahesh Viswanathan. Testing and Spot-Checking of Data Streams, In Algorithmica, 34(1):67-80, 2002 .
  30. Joan FeigenbaumSampath KannanMartin StraussMahesh Viswanathan. An Approximate L1-Difference Algorithm for Massive Data Streams, In SIAM J. Comput., 32(1):131-151, 2002 .
  31. Joan FeigenbaumArvind KrishnamurthyRahul SamiScott Shenker. Hardness Results for Multicast Cost Sharing, In FSTTCS, pp. 133-144, 2002 .
  32. Joan FeigenbaumScott Shenker. Distributed algorithmic mechanism design: recent results and future directions, In DIAL-M, pp. 1-13, 2002 .
  33. Joan FeigenbaumMichael J. FreedmanTomas SanderAdam Shostack. Privacy Engineering for Digital Rights Management Systems, In Digital Rights Management Workshop, pp. 76-105, 2001 .
  34. Joan FeigenbaumChristos H. PapadimitriouScott Shenker. Sharing the Cost of Multicast Transmissions, In J. Comput. Syst. Sci., 63(1):21-41, 2001 .
  35. Joan FeigenbaumArvind KrishnamurthyRahul SamiScott Shenker. Approximation and collusion in multicast cost sharing (extended abstract), In ACM Conference on Electronic Commerce, pp. 253-255, 2001 .
  36. Ninghui LiJoan Feigenbaum. Nonmonotonicity, User Interfaces, and Risk Assessment in Certificate Revocation, In Financial Cryptography, pp. 157-168, 2001 .
  37. Ernest MillerJoan Feigenbaum. Taking the Copy Out of Copyright, In Digital Rights Management Workshop, pp. 233-244, 2001 .
  38. Joan FeigenbaumYuval IshaiTal MalkinKobbi NissimMartin StraussRebecca N. Wright. Secure Multiparty Computation of Approximations, In ICALP, pp. 927-938, 2001 .
  39. Joan FeigenbaumSampath KannanMartin StraussMahesh Viswanathan. Testing and spot-checking of data streams (extended abstract), In SODA, pp. 165-174, 2000 .
  40. Joan FeigenbaumChristos H. PapadimitriouScott Shenker. Sharing the cost of muliticast transmissions (preliminary version), In STOC, pp. 218-227, 2000 .
  41. Ninghui LiBenjamin N. GrosofJoan Feigenbaum. A Practically Implementable and Tractable Delegation Logic, In IEEE Symposium on Security and Privacy, pp. 27-42, 2000 .
  42. Ninghui LiJoan FeigenbaumBenjamin N. Grosof. A Logic-based Knowledge Representation for Authorization with Delegation, In CSFW, pp. 162-174, 1999 .
  43. Matt BlazeJoan FeigenbaumAngelos D. Keromytis. The Role of Trust Management in Distributed Systems Security, In Secure Internet Programming, pp. 185-210, 1999 .
  44. Jon CallasJoan FeigenbaumDavid M. GoldschlagErin Sawyer. Fair Use, Intellectual Property, and the Information Economy (Panel Session Summary), In Financial Cryptography, pp. 173-183, 1999 .
  45. Joan FeigenbaumSampath KannanMoshe Y. VardiMahesh Viswanathan. The Complexity of Problems on Graphs Represented as OBDDs, In Chicago J. Theor. Comput. Sci., 1999, 1999 .
  46. Matt BlazeJoan FeigenbaumMoni Naor. A Formal Treatment of Remotely Keyed Encryption, In SODA, pp. 868-869, 1999 .
  47. Lenore CowenJoan FeigenbaumSampath Kannan. A Formal Framework for Evaluating Heuristic Programs, In Ann. Math. Artif. Intell., 22(3-4):193-206, 1998 .
  48. Joan FeigenbaumSampath KannanMoshe Y. VardiMahesh Viswanathan. Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract), In STACS, pp. 216-226, 1998 .
  49. Joan FeigenbaumLance FortnowSophie LaplanteAshish V. Naik. On Coherence, Random-Self-Reducibility, and Self-Correction, In Computational Complexity, 7(2):174-191, 1998 .
  50. Roger M. NeedhamE. Stewart LeeJoan FeigenbaumVirgil D. GligorBruce Christianson. Panel Session - Future Directions, In Security Protocols Workshop, pp. 227-239, 1998 .
  51. Matt BlazeJoan FeigenbaumAngelos D. Keromytis. KeyNote: Trust Management for Public-Key Infrastructures (Position Paper), In Security Protocols Workshop, pp. 59-63, 1998 .
  52. Matt BlazeJoan FeigenbaumMartin Strauss. Compliance Checking in the PolicyMaker Trust Management System, In Financial Cryptography, pp. 254-274, 1998 .
  53. Joan FeigenbaumMartin Strauss. An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract), In STACS, pp. 523-534, 1997 .
  54. Yang-Hua ChuJoan FeigenbaumBrian A. LaMacchiaPaul ResnickMartin Strauss. REFEREE: Trust Management for Web Applications, In Computer Networks, 29(8-13):953-964, 1997 .
  55. Donald BeaverJoan FeigenbaumJoe KilianPhillip Rogaway. Locally Random Reductions: Improvements and Applications, In J. Cryptology, 10(1):17-36, 1997 .
  56. Anne CondonJoan FeigenbaumCarsten LundPeter W. Shor. Random Debaters and the Hardness of Approximating Stochastic Functions, In SIAM J. Comput., 26(2):369-400, 1997 .
  57. Joan FeigenbaumG. David Forney Jr.Brian H. MarcusRobert J. McElieceAlexander Vardy. Introduction to the special issue on codes and complexity, In IEEE Transactions on Information Theory, 42(6):1649-1659, 1996 .
  58. Joan FeigenbaumLance FortnowSophie LaplanteAshish V. Naik. On Coherence, Random-self-reducibility, and Self-correction, In IEEE Conference on Computational Complexity, pp. 59-67, 1996 .
  59. Matt BlazeJoan FeigenbaumJack Lacy. Decentralized Trust Management, In IEEE Symposium on Security and Privacy, pp. 164-173, 1996 .
  60. Anne CondonJoan FeigenbaumCarsten LundPeter W. Shor. Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions, In Chicago J. Theor. Comput. Sci., 1995, 1995 .
  61. Joan FeigenbaumDaphne KollerPeter W. Shor. A Game-Theoretic Classification of Interactive Complexity Classes, In Structure in Complexity Theory Conference, pp. 227-237, 1995 .
  62. Joan FeigenbaumLance FortnowCarsten LundDaniel A. Spielman. The Power of Adaptiveness and Additional Queries in Random-Self-Reductions, In Computational Complexity, 4:158-174, 1994 .
  63. Joan FeigenbaumJeremy A. KahnCarsten Lund. Complexity Results for Pomset Languages, In SIAM J. Discrete Math., 6(3):432-442, 1993 .
  64. Anne CondonJoan FeigenbaumCarsten LundPeter W. Shor. Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions, In STOC, pp. 305-314, 1993 .
  65. Joan FeigenbaumLance Fortnow. Random-Self-Reducibility of Complete Sets, In SIAM J. Comput., 22(5):994-1005, 1993 .
  66. Richard BeigelJoan Feigenbaum. On Being Incoherent Without Being Very Hard, In Computational Complexity, 2:1-17, 1992 .
  67. Joan FeigenbaumAlejandro 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 .
  68. Richard BeigelMihir BellareJoan FeigenbaumShafi Goldwasser. Languages that Are Easier than their Proofs, In FOCS, pp. 19-28, 1991 .
  69. Joan FeigenbaumRafail Ostrovsky. A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems, In ASIACRYPT, pp. 352-359, 1991 .
  70. Joan FeigenbaumLance Fortnow. On the Random-Self-Reducibility of Complete Sets, In Structure in Complexity Theory Conference, pp. 124-132, 1991 .
  71. Joan FeigenbaumJeremy A. KahnCarsten Lund. Complexity Results for POMSET Languages, In CAV, pp. 343-353, 1991 .
  72. Donald BeaverJoan FeigenbaumVictor Shoup. Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract), In CRYPTO, pp. 326-338, 1990 .
  73. Mart\' \i n AbadiJoan Feigenbaum. Secure Circuit Evaluation, In J. Cryptology, 2(1):1-12, 1990 .
  74. Joan FeigenbaumSampath KannanNoam Nisan. Lower Bounds on Random-Self-Reducibility, In Structure in Complexity Theory Conference, pp. 100-109, 1990 .
  75. Donald BeaverJoan FeigenbaumJoe KilianPhillip Rogaway. Security with Low Communication Overhead, In CRYPTO, pp. 62-76, 1990 .
  76. David EppsteinJoan FeigenbaumChung-Lun Li. Equipartitions of graphs, In Discrete Mathematics, 91(3):239-248, 1990 .
  77. Donald BeaverJoan Feigenbaum. Hiding Instances in Multioracle Queries, In STACS, pp. 37-48, 1990 .
  78. Joan FeigenbaumRamsey W. Haddad. On Factorable Extensions and Subgraphs of Prime Graphs, In SIAM J. Discrete Math., 2(2):197-218, 1989 .
  79. Mart\' \i n AbadiJoan FeigenbaumJoe Kilian. On Hiding Information from an Oracle, In J. Comput. Syst. Sci., 39(1):21-50, 1989 .
  80. Mart\' \i n AbadiJoan Feigenbaum. A Simple Protocol for Secure Circuit Evaluation, In STACS, pp. 264-272, 1988 .
  81. Mart\' \i n AbadiEric AllenderAndrei Z. BroderJoan FeigenbaumLane A. Hemachandra. On Generating Solved Instances of Computational Problems, In CRYPTO, pp. 297-310, 1988 .
  82. Mart\' \i n AbadiJoan FeigenbaumJoe Kilian. On Hiding Information from an Oracle (Extended Abstract), In STOC, pp. 195-203, 1987 .
  83. Devika SubramanianJoan Feigenbaum. Factorization in Experiment Generation, In AAAI, pp. 518-522, 1986 (Download) .
  84. Joan FeigenbaumAlejandro A. Sch \"a ffer. Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism, In SIAM J. Comput., 15(2):619-627, 1986 .
  85. Joan Feigenbaum. Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him?, In CRYPTO, pp. 477-488, 1985 .
  86. Henry F. KorthGabriel M. KuperJoan FeigenbaumAllen Van GelderJeffrey 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  +
Personal tools