Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJoan Feigenbaum
Person information
- affiliation: Yale University, New Haven, Connecticut, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2017
[c86]Aaron Johnson, Rob Jansen, Aaron D. Jaggard, Joan Feigenbaum, Paul Syverson:
Avoiding The Man on the Wire: Improving Tor's Security with Trust-Aware Path Selection. NDSS 2017- [c85]Joan Feigenbaum, Bryan Ford:
Multiple Objectives of Lawful-Surveillance Protocols. Security Protocols Workshop 2017: 1-8 - [c84]Joan Feigenbaum:
Multiple Objectives of Lawful-Surveillance Protocols (Transcript of Discussion). Security Protocols Workshop 2017: 9-17 - [i13]Ludovic Barman, Italo Dacosta, Mahdi Zamani, Ennan Zhai, Bryan Ford, Jean-Pierre Hubaux, Joan Feigenbaum:
PriFi: A Low-Latency Local-Area Anonymous Communication Network. CoRR abs/1710.10237 (2017) - 2016
- [c83]Debayan Gupta, Benjamin Mood, Joan Feigenbaum, Kevin R. B. Butler, Patrick Traynor:
Using Intel Software Guard Extensions for Efficient Two-Party Secure Function Evaluation. Financial Cryptography Workshops 2016: 302-318 - [c82]Ludovic Barman, Mahdi Zamani, Italo Dacosta, Joan Feigenbaum, Bryan Ford, Jean-Pierre Hubaux, David Wolinsky:
PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication. WPES@CCS 2016: 181-184 - [c81]Aaron Segal, Joan Feigenbaum, Bryan Ford:
Privacy-Preserving Lawful Contact Chaining: [Preliminary Report]. WPES@CCS 2016: 185-188 - [i12]Aaron Segal, Joan Feigenbaum, Bryan Ford:
Open, privacy-preserving protocols for lawful surveillance. CoRR abs/1607.03659 (2016) - 2015
- [j52]Joan Feigenbaum, Bryan Ford:
Seeking anonymity in an internet panopticon. Commun. ACM 58(10): 58-69 (2015) - [j51]Aaron D. Jaggard, Aaron Johnson, Sarah Cortes, Paul Syverson, Joan Feigenbaum:
20, 000 In League Under the Sea: Anonymous Communication, Trust, MLATs, and Undersea Cables. PoPETs 2015(1): 4-24 (2015) - [c80]Joan Feigenbaum, Brad Rosen:
On the Use of Security and Privacy Technology as a Plot Device. Security Protocols Workshop 2015: 261-275 - [c79]Joan Feigenbaum:
On the Use of Security and Privacy Technology as a Plot Device (Transcript of Discussion). Security Protocols Workshop 2015: 276-282 - [i11]Benjamin Mood, Debayan Gupta, Kevin R. B. Butler, Joan Feigenbaum:
Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values. CoRR abs/1506.02954 (2015) - [i10]Aaron Johnson, Rob Jansen, Aaron D. Jaggard, Joan Feigenbaum, Paul F. Syverson:
Avoiding The Man on the Wire: Improving Tor's Security with Trust-Aware Path Selection. CoRR abs/1511.05453 (2015) - 2014
- [j50]Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira:
Approximate Privacy: Foundations and Quantification. ACM Trans. Algorithms 10(3): 11:1-11:38 (2014) - [c78]Benjamin Mood, Debayan Gupta, Kevin R. B. Butler, Joan Feigenbaum:
Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values. ACM Conference on Computer and Communications Security 2014: 582-596 - [c77]Giovanni Di Crescenzo, Joan Feigenbaum, Debayan Gupta, Euthimios Panagos, Jason Perry, Rebecca N. Wright:
Practical and Privacy-Preserving Policy Compliance for Outsourced Data. Financial Cryptography Workshops 2014: 181-194 - [c76]Joan Feigenbaum, Aaron D. Jaggard, Rebecca N. Wright:
Open vs. closed systems for accountability. HotSoS 2014: 4 - [c75]Jason Perry, Debayan Gupta, Joan Feigenbaum, Rebecca N. Wright:
Systematizing Secure Computation for Research and Decision Support. SCN 2014: 380-397 - [c74]Joan Feigenbaum, Jérémie Koenig:
On the Feasibility of a Technological Response to the Surveillance Morass. Security Protocols Workshop 2014: 239-252 - [c73]Joan Feigenbaum, Jérémie Koenig:
On the Feasibility of a Technological Response to the Surveillance Morass (Transcript of Discussion). Security Protocols Workshop 2014: 253-262 - [c72]Aaron Segal, Bryan Ford, Joan Feigenbaum:
Catching Bandits and Only Bandits: Privacy-Preserving Intersection Warrants for Lawful Surveillance. FOCI 2014 - [i9]Aaron D. Jaggard, Aaron Johnson, Paul F. Syverson, Joan Feigenbaum:
Representing Network Trust and Using It to Improve Anonymous Communication. CoRR abs/1406.3583 (2014) - 2013
- [c71]Hongda Xiao, Bryan Ford, Joan Feigenbaum:
Structural cloud audits that protect private information. CCSW 2013: 101-112 - [e7]Dan Boneh, Tim Roughgarden, Joan Feigenbaum:
Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. ACM 2013, ISBN 978-1-4503-2029-0 [contents] - [i8]
- 2012
- [j49]Joan Feigenbaum, Aaron Johnson, Paul F. Syverson:
Probabilistic analysis of onion routing in a black-box model. ACM Trans. Inf. Syst. Secur. 15(3): 14:1-14:28 (2012) - [c70]Debayan Gupta, Aaron Segal, Aurojit Panda, Gil Segev, Michael Schapira, Joan Feigenbaum, Jennifer Rexford, Scott Shenker:
A new approach to interdomain routing based on secure multi-party computation. HotNets 2012: 37-42 - [c69]
- [c68]Joan Feigenbaum, Brighten Godfrey, Aurojit Panda, Michael Schapira, Scott Shenker, Ankit Singla:
Brief announcement: on the resilience of routing tables. PODC 2012: 237-238 - [c67]Joan Feigenbaum, Michael Mitzenmacher, Georgios Zervas:
An Economic Analysis of User-Privacy Options in Ad-Supported Services. WINE 2012: 30-43 - [i7]Joan Feigenbaum, Brighten Godfrey, Aurojit Panda, Michael Schapira, Scott Shenker, Ankit Singla:
On the Resilience of Routing Tables. CoRR abs/1207.3732 (2012) - [i6]Joan Feigenbaum, Michael Mitzenmacher, Georgios Zervas:
An Economic Analysis of User-Privacy Options in Ad-Supported Services. CoRR abs/1208.0383 (2012) - 2011
- [j48]Joan Feigenbaum, Vijay Ramachandran, Michael Schapira:
Incentive-compatible interdomain routing. Distributed Computing 23(5-6): 301-319 (2011) - [c66]Joan Feigenbaum, Aaron D. Jaggard, Rebecca N. Wright:
Towards a formal model of accountability. NSPW 2011: 45-56 - [c65]Joan Feigenbaum, James A. Hendler, Aaron D. Jaggard, Daniel J. Weitzner, Rebecca N. Wright:
Accountability and deterrence in online life. WebSci 2011: 7:1-7:7 - [i5]Joan Feigenbaum, Aaron Johnson, Paul F. Syverson:
Probabilistic Analysis of Onion Routing in a Black-box Model. CoRR abs/1111.2520 (2011) - 2010
- [c64]Joan Feigenbaum, Aaron Johnson, Paul F. Syverson:
Preventing Active Timing Attacks in Low-Latency Anonymous Communication. Privacy Enhancing Technologies 2010: 166-183 - [c63]Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira:
Approximate privacy: foundations and quantification (extended abstract). EC 2010: 167-178 - [i4]Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira:
Approximate Privacy: PARs for Set Problems. CoRR abs/1001.3388 (2010)
2000 – 2009
- 2009
- [j47]Joan Feigenbaum, David C. Parkes, David M. Pennock:
Computational challenges in e-commerce. Commun. ACM 52(1): 70-74 (2009) - [i3]Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira:
Approximate Privacy: Foundations and Quantification. CoRR abs/0910.5714 (2009) - 2008
- [j46]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) - [j45]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) - [j44]
- [e6]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, ISBN 978-1-60558-179-8 [contents] - 2007
- [j43]Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami:
Subjective-cost policy routing. Theor. Comput. Sci. 378(2): 175-189 (2007) - [j42]James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong:
Towards a theory of data entanglement. Theor. Comput. Sci. 389(1-2): 26-43 (2007) - [c62]Joan Feigenbaum, Aaron Johnson, Paul F. Syverson:
A Model of Onion Routing with Provable Anonymity. Financial Cryptography 2007: 57-71 - [c61]Joan Feigenbaum, Aaron Johnson, Paul F. Syverson:
Probabilistic analysis of onion routing in a black-box model. WPES 2007: 1-10 - [c60]
- 2006
- [j41]Joan Feigenbaum, Rahul Sami, Scott Shenker:
Mechanism design for policy routing. Distributed Computing 18(4): 293-305 (2006) - [j40]Joan Feigenbaum, Michael Mitzenmacher:
Towards a theory of networked computation. SIGACT News 37(4): 22-26 (2006) - [j39]Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright:
Secure multiparty computation of approximations. ACM Trans. Algorithms 2(3): 435-472 (2006) - [c59]Jian Zhang, Joan Feigenbaum:
Finding highly correlated pairs efficiently with powerful pruning. CIKM 2006: 152-161 - [c58]Joan Feigenbaum, Vijay Ramachandran, Michael Schapira:
Incentive-compatible interdomain routing. EC 2006: 130-139 - [e5]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, ISBN 1-59593-236-4 [contents] - 2005
- [j38]Joan Feigenbaum, Sampath Kannan, Jian Zhang:
Computing Diameter in the Streaming and Sliding-Window Models. Algorithmica 41(1): 25-41 (2005) - [j37]Joan Feigenbaum, Christos H. Papadimitriou, Rahul Sami, Scott Shenker:
A BGP-based mechanism for lowest-cost routing. Distributed Computing 18(1): 61-72 (2005) - [j36]Joan Feigenbaum, Lance Fortnow, David M. Pennock, Rahul Sami:
Computation in a distributed information market. Theor. Comput. Sci. 343(1-2): 114-132 (2005) - [j35]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) - [c57]Jian Zhang, Jennifer Rexford, Joan Feigenbaum:
Learning-based anomaly detection in BGP updates. MineNet 2005: 219-220 - [c56]Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang:
Graph distances in the streaming model: the value of space. SODA 2005: 745-754 - [c55]Dirk Bergemann, Thomas Eisenbach, Joan Feigenbaum, Scott Shenker:
Flexibility as an Instrument in Digital Rights Management. WEIS 2005 - [c54]Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami:
Subjective-Cost Policy Routing. WINE 2005: 174-183 - 2004
- [j34]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) - [j33]Aaron Archer, Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker:
Approximation and collusion in multicast cost sharing. Games and Economic Behavior 47(1): 36-71 (2004) - [c53]James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong:
Towards a Theory of Data Entanglement: (Extended Abstract). ESORICS 2004: 177-192 - [c52]Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang:
On Graph Problems in a Semi-streaming Model. ICALP 2004: 531-543 - [c51]
- [e4]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 [contents] - 2003
- [j32]Joan Feigenbaum, Scott Shenker:
Distributed algorithmic mechanism design: recent results and future directions, Distributed Computing Column. Bulletin of the EATCS 79: 101-121 (2003) - [j31]Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker:
Hardness results for multicast cost sharing. Theor. Comput. Sci. 1-3(304): 215-236 (2003) - [j30]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) - [c50]Joan Feigenbaum, Lance Fortnow, David M. Pennock, Rahul Sami:
Computation in a distributed information market. EC 2003: 156-165 - [c49]Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker:
Approximation and collusion in multicast cost sharing. EC 2003: 280 - [e3]Joan Feigenbaum:
Security and Privacy in Digital Rights Management, ACM CCS-9 Workshop, DRM 2002, Washington, DC, USA, November 18, 2002, Revised Papers. Lecture Notes in Computer Science 2696, Springer 2003, ISBN 3-540-40410-4 [contents] - 2002
- [j29]Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
Testing and Spot-Checking of Data Streams. Algorithmica 34(1): 67-80 (2002) - [j28]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) - [c48]Joan Feigenbaum, Scott Shenker:
Distributed algorithmic mechanism design: recent results and future directions. DIAL-M 2002: 1-13 - [c47]Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker:
Hardness Results for Multicast Cost Sharing. FSTTCS 2002: 133-144 - [c46]Joan Feigenbaum, Christos H. Papadimitriou, Rahul Sami, Scott Shenker:
A BGP-based mechanism for lowest-cost routing. PODC 2002: 173-182 - 2001
- [j27]Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker:
Sharing the Cost of Multicast Transmissions. J. Comput. Syst. Sci. 63(1): 21-41 (2001) - [c45]Joan Feigenbaum, Michael J. Freedman, Tomas Sander, Adam Shostack:
Privacy Engineering for Digital Rights Management Systems. Digital Rights Management Workshop 2001: 76-105 - [c44]Ernest Miller, Joan Feigenbaum:
Taking the Copy Out of Copyright. Digital Rights Management Workshop 2001: 233-244 - [c43]Ninghui Li, Joan Feigenbaum:
Nonmonotonicity, User Interfaces, and Risk Assessment in Certificate Revocation. Financial Cryptography 2001: 157-168 - [c42]Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright:
Secure Multiparty Computation of Approximations. ICALP 2001: 927-938 - [c41]Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker:
Approximation and collusion in multicast cost sharing (extended abstract). EC 2001: 253-255 - [i2]Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright:
Secure Multiparty Computation of Approximations. IACR Cryptology ePrint Archive 2001: 24 (2001) - 2000
- [c40]Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
Testing and spot-checking of data streams (extended abstract). SODA 2000: 165-174 - [c39]Ninghui Li, Benjamin N. Grosof, Joan Feigenbaum:
A Practically Implementable and Tractable Delegation Logic. IEEE Symposium on Security and Privacy 2000: 27-42 - [c38]Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker:
Sharing the cost of muliticast transmissions (preliminary version). STOC 2000: 218-227
1990 – 1999
- 1999
- [j26]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) - [c37]Ninghui Li, Joan Feigenbaum, Benjamin N. Grosof:
A Logic-based Knowledge Representation for Authorization with Delegation. CSFW 1999: 162-174 - [c36]Matt Blaze, Joan Feigenbaum, Angelos D. Keromytis:
The Role of Trust Management in Distributed Systems Security. Secure Internet Programming 1999: 185-210 - [c35]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 - [c34]Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
An Approximate L1-Difference Algorithm for Massive Data Streams. FOCS 1999: 501-511 - [c33]Matt Blaze, Joan Feigenbaum, Moni Naor:
A Formal Treatment of Remotely Keyed Encryption. SODA 1999: 868-869 - [r1]Charles H. Goldberg, Jianer Chen, Viera Krnanova Proulx, Joan Feigenbaum, Sampath Kannan:
Information Structures. Handbook of Discrete and Combinatorial Mathematics 1999 - [i1]Matt Blaze, Joan Feigenbaum, John Ioannidis, Angelos D. Keromytis:
The KeyNote Trust-Management System Version 2. RFC 2704: 1-37 (1999) - 1998
- [j25]Lenore Cowen, Joan Feigenbaum, Sampath Kannan:
A Formal Framework for Evaluating Heuristic Programs. Ann. Math. Artif. Intell. 22(3-4): 193-206 (1998) - [j24]Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik:
On Coherence, Random-Self-Reducibility, and Self-Correction. Computational Complexity 7(2): 174-191 (1998) - [c32]Matt Blaze, Joan Feigenbaum, Moni Naor:
A Formal Treatment of Remotely Keyed Encryption. EUROCRYPT 1998: 251-265 - [c31]Matt Blaze, Joan Feigenbaum, Martin Strauss:
Compliance Checking in the PolicyMaker Trust Management System. Financial Cryptography 1998: 254-274 - [c30]Joan Feigenbaum:
Overview of the AT&T Labs Trust-Management Project (Position Paper). Security Protocols Workshop 1998: 45-50 - [c29]Joan Feigenbaum:
Overview of the AT&T Labs Trust-Management Project (Transcript of Discussion). Security Protocols Workshop 1998: 51-58 - [c28]Matt Blaze, Joan Feigenbaum, Angelos D. Keromytis:
KeyNote: Trust Management for Public-Key Infrastructures (Position Paper). Security Protocols Workshop 1998: 59-63 - [c27]Roger M. Needham, E. Stewart Lee, Joan Feigenbaum, Virgil D. Gligor, Bruce Christianson:
Panel Session - Future Directions. Security Protocols Workshop 1998: 227-239 - [c26]Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan:
Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract). STACS 1998: 216-226 - 1997
- [j23]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) - [j22]Matt Blaze, Joan Feigenbaum, Paul Resnick, Martin Strauss:
Managing trust in an information-labeling system. European Transactions on Telecommunications 8(5): 491-501 (1997) - [j21]Donald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway:
Locally Random Reductions: Improvements and Applications. J. Cryptology 10(1): 17-36 (1997) - [j20]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) - [j19]Yang-Hua Chu, Joan Feigenbaum, Brian A. LaMacchia, Paul Resnick, Martin Strauss:
Referee: trust management for Web applications. World Wide Web Journal 2: 127-139 (1997) - [c25]Joan Feigenbaum, Martin Strauss:
An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract). STACS 1997: 523-534 - 1996
- [j18]Eric Allender, Joan Feigenbaum, Judy Goldsmith, Toniann Pitassi, Steven Rudich:
The future of computational complexity theory: part II. SIGACT News 27(4): 3-7 (1996) - [j17]Joan Feigenbaum, G. David Forney Jr., Brian H. Marcus, Robert J. McEliece, Alexander Vardy:
Introduction to the special issue on codes and complexity. IEEE Trans. Information Theory 42(6): 1649-1659 (1996) - [c24]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 - [c23]Lenore Cowen, Joan Feigenbaum, Sampath Kannan:
A Formal Framework for Evaluating Heuristic Programs. ICALP 1996: 634-645 - [c22]Matt Blaze, Joan Feigenbaum, Jack Lacy:
Decentralized Trust Management. IEEE Symposium on Security and Privacy 1996: 164-173 - 1995
- [j16]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) - [c21]Joan Feigenbaum, Daphne Koller, Peter W. Shor:
A Game-Theoretic Classification of Interactive Complexity Classes. Structure in Complexity Theory Conference 1995: 227-237 - 1994
- [j15]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) - [c20]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 - 1993
- [j14]Joan Feigenbaum, Lance Fortnow:
Random-Self-Reducibility of Complete Sets. SIAM J. Comput. 22(5): 994-1005 (1993) - [j13]Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund:
Complexity Results for Pomset Languages. SIAM J. Discrete Math. 6(3): 432-442 (1993) - [c19]Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor:
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. STOC 1993: 305-314 - 1992
- [j12]