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 × Denmark
1 × Finland
1 × France
1 × Italy
1 × Spain
1 × The Netherlands
15 × USA
2 × Canada
Collaborated with:
R.Hariharan M.Lewenstein T.Roughgarden L.Gottlieb V.Gkatzelis H.J.Karloff V.Ramachandran L.Fleischer T.Tilley U.Vishkin B.M.Maggs R.K.Sitaraman Y.K.Cheung N.R.Devanur T.Kopelowitz D.Shasha X.Zhao Y.Dodis M.A.Bender R.Raman M.T.Goodrich C.Ó'Dúnlaing M.Sharir C.Yap J.S.Salowe W.L.Steiger E.Szemerédi J.R.Correa V.S.Mirrokni N.Olver A.Amir Y.Aumann E.Porat F.M.a.d.Heide M.Mitzenmacher A.W.Richa K.Schröder B.Vöcking
Talks about:
algorithm (6) match (6) suffix (4) tree (4) fast (4) construct (3) structur (3) time (3) techniqu (2) parallel (2)

Person: Richard Cole

DBLP DBLP: Cole:Richard

Contributed to:

STOC 20152015
ICALP (1) 20142014
STOC 20142014
STOC 20132013
STOC 20112011
ICALP (1) 20102010
STOC 20082008
ICALP (1) 20062006
STOC 20062006
KDD 20052005
STOC 20042004
ICALP 20032003
SEKE 20032003
STOC 20032003
ICALP 20022002
STOC 20022002
STOC 20002000
STOC 19981998
STOC 19971997
STOC 19931993
ICALP 19901990
ICALP 19881988
STOC 19861986
STOC 19841984

Wrote 25 papers:

STOC-2015-ColeG #approximate #nash #social
Approximating the Nash Social Welfare with Indivisible Items (RC, VG), pp. 371–380.
ICALP-v1-2014-ColeK #algorithm #performance #summary
Fast Algorithms for Constructing Maximum Entropy Summary Trees (RC, HJK), pp. 332–343.
STOC-2014-ColeR #complexity
The sample complexity of revenue maximization (RC, TR), pp. 243–252.
Tatonnement beyond gross substitutes?: gradient descent to the rescue (YKC, RC, NRD), pp. 191–200.
STOC-2011-ColeCGMO #coordination
Inner product spaces for MinSum coordination mechanisms (RC, JRC, VG, VSM, NO), pp. 539–548.
ICALP-v1-2010-ColeR #multi #sorting
Resource Oblivious Sorting on Multicores (RC, VR), pp. 226–237.
STOC-2008-ColeF #algorithm #problem
Fast-converging tatonnement algorithms for one-time and ongoing market problems (RC, LF), pp. 315–324.
ICALP-v1-2006-ColeKL #performance
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing (RC, TK, ML), pp. 358–369.
STOC-2006-ColeG #bound #set
Searching dynamic point sets in spaces with bounded doubling dimension (RC, LAG), pp. 574–583.
KDD-2005-ColeSZ #correlation #performance
Fast window correlations over uncooperative time series (RC, DS, XZ), pp. 743–749.
STOC-2004-ColeGL #fault #taxonomy
Dictionary matching and indexing with errors and don’t cares (RC, LAG, ML), pp. 91–100.
ICALP-2003-AmirACLP #algorithm #bound
Function Matching: Algorithms, Applications, and a Lower Bound (AA, YA, RC, ML, EP), pp. 929–942.
SEKE-2003-ColeT #analysis #concept
Conceptual Analysis of Software Structure (RC, TT), pp. 726–733.
STOC-2003-ColeDR #network
Pricing network edges for heterogeneous selfish users (RC, YD, TR), pp. 521–530.
STOC-2003-ColeH #algorithm #performance
A fast algorithm for computing steiner edge connectivity (RC, RH), pp. 167–176.
ICALP-2002-BenderCR #algorithm #exponential #performance
Exponential Structures for Efficient Cache-Oblivious Algorithms (MAB, RC, RR), pp. 195–207.
STOC-2002-ColeH #verification
Verifying candidate matches in sparse and wildcard matching (RC, RH), pp. 592–601.
STOC-2000-ColeH #performance
Faster suffix tree construction with missing suffix links (RC, RH), pp. 407–415.
STOC-1998-ColeMHMRSSV #multi #network #protocol #random
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks (RC, BMM, FMadH, MM, AWR, KS, RKS, BV), pp. 378–388.
STOC-1997-ColeH #pattern matching #random #set
Tree Pattern Matching and Subset Matching in Randomized O(n log3m) Time (RC, RH), pp. 66–75.
STOC-1993-ColeMS #array #configuration management #fault #multi #self
Multi-scale self-simulation: a technique for reconfiguring arrays with faults (RC, BMM, RKS), pp. 561–572.
ICALP-1990-ColeGO #diagrams #parallel #performance
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (RC, MTG, ), pp. 432–445.
Optimal Slope Selection (RC, JSS, WLS, ES), pp. 133–146.
STOC-1986-ColeV #algorithm #design #metaprogramming #parallel
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms (RC, UV), pp. 206–219.
STOC-1984-ColeSY #on the #problem
On k-hulls and Related Problems (RC, MS, CKY), pp. 154–166.

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.