Plaxton, Charles Gregory - Department of Computer Sciences, University of Texas at Austin

Advanced Search

Plaxton, Charles Gregory - Department of Computer Sciences, University of Texas at Austin

Breaking the \Theta(n log 2 for Sorting with Faults
Proportionate Progress: A Notion of Fairness in Resource Allocation \Lambda
Fair OnLine Scheduling of a Dynamic Set of Tasks on a Single Resource ?
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Deterministic Sorting in Nearly Logarithmic Time
Optimal Time Bounds for Approximate Clustering y Ramgopal R. Mettu
On the Spanning Trees of Weighted Graphs \Lambda Ernst W. Mayr
A Lower Bound for Sorting Networks Based on the Shuffle Permutation
The Online Median Problem Ramgopal R. Mettu C. Greg Plaxton
HYPERCUBIC SORTING NETWORKS \Lambda TOM LEIGHTON y AND C. GREG PLAXTON z
[6] H. Meijer and S. G. Akl. Optimal computation of prefix sums on a binary tree of processors. International Journal of Parallel Programming, 16:127--136, 1987.
SortingBased Selection Algorithms for Hypercubic Networks
On Contention Resolution Protocols and Associated Probabilistic Phenomena
Thread Scheduling for Multiprogrammed Multiprocessors Nimar S. Arora Robert D. Blumofe C. Greg Plaxton
Approximation Algorithms for Hierarchical Location Problems ?
A SuperLogarithmic Lower Bound for ShuffleUnshuffle Sorting Networks 1
Efficient Adaptive Collect using Randomization Hagit Attiya 1 Fabian Kuhn 2 C. Greg Plaxton 3 Mirjam Wattenhofer 4
Lower Bounds for Shellsort \Lambda C. Greg Plaxton 1 Torsten Suel 2
Online Hierarchical Cooperative Caching Xiaozhou Li 1 C. Greg Plaxton 2,3 Mitul Tiwari 2,4
All Nearest Smaller Values on the Hypercube Dina Kravets and C. Greg Plaxton
Placement Algorithms for Hierarchical Cooperative Caching
Distributed Computing manuscript No. (will be inserted by the editor)
Analysis of a Local Search Heuristic for Facility Location Problems \Lambda
Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings
TIGHT ANALYSES OF TWO LOCAL LOAD BALANCING ALGORITHMS BHASKAR GHOSH 1 F. T. LEIGHTON 2 BRUCE M. MAGGS 3;4
Maintaining the Ranch Topology Xiaozhou Li1,3
Optimal Time Bounds for Approximate Clustering Ramgopal R. Mettu
Efficient Adaptive Collect using Randomization Hagit Attiya1
Approximation Algorithms for Hierarchical Location Problems
Online Hierarchical Cooperative Caching Xiaozhou Li1
Buyer-Supplier Games: Optimization Over the Core
Distributed Computing manuscript No. (will be inserted by the editor)