Serge Plotkin

All Publications

• COST-DISTANCE: TWO METRIC NETWORK DESIGN SIAM JOURNAL ON COMPUTING Meyerson, A., Munagala, K., Plotkin, S. 2008; 38 (4): 1648-1659

  View details for DOI 10.1137/050629665

  View details for Web of Science ID 000261891600019

• An online throughput-competitive algorithm for multicast routing and admission control JOURNAL OF ALGORITHMS Goel, A., Henzinger, M. R., Plotkin, S. 2005; 55 (1): 1-20

  View details for DOI 10.1016/j.jalgor.2004.11.001

  View details for Web of Science ID 000228441600001

• A k-median algorithm with running time independent of data size MACHINE LEARNING Meyerson, A., O'Callaghan, L., Plotkin, S. 2004; 56 (1-3): 61-87

  View details for Web of Science ID 000222264700004

• Set K-cover algorithms for energy efficient monitoring in wireless sensor networks 3rd International Symposium on Information Processing in Sensor Networks Abrams, Z., Goel, A., Plotkin, S. ASSOC COMPUTING MACHINERY. 2004: 424–432

  View details for Web of Science ID 000222055900048

• A fast, small-space clustering algorithm, independent of data size. Machine Learning Journal, Special Issue on Data Clustering Meyerson, A., O’Callaghan, L., Plotkin, S. 2004; 56: 61–87
• Keeping peers honest in eigentrust. Abrams, Z., McGrew, R., Plotkin, S. 2004
• Scheduling data transfers in a network and the set scheduling problem JOURNAL OF ALGORITHMS Goel, A., Henzinger, M. R., Plotkin, S., Tardos, E. 2003; 48 (2): 314-332

  View details for DOI 10.1016/S0196-6774(03)00054-3

  View details for Web of Science ID 000184853000003

• Combining fairness with throughput: Online routing with multiple objectives JOURNAL OF COMPUTER AND SYSTEM SCIENCES Goel, A., Meyerson, A., Plotkin, S. 2001; 63 (1): 62-79

  View details for DOI 10.1006/jcss.2001.1755

  View details for Web of Science ID 000171061600005

• Competitive routing of virtual circuits with unknown duration JOURNAL OF COMPUTER AND SYSTEM SCIENCES Awerbuch, B., Azar, Y., Plotkin, S., Waarts, O. 2001; 62 (3): 385-397

  View details for Web of Science ID 000168461300001

• Web caching using access statistics 12th Annual ACM-SIAM Symposium on Discrete Algorithms Meyerson, A., Munagala, K., Plotkin, S. SIAM. 2001: 354–363

  View details for Web of Science ID 000177257800053

• On the integrality gap of capacitated facility location problem. GSIA Working Paper Abrams, Z., Meyerson, A., Munagala, K., Plotkin, S. 2001
• Facility location with interference. GSIA Working Paper 2001-E23 Abrams, Z., Konemann, J., Meyerson, A., Munagala, K., Plotkin, S. 2001
• Web caching using access statistics. Meyerson, A., Munagala, K., Plotkin, S. 2001
• Designing networks incrementally 42nd Annual Symposium on Foundations of Computer Science (FOCS 2001) Meyerson, A., Munagala, K., Plotkin, S. IEEE COMPUTER SOC. 2001: 406–415

  View details for Web of Science ID 000172225900039

• Distributed admission control, scheduling, and routing with stale information 12th Annual ACM-SIAM Symposium on Discrete Algorithms Goel, A., Meyerson, A., Plotkin, S. SIAM. 2001: 611–619

  View details for Web of Science ID 000177257800085

• Approximate majorization and fair online load balancing 12th Annual ACM-SIAM Symposium on Discrete Algorithms Goel, A., Meyerson, A., Plotkin, S. SIAM. 2001: 384–390

  View details for Web of Science ID 000177257800056

• A sublinear parallel algorithm for stable matching THEORETICAL COMPUTER SCIENCE Feder, T., Megiddo, N., Plotkin, S. A. 2000; 233 (1-2): 297-308

  View details for Web of Science ID 000084793400019

• Cost-Distance: Two metric network design 41st Annual Symposium on Foundations of Computer Science (FOCS 00) Meyerson, A., Munagala, K., Plotkin, S. IEEE COMPUTER SOC. 2000: 624–630

  View details for Web of Science ID 000165964000061

• Combining fairness with throughput: Online routing with multiple objectives. Goel, A., Meyerson, A., Plotkin, S. 2000
• Cost-distance: Two metric network design. Technical Report STAN-CS-TN-00-92, Stanford Meyerson, A., Munagala, K., Plotkin, S. 2000
• Time-lapse snapshots SIAM JOURNAL ON COMPUTING Dwork, C., Herlihy, M., Plotkin, S., Waarts, O. 1999; 28 (5): 1848-1874

  View details for Web of Science ID 000080710200014

• Scheduling data transfers in a network and the set scheduling problem. Goel, A., Henzinger, M., Plotkin, S., Tardos, E. 1999
• Time-lapse snapshots. SIAM J. on Computing Dwork, C., Herlihy, M., P., Plotkin, S., Waarts, O. 1999; 5 (28)
• Routing and admission control in general topology networks with Poisson arrivals 7th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA 96) Kamath, L., Palmon, O., Plotkin, S. ACADEMIC PRESS INC ELSEVIER SCIENCE. 1998: 236–58

  View details for Web of Science ID 000073541000004

• Approximating a finite metric by a small number of tree metrics 39th Annual Symposium on Foundations of Computer Science Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S. IEEE COMPUTER SOC. 1998: 379–388

  View details for Web of Science ID 000077523900042

• Online throughput-competitive algorithm for multicast routing and admission control. Goel, A., Henzinger, M., Plotkin, S. 1998
• An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow 6th International Integer Programming and Combinatorial Optimization (IPCO VI) Goldberg, A. V., Oldham, J. D., Plotkin, S., Stein, C. SPRINGER-VERLAG BERLIN. 1998: 338–352

  View details for Web of Science ID 000077582600026

• An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow. Goldberg, A., Oldham, J., D., Plotkin, S., Stein, C. 1998
• An improved lower bound for load balancing of tasks with unknown duration INFORMATION PROCESSING LETTERS Ma, Y., Plotkin, S. 1997; 62 (6): 301-303

  View details for Web of Science ID A1997XM07100004

• On-line routing of virtual circuits with applications to load balancing and machine scheduling JOURNAL OF THE ACM Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O. 1997; 44 (3): 486-504

  View details for Web of Science ID A1997XR56400005

• Approximation algorithms for Steiner and directed multicuts JOURNAL OF ALGORITHMS Klein, P. N., Plotkin, S. A., Rao, S., Tardos, E. 1997; 22 (2): 241-269

  View details for Web of Science ID A1997WH54200003

• On-line load balancing of temporary tasks JOURNAL OF ALGORITHMS Azar, Y., Kalyanasundaram, B., Plotkin, S., Pruhs, K. R., Waarts, O. 1997; 22 (1): 93-110

  View details for Web of Science ID A1997WH53900004

• Online throughput-competitive algorithm for multicast routing and admission control. Technical Report 97-1592, Stanford University Goel, A., Henzinger, M., Plotkin, S. 1997
• Improved lower bounds for load balancing of tasks with unknown duration. Information Processing Letters Ma, Y., Plotkin, S. 1997; 62: 301–303
• On-line machine scheduling with applications to load balancing and virtual circuit routing. J. Assoc. Comput. Mach. Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O. 1997; 3 (44): 486–504
• Routing and admission control in general topology networks with Poisson arrivals 7th Annual ACM/SIAM Symposium on Discrete Algorithms Kamath, A., Palmon, O., Plotkin, S. SIAM. 1996: 269–278

  View details for Web of Science ID A1996BE98Q00031

• Improved lower bounds for load balancing of tasks with unknown duration. Technical Report STAN-CS-TN-96-37, Stanford University Ma, Y., Plotkin, S. 1996
• Routing and admission control in general topology networks with poisson arrivals. Technical Report STAN-CS-TR-96-1575, Stanford University Kamath, A., Palmon, O., Plotkin, S. 1996
• Local management of a global resource in a communication network JOURNAL OF THE ACM Afek, Y., Awerbuch, B., Plotkin, S., Saks, M. 1996; 43 (1): 1-19

  View details for Web of Science ID A1996UW78500001

• COMPETITIVE ROUTING OF VIRTUAL CIRCUITS IN ATM NETWORKS IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS Plotkin, S. 1995; 13 (6): 1128-1136

  View details for Web of Science ID A1995RL82200019

• FAST APPROXIMATION ALGORITHMS FOR FRACTIONAL PACKING AND COVERING PROBLEMS MATHEMATICS OF OPERATIONS RESEARCH Plotkin, S. A., Shmoys, D. B., Tardos, E. 1995; 20 (2): 257-301

  View details for Web of Science ID A1995RR11200001

• FAST APPROXIMATION ALGORITHMS FOR MULTICOMMODITY FLOW PROBLEMS JOURNAL OF COMPUTER AND SYSTEM SCIENCES Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, E., Tragoudas, S. 1995; 50 (2): 228-243

  View details for Web of Science ID A1995QU27800005

• IMPROVED BOUNDS ON THE MAX-FLOW MIN-CUT RATIO FOR MULTICOMMODITY FLOWS COMBINATORICA Plotkin, S., TARDOS, V. 1995; 15 (3): 425-434

  View details for Web of Science ID A1995RW18000010

• Routing and admission control in general topology networks. Technical Report STAN-CS-TR-95-1548, Stanford University Gawlick, R., Kamath, A., Plotkin, S., Ramakrishnan, K. 1995
• Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. Karger, D., Plotkin, S. 1995
• Fast approximation algorithm for min-cost multicommodity flow. Technical Report STAN-CS-TN-95-19, Stanford University Kamath, A., Palmon, O., Plotkin, S. 1995
• FAST APPROXIMATION ALGORITHM FOR MINIMUM COST MULTICOMMODITY FLOW 6th Annual ACM/SIAM Symposium on Discrete Algorithms Kamath, A., Palmon, O., Plotkin, S. SIAM. 1995: 493–501

  View details for Web of Science ID A1995BC77V00054

• FASTER APPROXIMATION ALGORITHMS FOR THE UNIT CAPACITY CONCURRENT FLOW PROBLEM WITH APPLICATIONS TO ROUTING AND FINDING SPARSE CUTS SIAM JOURNAL ON COMPUTING Klein, P., Plotkin, S., Stein, C., Tardos, E. 1994; 23 (3): 466-487

  View details for Web of Science ID A1994NN24400002

• A PARALLEL ALGORITHM FOR RECONFIGURING A MULTIBUTTERFLY NETWORK WITH FAULTY SWITCHES IEEE TRANSACTIONS ON COMPUTERS Goldberg, A. V., Maggs, B. M., Plotkin, S. A. 1994; 43 (3): 321-326

  View details for Web of Science ID A1994ND51700006

• Competitive routing of virtual circuits with unknown duration. Awerbuch, B., Azar, Y., Plotkin, S., Waarts, O. 1994
• A sublinear parallel algorithm for stable matching. Feder, T., Megiddo, N., Plotkin, S. 1994
• Distributed routing and admission control of virtual circuits in general topology networks. Technical Report BL011212-940819-19TM, AT&T Bell Laboratories Gawlick, R., Kamath, A., Plotkin, S., Ramakrishnan, K. 1994
• Improved approximation algorithms for network design problems. Goemans, M., Goldberg, A., Plotkin, S., Shmoys, D., Tardos, É., Williamson, D. 1994
• SHALLOW EXCLUDED MINORS AND IMPROVED GRAPH DECOMPOSITIONS 5th Annual ACM-SIAM Symposium on Discrete Algorithms Plotkin, S., Rao, S., Smith, W. D. SIAM. 1994: 462–470

  View details for Web of Science ID A1994BA19U00051

• POLYNOMIAL DUAL NETWORK SIMPLEX ALGORITHMS MATHEMATICAL PROGRAMMING Orlin, J. B., Plotkin, S. A., Tardos, E. 1993; 60 (3): 255-276

  View details for Web of Science ID A1993LV54400001

• APPROXIMATING MATCHINGS IN PARALLEL INFORMATION PROCESSING LETTERS Fischer, T., Goldberg, A. V., Haglin, D. J., Plotkin, S. 1993; 46 (3): 115-118

  View details for Web of Science ID A1993LK18100002

• SUBLINEAR-TIME PARALLEL ALGORITHMS FOR MATCHING AND RELATED PROBLEMS JOURNAL OF ALGORITHMS Goldberg, A. V., Plotkin, S. A., Vaidya, P. M. 1993; 14 (2): 180-213

  View details for Web of Science ID A1993KM60500002

• Throughput competitive on-line routing. Awerbuch, B., Azar, Y., Plotkin, S. 1993
• On-line machine scheduling with applications to load balancing and virtual circuit routing. Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O. 1993
• On-line load balancing of temporary tasks. Azar, Y., Kalyanasundaram, B., Plotkin, S., Pruhs, K., Waarts, O. 1993
• Improved bounds on the max-flow min-cut ratio for multicommodity flows. Plotkin, S., Tardos, É. 1993
• A sublinear parallel algorithm for stable matching. Technical Report RJ 9327 (82440), IBM Almaden Research Center Feder, T., Megiddo, N., Plotkin, S. 1993
• Planar graphs, multicommodity flow, and network decomposition. Klein, P., Plotkin, S., Rao, S. 1993
• Bounds on the max-flow min-cut ratio for directed multicommodity flows. Technical Report CS-93-30, Brown University Klein, P., Plotkin, S., Rao, S., Tardos, E. 1993
• USING SEPARATION ALGORITHMS IN FIXED DIMENSION 1ST ANNUAL SYMP ON DISCRETE ALGORITHMS ( SODA ) NORTON, C. H., Plotkin, S. A., Tardos, E. ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS. 1992: 79–98

  View details for Web of Science ID A1992HB82700005

• USING INTERIOR-POINT METHODS FOR FAST PARALLEL ALGORITHMS FOR BIPARTITE MATCHING AND RELATED PROBLEMS SIAM JOURNAL ON COMPUTING Goldberg, A. V., Plotkin, S. A., Shmoys, D. B., Tardos, E. 1992; 21 (1): 140-150

  View details for Web of Science ID A1992HE39700011

• TIME-LAPSE SNAPSHOTS LECTURE NOTES IN COMPUTER SCIENCE Dwork, C., Herlihy, M., Plotkin, S. A., Waarts, O. 1992; 601: 154-170

  View details for Web of Science ID A1992LF68200016

• Time-lapse snapshots. Technical Report STAN-CS- 92-1423, Department of Computer Science, Stanford University Dwork, C., Herlihy, M., P., Plotkin, S., A., Waarts, O. 1992
• Lecture Notes: Topics in Combinatorial Optimization. Technical Report STAN-CS-92-1447, Department of Computer Science, Stanford University Goldberg, A., Plotkin, S. 1992
• Fast approximation algorithms for fractional packing and covering problems. Technical Report STAN-CS-92-1419, Department of Computer Science, Stanford University Plotkin, S., Shmoys, D., Tardos, É. 1992
• A parallel algorithm for reconfiguring a multibutterfly network with faulty switches. Technical Report STAN-CS-92-1427, Department of Computer Science, Stanford University Goldberg, A., Maggs, B., Plotkin, S. 1992
• Time-lapse snapshots. Dwork, C., Herlihy, M., P., Plotkin, S., Waarts, O. 1992
• COMPARISON OF ACELLULAR AND WHOLE-CELL PERTUSSIS-COMPONENT DIPHTHERIA-TETANUS-PERTUSSIS VACCINES IN INFANTS JOURNAL OF PEDIATRICS Blumberg, D. A., Mink, C. M., Cherry, J. D., Johnson, C., Garber, R., Plotkin, S. A., Watson, B., Ballanco, G. A., Daum, R. S., Sullivan, B., Townsend, T. R., Brayton, J., Gooch, W. M., Nelson, D. B., Congeni, B. L., Prober, C. G., Hackell, J. G., Dekker, C. L., Christenson, P. D. 1991; 119 (2): 194-204

  View details for Web of Science ID A1991FZ69200006

• COMBINATORIAL ALGORITHMS FOR THE GENERALIZED CIRCULATION PROBLEM MATHEMATICS OF OPERATIONS RESEARCH Goldberg, A. V., Plotkin, S. A., Tardos, E. 1991; 16 (2): 351-381

  View details for Web of Science ID A1991FM19800008

• Predictors of morbidity and mortality in neonates with herpes simplex virus infections. The National Institute of Allergy and Infectious Diseases Collaborative Antiviral Study Group. New England journal of medicine Whitley, R., Arvin, A., Prober, C., Corey, L., Burchett, S., Plotkin, S., Starr, S., Jacobs, R., Powell, D., Nahmias, A. 1991; 324 (7): 450-454

  Abstract

  In a controlled trial comparing acyclovir with vidarabine in the treatment of neonatal herpes simplex virus (HSV) infection, we found no significant difference between the treatments in adjusted mortality and morbidity. Hence, we sought to define for the entire cohort (n = 202) the clinical characteristics that best predicted the eventual outcome in these neonates.Data were gathered prospectively at 27 centers between 1981 and 1988 in infants less than one month of age who had virologically confirmed HSV infection. We examined the outcomes by multivariate analyses of 24 variables. Disease was classified in one of three categories based on the extent of the involvement at entry into the trial: infection confined to skin, eyes, or mouth; encephalitis; or disseminated infection.There were no deaths among the 85 infants with localized HSV infection. The mortality rate was significantly higher in the 46 neonates with disseminated infection (57 percent) than in the 71 with encephalitis (15 percent). In addition, the risk of death was increased in neonates who were in or near coma at entry (relative risk, 5.2), had disseminated intravascular coagulopathy (relative risk, 3.8), or were premature (relative risk, 3.7). In babies with disseminated disease, HSV pneumonitis was also associated with greater mortality (relative risk, 3.6). In the survivors, morbidity was most frequent in infants with encephalitis (relative risk, 4.4), disseminated infection (relative risk, 2.1), seizures (relative risk, 3.0), or infection with HSV type 2 (relative risk, 4.9). With HSV infection limited to the skin, eyes, or mouth, the presence of three or more recurrences of vesicles was associated with an increased risk of neurologic impairment as compared with two or fewer recurrences.

  View details for PubMedID 1988830

• A controlled trial comparing vidarabine with acyclovir in neonatal herpes simplex virus infection. Infectious Diseases Collaborative Antiviral Study Group. New England journal of medicine Whitley, R., Arvin, A., Prober, C., Burchett, S., Corey, L., Powell, D., Plotkin, S., Starr, S., Alford, C., Connor, J. 1991; 324 (7): 444-449

  Abstract

  Despite the use of vidarabine, herpes simplex virus (HSV) infection in neonates continues to be a disease of high morbidity and mortality. We undertook a controlled trial comparing vidarabine with acyclovir for the treatment of neonatal HSV infection.Babies less than one month of age with virologically confirmed HSV infection were randomly and blindly assigned to receive either intravenous vidarabine (30 mg per kilogram of body weight per day; n = 95) or acyclovir (30 mg per kilogram per day; n = 107) for 10 days. Actuarial rates of mortality and morbidity among the survivors after one year were compared overall and according to the extent of the disease at entry into the study (infection confined to the skin, eyes, or mouth; encephalitis; or disseminated disease).After adjustment for differences between groups in the extent of disease, there was no difference between vidarabine and acyclovir in either morbidity (P = 0.83) or mortality (P = 0.27). None of the 85 babies with disease confined to the skin, eyes, or mouth died. Of the 31 babies in this group who were treated with vidarabine and followed for a year, 88 percent (22 of 25) were judged to be developing normally after one year, as compared with 98 percent (45 of 46) of the 54 treated with acyclovir (95 percent confidence interval for the difference, -4 to 24). For the 71 babies with encephalitis, mortality was 14 percent with vidarabine (5 of 36) and with acyclovir (5 of 35); of the survivors, 43 percent (13 of 30) and 29 percent (8 of 28), respectively, were developing normally after one year (95 percent confidence interval for the difference, -11 to 39). For the 46 babies with disseminated disease, mortality was 50 percent (14 of 28) with vidarabine and 61 percent (11 of 18) with acyclovir (95 percent confidence interval for the difference, -20 to 40); of the survivors, 58 percent (7 of 12) and 60 percent (3 of 5), respectively, were judged to be developing normally after one year (95 percent confidence interval for the difference, -40 to 50). Both medications were without serious toxic effects.In this multicenter, randomized, blinded study there were no differences in outcome between vidarabine and acyclovir in the treatment of neonatal HSV infection. The study lacked statistical power to determine whether there were sizable differences within the subgroups of those with localized HSV, encephalitis, or disseminated disease.

  View details for PubMedID 1988829

• Fast approximation algorithms for fractional packing and covering problems. Plotkin, S., Shmoys, D., Tardos, É. 1991
• Approximating matching in parallel. Technical Report STAN-CS-91-1369, Department of Computer Science, Stanford University Fischer, T., Goldberg, A., Plotkin, S. 1991
• Polynomial Dual Network Simplex. Technical Report STAN-CS-91-1374, Department of Computer Science, Stanford University Orlin, J., Plotkin, S., Tardos, É. 1991
• Fast approximation algorithms for multicommodity flow problem. Technical Report STAN-CS-91-1375, Department of Computer Science, Stanford University Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, É., Tragoudas, S. 1991
• Fast approximation algorithms for multicommodity flow problem. Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, É., Tragoudas, S. 1991
• Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. Technical Report 961, School of Operations Research and Industrial Engineering, Cornell University Klein, P., Plotkin, S., Stein, C., Tardos, É. 1991
• Improved Dual Network Simplex. Plotkin, S., Tardos, É. 1990
• Using Separation Algorithms in Fixed Dimension. Haibt-Norton, C., Plotkin, S., Tardos, É. 1990
• Using Separation Algorithms in Fixed Dimension. Technical Report 866, School of Oper. Res. and Ind. Eng., Cornell University Haibt-Norton, C., Plotkin, S., Tardos, É. 1989
• Interior Point Methods in Parallel Computation. Goldberg, A., Plotkin, S., Shmoys, D., Tardos, É. 1989
• Interior Point Methods in Parallel Computation. Technical Report STAN-CS-89-1259, Stanford University Goldberg, A., Plotkin, S., Shmoys, D., Tardos, É. 1989
• Sticky Bits and Universality of Consensus. Technical Report STAN-CS-89-1280, Stanford University Plotkin, S. 1989
• Sticky Bits and Universality of Consensus. Plotkin, S. 1989
• Network Decomposition and Locality in Distributed Computation. Awerbuch, B., Goldberg, A., Luby, M., Plotkin, S. 1989
• Sublinear-Time Parallel Algorithms for Matching and Related Problems. Goldberg, A., Plotkin, S., Vaidya, P. 1988
• Parallel Symmetry Breaking in Sparse Graphs. SIAM J. on Discrete Mathematics Goldberg, A., Plotkin, S., Shannon, G. 1988; 4 (1): 434–446
• Advanced parallel and VLSI computation: Lecture notes for 6.849/18.436. Leighton, F., T., Leiserson, C., E., Maggs, B., Plotkin, S., Wein, J. 1988
• Minimum-Cost Spanning Tree as a Path-Finding Problem in a Closed Semiring. Information Processing Letters Maggs, B., Plotkin, S. 1988; 6 (26): 291–293
• Combinatorial Algorithms for the Generalized Circulation Problem. Technical Report MIT/LCS/TM-358, M.I.T. Goldberg, A., Plotkin, S., Tardos, É. 1988
• Combinatorial Algorithms for the Generalized Circulation Problem. Goldberg, A., Plotkin, S., Tardos, É. 1988
• Sublinear-Time Parallel Algorithms for Matching and Related Problems. Technical Report MIT/LCS/TM-357, M.I.T. Goldberg, A., Plotkin, S., Vaidya, P. 1988
• Theory of parallel and VLSI computation: Lecture notes for 18.435/6.848. Leighton, F., T., Leiserson, C., E., Maggs, B., Plotkin, S., Wein, J. 1988
• Local Management of a Global Resource in a Communication Network. Afek, Y., Awerbuch, B., Plotkin, S., Saks, M. 1987
• Parallel Symmetry Breaking in Sparse Graphs. Goldberg, A., Plotkin, S., Shannon, G. 1987
• Efficient Parallel Algorithms for (Δ+1)-Coloring and Maximal Independent Set Problems. Technical Report MIT/LCS/TM-320, M.I.T. Goldberg, A., Plotkin, S. 1987
• Approximating the size of a dynamically growing distributed network. Technical Report MIT/LCS/TM-328, M.I.T. Awerbuch, B., Plotkin, S. 1987
• Parallel (Δ+1) Coloring of Constant-Degree Graphs. Information Processing Letters Goldberg, A., Plotkin, S. 1987; 4 (25): 241–245
• A Tree-Structured Architecture for Semantic Gap Reduction. Computer Architecture News Plotkin, S., Tabak, D. 1983; 11: 34–44
• Modular, Object-Oriented Microcomputer Architecture. Microprocessing and Microprogramming Plotkin, S., Tabak, D. 1983; 12: 153–157
• An Adaptive Approach to Suppress Powerful Impulsive Interference. Signal Processing Plotkin, E., Plotkin, S. 1982; 1: 1–9
• Real Ray Tracing in an Unmagnetized Absorptive Ionosphere. Israel Journal of Technology Censor, D., Plotkin, S. 1980; 18: 319–325