The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Serge A. Plotkin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Baruch Awerbuch, Yossi Azar, Serge A. Plotkin
    Throughput-Competitive On-Line Routing [Citation Graph (1, 0)][DBLP]
    FOCS, 1993, pp:32-40 [Conf]
  2. Serge A. Plotkin
    Sticky Bits and Universality of Consensus. [Citation Graph (1, 0)][DBLP]
    PODC, 1989, pp:159-175 [Conf]
  3. James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
    On-line load balancing with applications to machine scheduling and virtual circuit routing. [Citation Graph (1, 0)][DBLP]
    STOC, 1993, pp:623-631 [Conf]
  4. Serge A. Plotkin
    Competitive Routing of Virtual Circuits in ATM Networks. [Citation Graph (1, 0)][DBLP]
    IEEE Journal on Selected Areas in Communications, 1995, v:13, n:6, pp:1128-1136 [Journal]
  5. Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks
    Local Management of a Global Resource in a Communication Network [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:347-357 [Conf]
  6. Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin
    Network Decomposition and Locality in Distributed Computation [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:364-369 [Conf]
  7. Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin
    Approximating a Finite Metric by a Small Number of Tree Metrics. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:379-388 [Conf]
  8. Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos
    Interior-Point Methods in Parallel Computation [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:350-355 [Conf]
  9. Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos
    Combinatorial Algorithms for the Generalized Circulation Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:432-443 [Conf]
  10. Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
    Sublinear-Time Parallel Algorithms for Matching and Related Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:174-185 [Conf]
  11. Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
    Cost-Distance: Two Metric Network Design. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:624-630 [Conf]
  12. Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
    Designing Networks Incrementally. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:406-415 [Conf]
  13. Serge A. Plotkin, David B. Shmoys, Éva Tardos
    Fast Approximation Algorithms for Fractional Packing and Covering Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:495-504 [Conf]
  14. Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein
    An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:338-352 [Conf]
  15. Zoë Abrams, Ashish Goel, Serge A. Plotkin
    Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    IPSN, 2004, pp:424-432 [Conf]
  16. Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts
    Time-Lapse Snapshots. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1992, pp:154-170 [Conf]
  17. Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts
    Competitive Routing of Virtual Circuits with Unknown Duration. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:321-327 [Conf]
  18. Tomás Feder, Nimrod Megiddo, Serge A. Plotkin
    A Sublinear Parallel Algorithm for Stable Matching. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:632-637 [Conf]
  19. Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin
    Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:97-106 [Conf]
  20. Ashish Goel, Adam Meyerson, Serge A. Plotkin
    Approximate majorization and fair online load balancing. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:384-390 [Conf]
  21. Ashish Goel, Adam Meyerson, Serge A. Plotkin
    Distributed admission control, scheduling, and routing with stale information. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:611-619 [Conf]
  22. Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson
    Improved Approximation Algorithms for Network Design Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:223-232 [Conf]
  23. Anil Kamath, Omri Palmon, Serge A. Plotkin
    Fast Approximation Algorithm for Minimum Cost Multicommodity Flow. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:493-501 [Conf]
  24. Anil Kamath, Omri Palmon, Serge A. Plotkin
    Routing and Admission Control in General Topology Networks with Poisson Arrivals. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:269-278 [Conf]
  25. Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos
    Using Separation Algorithms in Fixed Dimension. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:377-387 [Conf]
  26. Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
    Web caching using access statistics. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:354-363 [Conf]
  27. Serge A. Plotkin, Satish Rao, Warren D. Smith
    Shallow Excluded Minors and Improved Graph Decompositions. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:462-470 [Conf]
  28. Serge A. Plotkin, Éva Tardos
    Improved Dual Network Simplex. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:367-376 [Conf]
  29. Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos
    Scheduling Data Transfers in a Network and the Set Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:189-197 [Conf]
  30. Ashish Goel, Adam Meyerson, Serge A. Plotkin
    Combining fairness with throughput: online routing with multiple objectives. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:670-679 [Conf]
  31. Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon
    Parallel Symmetry-Breaking in Sparse Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:315-324 [Conf]
  32. David R. Karger, Serge A. Plotkin
    Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:18-25 [Conf]
  33. Philip N. Klein, Serge A. Plotkin, Satish Rao
    Excluded minors, network decomposition, and multicommodity flow. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:682-690 [Conf]
  34. Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas
    Fast Approximation Algorithms for Multicommodity Flow Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:101-111 [Conf]
  35. Serge A. Plotkin, Éva Tardos
    Improved bounds on the max-flow min-cut ratio for multicommodity flows. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:691-697 [Conf]
  36. Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
    Online Load Balancing of Temporary Tasks. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:119-130 [Conf]
  37. Serge A. Plotkin, Éva Tardos
    Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:3, pp:425-434 [Journal]
  38. Zoë Abrams, Ashish Goel, Serge A. Plotkin
    Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  39. Ted Fischer, Andrew V. Goldberg, David J. Haglin, Serge A. Plotkin
    Approximating Matchings in Parallel. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:3, pp:115-118 [Journal]
  40. Andrew V. Goldberg, Serge A. Plotkin
    Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:4, pp:241-245 [Journal]
  41. Yuan Ma, Serge A. Plotkin
    An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:6, pp:301-303 [Journal]
  42. Bruce M. Maggs, Serge A. Plotkin
    Minimum-Cost Spanning Tree as a Path-Finding Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:26, n:6, pp:291-293 [Journal]
  43. Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks
    Local Management of a Global Resource in a Communication Network. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:1, pp:1-19 [Journal]
  44. 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. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:3, pp:486-504 [Journal]
  45. Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
    On-Line Load Balancing of Temporary Tasks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:1, pp:93-110 [Journal]
  46. Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin
    An online throughput-competitive algorithm for multicast routing and admission control. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:55, n:1, pp:1-20 [Journal]
  47. Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos
    Scheduling data transfers in a network and the set scheduling problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:2, pp:314-332 [Journal]
  48. Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
    Sublinear-Time Parallel Algorithms for Matching and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:2, pp:180-213 [Journal]
  49. Anil Kamath, Omri Palmon, Serge A. Plotkin
    Routing and Admission Control in General Topology Networks with Poisson Arrivals. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:27, n:2, pp:236-258 [Journal]
  50. Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos
    Approximation Algorithms for Steiner and Directed Multicuts. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:2, pp:241-269 [Journal]
  51. Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos
    Using Separation Algorithms in Fixed Dimension. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:1, pp:79-98 [Journal]
  52. Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts
    Competitive Routing of Virtual Circuits with Unknown Duration. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:3, pp:385-397 [Journal]
  53. Ashish Goel, Adam Meyerson, Serge A. Plotkin
    Combining Fairness with Throughput: Online Routing with Multiple Objectives. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:1, pp:62-79 [Journal]
  54. Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Stein, Spyros Tragoudas
    Fast Approximation Algorithms for Multicommodity Flow Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:2, pp:228-243 [Journal]
  55. Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin
    A k-Median Algorithm with Running Time Independent of Data Size. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2004, v:56, n:1-3, pp:61-87 [Journal]
  56. James B. Orlin, Serge A. Plotkin, Éva Tardos
    Polynomial dual network simplex algorithms. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:255-276 [Journal]
  57. Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts
    Time-Lapse Snapshots. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1848-1874 [Journal]
  58. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:1, pp:140-150 [Journal]
  59. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:3, pp:466-487 [Journal]
  60. Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon
    Parallel Symmetry-Breaking in Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:4, pp:434-446 [Journal]
  61. Ashish Goel, Adam Meyerson, Serge A. Plotkin
    Approximate majorization and fair online load balancing. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:2, pp:338-349 [Journal]
  62. Andrew V. Goldberg, Bruce M. Maggs, Serge A. Plotkin
    A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:3, pp:321-326 [Journal]
  63. Tomás Feder, Nimrod Megiddo, Serge A. Plotkin
    A sublinear parallel algorithm for stable matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:233, n:1-2, pp:297-308 [Journal]

Search in 0.006secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002