C. Greg Plaxton

From MaRDI portal
Revision as of 14:51, 10 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page C. Greg Plaxton to C. Greg Plaxton: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:287228

Available identifiers

zbMath Open plaxton.c-gregMaRDI QIDQ287228

List of research outcomes

PublicationDate of PublicationType
On the spanning trees of weighted graphs2024-02-28Paper
A super-logarithmic lower bound for hypercubic sorting networks2019-04-29Paper
Fair on-line scheduling of a dynamic set of tasks on a single resource2016-05-26Paper
Proportionate progress2015-05-07Paper
Optimal cover time for a graph-based coupon collector process2014-02-03Paper
Concurrent maintenance of rings2013-06-20Paper
Efficient adaptive collect using randomization2013-06-07Paper
Competitive weighted matching in transversal matroids2012-04-26Paper
Maintaining the Ranch topology2012-03-07Paper
Buyer-supplier games: optimization over the core2011-02-21Paper
Approximation algorithms for hierarchical location problems2010-08-16Paper
Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines2008-08-28Paper
Competitive Weighted Matching in Transversal Matroids2008-08-28Paper
Online Compression Caching2008-07-15Paper
Buyer-Supplier Games: Optimization over the Core2008-02-20Paper
Online hierarchical cooperative caching2007-01-25Paper
Approximation algorithms for hierarchical location problems2006-06-30Paper
Automata, Languages and Programming2006-01-10Paper
Active and Concurrent Topology Maintenance2005-08-17Paper
Optimal time bounds for approximate clustering2005-01-19Paper
The Online Median Problem2003-06-19Paper
https://portal.mardi4nfdi.de/entity/Q42303442002-01-21Paper
https://portal.mardi4nfdi.de/entity/Q42340922001-08-28Paper
Placement Algorithms for Hierarchical Cooperative Caching2001-04-17Paper
A superlogarithmic lower bound for shuffle-unshuffle sorting networks2000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q42319162000-04-26Paper
Accessing nearby copies of replicated objects in a distributed environment2000-01-25Paper
Analysis of a Local Search Heuristic for Facility Location Problems2000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42501571999-10-18Paper
Rapid convergence of a local load balancing algorithm for asynchronous rings1999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42523371999-06-17Paper
Hypercubic Sorting Networks1998-05-10Paper
https://portal.mardi4nfdi.de/entity/Q31289291997-10-05Paper
Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults1997-08-03Paper
Lower Bounds for Shellsort1997-06-04Paper
Proportionate progress: A notion of fairness in resource allocation1996-10-08Paper
A lower bound for sorting networks based on the shuffle permutation1994-10-30Paper
Deterministic sorting in nearly logarithmic time on the hypercube and related computers1994-07-27Paper
Pipelined parallel prefix computations, and sorting on a pipelined hypercube1993-06-29Paper
On the spanning trees of weighted graphs1993-03-10Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: C. Greg Plaxton