Serge A. Plotkin

发表

Local Management of a Global Resource in a Communication Network

Michael E. Saks, Baruch Awerbuch, Yehuda Afek, 1987, FOCS.

Improved bounds on the max-flow min-cut ratio for multicommodity flows

Éva Tardos, Serge A. Plotkin, 1995, Comb..

A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches

Bruce M. Maggs, Andrew V. Goldberg, Serge A. Plotkin, 1994, IEEE Trans. Computers.

Time-Lapse Snapshots

Maurice Herlihy, Cynthia Dwork, Serge A. Plotkin, 1999, SIAM J. Comput..

Local management of a global resource in a communication network

Michael E. Saks, Baruch Awerbuch, Yehuda Afek, 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

Sublinear-Time Parallel Algorithms for Matching and Related Problems

Andrew V. Goldberg, Pravin M. Vaidya, Serge A. Plotkin, 1993, J. Algorithms.

Fast Approximation Algorithms for Multicommodity Flow Problems

Fillia Makedon, Spyros Tragoudas, Éva Tardos, 1995, J. Comput. Syst. Sci..

On-line routing of virtual circuits with applications to load balancing and machine scheduling

Amos Fiat, Yossi Azar, Serge A. Plotkin, 1997, JACM.

Throughput-competitive on-line routing

Yossi Azar, Baruch Awerbuch, Serge A. Plotkin, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

Parallel Symmetry-Breaking in Sparse Graphs

Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon, 1988, SIAM J. Discret. Math..

Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

Philip N. Klein, Éva Tardos, Serge A. Plotkin, 1994, SIAM J. Comput..

Combining Fairness with Throughput: Online Routing with Multiple Objectives

Ashish Goel, Adam Meyerson, Serge A. Plotkin, 2001, J. Comput. Syst. Sci..

Scheduling data transfers in a network and the set scheduling problem

Éva Tardos, Ashish Goel, Monika Henzinger, 2003, J. Algorithms.

Web caching using access statistics

Kamesh Munagala, Adam Meyerson, Serge A. Plotkin, 2001, SODA '01.

Sticky bits and universality of consensus

Serge A. Plotkin, 1989, PODC '89.

Approximation Algorithms for Steiner and Directed Multicuts

Philip N. Klein, Éva Tardos, Satish Rao, 1997, J. Algorithms.

Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs

Andrew V. Goldberg, Serge A. Plotkin, A. Goldberg, 1987, Inf. Process. Lett..

Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows

David R. Karger, Serge A. Plotkin, David R Karger, 1995, STOC '95.

Minimum-Cost Spanning Tree as a Path-Finding Problem

Bruce M. Maggs, Serge A. Plotkin, 1988, Inf. Process. Lett..

Approximating Matchings in Parallel

Andrew V. Goldberg, Serge A. Plotkin, David J. Haglin, 1993, Inf. Process. Lett..

Network decomposition and locality in distributed computation

Andrew V. Goldberg, Baruch Awerbuch, Serge A. Plotkin, 1989, 30th Annual Symposium on Foundations of Computer Science.

Set k-cover algorithms for energy efficient monitoring in wireless sensor networks

Ashish Goel, Serge A. Plotkin, Zoë Abrams, 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

Approximating a finite metric by a small number of tree metrics

Sudipto Guha, Ashish Goel, Moses Charikar, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

Polynomial dual network simplex algorithms

Éva Tardos, James B. Orlin, Serge A. Plotkin, 2011, Math. Program..

An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration

Yuan Ma, Serge A. Plotkin, Yuan Ma, 1997, Inf. Process. Lett..

Set k-cover algorithms for energy efficient monitoring in wireless sensor networks

Ashish Goel, Serge A. Plotkin, Zoë Abrams, 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

Competitive routing of virtual circuits with unknown duration

Yossi Azar, Baruch Awerbuch, Serge A. Plotkin, 1994, SODA '94.

Cost-Distance: Two Metric Network Design

Kamesh Munagala, Adam Meyerson, Serge A. Plotkin, 2008, SIAM J. Comput..

Graph-theoretic techniques for parallel, distributed, and sequential computation

Serge A. Plotkin, 1988 .

Improved dual network simplex

Éva Tardos, Serge A. Plotkin, É. Tardos, 1990, SODA '90.

Routing and admission control in general topology networks with Poisson arrivals

Serge A. Plotkin, Anil Kamath, Omri Palmon, 1995, SODA '96.

Scheduling data transfers in a network and the set scheduling problem

Éva Tardos, Ashish Goel, Monika Henzinger, 1999, STOC '99.

Fast Approximation Algorithms for Fractional Packing and Covering Problems

Éva Tardos, David B. Shmoys, Serge A. Plotkin, 1995, Math. Oper. Res..

On-Line Load Balancing of Temporary Tasks

Bala Kalyanasundaram, Kirk Pruhs, Yossi Azar, 1993, J. Algorithms.

Excluded minors, network decomposition, and multicommodity flow

Philip N. Klein, Satish Rao, Serge A. Plotkin, 1993, STOC.

Combining fairness with throughput: online routing with multiple objectives

Ashish Goel, Adam Meyerson, Serge A. Plotkin, 2000, STOC '00.

A k-Median Algorithm with Running Time Independent of Data Size

Adam Meyerson, Serge A. Plotkin, Liadan O'Callaghan, 2004, Machine Learning.

Combinatorial Algorithms for the Generalized Circulation Problem

Andrew V. Goldberg, Éva Tardos, Serge A. Plotkin, 1991, Math. Oper. Res..

Sublinear-time parallel algorithms for matching and related problems

Andrew V. Goldberg, Pravin M. Vaidya, Serge A. Plotkin, 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

Cost-distance: two metric network design

Kamesh Munagala, Adam Meyerson, Serge A. Plotkin, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

Time-Lapse Snapshots

Maurice Herlihy, Cynthia Dwork, Serge A. Plotkin, 1992, SIAM J. Comput..

Parallel symmetry-breaking in sparse graphs

Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon, 1987, STOC.

Using separation algorithms in fixed dimension

Éva Tardos, Serge A. Plotkin, Carolyn Haibt Norton, 1990, SODA '90.

Fast approximation algorithms for fractional packing and covering problems

Éva Tardos, David B. Shmoys, Serge A. Plotkin, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

A non-manipulable trust system based on EigenTrust

Serge A. Plotkin, Zoë Abrams, Robert McGrew, 2005, SECO.

Improved approximation algorithms for network design problems

Andrew V. Goldberg, Éva Tardos, David P. Williamson, 1994, SODA '94.

Approximate majorization and fair online load balancing

Ashish Goel, Adam Meyerson, Serge A. Plotkin, 2001, TALG.

On-line load balancing with applications to machine scheduling and virtual circuit routing

Amos Fiat, Yossi Azar, Serge A. Plotkin, 1993, STOC.

Competitive Routing of Virtual Circuits in ATM Networks

Serge A. Plotkin, 1995, IEEE J. Sel. Areas Commun..

Shallow excluded minors and improved graph decompositions

Satish Rao, Serge A. Plotkin, Warren D. Smith, 1994, SODA '94.

Distributed admission control, scheduling, and routing with stale information

Ashish Goel, Adam Meyerson, Serge A. Plotkin, 2001, SODA '01.

An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow

Andrew V. Goldberg, Serge A. Plotkin, Clifford Stein, 1998, IPCO.

Fast approximation algorithms for multicommodity flow problems

Fillia Makedon, Spyros Tragoudas, Éva Tardos, 1991, STOC '91.

Improved bounds on the max-flow min-cut ratio for multicommodity flows

Éva Tardos, Serge A. Plotkin, É. Tardos, 1993, Comb..

Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems

Andrew V. Goldberg, Éva Tardos, David B. Shmoys, 1992, SIAM J. Comput..

Online througput-competitive algorithm for multicast routing and admission control

Ashish Goel, Monika Henzinger, Serge A. Plotkin, 1998, SODA '98.

Interior-point methods in parallel computation

Andrew V. Goldberg, Éva Tardos, David B. Shmoys, 1989, 30th Annual Symposium on Foundations of Computer Science.

Combinatorial algorithms for the generalized circulation problem

Andrew V. Goldberg, Éva Tardos, Serge A. Plotkin, 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

A sublinear parallel algorithm for stable matching

Nimrod Megiddo, Tomás Feder, Serge A. Plotkin, 1994, SODA '94.

Designing networks incrementally

Kamesh Munagala, Adam Meyerson, Serge A. Plotkin, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Fast approximation algorithm for minimum cost multicommodity flow

Serge A. Plotkin, Anil Kamath, Omri Palmon, 1995, SODA '95.

Efficient parallel algorithms for (5+1)-coloring and maximal independent set problems

Serge A. Plotkin, A. Goldberg, 1987 .

Bounds on the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows

Serge A. Plotkin, P. Klein, É. Tardos, 1993 .

Graph-theoretic techniques for parallel, distributed, and sequential computation

Serge A. Plotkin, 1988 .

On-line routing of virtual circuits with applications to load balancing and machine scheduling

Serge A. Plotkin, J. Aspnes, Y. Azar, 1997, JACM.

CS369 - Online Algorithms Lecture Notes for 2012-2013 Academic Year

Serge A. Plotkin, Serge Plotkin, 2013 .

Keeping Peers Honest In EigenTrust

Serge A. Plotkin, Serge Plotkin, Zoë Abrams, 2004 .

Optimization Problems in High-Speed Networks

Serge A. Plotkin, Serge Plotkin, 2002 .

CS261 - Optimization Paradigms Lecture Notes for 2009-2010 Academic Year

Serge A. Plotkin, Serge Plotkin, 2010 .

On-line routing of virtual circuits with applications to load balancing and machine scheduling

Serge A. Plotkin, J. Aspnes, Y. Azar, 1997, JACM.