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
Journal ArticleDOI
New Linear-Time Algorithms for Edge-Coloring Planar Graphs
Richard Cole,Łukasz Kowalik +1 more
TL;DR: A linear-time algorithm for coloring planar graphs with maximum degree Δ with max {Δ,9} colors is optimal for graphs withmaximum degree Δ≥9 and is shown to be efficient over the algorithms of Chrobak and Yung and Nishizeki.
Book
Randomized Parallel Algorithms for Trapezoidal Diagrams
TL;DR: It is shown that randomized parallel CREW PRAM algorithms for building trapezoidal diagrams of line segments in the plane with parallel time bounds require the assumption that enough processors are available, with processor allocations every log n steps.
Proceedings ArticleDOI
Efficient Resource Oblivious Algorithms for Multicores with False Sharing
Richard Cole,Vijaya Ramachandran +1 more
TL;DR: Algorithms for a multicore environment in which each core has its own private cache and false sharing can occur are considered, and block-resilient HBP algorithms with low false sharing costs for several fundamental problems are developed.
Proceedings Article
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version)
Proceedings ArticleDOI
Multi-scale self-simulation: a technique for reconfiguring arrays with faults
TL;DR: If faulty nodes are allowed to communicate, but not compute, then an N-node one-dimensional array can tolerate logO(lJ N worst-case faults and still emulate a fault-free array with constant slowdown, and this bound is tight.