R
Richard Cole
Researcher at New York University
Publications - 194
Citations - 11002
Richard Cole is an academic researcher from New York University. The author has contributed to research in topics: Parallel algorithm & Time complexity. The author has an hindex of 57, co-authored 193 publications receiving 10474 citations. Previous affiliations of Richard Cole include Courant Institute of Mathematical Sciences & Tel Aviv University.
Papers
More filters
Book ChapterDOI
Suffix trays and suffix trists: structures for faster text indexing
TL;DR: A suffix trist is suggested, a cross between a suffix tree and a suffix list, which supports queries in O(m+log|Σ|) time and the space and text update time of a suffix trists are the same as for the suffix tree or the suffix list.
Proceedings Article
Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract)
Richard Cole,Ramesh Hariharan +1 more
TL;DR: The authors show an upper bound of n+8/3(m+1)(n-m) character comparisons, achieved by an online algorithm which performs O(n) work in total, requires O(m) space and O( m/sup 2/) time for preprocessing.
Book
Optimal VLSI circuits for sorting
Richard Cole,Alan Siegel +1 more
TL;DR: A fundamentally new merging network for sorting numbers in a bit model is described, with new organizational approaches for optimal tuning of merging networks and the proper management of data flow.
Journal ArticleDOI
Reconfiguring Arrays with Faults Part I: Worst-Case Faults
TL;DR: If faulty nodes are allowed to communicate, but not compute, then an N-node one-dimensional array can tolerate $\log^k N$ worst-case faults, for any constant $k > 0$, and still emulate a fault-free array with constant slowdown, and this bound is tight.
Proceedings ArticleDOI
On the benefit of supporting virtual channels in wormhole routers
TL;DR: It is shown that it is possible to route any set of messages with L flits each, whose paths have congestion C and dilation D in O((L+ D) C(D log D) B B) flit steps, which implies that increasing the buffering capacity and the bandwidth of each physical channel by a factor of B can speed up a wormhole routing algorithm by a superlinear factor.