| Year |
Citation |
Score |
| 2014 |
Feigenbaum J, Jaggard AD, Schapira M. Approximate privacy: Foundations and quantification Acm Transactions On Algorithms. 10. DOI: 10.1145/2601067 |
0.357 |
|
| 2012 |
Feigenbaum J, Johnson A, Syverson P. Probabilistic analysis of onion routing in a black-box model Acm Transactions On Information and System Security. 15. DOI: 10.1145/2382448.2382452 |
0.473 |
|
| 2011 |
Feigenbaum J, Ramachandran V, Schapira M. Incentive-compatible interdomain routing Distributed Computing. 23: 301-319. DOI: 10.1007/S00446-011-0126-8 |
0.537 |
|
| 2008 |
Feigenbaum J, Kannan S, McGregor A, Suri S, Zhang J. Graph distances in the data-stream model Siam Journal On Computing. 38: 1709-1727. DOI: 10.1137/070683155 |
0.41 |
|
| 2007 |
Feigenbaum J, Schapira M, Shenker S. Distributed algorithmic mechanism design Algorithmic Game Theory. 363-384. DOI: 10.1017/CBO9780511800481.016 |
0.352 |
|
| 2007 |
Aspnes J, Feigenbaum J, Yampolskiy A, Zhong S. Towards a theory of data entanglement Theoretical Computer Science. 389: 26-43. DOI: 10.1016/J.Tcs.2007.07.021 |
0.308 |
|
| 2007 |
Feigenbaum J, Karger DR, Mirrokni VS, Sami R. Subjective-cost policy routing Theoretical Computer Science. 378: 175-189. DOI: 10.1016/j.tcs.2007.02.020 |
0.622 |
|
| 2006 |
Feigenbaum J, Mitzenmacher M. Towards a theory of networked computation Sigact News. 37: 22-26. DOI: 10.1145/1189056.1189059 |
0.322 |
|
| 2006 |
Feigenbaum J, Ishai Y, Malkin TAL, Nissim K, Strauss MJ, Wright RN. Secure multiparty computation of approximations Acm Transactions On Algorithms. 2: 435-472. DOI: 10.1145/1159892.1159900 |
0.398 |
|
| 2006 |
Feigenbaum J, Sami R, Shenker S. Mechanism design for policy routing Distributed Computing. 18: 293-305. DOI: 10.1007/S00446-005-0134-7 |
0.663 |
|
| 2005 |
Feigenbaum J, Fortnow L, Pennock DM, Sami R. Computation in a distributed information market Theoretical Computer Science. 343: 114-132. DOI: 10.1016/J.Tcs.2005.05.010 |
0.625 |
|
| 2005 |
Feigenbaum J, Papadimitriou C, Sami R, Shenker S. A BGP-based mechanism for lowest-cost routing Distributed Computing. 18: 61-72. DOI: 10.1007/S00446-005-0122-Y |
0.673 |
|
| 2004 |
Archer A, Feigenbaum J, Krishnamurthy A, Sami R, Shenker S. Approximation and collusion in multicast cost sharing Games and Economic Behavior. 47: 36-71. DOI: 10.1016/S0899-8256(03)00176-3 |
0.654 |
|
| 2004 |
Feigenbaum J, Kannan S, Zhang J. Computing diameter in the streaming and sliding-window models Algorithmica (New York). 41: 25-41. DOI: 10.1007/S00453-004-1105-2 |
0.364 |
|
| 2003 |
Li N, Grosof BN, Feigenbaum J. Delegation logic: A logic-based approach to distributed authorization Acm Transactions On Information and System Security. 6: 128-171. DOI: 10.1145/605434.605438 |
0.306 |
|
| 2003 |
Feigenbaum J, Kannan S, Strauss MJ, Viswanathan M. An approximate L1-difference algorithm for massive data streams Siam Journal On Computing. 32: 131-151. DOI: 10.1137/S0097539799361701 |
0.351 |
|
| 2003 |
Feigenbaum J, Krishnamurthy A, Sami R, Shenker S. Hardness results for multicast cost sharing Theoretical Computer Science. 304: 215-236. DOI: 10.1016/S0304-3975(03)00085-9 |
0.667 |
|
| 2002 |
Feigenbaum J, Shenker S. Distributed algorithmic mechanism design: Recent results and future directions Proceedings of the Discrete Algorithms and Methods For Mobile Computing and Communications. 1-13. |
0.319 |
|
| 2001 |
Feigenbaum J, Papadimitriou CH, Shenker S. Sharing the cost of multicast transmissions Journal of Computer and System Sciences. 63: 21-41. DOI: 10.1006/Jcss.2001.1754 |
0.432 |
|
| 1998 |
Feigenbaum J, Kannan S, Vardi MY, Viswanathan M. Complexity of problems on graphs represented as OBDDs (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1373: 216-226. DOI: 10.1007/Bfb0028563 |
0.311 |
|
| 1997 |
Feigenbaum J, Rudich S, Blaze M, McCurley K. Security and privacy in the information economy. Proceedings of the National Academy of Sciences of the United States of America. 94: 2789-92. PMID 11607726 DOI: 10.1073/Pnas.94.7.2789 |
0.32 |
|
| 1997 |
Condon A, Feigenbaum J, Lund C, Shor P. Random debaters and the hardness of approximating stochastic functions Siam Journal On Computing. 26: 369-400. DOI: 10.1137/S0097539793260738 |
0.308 |
|
| 1997 |
Beaver D, Feigenbaum J, Kilian J, Rogaway P. Locally random reductions: Improvements and applications Journal of Cryptology. 10: 17-36. DOI: 10.1007/S001459900017 |
0.313 |
|
| 1997 |
Blaze M, Feigenbaum J, Resnick P, Strauss M. Managing Trust in an Information-Labeling System European Transactions On Telecommunications. 8: 491-501. DOI: 10.1002/Ett.4460080507 |
0.308 |
|
| 1996 |
Allender E, Feigenbaum J, Goldsmith J, Pitassi T, Rudich S. The future of computational complexity theory: part II Acm Sigact News. 27: 3-7. DOI: 10.1145/242581.242582 |
0.305 |
|
| 1994 |
Feigenbaum J, Reingold N. Universal traversal sequences American Mathematical Monthly. 101: 262-265. DOI: 10.1080/00029890.1994.11996941 |
0.302 |
|
| 1993 |
Feigenbaum J. Probabilistic Algorithms for Defeating Adversaries Statistical Science. 8: 26-30. DOI: 10.1214/Ss/1177011080 |
0.333 |
|
| 1993 |
Feigenbaum J, Lagarias JC. Probabilistic algorithms for speedup Statistical Science. 8: 20-25. DOI: 10.1214/Ss/1177011079 |
0.305 |
|
| 1985 |
Feigenbaum J, Hershberger J, Schäffer AA. A polynomial time algorithm for finding the prime factors of cartesian-product graphs Discrete Applied Mathematics. 12: 123-138. DOI: 10.1016/0166-218X(85)90066-6 |
0.352 |
|
| 1983 |
Feigenbaum J, Tarjan RE. Two New Kinds of Biased Search Trees Bell System Technical Journal. 62: 3139-3158. DOI: 10.1002/J.1538-7305.1983.Tb03469.X |
0.306 |
|
| Show low-probability matches. |