C. Greg Plaxton

Publication Activity (10 Years)

Years Active: 1988-2013
Publications (10 Years): 0

Top Topics

Provide An Upper Bound

Hierarchical Clustering

Top Venues

J. Discrete Algorithms

Publications

Ramgopal R. Mettu, C. Greg Plaxton
Optimal Time Bounds for Approximate Clustering CoRR (2013)
Nedialko B. Dimitrov, C. Greg Plaxton
Optimal cover time for a graph-based coupon collector process. J. Discrete Algorithms 19 (2013)
Nedialko B. Dimitrov, C. Greg Plaxton
Competitive Weighted Matching in Transversal Matroids. Algorithmica 62 (1-2) (2012)
Nedialko B. Dimitrov, C. Greg Plaxton
Buyer-supplier games: Optimization over the core. Theor. Comput. Sci. 412 (7) (2011)
Chinmayi Krishnappa, C. Greg Plaxton
A dynamic unit-demand auction supporting bid revision. ICEC (2011)
Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
Maintaining the Ranch topology. J. Parallel Distributed Comput. 70 (11) (2010)
C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick M. Vin
Online Compression Caching. SWAT (2008)
Nedialko B. Dimitrov, C. Greg Plaxton
Competitive Weighted Matching in Transversal Matroids. ICALP (1) (2008)
C. Greg Plaxton
Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines. ICALP (1) (2008)
C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick M. Vin
Reconfigurable Resource Scheduling with Variable Delay Bounds. IPDPS (2007)
C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula
Online Aggregation over Trees. IPDPS (2007)
Nedialko B. Dimitrov, C. Greg Plaxton
Buyer-Supplier Games: Optimization over the Core. WAOA (2007)
Hagit Attiya, Fabian Kuhn, C. Greg Plaxton, Mirjam Wattenhofer, Roger Wattenhofer
Efficient adaptive collect using randomization. Distributed Comput. 18 (3) (2006)
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani
Online Hierarchical Cooperative Caching. Theory Comput. Syst. 39 (6) (2006)
Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
Concurrent Maintenance of Rings. Distributed Comput. 19 (2) (2006)
C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick M. Vin
Reconfigurable resource scheduling. SPAA (2006)
C. Greg Plaxton
Approximation algorithms for hierarchical location problems. J. Comput. Syst. Sci. 72 (3) (2006)
Nedialko B. Dimitrov, C. Greg Plaxton
Optimal Cover Time for a Graph-Based Coupon Collector Process. ICALP (2005)
Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
Active and Concurrent Topology Maintenance. DISC (2004)
Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
Brief announcement: concurrent maintenance of rings. PODC (2004)
Ramgopal R. Mettu, C. Greg Plaxton
Optimal Time Bounds for Approximate Clustering. Mach. Learn. 56 (1-3) (2004)
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani
Online hierarchical cooperative caching. SPAA (2004)
C. Greg Plaxton
Approximation algorithms for hierarchical location problems. STOC (2003)
Ramgopal R. Mettu, C. Greg Plaxton
The Online Median Problem. SIAM J. Comput. 32 (3) (2003)
Xiaozhou (Steve) Li, C. Greg Plaxton
On name resolution in peer-to-peer networks. POMC (2002)
Ramgopal R. Mettu, C. Greg Plaxton
Optimal Time Bounds for Approximate Clustering. UAI (2002)
Nimar S. Arora, Robert D. Blumofe, C. Greg Plaxton
Thread Scheduling for Multiprogrammed Multiprocessors. Theory Comput. Syst. 34 (2) (2001)
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
Placement Algorithms for Hierarchical Cooperative Caching. J. Algorithms 38 (1) (2001)
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
Analysis of a Local Search Heuristic for Facility Location Problems. J. Algorithms 37 (1) (2000)
Ramgopal R. Mettu, C. Greg Plaxton
The Online Median Problem. FOCS (2000)
Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton
Sorting-Based Selection Algorithms for Hypercubic Networks. Algorithmica 26 (2) (2000)
C. Greg Plaxton, Torsten Suel
A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks. Theory Comput. Syst. 33 (3) (2000)
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) (1999)
Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman
Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings. Theor. Comput. Sci. 220 (1) (1999)
C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa
Accessing Nearby Copies of Replicated Objects in a Distributed Environment. Theory Comput. Syst. 32 (3) (1999)
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
Placement Algorithms for Hierarchical Cooperative Caching. SODA (1999)
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
Analysis of a Local Search Heuristic for Facility Location Problems. SODA (1998)
Frank Thomson Leighton, C. Greg Plaxton
Hypercubic Sorting Networks. SIAM J. Comput. 27 (1) (1998)
Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
Sorting Algorithms. Theory Comput. Syst. 31 (2) (1998)
Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman
On Contention Resolution Protocols and Associated Probabilistic Phenomena. J. ACM 45 (2) (1998)
Nimar S. Arora, Robert D. Blumofe, C. Greg Plaxton
Thread Scheduling for Multiprogrammed Multiprocessors. SPAA (1998)
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) (1997)
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) (1997)
C. Greg Plaxton, Torsten Suel
Lower Bounds for Shellsort. J. Algorithms 23 (2) (1997)
Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman
Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings. WDAG (1997)
C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa
Accessing Nearby Copies of Replicated Objects in a Distributed Environment. SPAA (1997)
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)
Dina Kravets, C. Greg Plaxton
All Nearest Smaller Values on the Hypercube. IEEE Trans. Parallel Distributed Syst. 7 (5) (1996)
C. Greg Plaxton, Rajmohan Rajaraman
Fast Fault-Tolerant Concurrent Access to Shared Objects. FOCS (1996)
Sanjoy K. Baruah, N. K. Cohen, C. Greg Plaxton, Donald A. Varvel
Proportionate Progress: A Notion of Fairness in Resource Allocation. Algorithmica 15 (6) (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) (1996)
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)
C. Greg Plaxton
Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection Machines. FOCS (1995)
Nabil Kahalé, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi
Lower bounds for sorting networks. STOC (1995)
Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton
Fast scheduling of periodic tasks on multiple resources. IPPS (1995)
Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman
On contention resolution protocols and associated probabilistic phenomena. STOC (1994)
C. Greg Plaxton, Torsten Suel
A Lower Bound for Sorting Networks Based on the Shuffle Permutation. Math. Syst. Theory 27 (5) (1994)
C. Greg Plaxton, Torsten Suel
A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks. ICALP (1994)
Dina Kravets, C. Greg Plaxton
An optimal hypercube algorithm for the all nearest smaller values problem. SPDP (1994)
Alok Aggarwal, C. Greg Plaxton
Optimal Parallel Sorting in Multi-Level Storage. SODA (1994)
Robert Cypher, C. Greg Plaxton
Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. J. Comput. Syst. Sci. 47 (3) (1993)
Ernst W. Mayr, C. Greg Plaxton
Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube. J. Parallel Distributed Comput. 17 (4) (1993)
Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton
Sorting-Based Selection Algorithms for Hypercube Networks. IPPS (1993)
Sanjoy K. Baruah, N. K. Cohen, C. Greg Plaxton, Donald A. Varvel
Proportionate progress: a notion of fairness in resource allocation. STOC (1993)
Michael Klugerman, C. Greg Plaxton
Small-Depth Counting Networks STOC (1992)
C. Greg Plaxton, Bjorn Poonen, Torsten Suel
Improved Lower Bounds for Shellsort FOCS (1992)
C. Greg Plaxton, Torsten Suel
A Lower Bound for Sorting Networks Based on the Shuffle Permutation. SPAA (1992)
C. Greg Plaxton
A Hypercubic Sorting Network with Nearly Logarithmic Depth STOC (1992)
Ernst W. Mayr, C. Greg Plaxton
On the spanning trees of weighted graphs. Comb. 12 (4) (1992)
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)
Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton
Highly Fault-Tolerant Sorting Circuits FOCS (1991)
Robert Cypher, C. Greg Plaxton
Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers STOC (1990)
Frank Thomson Leighton, C. Greg Plaxton
A (fairly) Simple Circuit that (usually) Sorts FOCS (1990)
C. Greg Plaxton
Load Balancing, Selection Sorting on the Hypercube. SPAA (1989)
C. Greg Plaxton
On the Network Complexity of Selection FOCS (1989)
Ernst W. Mayr, C. Greg Plaxton
On the Spanning Trees of Weighted Graphs. WG (1988)