The following pages link to C. Greg Plaxton (Q287228):
Displaying 40 items.
- Fair on-line scheduling of a dynamic set of tasks on a single resource (Q287232) (← links)
- Buyer-supplier games: optimization over the core (Q627118) (← links)
- Maintaining the Ranch topology (Q666250) (← links)
- Optimal time bounds for approximate clustering (Q703075) (← links)
- Online hierarchical cooperative caching (Q863196) (← links)
- On the spanning trees of weighted graphs (Q1204524) (← links)
- Rapid convergence of a local load balancing algorithm for asynchronous rings (Q1292435) (← links)
- Accessing nearby copies of replicated objects in a distributed environment (Q1293914) (← links)
- Deterministic sorting in nearly logarithmic time on the hypercube and related computers (Q1317489) (← links)
- Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults (Q1356885) (← links)
- (Q1579051) (redirect page) (← links)
- A superlogarithmic lower bound for shuffle-unshuffle sorting networks (Q1579052) (← links)
- Proportionate progress: A notion of fairness in resource allocation (Q1918992) (← links)
- Efficient adaptive collect using randomization (Q1953647) (← links)
- Concurrent maintenance of rings (Q1954197) (← links)
- Pipelined parallel prefix computations, and sorting on a pipelined hypercube (Q2365584) (← links)
- Competitive weighted matching in transversal matroids (Q2428661) (← links)
- Optimal cover time for a graph-based coupon collector process (Q2434930) (← links)
- Placement Algorithms for Hierarchical Cooperative Caching (Q2709801) (← links)
- (Q3128929) (← links)
- Online Compression Caching (Q3512477) (← links)
- Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines (Q3521921) (← links)
- Competitive Weighted Matching in Transversal Matroids (Q3521935) (← links)
- (Q4230344) (← links)
- (Q4231916) (← links)
- (Q4234092) (← links)
- (Q4250157) (← links)
- (Q4252337) (← links)
- A lower bound for sorting networks based on the shuffle permutation (Q4311642) (← links)
- Lower Bounds for Shellsort (Q4339002) (← links)
- Hypercubic Sorting Networks (Q4388861) (← links)
- Analysis of a Local Search Heuristic for Facility Location Problems (Q4512576) (← links)
- A super-logarithmic lower bound for hypercubic sorting networks (Q4632461) (← links)
- The Online Median Problem (Q4706233) (← links)
- Proportionate progress (Q5248503) (← links)
- Buyer-Supplier Games: Optimization over the Core (Q5443370) (← links)
- Active and Concurrent Topology Maintenance (Q5464201) (← links)
- Automata, Languages and Programming (Q5716820) (← links)
- Approximation algorithms for hierarchical location problems (Q5901083) (← links)
- Approximation algorithms for hierarchical location problems (Q5920573) (← links)
