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
Proceedings Article
Dynamic LCA queries on trees
Richard Cole,Ramesh Hariharan +1 more
TL;DR: In this article, a data structure on trees which allows for the following operations, all in worst-case constant time: insertion of leaves and internal nodes, deletion of leaves, 3. deletion of internal nodes with only one child, determining the least common ancestor of any two nodes.
Journal ArticleDOI
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
TL;DR: On an n-node splay tree, the amortized cost of an access at distance d from the preceding access is O(log (d+1)) and there is an O(n) initialization cost.
Proceedings ArticleDOI
How much can taxes help selfish routing
TL;DR: A model of selfish routing in which the latency experienced by network traffic on an edge of the network is a function of the edge congestion, and network users are assumed to selfishly route traffic on minimum-latency paths is considered.
Proceedings ArticleDOI
Searching dynamic point sets in spaces with bounded doubling dimension
Richard Cole,Lee-Ad Gottlieb +1 more
TL;DR: A new data structure is presented that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension and finds a (1+ε)-approximate nearest neighbor in time O(log n) + (1/ε)O(1).
Journal ArticleDOI
Approximate String Matching: A Simpler Faster Algorithm
Richard Cole,Ramesh Hariharan +1 more
TL;DR: Two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k, are given.