Serge A. Plotkin

67 papers A* 31B 2Journal 32Unranked 2

Year	Rank	Type	Title / Venue / Authors
2008	J	`jnl`	Cost-Distance: Two Metric Network Design. SIAM J. Comput. Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
2005	J	`jnl`	A non-manipulable trust system based on EigenTrust. SIGecom Exch. Zoë Abrams, Robert McGrew, Serge A. Plotkin
2005	J	`jnl`	An online throughput-competitive algorithm for multicast routing and admission control. J. Algorithms Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin
2005	J	`jnl`	Approximate majorization and fair online load balancing. ACM Trans. Algorithms Ashish Goel, Adam Meyerson, Serge A. Plotkin
2004	J	`jnl`	A Mach. Learn. Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin
2004	—	`conf`	Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. IPSN Zoë Abrams, Ashish Goel, Serge A. Plotkin
2003	J	`jnl`	Scheduling data transfers in a network and the set scheduling problem. J. Algorithms Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos
2003	J	`jnl`	Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks CoRR Zoë Abrams, Ashish Goel, Serge A. Plotkin
2001	A*	`conf`	Approximate majorization and fair online load balancing. SODA Ashish Goel, Adam Meyerson, Serge A. Plotkin
2001	J	`jnl`	Combining Fairness with Throughput: Online Routing with Multiple Objectives. J. Comput. Syst. Sci. Ashish Goel, Adam Meyerson, Serge A. Plotkin
2001	J	`jnl`	Competitive Routing of Virtual Circuits with Unknown Duration. J. Comput. Syst. Sci. Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts
2001	A*	`conf`	Designing Networks Incrementally. FOCS Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
2001	A*	`conf`	Distributed admission control, scheduling, and routing with stale information. SODA Ashish Goel, Adam Meyerson, Serge A. Plotkin
2001	A*	`conf`	Web caching using access statistics. SODA Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
2000	J	`jnl`	A sublinear parallel algorithm for stable matching. Theor. Comput. Sci. Tomás Feder, Nimrod Megiddo, Serge A. Plotkin
2000	A*	`conf`	Combining fairness with throughput: online routing with multiple objectives. STOC Ashish Goel, Adam Meyerson, Serge A. Plotkin
2000	A*	`conf`	Cost-Distance: Two Metric Network Design. FOCS Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
1999	A*	`conf`	Scheduling Data Transfers in a Network and the Set Scheduling Problem. STOC Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos
1999	J	`jnl`	Time-Lapse Snapshots. SIAM J. Comput. Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts
1998	B	`conf`	An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. IPCO Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein
1998	A*	`conf`	Approximating a Finite Metric by a Small Number of Tree Metrics. FOCS Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin
1998	A*	`conf`	Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control. SODA Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin
1998	J	`jnl`	Routing and Admission Control in General Topology Networks with Poisson Arrivals. J. Algorithms Anil Kamath, Omri Palmon, Serge A. Plotkin
1997	J	`jnl`	An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration. Inf. Process. Lett. Yuan Ma, Serge A. Plotkin
1997	J	`jnl`	Approximation Algorithms for Steiner and Directed Multicuts. J. Algorithms Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos
1997	J	`jnl`	On-Line Load Balancing of Temporary Tasks. J. Algorithms Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
1997	J	`jnl`	On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
1996	J	`jnl`	Local Management of a Global Resource in a Communication Network. J. ACM Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks
1996	A*	`conf`	Routing and Admission Control in General Topology Networks with Poisson Arrivals. SODA Anil Kamath, Omri Palmon, Serge A. Plotkin
1995	A*	`conf`	Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. STOC David R. Karger, Serge A. Plotkin
1995	J	`jnl`	Competitive Routing of Virtual Circuits in ATM Networks. IEEE J. Sel. Areas Commun. Serge A. Plotkin
1995	A*	`conf`	Fast Approximation Algorithm for Minimum Cost Multicommodity Flow. SODA Anil Kamath, Omri Palmon, Serge A. Plotkin
1995	J	`jnl`	Fast Approximation Algorithms for Fractional Packing and Covering Problems. Math. Oper. Res. Serge A. Plotkin, David B. Shmoys, Éva Tardos
1995	J	`jnl`	Fast Approximation Algorithms for Multicommodity Flow Problems. J. Comput. Syst. Sci. Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas
1995	J	`jnl`	Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows. Comb. Serge A. Plotkin, Éva Tardos
1994	J	`jnl`	A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches. IEEE Trans. Computers Andrew V. Goldberg, Bruce M. Maggs, Serge A. Plotkin
1994	A*	`conf`	A Sublinear Parallel Algorithm for Stable Matching. SODA Tomás Feder, Nimrod Megiddo, Serge A. Plotkin
1994	A*	`conf`	Competitive Routing of Virtual Circuits with Unknown Duration. SODA Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts
1994	J	`jnl`	Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts. SIAM J. Comput. Philip N. Klein, Serge A. Plotkin, Clifford Stein, Éva Tardos
1994	A*	`conf`	Improved Approximation Algorithms for Network Design Problems. SODA Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson
1994	A*	`conf`	Shallow Excluded Minors and Improved Graph Decompositions. SODA Serge A. Plotkin, Satish Rao, Warren D. Smith
1993	J	`jnl`	Approximating Matchings in Parallel. Inf. Process. Lett. Ted Fischer, Andrew V. Goldberg, David J. Haglin, Serge A. Plotkin
1993	A*	`conf`	Excluded minors, network decomposition, and multicommodity flow. STOC Philip N. Klein, Serge A. Plotkin, Satish Rao
1993	A*	`conf`	Improved bounds on the max-flow min-cut ratio for multicommodity flows. STOC Serge A. Plotkin, Éva Tardos
1993	A*	`conf`	On-line load balancing with applications to machine scheduling and virtual circuit routing. STOC James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
1993	B	`conf`	Online Load Balancing of Temporary Tasks. WADS Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
1993	J	`jnl`	Polynomial dual network simplex algorithms. Math. Program. James B. Orlin, Serge A. Plotkin, Éva Tardos
1993	J	`jnl`	Sublinear-Time Parallel Algorithms for Matching and Related Problems. J. Algorithms Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
1993	A*	`conf`	Throughput-Competitive On-Line Routing FOCS Baruch Awerbuch, Yossi Azar, Serge A. Plotkin
1992	—	`conf`	Time-Lapse Snapshots. ISTCS Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts
1992	J	`jnl`	Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems. SIAM J. Comput. Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos
1992	J	`jnl`	Using Separation Algorithms in Fixed Dimension. J. Algorithms Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos
1991	J	`jnl`	Combinatorial Algorithms for the Generalized Circulation Problem. Math. Oper. Res. Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos
1991	A*	`conf`	Fast Approximation Algorithms for Fractional Packing and Covering Problems FOCS Serge A. Plotkin, David B. Shmoys, Éva Tardos
1991	A*	`conf`	Fast Approximation Algorithms for Multicommodity Flow Problems STOC Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas
1990	A*	`conf`	Improved Dual Network Simplex. SODA Serge A. Plotkin, Éva Tardos
1990	A*	`conf`	Using Separation Algorithms in Fixed Dimension. SODA Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos
1989	A*	`conf`	Interior-Point Methods in Parallel Computation FOCS Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos
1989	A*	`conf`	Network Decomposition and Locality in Distributed Computation FOCS Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin
1989	A*	`conf`	Sticky Bits and Universality of Consensus. PODC Serge A. Plotkin
1988	A*	`conf`	Combinatorial Algorithms for the Generalized Circulation Problem FOCS Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos
1988	J	`jnl`	Minimum-Cost Spanning Tree as a Path-Finding Problem. Inf. Process. Lett. Bruce M. Maggs, Serge A. Plotkin
1988	J	`jnl`	Parallel Symmetry-Breaking in Sparse Graphs. SIAM J. Discret. Math. Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon
1988	A*	`conf`	Sublinear-Time Parallel Algorithms for Matching and Related Problems FOCS Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
1987	A*	`conf`	Local Management of a Global Resource in a Communication Network FOCS Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks
1987	J	`jnl`	Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs. Inf. Process. Lett. Andrew V. Goldberg, Serge A. Plotkin
1987	A*	`conf`	Parallel Symmetry-Breaking in Sparse Graphs STOC Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon