Search results for "Serge A. Plotkin"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Adam Meyerson, Kamesh Munagala, Serge A. Plotkin	Cost-Distance: Two Metric Network Design.	SIAM J. Comput.	2008	DBLP DOI BibTeX RDF
1	Ashish Goel, Adam Meyerson, Serge A. Plotkin	Approximate majorization and fair online load balancing.	ACM Transactions on Algorithms	2005	DBLP DOI BibTeX RDF	load balancing, Fairness
1	Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin	An online throughput-competitive algorithm for multicast routing and admission control.	J. Algorithms	2005	DBLP DOI BibTeX RDF
1	Zoë Abrams, Robert McGrew, Serge A. Plotkin	A non-manipulable trust system based on EigenTrust.	SIGecom Exchanges	2005	DBLP DOI BibTeX RDF	algorithms, P2P, mechanism design, economics
1	Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin	A k-Median Algorithm with Running Time Independent of Data Size.	Machine Learning	2004	DBLP DOI BibTeX RDF	sublinear, clustering, sampling
1	Zoë Abrams, Ashish Goel, Serge A. Plotkin	Set k-cover algorithms for energy efficient monitoring in wireless sensor networks.	IPSN	2004	DBLP DOI BibTeX RDF	wireless sensor networks, energy conservation, analysis of algorithms
1	Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos	Scheduling data transfers in a network and the set scheduling problem.	J. Algorithms	2003	DBLP DOI BibTeX RDF
1	Zoë Abrams, Ashish Goel, Serge A. Plotkin	Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks	CoRR	2003	DBLP BibTeX RDF
1	Ashish Goel, Adam Meyerson, Serge A. Plotkin	Combining Fairness with Throughput: Online Routing with Multiple Objectives.	J. Comput. Syst. Sci.	2001	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts	Competitive Routing of Virtual Circuits with Unknown Duration.	J. Comput. Syst. Sci.	2001	DBLP DOI BibTeX RDF
1	Ashish Goel, Adam Meyerson, Serge A. Plotkin	Approximate majorization and fair online load balancing.	SODA	2001	DBLP DOI BibTeX RDF
1	Adam Meyerson, Kamesh Munagala, Serge A. Plotkin	Web caching using access statistics.	SODA	2001	DBLP DOI BibTeX RDF
1	Ashish Goel, Adam Meyerson, Serge A. Plotkin	Distributed admission control, scheduling, and routing with stale information.	SODA	2001	DBLP DOI BibTeX RDF
1	Adam Meyerson, Kamesh Munagala, Serge A. Plotkin	Designing Networks Incrementally.	FOCS	2001	DBLP DOI BibTeX RDF
1	Tomás Feder, Nimrod Megiddo, Serge A. Plotkin	A sublinear parallel algorithm for stable matching.	Theor. Comput. Sci.	2000	DBLP DOI BibTeX RDF
1	Adam Meyerson, Kamesh Munagala, Serge A. Plotkin	Cost-Distance: Two Metric Network Design.	FOCS	2000	DBLP DOI BibTeX RDF	cost-distance problem, 2-metric network design, edge cost sum optimization, source-sink distance sum optimization, randomized approximation scheme, source number, logarithmic approximation, single-sink buy-at-bulk problem, variable pipe types, single-source multicast trees, delay properties, multi-level facility location, computational complexity, trees (mathematics), cost, Steiner tree, facility location, telecommunication network routing, edges, approximation theory, randomised algorithms, network synthesis
1	Ashish Goel, Adam Meyerson, Serge A. Plotkin	Combining fairness with throughput: online routing with multiple objectives.	STOC	2000	DBLP DOI BibTeX RDF
1	Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts	Time-Lapse Snapshots.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos	Scheduling Data Transfers in a Network and the Set Scheduling Problem.	STOC	1999	DBLP DOI BibTeX RDF
1	Anil Kamath, Omri Palmon, Serge A. Plotkin	Routing and Admission Control in General Topology Networks with Poisson Arrivals.	J. Algorithms	1998	DBLP DOI BibTeX RDF
1	Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin	Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control.	SODA	1998	DBLP DOI BibTeX RDF
1	Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein	An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow.	IPCO	1998	DBLP DOI BibTeX RDF
1	Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin	Approximating a Finite Metric by a Small Number of Tree Metrics.	FOCS	1998	DBLP DOI BibTeX RDF	probabilistic approximation of metric spaces, low diameter partitioning, real normed spaces, algorithms, linear programming, approximation, metric space, derandomization, tree metric
1	Yuan Ma, Serge A. Plotkin	An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration.	Inf. Process. Lett.	1997	DBLP DOI BibTeX RDF
1	Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts	On-Line Load Balancing of Temporary Tasks.	J. Algorithms	1997	DBLP DOI BibTeX RDF
1	Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos	Approximation Algorithms for Steiner and Directed Multicuts.	J. Algorithms	1997	DBLP DOI BibTeX RDF
1	James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts	On-line routing of virtual circuits with applications to load balancing and machine scheduling.	J. ACM	1997	DBLP DOI BibTeX RDF	optimization, routing, high-speed networks, on-line algorithms
1	Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks	Local Management of a Global Resource in a Communication Network.	J. ACM	1996	DBLP DOI BibTeX RDF	distributed computation, resource management, diffusing computations, distributed network management
1	Anil Kamath, Omri Palmon, Serge A. Plotkin	Routing and Admission Control in General Topology Networks with Poisson Arrivals.	SODA	1996	DBLP DOI BibTeX RDF
1	Serge A. Plotkin, Éva Tardos	Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows.	Combinatorica	1995	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Stein, Spyros Tragoudas	Fast Approximation Algorithms for Multicommodity Flow Problems.	J. Comput. Syst. Sci.	1995	DBLP DOI BibTeX RDF
1	Serge A. Plotkin	Competitive Routing of Virtual Circuits in ATM Networks.	IEEE Journal on Selected Areas in Communications	1995	DBLP DOI BibTeX RDF
1	Anil Kamath, Omri Palmon, Serge A. Plotkin	Fast Approximation Algorithm for Minimum Cost Multicommodity Flow.	SODA	1995	DBLP DOI BibTeX RDF
1	David R. Karger, Serge A. Plotkin	Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows.	STOC	1995	DBLP DOI BibTeX RDF
1	Andrew V. Goldberg, Bruce M. Maggs, Serge A. Plotkin	A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF
1	Philip N. Klein, Serge A. Plotkin, Clifford Stein, Éva Tardos	Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts.	SIAM J. Comput.	1994	DBLP DOI BibTeX RDF
1	Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson	Improved Approximation Algorithms for Network Design Problems.	SODA	1994	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts	Competitive Routing of Virtual Circuits with Unknown Duration.	SODA	1994	DBLP DOI BibTeX RDF
1	Tomás Feder, Nimrod Megiddo, Serge A. Plotkin	A Sublinear Parallel Algorithm for Stable Matching.	SODA	1994	DBLP DOI BibTeX RDF
1	Serge A. Plotkin, Satish Rao, Warren D. Smith	Shallow Excluded Minors and Improved Graph Decompositions.	SODA	1994	DBLP DOI BibTeX RDF
1	Ted Fischer, Andrew V. Goldberg, David J. Haglin, Serge A. Plotkin	Approximating Matchings in Parallel.	Inf. Process. Lett.	1993	DBLP DOI BibTeX RDF
1	Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya	Sublinear-Time Parallel Algorithms for Matching and Related Problems.	J. Algorithms	1993	DBLP DOI BibTeX RDF
1	James B. Orlin, Serge A. Plotkin, Éva Tardos	Polynomial dual network simplex algorithms.	Math. Program.	1993	DBLP DOI BibTeX RDF
1	Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts	Online Load Balancing of Temporary Tasks.	WADS	1993	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Yossi Azar, Serge A. Plotkin	Throughput-Competitive On-Line Routing	FOCS	1993	DBLP DOI BibTeX RDF	maximum call duration, throughput-competitive on-line routing, optical communication links, admission control, high-speed networks, bandwidth-delay product
1	Philip N. Klein, Serge A. Plotkin, Satish Rao	Excluded minors, network decomposition, and multicommodity flow.	STOC	1993	DBLP DOI BibTeX RDF
1	Serge A. Plotkin, Éva Tardos	Improved bounds on the max-flow min-cut ratio for multicommodity flows.	STOC	1993	DBLP DOI BibTeX RDF
1	James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts	On-line load balancing with applications to machine scheduling and virtual circuit routing.	STOC	1993	DBLP DOI BibTeX RDF
1	Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos	Using Separation Algorithms in Fixed Dimension.	J. Algorithms	1992	DBLP DOI BibTeX RDF
1	Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos	Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems.	SIAM J. Comput.	1992	DBLP DOI BibTeX RDF
1	Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts	Time-Lapse Snapshots.	ISTCS	1992	DBLP DOI BibTeX RDF
1	Serge A. Plotkin, David B. Shmoys, Éva Tardos	Fast Approximation Algorithms for Fractional Packing and Covering Problems	FOCS	1991	DBLP DOI BibTeX RDF	fractional covering, fractional packing, approximation algorithms, linear programming, Lagrangian relaxation, running time, multicommodity flow problems
1	Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas	Fast Approximation Algorithms for Multicommodity Flow Problems	STOC	1991	DBLP DOI BibTeX RDF
1	Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos	Using Separation Algorithms in Fixed Dimension.	SODA	1990	DBLP DOI BibTeX RDF
1	Serge A. Plotkin, Éva Tardos	Improved Dual Network Simplex.	SODA	1990	DBLP DOI BibTeX RDF
1	Serge A. Plotkin	Sticky Bits and Universality of Consensus.	PODC	1989	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin	Network Decomposition and Locality in Distributed Computation	FOCS	1989	DBLP DOI BibTeX RDF	arbitrary graph, distributed algorithm, distributed computation, graph partitioning, deterministic algorithms, network decomposition
1	Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos	Interior-Point Methods in Parallel Computation	FOCS	1989	DBLP DOI BibTeX RDF	bipartite matching problem, parallel algorithm, linear programming, interior-point methods
1	Bruce M. Maggs, Serge A. Plotkin	Minimum-Cost Spanning Tree as a Path-Finding Problem.	Inf. Process. Lett.	1988	DBLP DOI BibTeX RDF
1	Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon	Parallel Symmetry-Breaking in Sparse Graphs.	SIAM J. Discrete Math.	1988	DBLP DOI BibTeX RDF
1	Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya	Sublinear-Time Parallel Algorithms for Matching and Related Problems	FOCS	1988	DBLP DOI BibTeX RDF	sublinear-time parallel algorithms, maximal node-disjoint paths, zero-one networks, matching, depth-first search, node-disjoint paths, combinatorial structure
1	Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos	Combinatorial Algorithms for the Generalized Circulation Problem	FOCS	1988	DBLP DOI BibTeX RDF	generalized circulation problem, linear programming, graph, nodes, combinatorial algorithms, maximum-flow problem
1	Andrew V. Goldberg, Serge A. Plotkin	Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs.	Inf. Process. Lett.	1987	DBLP DOI BibTeX RDF
1	Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks	Local Management of a Global Resource in a Communication Network	FOCS	1987	DBLP DOI BibTeX RDF
1	Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon	Parallel Symmetry-Breaking in Sparse Graphs	STOC	1987	DBLP DOI BibTeX RDF

Publications of "Serge A. Plotkin" ( http://dblp.L3S.de/Authors/Serge_A._Plotkin )