| Year |
Citation |
Score |
| 2008 |
Meyerson A, Munagala K, Plotkin S. Cost-Distance: Two Metric Network Design Siam Journal On Computing. 38: 1648-1659. DOI: 10.1137/050629665 |
0.665 |
|
| 2005 |
Abrams Z, McGrew R, Plotkin S. A non-manipulable trust system based on EigenTrust Sigecom Exchanges. 5: 21-30. DOI: 10.1145/1120717.1120721 |
0.601 |
|
| 2005 |
Goel A, Meyerson A, Plotkin S. Approximate majorization and fair online load balancing Acm Transactions On Algorithms. 1: 338-349. DOI: 10.1145/1103963.1103970 |
0.659 |
|
| 2005 |
Goel A, Henzinger MR, Plotkin S. An online throughput-competitive algorithm for multicast routing and admission control Journal of Algorithms. 55: 1-20. DOI: 10.1016/J.Jalgor.2004.11.001 |
0.508 |
|
| 2004 |
Meyerson A, O'Callaghan L, Plotkin S. A k -Median Algorithm with Running Time Independent of Data Size Machine Learning. 56: 61-87. DOI: 10.1023/B:Mach.0000033115.78247.F0 |
0.664 |
|
| 2003 |
Goel A, Henzinger MR, Plotkin S, Tardos E. Scheduling data transfers in a network and the set scheduling problem Journal of Algorithms. 48: 314-332. DOI: 10.1016/S0196-6774(03)00054-3 |
0.374 |
|
| 2001 |
Goel A, Meyerson A, Plotkin S. Combining Fairness with Throughput: Online Routing with Multiple Objectives Journal of Computer and System Sciences. 63: 62-79. DOI: 10.1006/Jcss.2001.1755 |
0.675 |
|
| 2001 |
Awerbuch B, Azar Y, Plotkin S, Waarts O. Competitive routing of virtual circuits with unknown duration Journal of Computer and System Sciences. 62: 385-397. DOI: 10.1006/Jcss.1999.1662 |
0.467 |
|
| 1999 |
Dwork C, Herlihy M, Plotkin S, Waarts O. Time-lapse snapshots Siam Journal On Computing. 28: 1848-1874. DOI: 10.1137/S0097539793243685 |
0.36 |
|
| 1997 |
Aspnes J, Azar Y, Fiat A, Plotkin S, Waarts O. On-line routing of virtual circuits with applications to load balancing and machine scheduling Journal of the Acm. 44: 486-504. DOI: 10.1145/258128.258201 |
0.443 |
|
| 1997 |
Ma Y, Plotkin S. An improved lower bound for load balancing of tasks with unknown duration Information Processing Letters. 62: 301-303. DOI: 10.1016/S0020-0190(97)00085-9 |
0.313 |
|
| 1997 |
Azar Y, Kalyanasundaram B, Plotkin S, Pruhs KR, Waarts O. On-Line Load Balancing of Temporary Tasks Journal of Algorithms. 22: 93-110. DOI: 10.1006/Jagm.1995.0799 |
0.325 |
|
| 1996 |
Afek Y, Awerbuch B, Plotkin S, Saks M. Local management of a global resource in a communication network Journal of the Acm. 43: 1-19. DOI: 10.1145/227595.227596 |
0.331 |
|
| 1994 |
Klein P, Plotkin S, Stein C, Tardos E. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts Siam Journal On Computing. 23: 466-487. DOI: 10.1137/S0097539792241175 |
0.492 |
|
| 1993 |
Fischer T, Goldberg AV, Haglin DJ, Plotkin S. Approximating matchings in parallel Information Processing Letters. 46: 115-118. DOI: 10.1016/0020-0190(93)90055-E |
0.343 |
|
| Show low-probability matches. |