C. Greg Plaxton

76 papers A* 21A 5B 9C 1Journal 32Unranked 8
YearRankTypeTitle / Venue / Authors
2013 J jnl
Optimal Time Bounds for Approximate Clustering
CoRR
Ramgopal R. Mettu, C. Greg Plaxton
2013 J jnl
Optimal cover time for a graph-based coupon collector process.
J. Discrete Algorithms
Nedialko B. Dimitrov, C. Greg Plaxton
2012 J jnl
Competitive Weighted Matching in Transversal Matroids.
Algorithmica
Nedialko B. Dimitrov, C. Greg Plaxton
2011 C conf
A dynamic unit-demand auction supporting bid revision.
ICEC
Chinmayi Krishnappa, C. Greg Plaxton
2011 J jnl
Buyer-supplier games: Optimization over the core.
Theor. Comput. Sci.
Nedialko B. Dimitrov, C. Greg Plaxton
2010 J jnl
Maintaining the Ranch topology.
J. Parallel Distributed Comput.
Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
2008 — conf
Competitive Weighted Matching in Transversal Matroids.
ICALP (1)
Nedialko B. Dimitrov, C. Greg Plaxton
2008 — conf
Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines.
ICALP (1)
C. Greg Plaxton
2008 — conf
Online Compression Caching.
SWAT
C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick M. Vin
2007 B conf
Buyer-Supplier Games: Optimization over the Core.
WAOA
Nedialko B. Dimitrov, C. Greg Plaxton
2007 A conf
Online Aggregation over Trees.
IPDPS
C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula
2007 A conf
Reconfigurable Resource Scheduling with Variable Delay Bounds.
IPDPS
C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick M. Vin
2006 J jnl
Approximation algorithms for hierarchical location problems.
J. Comput. Syst. Sci.
C. Greg Plaxton
2006 J jnl
Concurrent Maintenance of Rings.
Distributed Comput.
Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
2006 J jnl
Efficient adaptive collect using randomization.
Distributed Comput.
Hagit Attiya, Fabian Kuhn, C. Greg Plaxton, Mirjam Wattenhofer, Roger Wattenhofer
2006 J jnl
Online Hierarchical Cooperative Caching.
Theory Comput. Syst.
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani
2006 B conf
Reconfigurable resource scheduling.
SPAA
C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick M. Vin
2005 A* conf
Optimal Cover Time for a Graph-Based Coupon Collector Process.
ICALP
Nedialko B. Dimitrov, C. Greg Plaxton
2004 A conf
Active and Concurrent Topology Maintenance.
DISC
Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
2004 A* conf
Brief announcement: concurrent maintenance of rings.
PODC
Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
2004 B conf
Online hierarchical cooperative caching.
SPAA
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani
2004 J jnl
Optimal Time Bounds for Approximate Clustering.
Mach. Learn.
Ramgopal R. Mettu, C. Greg Plaxton
2003 A* conf
Approximation algorithms for hierarchical location problems.
STOC
C. Greg Plaxton
2003 J jnl
The Online Median Problem.
SIAM J. Comput.
Ramgopal R. Mettu, C. Greg Plaxton
2002 — conf
On name resolution in peer-to-peer networks.
POMC
Xiaozhou (Steve) Li, C. Greg Plaxton
2002 A conf
Optimal Time Bounds for Approximate Clustering.
UAI
Ramgopal R. Mettu, C. Greg Plaxton
2001 J jnl
Placement Algorithms for Hierarchical Cooperative Caching.
J. Algorithms
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
2001 J jnl
Thread Scheduling for Multiprogrammed Multiprocessors.
Theory Comput. Syst.
Nimar S. Arora, Robert D. Blumofe, C. Greg Plaxton
2000 J jnl
A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks.
Theory Comput. Syst.
C. Greg Plaxton, Torsten Suel
2000 J jnl
Analysis of a Local Search Heuristic for Facility Location Problems.
J. Algorithms
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
2000 J jnl
Sorting-Based Selection Algorithms for Hypercubic Networks.
Algorithmica
Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton
2000 A* conf
The Online Median Problem.
FOCS
Ramgopal R. Mettu, C. Greg Plaxton
1999 J jnl
Accessing Nearby Copies of Replicated Objects in a Distributed Environment.
Theory Comput. Syst.
C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa
1999 A* conf
Placement Algorithms for Hierarchical Cooperative Caching.
SODA
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
1999 J jnl
Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings.
Theor. Comput. Sci.
Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman
1999 J jnl
Tight Analyses of Two Local Load Balancing Algorithms.
SIAM J. Comput.
Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman
1998 A* conf
Analysis of a Local Search Heuristic for Facility Location Problems.
SODA
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
1998 J jnl
Hypercubic Sorting Networks.
SIAM J. Comput.
Frank Thomson Leighton, C. Greg Plaxton
1998 J jnl
On Contention Resolution Protocols and Associated Probabilistic Phenomena.
J. ACM
Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman
1998 J jnl
Sorting Algorithms.
Theory Comput. Syst.
Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
1998 B conf
Thread Scheduling for Multiprogrammed Multiprocessors.
SPAA
Nimar S. Arora, Robert D. Blumofe, C. Greg Plaxton
1997 B conf
Accessing Nearby Copies of Replicated Objects in a Distributed Environment.
SPAA
C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa
1997 J jnl
Breaking the Theta (n log² n) Barrier for Sorting with Faults.
J. Comput. Syst. Sci.
Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton
1997 J jnl
Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource.
Inf. Process. Lett.
Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton, Ion Stoica, Hussein M. Abdel-Wahab, Kevin Jeffay
1997 J jnl
Lower Bounds for Shellsort.
J. Algorithms
C. Greg Plaxton, Torsten Suel
1997 — conf
Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings.
WDAG
Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman
1996 J jnl
A Comparison of Sorting Algorithms for the Connection Machine CM-2.
Commun. ACM
Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
1996 A conf
A proportional share resource allocation algorithm for real-time, time-shared systems.
RTSS
Ion Stoica, Hussein M. Abdel-Wahab, Kevin Jeffay, Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton
1996 J jnl
All Nearest Smaller Values on the Hypercube.
IEEE Trans. Parallel Distributed Syst.
Dina Kravets, C. Greg Plaxton
1996 A* conf
Fast Fault-Tolerant Concurrent Access to Shared Objects.
FOCS
C. Greg Plaxton, Rajmohan Rajaraman
1996 J jnl
Proportionate Progress: A Notion of Fairness in Resource Allocation.
Algorithmica
Sanjoy K. Baruah, N. K. Cohen, C. Greg Plaxton, Donald A. Varvel
1995 — conf
Fast scheduling of periodic tasks on multiple resources.
IPPS
Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton
1995 A* conf
Lower bounds for sorting networks.
STOC
Nabil Kahalé, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi
1995 A* conf
Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection Machines.
FOCS
C. Greg Plaxton
1995 A* conf
Tight analyses of two local load balancing algorithms.
STOC
Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman
1994 J jnl
A Lower Bound for Sorting Networks Based on the Shuffle Permutation.
Math. Syst. Theory
C. Greg Plaxton, Torsten Suel
1994 A* conf
A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks.
ICALP
C. Greg Plaxton, Torsten Suel
1994 — conf
An optimal hypercube algorithm for the all nearest smaller values problem.
SPDP
Dina Kravets, C. Greg Plaxton
1994 A* conf
On contention resolution protocols and associated probabilistic phenomena.
STOC
Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman
1994 A* conf
Optimal Parallel Sorting in Multi-Level Storage.
SODA
Alok Aggarwal, C. Greg Plaxton
1993 J jnl
Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers.
J. Comput. Syst. Sci.
Robert Cypher, C. Greg Plaxton
1993 J jnl
Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube.
J. Parallel Distributed Comput.
Ernst W. Mayr, C. Greg Plaxton
1993 A* conf
Proportionate progress: a notion of fairness in resource allocation.
STOC
Sanjoy K. Baruah, N. K. Cohen, C. Greg Plaxton, Donald A. Varvel
1993 — conf
Sorting-Based Selection Algorithms for Hypercube Networks.
IPPS
Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton
1992 A* conf
A Hypercubic Sorting Network with Nearly Logarithmic Depth
STOC
C. Greg Plaxton
1992 B conf
A Lower Bound for Sorting Networks Based on the Shuffle Permutation.
SPAA
C. Greg Plaxton, Torsten Suel
1992 A* conf
Improved Lower Bounds for Shellsort
FOCS
C. Greg Plaxton, Bjorn Poonen, Torsten Suel
1992 J jnl
On the spanning trees of weighted graphs.
Comb.
Ernst W. Mayr, C. Greg Plaxton
1992 A* conf
Small-Depth Counting Networks
STOC
Michael Klugerman, C. Greg Plaxton
1991 B conf
A Comparison of Sorting Algorithms for the Connection Machine CM-2.
SPAA
Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
1991 A* conf
Highly Fault-Tolerant Sorting Circuits
FOCS
Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton
1990 A* conf
A (fairly) Simple Circuit that (usually) Sorts
FOCS
Frank Thomson Leighton, C. Greg Plaxton
1990 A* conf
Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers
STOC
Robert Cypher, C. Greg Plaxton
1989 B conf
Load Balancing, Selection Sorting on the Hypercube.
SPAA
C. Greg Plaxton
1989 A* conf
On the Network Complexity of Selection
FOCS
C. Greg Plaxton
1988 B conf
On the Spanning Trees of Weighted Graphs.
WG
Ernst W. Mayr, C. Greg Plaxton