default search action
Serge A. Plotkin
Person information
- affiliation: Stanford University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [j31]Adam Meyerson, Kamesh Munagala, Serge A. Plotkin:
Cost-Distance: Two Metric Network Design. SIAM J. Comput. 38(4): 1648-1659 (2008) - 2005
- [j30]Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin:
An online throughput-competitive algorithm for multicast routing and admission control. J. Algorithms 55(1): 1-20 (2005) - [j29]Zoë Abrams, Robert McGrew, Serge A. Plotkin:
A non-manipulable trust system based on EigenTrust. SIGecom Exch. 5(4): 21-30 (2005) - [j28]Ashish Goel, Adam Meyerson, Serge A. Plotkin:
Approximate majorization and fair online load balancing. ACM Trans. Algorithms 1(2): 338-349 (2005) - 2004
- [j27]Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin:
A k-Median Algorithm with Running Time Independent of Data Size. Mach. Learn. 56(1-3): 61-87 (2004) - [c35]Zoë Abrams, Ashish Goel, Serge A. Plotkin:
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. IPSN 2004: 424-432 - 2003
- [j26]Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos:
Scheduling data transfers in a network and the set scheduling problem. J. Algorithms 48(2): 314-332 (2003) - [i1]Zoë Abrams, Ashish Goel, Serge A. Plotkin:
Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks. CoRR cs.DS/0311030 (2003) - 2001
- [j25]Baruch Awerbuch, Yossi Azar
, Serge A. Plotkin, Orli Waarts:
Competitive Routing of Virtual Circuits with Unknown Duration. J. Comput. Syst. Sci. 62(3): 385-397 (2001) - [j24]Ashish Goel, Adam Meyerson, Serge A. Plotkin:
Combining Fairness with Throughput: Online Routing with Multiple Objectives. J. Comput. Syst. Sci. 63(1): 62-79 (2001) - [c34]Adam Meyerson, Kamesh Munagala
Designing Networks Incrementally. FOCS 2001: 406-415 - [c33]Adam Meyerson, Kamesh Munagala, Serge A. Plotkin:
Web caching using access statistics. SODA 2001: 354-363 - [c32]Ashish Goel, Adam Meyerson, Serge A. Plotkin:
Approximate majorization and fair online load balancing. SODA 2001: 384-390 - [c31]Ashish Goel, Adam Meyerson, Serge A. Plotkin:
Distributed admission control, scheduling, and routing with stale information. SODA 2001: 611-619 - 2000
- [j23]Tomás Feder, Nimrod Megiddo, Serge A. Plotkin:
A sublinear parallel algorithm for stable matching. Theor. Comput. Sci. 233(1-2): 297-308 (2000) - [c30]Adam Meyerson, Kamesh Munagala
Cost-Distance: Two Metric Network Design. FOCS 2000: 624-630 - [c29]Ashish Goel, Adam Meyerson, Serge A. Plotkin:
Combining fairness with throughput: online routing with multiple objectives. STOC 2000: 670-679
1990 – 1999
- 1999
- [j22]Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts:
Time-Lapse Snapshots. SIAM J. Comput. 28(5): 1848-1874 (1999) - [c28]Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos:
Scheduling Data Transfers in a Network and the Set Scheduling Problem. STOC 1999: 189-197 - 1998
- [j21]Anil Kamath, Omri Palmon, Serge A. Plotkin:
Routing and Admission Control in General Topology Networks with Poisson Arrivals. J. Algorithms 27(2): 236-258 (1998) - [c27]Moses Charikar
Approximating a Finite Metric by a Small Number of Tree Metrics. FOCS 1998: 379-388 - [c26]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: 338-352 - [c25]Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin:
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control. SODA 1998: 97-106 - 1997
- [j20]Yuan Ma, Serge A. Plotkin:
An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration. Inf. Process. Lett. 62(6): 301-303 (1997) - [j19]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 44(3): 486-504 (1997) - [j18]Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts:
On-Line Load Balancing of Temporary Tasks. J. Algorithms 22(1): 93-110 (1997) - [j17]Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos:
Approximation Algorithms for Steiner and Directed Multicuts. J. Algorithms 22(2): 241-269 (1997) - 1996
- [j16]Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks:
Local Management of a Global Resource in a Communication Network. J. ACM 43(1): 1-19 (1996) - [c24]Anil Kamath, Omri Palmon, Serge A. Plotkin:
Routing and Admission Control in General Topology Networks with Poisson Arrivals. SODA 1996: 269-278 - 1995
- [j15]Serge A. Plotkin, Éva Tardos:
Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows. Comb. 15(3): 425-434 (1995) - [j14]Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas:
Fast Approximation Algorithms for Multicommodity Flow Problems. J. Comput. Syst. Sci. 50(2): 228-243 (1995) - [j13]Serge A. Plotkin:
Competitive Routing of Virtual Circuits in ATM Networks. IEEE J. Sel. Areas Commun. 13(6): 1128-1136 (1995) - [j12]Serge A. Plotkin, David B. Shmoys
Fast Approximation Algorithms for Fractional Packing and Covering Problems. Math. Oper. Res. 20(2): 257-301 (1995) - [c23]Anil Kamath, Omri Palmon, Serge A. Plotkin:
Fast Approximation Algorithm for Minimum Cost Multicommodity Flow. SODA 1995: 493-501 - [c22]David R. Karger, Serge A. Plotkin:
Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. STOC 1995: 18-25 - 1994
- [j11]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. 23(3): 466-487 (1994) - [j10]Andrew V. Goldberg, Bruce M. Maggs, Serge A. Plotkin:
A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches. IEEE Trans. Computers 43(3): 321-326 (1994) - [c21]Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys
Improved Approximation Algorithms for Network Design Problems. SODA 1994: 223-232 - [c20]Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts:
Competitive Routing of Virtual Circuits with Unknown Duration. SODA 1994: 321-327 - [c19]Serge A. Plotkin, Satish Rao, Warren D. Smith:
Shallow Excluded Minors and Improved Graph Decompositions. SODA 1994: 462-470 - [c18]Tomás Feder, Nimrod Megiddo, Serge A. Plotkin:
A Sublinear Parallel Algorithm for Stable Matching. SODA 1994: 632-637 - 1993
- [j9]Ted Fischer, Andrew V. Goldberg, David J. Haglin, Serge A. Plotkin:
Approximating Matchings in Parallel. Inf. Process. Lett. 46(3): 115-118 (1993) - [j8]Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya:
Sublinear-Time Parallel Algorithms for Matching and Related Problems. J. Algorithms 14(2): 180-213 (1993) - [j7]James B. Orlin
Polynomial dual network simplex algorithms. Math. Program. 60: 255-276 (1993) - [c17]Baruch Awerbuch, Yossi Azar, Serge A. Plotkin:
Throughput-Competitive On-Line Routing. FOCS 1993: 32-40 - [c16]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: 623-631 - [c15]Philip N. Klein, Serge A. Plotkin, Satish Rao:
Excluded minors, network decomposition, and multicommodity flow. STOC 1993: 682-690 - [c14]Serge A. Plotkin, Éva Tardos:
Improved bounds on the max-flow min-cut ratio for multicommodity flows. STOC 1993: 691-697 - [c13]Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts:
Online Load Balancing of Temporary Tasks. WADS 1993: 119-130 - 1992
- [j6]Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos:
Using Separation Algorithms in Fixed Dimension. J. Algorithms 13(1): 79-98 (1992) - [j5]Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems. SIAM J. Comput. 21(1): 140-150 (1992) - [c12]Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts:
Time-Lapse Snapshots. ISTCS 1992: 154-170 - 1991
- [j4]Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos:
Combinatorial Algorithms for the Generalized Circulation Problem. Math. Oper. Res. 16(2): 351-381 (1991) - [c11]Serge A. Plotkin, David B. Shmoys
Fast Approximation Algorithms for Fractional Packing and Covering Problems. FOCS 1991: 495-504 - [c10]Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas:
Fast Approximation Algorithms for Multicommodity Flow Problems. STOC 1991: 101-111 - 1990
- [c9]Serge A. Plotkin, Éva Tardos:
Improved Dual Network Simplex. SODA 1990: 367-376 - [c8]Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos:
Using Separation Algorithms in Fixed Dimension. SODA 1990: 377-387
1980 – 1989
- 1989
- [c7]Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys
Interior-Point Methods in Parallel Computation. FOCS 1989: 350-355 - [c6]Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin:
Network Decomposition and Locality in Distributed Computation. FOCS 1989: 364-369 - [c5]Serge A. Plotkin:
Sticky Bits and Universality of Consensus. PODC 1989: 159-175 - 1988
- [j3]Bruce M. Maggs, Serge A. Plotkin:
Minimum-Cost Spanning Tree as a Path-Finding Problem. Inf. Process. Lett. 26(6): 291-293 (1988) - [j2]Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon:
Parallel Symmetry-Breaking in Sparse Graphs. SIAM J. Discret. Math. 1(4): 434-446 (1988) - [c4]Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya:
Sublinear-Time Parallel Algorithms for Matching and Related Problems. FOCS 1988: 174-185 - [c3]Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos:
Combinatorial Algorithms for the Generalized Circulation Problem. FOCS 1988: 432-443 - 1987
- [j1]Andrew V. Goldberg, Serge A. Plotkin:
Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs. Inf. Process. Lett. 25(4): 241-245 (1987) - [c2]Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks:
Local Management of a Global Resource in a Communication Network. FOCS 1987: 347-357 - [c1]Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon:
Parallel Symmetry-Breaking in Sparse Graphs. STOC 1987: 315-324
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: