BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Iceland
1 × Israel
1 × Portugal
2 × Canada
4 × USA
Collaborated with:
N.B.Dimitrov T.Suel M.Klugerman R.Cypher R.Rajaraman P.D.MacKenzie F.T.Leighton S.K.Baruah N.K.Cohen D.A.Varvel N.Kahale Y.Ma E.Szemerédi B.Ghosh B.M.Maggs S.Muthukrishnan A.W.Richa R.E.Tarjan D.Zuckerman
Talks about:
network (4) sort (4) logarithm (3) hypercub (3) time (3) algorithm (2) weight (2) lower (2) depth (2) bound (2)

Person: C. Greg Plaxton

DBLP DBLP: Plaxton:C=_Greg

Contributed to:

ICALP (1) 20082008
ICALP 20052005
STOC 20032003
STOC 19951995
ICALP 19941994
STOC 19941994
STOC 19931993
STOC 19921992
STOC 19901990

Wrote 12 papers:

Competitive Weighted Matching in Transversal Matroids (NBD, CGP), pp. 397–408.
ICALP-A-2008-Plaxton #performance #scheduling
Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines (CGP), pp. 222–233.
ICALP-2005-DimitrovP #graph #process
Optimal Cover Time for a Graph-Based Coupon Collector Process (NBD, CGP), pp. 702–716.
STOC-2003-Plaxton #algorithm #approximate #problem
Approximation algorithms for hierarchical location problems (CGP), pp. 40–49.
STOC-1995-GhoshLMMPRRTZ #algorithm #analysis
Tight analyses of two local load balancing algorithms (BG, FTL, BMM, SM, CGP, RR, AWR, RET, DZ), pp. 548–558.
STOC-1995-KahaleLMPSS #bound #network #sorting
Lower bounds for sorting networks (NK, FTL, YM, CGP, TS, ES), pp. 437–446.
ICALP-1994-PlaxtonS #bound #network #sorting
A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks (CGP, TS), pp. 618–629.
STOC-1994-MacKenziePR #on the #probability #protocol
On contention resolution protocols and associated probabilistic phenomena (PDM, CGP, RR), pp. 153–162.
STOC-1993-BaruahCPV #resource management
Proportionate progress: a notion of fairness in resource allocation (SKB, NKC, CGP, DAV), pp. 345–354.
STOC-1992-KlugermanP #network
Small-Depth Counting Networks (MK, CGP), pp. 417–428.
STOC-1992-Plaxton #network #sorting
A Hypercubic Sorting Network with Nearly Logarithmic Depth (CGP), pp. 405–416.
STOC-1990-CypherP #sorting
Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers (RC, CGP), pp. 193–203.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.