C. Greg Plaxton

Nedialko B. Dimitrov, C. Greg Plaxton: Optimal cover time for a graph-based coupon collector process. J. Discrete Algorithms 19: 39-51 (2013)

Ramgopal R. Mettu, C. Greg Plaxton: Optimal Time Bounds for Approximate Clustering. CoRR abs/1301.0587 (2013)

Nedialko B. Dimitrov, C. Greg Plaxton: Competitive Weighted Matching in Transversal Matroids. Algorithmica 62(1-2): 333-348 (2012)

Nedialko B. Dimitrov, C. Greg Plaxton: Buyer-supplier games: Optimization over the core. Theor. Comput. Sci. 412(7): 614-625 (2011)

Xiaozhou Li, Jayadev Misra, C. Greg Plaxton: Maintaining the Ranch topology. J. Parallel Distrib. Comput. 70(11): 1142-1158 (2010)

C. Greg Plaxton: Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines. ICALP (1) 2008: 222-233

Nedialko B. Dimitrov, C. Greg Plaxton: Competitive Weighted Matching in Transversal Matroids. ICALP (1) 2008: 397-408

C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick M. Vin: Online Compression Caching. SWAT 2008: 414-425

C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick M. Vin: Reconfigurable Resource Scheduling with Variable Delay Bounds. IPDPS 2007: 1-10

C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula: Online Aggregation over Trees. IPDPS 2007: 1-10

Nedialko B. Dimitrov, C. Greg Plaxton: Buyer-Supplier Games: Optimization over the Core. WAOA 2007: 27-40

Hagit Attiya, Fabian Kuhn, C. Greg Plaxton, Mirjam Wattenhofer, Roger Wattenhofer: Efficient adaptive collect using randomization. Distributed Computing 18(3): 179-188 (2006)

Xiaozhou Li, Jayadev Misra, C. Greg Plaxton: Concurrent Maintenance of Rings. Distributed Computing 19(2): 126-148 (2006)

C. Greg Plaxton: Approximation algorithms for hierarchical location problems. J. Comput. Syst. Sci. 72(3): 425-443 (2006)

Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani: Online Hierarchical Cooperative Caching. Theory Comput. Syst. 39(6): 851-874 (2006)

C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick M. Vin: Reconfigurable resource scheduling. SPAA 2006: 93-102

Nedialko B. Dimitrov, C. Greg Plaxton: Optimal Cover Time for a Graph-Based Coupon Collector Process. ICALP 2005: 702-716

Ramgopal R. Mettu, C. Greg Plaxton: Optimal Time Bounds for Approximate Clustering. Machine Learning 56(1-3): 35-60 (2004)

Xiaozhou Li, Jayadev Misra, C. Greg Plaxton: Brief announcement: concurrent maintenance of rings. PODC 2004: 376

Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani: Online hierarchical cooperative caching. SPAA 2004: 74-83

Xiaozhou Li, Jayadev Misra, C. Greg Plaxton: Active and Concurrent Topology Maintenance. DISC 2004: 320-334

Ramgopal R. Mettu, C. Greg Plaxton: The Online Median Problem. SIAM J. Comput. 32(3): 816-832 (2003)

C. Greg Plaxton: Approximation algorithms for hierarchical location problems. STOC 2003: 40-49

Xiaozhou (Steve) Li, C. Greg Plaxton: On name resolution in peer-to-peer networks. POMC 2002: 82-89

Ramgopal R. Mettu, C. Greg Plaxton: Optimal Time Bounds for Approximate Clustering. UAI 2002: 344-351

Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman: Placement Algorithms for Hierarchical Cooperative Caching. J. Algorithms 38(1): 260-302 (2001)

Nimar S. Arora, Robert D. Blumofe, C. Greg Plaxton: Thread Scheduling for Multiprogrammed Multiprocessors. Theory Comput. Syst. 34(2): 115-144 (2001)

Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton: Sorting-Based Selection Algorithms for Hypercubic Networks. Algorithmica 26(2): 237-254 (2000)

Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman: Analysis of a Local Search Heuristic for Facility Location Problems. J. Algorithms 37(1): 146-188 (2000)

C. Greg Plaxton, Torsten Suel: A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks. Theory Comput. Syst. 33(3): 233-254 (2000)

Ramgopal R. Mettu, C. Greg Plaxton: The Online Median Problem. FOCS 2000: 339-348

C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa: Accessing Nearby Copies of Replicated Objects in a Distributed Environment. Theory Comput. Syst. 32(3): 241-280 (1999)

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. SIAM J. Comput. 29(1): 29-64 (1999)

Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman: Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings. Theor. Comput. Sci. 220(1): 247-265 (1999)

Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman: Placement Algorithms for Hierarchical Cooperative Caching. SODA 1999: 586-595

Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman: On Contention Resolution Protocols and Associated Probabilistic Phenomena. J. ACM 45(2): 324-378 (1998)

Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha: Sorting Algorithms. Theory Comput. Syst. 31(2): 135-167 (1998)

Frank Thomson Leighton, C. Greg Plaxton: Hypercubic Sorting Networks. SIAM J. Comput. 27(1): 1-47 (1998)

Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman: Analysis of a Local Search Heuristic for Facility Location Problems. SODA 1998: 1-10

Nimar S. Arora, Robert D. Blumofe, C. Greg Plaxton: Thread Scheduling for Multiprogrammed Multiprocessors. SPAA 1998: 119-129

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. Inf. Process. Lett. 64(1): 43-51 (1997)

C. Greg Plaxton, Torsten Suel: Lower Bounds for Shellsort. J. Algorithms 23(2): 221-240 (1997)

Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton: Breaking the Theta (n log² n) Barrier for Sorting with Faults. J. Comput. Syst. Sci. 54(2): 265-304 (1997)

C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa: Accessing Nearby Copies of Replicated Objects in a Distributed Environment. SPAA 1997: 311-320

Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman: Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings. WDAG 1997: 81-95

Sanjoy K. Baruah, N. K. Cohen, C. Greg Plaxton, Donald A. Varvel: Proportionate Progress: A Notion of Fairness in Resource Allocation. Algorithmica 15(6): 600-625 (1996)

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. Commun. ACM 39(12es): 273-297 (1996)

Dina Kravets, C. Greg Plaxton: All Nearest Smaller Values on the Hypercube. IEEE Trans. Parallel Distrib. Syst. 7(5): 456-462 (1996)

C. Greg Plaxton, Rajmohan Rajaraman: Fast Fault-Tolerant Concurrent Access to Shared Objects. FOCS 1996: 570-579

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. RTSS 1996: 288-299

C. Greg Plaxton: Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection Machines. FOCS 1995: 114-122

Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton: Fast scheduling of periodic tasks on multiple resources. IPPS 1995: 280-288

Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi: Lower bounds for sorting networks. STOC 1995: 437-446

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. STOC 1995: 548-558

C. Greg Plaxton, Torsten Suel: A Lower Bound for Sorting Networks Based on the Shuffle Permutation. Mathematical Systems Theory 27(5): 491-508 (1994)

C. Greg Plaxton, Torsten Suel: A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks. ICALP 1994: 618-629

Alok Aggarwal, C. Greg Plaxton: Optimal Parallel Sorting in Multi-Level Storage. SODA 1994: 659-668

Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman: On contention resolution protocols and associated probabilistic phenomena. STOC 1994: 153-162

Robert Cypher, C. Greg Plaxton: Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. J. Comput. Syst. Sci. 47(3): 501-548 (1993)

Ernst W. Mayr, C. Greg Plaxton: Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube. J. Parallel Distrib. Comput. 17(4): 374-380 (1993)

Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton: Sorting-Based Selection Algorithms for Hypercube Networks. IPPS 1993: 89-95

Sanjoy K. Baruah, N. K. Cohen, C. Greg Plaxton, Donald A. Varvel: Proportionate progress: a notion of fairness in resource allocation. STOC 1993: 345-354

Ernst W. Mayr, C. Greg Plaxton: On the spanning trees of weighted graphs. Combinatorica 12(4): 433-447 (1992)

C. Greg Plaxton, Bjorn Poonen, Torsten Suel: Improved Lower Bounds for Shellsort. FOCS 1992: 226-235

C. Greg Plaxton, Torsten Suel: A Lower Bound for Sorting Networks Based on the Shuffle Permutation. SPAA 1992: 70-79

C. Greg Plaxton: A Hypercubic Sorting Network with Nearly Logarithmic Depth. STOC 1992: 405-416

Michael Klugerman, C. Greg Plaxton: Small-Depth Counting Networks. STOC 1992: 417-428

Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton: Highly Fault-Tolerant Sorting Circuits. FOCS 1991: 458-469

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. SPAA 1991: 3-16

Frank Thomson Leighton, C. Greg Plaxton: A (fairly) Simple Circuit that (usually) Sorts. FOCS 1990: 264-274

Robert Cypher, C. Greg Plaxton: Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. STOC 1990: 193-203

C. Greg Plaxton: On the Network Complexity of Selection. FOCS 1989: 396-401

C. Greg Plaxton: Load Balancing, Selection Sorting on the Hypercube. SPAA 1989: 64-73

Ernst W. Mayr, C. Greg Plaxton: On the Spanning Trees of Weighted Graphs. WG 1988: 394-405