The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

C. Greg Plaxton: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
    Analysis of a Local Search Heuristic for Facility Location Problems. [Citation Graph (1, 0)][DBLP]
    SODA, 1998, pp:1-10 [Conf]
  2. Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
    A Comparison of Sorting Algorithms for the Connection Machine CM-2. [Citation Graph (1, 0)][DBLP]
    SPAA, 1991, pp:3-16 [Conf]
  3. Robert Cypher, C. Greg Plaxton
    Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:47, n:3, pp:501-548 [Journal]
  4. Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton
    Highly Fault-Tolerant Sorting Circuits [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:458-469 [Conf]
  5. Frank Thomson Leighton, C. Greg Plaxton
    A (fairly) Simple Circuit that (usually) Sorts [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:264-274 [Conf]
  6. Ramgopal R. Mettu, C. Greg Plaxton
    The Online Median Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:339-348 [Conf]
  7. C. Greg Plaxton
    On the Network Complexity of Selection [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:396-401 [Conf]
  8. C. Greg Plaxton
    Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection Machines. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:114-122 [Conf]
  9. C. Greg Plaxton, Bjorn Poonen, Torsten Suel
    Improved Lower Bounds for Shellsort [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:226-235 [Conf]
  10. C. Greg Plaxton, Rajmohan Rajaraman
    Fast Fault-Tolerant Concurrent Access to Shared Objects. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:570-579 [Conf]
  11. Nedialko B. Dimitrov, C. Greg Plaxton
    Optimal Cover Time for a Graph-Based Coupon Collector Process. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:702-716 [Conf]
  12. C. Greg Plaxton, Torsten Suel
    A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:618-629 [Conf]
  13. Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton
    Fast scheduling of periodic tasks on multiple resources. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:280-288 [Conf]
  14. Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton
    Sorting-Based Selection Algorithms for Hypercube Networks. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:89-95 [Conf]
  15. Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
    Brief announcement: concurrent maintenance of rings. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:376- [Conf]
  16. Xiaozhou (Steve) Li, C. Greg Plaxton
    On name resolution in peer-to-peer networks. [Citation Graph (0, 0)][DBLP]
    POMC, 2002, pp:82-89 [Conf]
  17. Ion Stoica, Hussein M. Abdel-Wahab, Kevin Jeffay, Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton
    A proportional share resource allocation algorithm for real-time, time-shared systems. [Citation Graph (0, 0)][DBLP]
    IEEE Real-Time Systems Symposium, 1996, pp:288-299 [Conf]
  18. Alok Aggarwal, C. Greg Plaxton
    Optimal Parallel Sorting in Multi-Level Storage. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:659-668 [Conf]
  19. Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
    Placement Algorithms for Hierarchical Cooperative Caching. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:586-595 [Conf]
  20. Nimar S. Arora, Robert D. Blumofe, C. Greg Plaxton
    Thread Scheduling for Multiprogrammed Multiprocessors. [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:119-129 [Conf]
  21. Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani
    Online hierarchical cooperative caching. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:74-83 [Conf]
  22. C. Greg Plaxton
    Load Balancing, Selection Sorting on the Hypercube. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:64-73 [Conf]
  23. C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa
    Accessing Nearby Copies of Replicated Objects in a Distributed Environment. [Citation Graph (0, 0)][DBLP]
    SPAA, 1997, pp:311-320 [Conf]
  24. C. Greg Plaxton, Torsten Suel
    A Lower Bound for Sorting Networks Based on the Shuffle Permutation. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:70-79 [Conf]
  25. C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick Vin
    Reconfigurable resource scheduling. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:93-102 [Conf]
  26. Sanjoy K. Baruah, N. K. Cohen, C. Greg Plaxton, Donald A. Varvel
    Proportionate progress: a notion of fairness in resource allocation. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:345-354 [Conf]
  27. Robert Cypher, C. Greg Plaxton
    Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:193-203 [Conf]
  28. Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman
    Tight analyses of two local load balancing algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:548-558 [Conf]
  29. Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi
    Lower bounds for sorting networks. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:437-446 [Conf]
  30. Michael Klugerman, C. Greg Plaxton
    Small-Depth Counting Networks [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:417-428 [Conf]
  31. Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman
    On contention resolution protocols and associated probabilistic phenomena. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:153-162 [Conf]
  32. C. Greg Plaxton
    Approximation algorithms for hierarchical location problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:40-49 [Conf]
  33. C. Greg Plaxton
    A Hypercubic Sorting Network with Nearly Logarithmic Depth [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:405-416 [Conf]
  34. Ramgopal R. Mettu, C. Greg Plaxton
    Optimal Time Bounds for Approximate Clustering. [Citation Graph (0, 0)][DBLP]
    UAI, 2002, pp:344-351 [Conf]
  35. Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman
    Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings. [Citation Graph (0, 0)][DBLP]
    WDAG, 1997, pp:81-95 [Conf]
  36. Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
    Active and Concurrent Topology Maintenance. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:320-334 [Conf]
  37. Ernst W. Mayr, C. Greg Plaxton
    On the Spanning Trees of Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1988, pp:394-405 [Conf]
  38. Sanjoy K. Baruah, N. K. Cohen, C. Greg Plaxton, Donald A. Varvel
    Proportionate Progress: A Notion of Fairness in Resource Allocation. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:15, n:6, pp:600-625 [Journal]
  39. Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton
    Sorting-Based Selection Algorithms for Hypercubic Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:2, pp:237-254 [Journal]
  40. Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
    A Comparison of Sorting Algorithms for the Connection Machine CM-2. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1996, v:39, n:12es, pp:273-297 [Journal]
  41. Ernst W. Mayr, C. Greg Plaxton
    On the spanning trees of weighted graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:4, pp:433-447 [Journal]
  42. Hagit Attiya, Fabian Kuhn, C. Greg Plaxton, Mirjam Wattenhofer, Roger Wattenhofer
    Efficient adaptive collect using randomization. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:3, pp:179-188 [Journal]
  43. Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
    Concurrent Maintenance of Rings. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:19, n:2, pp:126-148 [Journal]
  44. Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton, Ion Stoica, Hussein M. Abdel-Wahab, Kevin Jeffay
    Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:1, pp:43-51 [Journal]
  45. Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman
    On Contention Resolution Protocols and Associated Probabilistic Phenomena. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:2, pp:324-378 [Journal]
  46. Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
    Analysis of a Local Search Heuristic for Facility Location Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:1, pp:146-188 [Journal]
  47. Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
    Placement Algorithms for Hierarchical Cooperative Caching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:260-302 [Journal]
  48. C. Greg Plaxton, Torsten Suel
    Lower Bounds for Shellsort. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:2, pp:221-240 [Journal]
  49. Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton
    Breaking the Theta (n log² n) Barrier for Sorting with Faults. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:265-304 [Journal]
  50. C. Greg Plaxton
    Approximation algorithms for hierarchical location problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:3, pp:425-443 [Journal]
  51. Ernst W. Mayr, C. Greg Plaxton
    Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1993, v:17, n:4, pp:374-380 [Journal]
  52. Ramgopal R. Mettu, C. Greg Plaxton
    Optimal Time Bounds for Approximate Clustering. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2004, v:56, n:1-3, pp:35-60 [Journal]
  53. Nimar S. Arora, Robert D. Blumofe, C. Greg Plaxton
    Thread Scheduling for Multiprogrammed Multiprocessors. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:2, pp:115-144 [Journal]
  54. Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
    Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:2, pp:135-167 [Journal]
  55. C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa
    Accessing Nearby Copies of Replicated Objects in a Distributed Environment. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:3, pp:241-280 [Journal]
  56. C. Greg Plaxton, Torsten Suel
    A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:3, pp:233-254 [Journal]
  57. C. Greg Plaxton, Torsten Suel
    A Lower Bound for Sorting Networks Based on the Shuffle Permutation. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:5, pp:491-508 [Journal]
  58. Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman
    Tight Analyses of Two Local Load Balancing Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:29-64 [Journal]
  59. Frank Thomson Leighton, C. Greg Plaxton
    Hypercubic Sorting Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:1-47 [Journal]
  60. Ramgopal R. Mettu, C. Greg Plaxton
    The Online Median Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:3, pp:816-832 [Journal]
  61. Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman
    Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:220, n:1, pp:247-265 [Journal]
  62. Dina Kravets, C. Greg Plaxton
    All Nearest Smaller Values on the Hypercube. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:5, pp:456-462 [Journal]
  63. C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick Vin
    Reconfigurable Resource Scheduling with Variable Delay Bounds. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-10 [Conf]
  64. C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula
    Online Aggregation over Trees. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-10 [Conf]
  65. Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani
    Online Hierarchical Cooperative Caching. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:6, pp:851-874 [Journal]

  66. Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines. [Citation Graph (, )][DBLP]


  67. Competitive Weighted Matching in Transversal Matroids. [Citation Graph (, )][DBLP]


  68. Online Compression Caching. [Citation Graph (, )][DBLP]


  69. Buyer-Supplier Games: Optimization over the Core. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002