On graph problems in a semi-streaming model. Zbl 1081.68069
Feigenbaum, Joan; Kannan, Sampath; McGregor, Andrew; Suri, Siddharth; Zhang, Jian |
|
2005
|
Contemporary cryptology. The science of information integrity. Zbl 0784.94019
|
|
1992
|
Hiding instances in multioracle queries. Zbl 0733.68005
Beaver, Donald; Feigenbaum, Joan |
|
1990
|
Sharing the cost of multicast transmissions. Zbl 0996.68026
Feigenbaum, Joan; Papadimitriou, Christos H.; Shenker, Scott |
|
2001
|
Random-self-reducibility of complete sets. Zbl 0789.68057
Feigenbaum, Joan; Fortnow, Lance |
|
1993
|
A polynomial time algorithm for finding the prime factors of Cartesian- product graphs. Zbl 0579.68028
Feigenbaum, Joan; Hershberger, John; Schäffer, Alejandro A. |
|
1985
|
On hiding information from an oracle. Zbl 0687.68016
Abadi, Martín; Feigenbaum, Joan; Kilian, Joe |
|
1989
|
Graph distances in the data-stream model. Zbl 1181.68153
Feigenbaum, Joan; Kannan, Sampath; McGregor, Andrew; Suri, Siddharth; Zhang, Jian |
|
2008
|
Finding the prime factors of strong direct product graphs in polynomial time. Zbl 0786.68076
Feigenbaum, Joan; Schäffer, Alejandro A. |
|
1992
|
Graph distances in the streaming model: the value of space. Zbl 1297.05073
Feigenbaum, Joan; Kannan, Sampath; McGregor, Andrew; Suri, Siddharth; Zhang, Jian |
|
2005
|
Security with low communication overhead. (Extended abstract). Zbl 0800.68416
Beaver, D.; Feigenbaum, J.; Kilian, J.; Rogaway, P. |
|
1991
|
Hardness results for multicast cost sharing. Zbl 1045.68163
Feigenbaum, Joan; Krishnamurthy, Arvind; Sami, Rahul; Shenker, Scott |
|
2003
|
Approximation and collusion in multicast cost sharing. Zbl 1080.90014
Archer, Aaron; Feigenbaum, Joan; Krishnamurthy, Arvind; Sami, Rahul; Shenker, Scott |
|
2004
|
An approximate \(L^{1}\)-difference algorithm for massive data streams. Zbl 1029.68157
Feigenbaum, Joan; Kannan, Sampath; Strauss, Martin J.; Viswanathan, Mahesh |
|
2002
|
On graph problems in a semi-streaming model. Zbl 1099.68679
Feigenbaum, Joan; Kannan, Sampath; McGregor, Andrew; Suri, Siddharth; Zhang, Jian |
|
2004
|
A BGP-based mechanism for lowest-cost routing. Zbl 1292.68152
Feigenbaum, Joan; Papadimitriou, Christos; Sami, Rahul; Shenker, Scott |
|
2002
|
A BGP-based mechanism for lowest-cost routing. Zbl 1264.68215
Feigenbaum, Joan; Papadimitriou, Christos; Sami, Rahul; Shenker, Scott |
|
2005
|
Distributed algorithmic mechanism design: recent results and future directions. Zbl 1090.68528
Feigenbaum, Joan; Shenker, Scott |
|
2004
|
Secure circuit evaluation. A protocol based on hiding information from an oracle. Zbl 0699.68033
Abadi, Martin; Feigenbaum, Joan |
|
1990
|
Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time. Zbl 0637.05018
Feigenbaum, Joan |
|
1986
|
Computing diameter in the streaming and sliding-window models. Zbl 1082.68020
Feigenbaum, Joan; Kannan, Sampath; Zhang, Jian |
|
2005
|
Secure multiparty computation of approximations. Zbl 1321.68464
Feigenbaum, Joan; Ishai, Yuval; Malkin, Tal; Nissim, Kobbi; Strauss, Martin J.; Wright, Rebecca N. |
|
2006
|
On factorable extensions and subgraphs of prime graphs. Zbl 0736.05061
Feigenbaum, Joan; Haddad, Ramsey W. |
|
1989
|
Secure multiparty computation of approximations (extended abstract). Zbl 0986.68954
Feigenbaum, Joan; Ishai, Yuval; Malkin, Tal; Nissim, Kobbi; Strauss, Martin J. |
|
2001
|
Probabilistically checkable debate systems and nonapproximability of PSPACE hard functions. Zbl 0924.68177
Condon, Anne; Feigenbaum, Joan; Lund, Carsten; Shor, Peter W. |
|
1995
|
On being incoherent without being very hard. Zbl 0752.68038
Beigel, Richard; Feigenbaum, Joan |
|
1992
|
Random debaters and the hardness of approximating stochastic functions. Zbl 0874.68125
Condon, Anne; Feigenbaum, Joan; Lund, Carsten; Shor, Peter |
|
1997
|
Complexity of problems on graphs represented as OBDDs. Zbl 0924.68097
Feigenbaum, Joan; Kannan, Sampath; Vardi, Moshe Y.; Viswanathan, Mahesh |
|
1999
|
Locally random reductions: Improvements and applications. Zbl 0873.94013
Beaver, D.; Feigenbaum, J.; Kilian, J.; Rogaway, P. |
|
1997
|
Subjective-cost policy routing. Zbl 1120.68030
Feigenbaum, Joan; Karger, David R.; Mirrokni, Vahab S.; Sami, Rahul |
|
2007
|
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. Zbl 1310.68085
Condon, Anne; Feigenbaum, Joan; Lund, Carsten; Shor, Peter |
|
1993
|
Encrypting problem instances. Or…, can you take advantage of someone without having to trust him? Zbl 0592.94011
Feigenbaum, Joan |
|
1986
|
Recognizing composite graphs is equivalent to testing graph isomorphism. Zbl 0602.68033
Feigenbaum, Joan; Schäffer, Alejandro A. |
|
1986
|
On generating solved instances of computational problems. Zbl 0792.68045
Abadi, Martín; Allender, Eric; Broder, Andrei; Feigenbaum, Joan; Hemachandra, Lane A. |
|
1990
|
Locally random reductions in interactive complexity theory. Zbl 0801.68062
Feigenbaum, Joan |
|
1993
|
Two new kinds of biased search trees. Zbl 0582.68036
Feigenbaum, J.; Tarjan, R. E. |
|
1983
|
A formal treatment of remotely keyed encryption. (Extended abstract). Zbl 0936.68034
Blaze, Matt; Feigenbaum, Joan; Naor, Moni |
|
1998
|
Sharing the cost of muliticast transmissions (preliminary version). Zbl 1296.68066
Feigenbaum, Joan; Papadimitriou, Christos; Shenker, Scott |
|
2000
|
The power of adaptiveness and additional queries in random-self- reductions. Zbl 0808.68060
Feigenbaum, Joan; Fortnow, Lance; Lund, Carsten; Spielman, Daniel |
|
1994
|
Testing and spot-checking of data streams (Extended abstract). Zbl 0961.68038
Feigenbaum, J.; Kannan, S.; Strauss, M.; Viswanathan, M. |
|
2000
|
Approximate privacy: foundations and quantification. Zbl 1398.68049
Feigenbaum, Joan; Jaggard, Aaron D.; Schapira, Michael |
|
2014
|
Complexity results for POMSET languages. Zbl 0781.68058
Feigenbaum, Joan; Kahn, Jeremy A.; Lund, Carsten |
|
1993
|
Computation in a distributed information market. Zbl 1079.68106
Feigenbaum, Joan; Fortnow, Lance; Pennock, David M.; Sami, Rahul |
|
2005
|
Distributed computing and cryptography. Proceedings of a DIMACS workshop, October 4-6, 1989, Princeton, NJ (USA). Zbl 0719.00027
|
|
1991
|
Distributed algorithmic mechanism design. Zbl 1151.91417
Feigenbaum, Joan; Schapira, Michael; Shenker, Scott |
|
2007
|
The use of coding theory in computational complexity. Zbl 0845.68058
Feigenbaum, Joan |
|
1995
|
Hardness results for multicast cost sharing. Zbl 1027.68502
Feigenbaum, Joan; Krishnamurthy, Arvind; Sami, Rahul; Shenker, Scott |
|
2002
|
Mechanism design for policy routing. Zbl 1266.68036
Feigenbaum, Joan; Sami, Rahul; Shenker, Scott |
|
2006
|
Advances in cryptology – CRYPTO ’91. Proceedings of the conference, held in Santa Barbara, CA, USA, August 11–15, 1991. Zbl 0753.00024
|
|
1992
|
Incentive-compatible interdomain routing. Zbl 1231.68054
Feigenbaum, Joan; Ramachandran, Vijay; Schapira, Michael |
|
2011
|
Hiding instances in zero-knowledge proof systems. (Extended abstract). Zbl 0800.68407
Beaver, Donald; Feigenbaum, Joan; Shoup, Victor |
|
1991
|
Testing and spot-checking of data streams. Zbl 1016.68028
Feigenbaum, J.; Kannan, S.; Strauss, M.; Viswanathan, M. |
|
2002
|
Cryptographic protection of databases and software. Zbl 0722.68047
Feigenbaum, Joan; Liberman, Mark Y.; Wright, Rebecca N. |
|
1991
|
On coherence, random-self-reducibility, and self-correction. Zbl 0917.68074
Feigenbaum, Joan; Fortnow, Lance; Laplante, Sophie; Naik, Ashish |
|
1998
|
Mechanism design for policy routing. Zbl 1321.68074
Feigenbaum, Joan; Sami, Rahul; Shenker, Scott |
|
2004
|
Probabilistic algorithms for speedup. Zbl 0766.68001
Feigenbaum, Joan; Lagarias, Jeffrey C. |
|
1992
|
A model of onion routing with provable anonymity. Zbl 1195.68023
Feigenbaum, Joan; Johnson, Aaron; Syverson, Paul |
|
2008
|
A note on one-prover, instance-hiding zero-knowledge proof systems. (Extended abstract). Zbl 0805.68060
Feigenbaum, Joan; Ostrovsky, Rafail |
|
1993
|
Lexicographically factorable extensions of irreducible graphs. Zbl 0840.05067
Feigenbaum, Joan |
|
1991
|
Privacy engineering for digital rights management systems. Zbl 1048.68747
Feigenbaum, Joan; Freedman, Michael J.; Sander, Tomas; Shostack, Adam |
|
2002
|
Brief announcement: On the resilience of routing tables. Zbl 1301.68042
Feigenbaum, Joan; Godfrey, Brighten; Panda, Aurojit; Schapira, Michael; Shenker, Scott; Singla, Ankit |
|
2012
|
Equipartitions of graphs. Zbl 0761.05051
Eppstein, David; Feigenbaum, Joan; Li, Chung-Lun |
|
1991
|
An information-theoretic treatment of random-self-reducibility (extended abstract). Zbl 1499.68125
Feigenbaum, Joan; Strauss, Martin |
|
1997
|
Systematizing secure computation for research and decision support. Zbl 1404.94104
Perry, Jason; Gupta, Debayan; Feigenbaum, Joan; Wright, Rebecca N. |
|
2014
|
Approximate privacy: foundations and quantification. Zbl 1398.68049
Feigenbaum, Joan; Jaggard, Aaron D.; Schapira, Michael |
|
2014
|
Systematizing secure computation for research and decision support. Zbl 1404.94104
Perry, Jason; Gupta, Debayan; Feigenbaum, Joan; Wright, Rebecca N. |
|
2014
|
Brief announcement: On the resilience of routing tables. Zbl 1301.68042
Feigenbaum, Joan; Godfrey, Brighten; Panda, Aurojit; Schapira, Michael; Shenker, Scott; Singla, Ankit |
|
2012
|
Incentive-compatible interdomain routing. Zbl 1231.68054
Feigenbaum, Joan; Ramachandran, Vijay; Schapira, Michael |
|
2011
|
Graph distances in the data-stream model. Zbl 1181.68153
Feigenbaum, Joan; Kannan, Sampath; McGregor, Andrew; Suri, Siddharth; Zhang, Jian |
|
2008
|
A model of onion routing with provable anonymity. Zbl 1195.68023
Feigenbaum, Joan; Johnson, Aaron; Syverson, Paul |
|
2008
|
Subjective-cost policy routing. Zbl 1120.68030
Feigenbaum, Joan; Karger, David R.; Mirrokni, Vahab S.; Sami, Rahul |
|
2007
|
Distributed algorithmic mechanism design. Zbl 1151.91417
Feigenbaum, Joan; Schapira, Michael; Shenker, Scott |
|
2007
|
Secure multiparty computation of approximations. Zbl 1321.68464
Feigenbaum, Joan; Ishai, Yuval; Malkin, Tal; Nissim, Kobbi; Strauss, Martin J.; Wright, Rebecca N. |
|
2006
|
Mechanism design for policy routing. Zbl 1266.68036
Feigenbaum, Joan; Sami, Rahul; Shenker, Scott |
|
2006
|
On graph problems in a semi-streaming model. Zbl 1081.68069
Feigenbaum, Joan; Kannan, Sampath; McGregor, Andrew; Suri, Siddharth; Zhang, Jian |
|
2005
|
Graph distances in the streaming model: the value of space. Zbl 1297.05073
Feigenbaum, Joan; Kannan, Sampath; McGregor, Andrew; Suri, Siddharth; Zhang, Jian |
|
2005
|
A BGP-based mechanism for lowest-cost routing. Zbl 1264.68215
Feigenbaum, Joan; Papadimitriou, Christos; Sami, Rahul; Shenker, Scott |
|
2005
|
Computing diameter in the streaming and sliding-window models. Zbl 1082.68020
Feigenbaum, Joan; Kannan, Sampath; Zhang, Jian |
|
2005
|
Computation in a distributed information market. Zbl 1079.68106
Feigenbaum, Joan; Fortnow, Lance; Pennock, David M.; Sami, Rahul |
|
2005
|
Approximation and collusion in multicast cost sharing. Zbl 1080.90014
Archer, Aaron; Feigenbaum, Joan; Krishnamurthy, Arvind; Sami, Rahul; Shenker, Scott |
|
2004
|
On graph problems in a semi-streaming model. Zbl 1099.68679
Feigenbaum, Joan; Kannan, Sampath; McGregor, Andrew; Suri, Siddharth; Zhang, Jian |
|
2004
|
Distributed algorithmic mechanism design: recent results and future directions. Zbl 1090.68528
Feigenbaum, Joan; Shenker, Scott |
|
2004
|
Mechanism design for policy routing. Zbl 1321.68074
Feigenbaum, Joan; Sami, Rahul; Shenker, Scott |
|
2004
|
Hardness results for multicast cost sharing. Zbl 1045.68163
Feigenbaum, Joan; Krishnamurthy, Arvind; Sami, Rahul; Shenker, Scott |
|
2003
|
An approximate \(L^{1}\)-difference algorithm for massive data streams. Zbl 1029.68157
Feigenbaum, Joan; Kannan, Sampath; Strauss, Martin J.; Viswanathan, Mahesh |
|
2002
|
A BGP-based mechanism for lowest-cost routing. Zbl 1292.68152
Feigenbaum, Joan; Papadimitriou, Christos; Sami, Rahul; Shenker, Scott |
|
2002
|
Hardness results for multicast cost sharing. Zbl 1027.68502
Feigenbaum, Joan; Krishnamurthy, Arvind; Sami, Rahul; Shenker, Scott |
|
2002
|
Testing and spot-checking of data streams. Zbl 1016.68028
Feigenbaum, J.; Kannan, S.; Strauss, M.; Viswanathan, M. |
|
2002
|
Privacy engineering for digital rights management systems. Zbl 1048.68747
Feigenbaum, Joan; Freedman, Michael J.; Sander, Tomas; Shostack, Adam |
|
2002
|
Sharing the cost of multicast transmissions. Zbl 0996.68026
Feigenbaum, Joan; Papadimitriou, Christos H.; Shenker, Scott |
|
2001
|
Secure multiparty computation of approximations (extended abstract). Zbl 0986.68954
Feigenbaum, Joan; Ishai, Yuval; Malkin, Tal; Nissim, Kobbi; Strauss, Martin J. |
|
2001
|
Sharing the cost of muliticast transmissions (preliminary version). Zbl 1296.68066
Feigenbaum, Joan; Papadimitriou, Christos; Shenker, Scott |
|
2000
|
Testing and spot-checking of data streams (Extended abstract). Zbl 0961.68038
Feigenbaum, J.; Kannan, S.; Strauss, M.; Viswanathan, M. |
|
2000
|
Complexity of problems on graphs represented as OBDDs. Zbl 0924.68097
Feigenbaum, Joan; Kannan, Sampath; Vardi, Moshe Y.; Viswanathan, Mahesh |
|
1999
|
A formal treatment of remotely keyed encryption. (Extended abstract). Zbl 0936.68034
Blaze, Matt; Feigenbaum, Joan; Naor, Moni |
|
1998
|
On coherence, random-self-reducibility, and self-correction. Zbl 0917.68074
Feigenbaum, Joan; Fortnow, Lance; Laplante, Sophie; Naik, Ashish |
|
1998
|
Random debaters and the hardness of approximating stochastic functions. Zbl 0874.68125
Condon, Anne; Feigenbaum, Joan; Lund, Carsten; Shor, Peter |
|
1997
|
Locally random reductions: Improvements and applications. Zbl 0873.94013
Beaver, D.; Feigenbaum, J.; Kilian, J.; Rogaway, P. |
|
1997
|
An information-theoretic treatment of random-self-reducibility (extended abstract). Zbl 1499.68125
Feigenbaum, Joan; Strauss, Martin |
|
1997
|
Probabilistically checkable debate systems and nonapproximability of PSPACE hard functions. Zbl 0924.68177
Condon, Anne; Feigenbaum, Joan; Lund, Carsten; Shor, Peter W. |
|
1995
|
The use of coding theory in computational complexity. Zbl 0845.68058
Feigenbaum, Joan |
|
1995
|
The power of adaptiveness and additional queries in random-self- reductions. Zbl 0808.68060
Feigenbaum, Joan; Fortnow, Lance; Lund, Carsten; Spielman, Daniel |
|
1994
|
Random-self-reducibility of complete sets. Zbl 0789.68057
Feigenbaum, Joan; Fortnow, Lance |
|
1993
|
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. Zbl 1310.68085
Condon, Anne; Feigenbaum, Joan; Lund, Carsten; Shor, Peter |
|
1993
|
Locally random reductions in interactive complexity theory. Zbl 0801.68062
Feigenbaum, Joan |
|
1993
|
Complexity results for POMSET languages. Zbl 0781.68058
Feigenbaum, Joan; Kahn, Jeremy A.; Lund, Carsten |
|
1993
|
A note on one-prover, instance-hiding zero-knowledge proof systems. (Extended abstract). Zbl 0805.68060
Feigenbaum, Joan; Ostrovsky, Rafail |
|
1993
|
Contemporary cryptology. The science of information integrity. Zbl 0784.94019
|
|
1992
|
Finding the prime factors of strong direct product graphs in polynomial time. Zbl 0786.68076
Feigenbaum, Joan; Schäffer, Alejandro A. |
|
1992
|
On being incoherent without being very hard. Zbl 0752.68038
Beigel, Richard; Feigenbaum, Joan |
|
1992
|
Advances in cryptology – CRYPTO ’91. Proceedings of the conference, held in Santa Barbara, CA, USA, August 11–15, 1991. Zbl 0753.00024
|
|
1992
|
Probabilistic algorithms for speedup. Zbl 0766.68001
Feigenbaum, Joan; Lagarias, Jeffrey C. |
|
1992
|
Security with low communication overhead. (Extended abstract). Zbl 0800.68416
Beaver, D.; Feigenbaum, J.; Kilian, J.; Rogaway, P. |
|
1991
|
Distributed computing and cryptography. Proceedings of a DIMACS workshop, October 4-6, 1989, Princeton, NJ (USA). Zbl 0719.00027
|
|
1991
|
Hiding instances in zero-knowledge proof systems. (Extended abstract). Zbl 0800.68407
Beaver, Donald; Feigenbaum, Joan; Shoup, Victor |
|
1991
|
Cryptographic protection of databases and software. Zbl 0722.68047
Feigenbaum, Joan; Liberman, Mark Y.; Wright, Rebecca N. |
|
1991
|
Lexicographically factorable extensions of irreducible graphs. Zbl 0840.05067
Feigenbaum, Joan |
|
1991
|
Equipartitions of graphs. Zbl 0761.05051
Eppstein, David; Feigenbaum, Joan; Li, Chung-Lun |
|
1991
|
Hiding instances in multioracle queries. Zbl 0733.68005
Beaver, Donald; Feigenbaum, Joan |
|
1990
|
Secure circuit evaluation. A protocol based on hiding information from an oracle. Zbl 0699.68033
Abadi, Martin; Feigenbaum, Joan |
|
1990
|
On generating solved instances of computational problems. Zbl 0792.68045
Abadi, Martín; Allender, Eric; Broder, Andrei; Feigenbaum, Joan; Hemachandra, Lane A. |
|
1990
|
On hiding information from an oracle. Zbl 0687.68016
Abadi, Martín; Feigenbaum, Joan; Kilian, Joe |
|
1989
|
On factorable extensions and subgraphs of prime graphs. Zbl 0736.05061
Feigenbaum, Joan; Haddad, Ramsey W. |
|
1989
|
Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time. Zbl 0637.05018
Feigenbaum, Joan |
|
1986
|
Encrypting problem instances. Or…, can you take advantage of someone without having to trust him? Zbl 0592.94011
Feigenbaum, Joan |
|
1986
|
Recognizing composite graphs is equivalent to testing graph isomorphism. Zbl 0602.68033
Feigenbaum, Joan; Schäffer, Alejandro A. |
|
1986
|
A polynomial time algorithm for finding the prime factors of Cartesian- product graphs. Zbl 0579.68028
Feigenbaum, Joan; Hershberger, John; Schäffer, Alejandro A. |
|
1985
|
Two new kinds of biased search trees. Zbl 0582.68036
Feigenbaum, J.; Tarjan, R. E. |
|
1983
|