Y
Yan Gu
Researcher at University of California, Riverside
Publications - 81
Citations - 1192
Yan Gu is an academic researcher from University of California, Riverside. The author has contributed to research in topics: Parallel algorithm & Computer science. The author has an hindex of 18, co-authored 58 publications receiving 848 citations. Previous affiliations of Yan Gu include Carnegie Mellon University & Tsinghua University.
Papers
More filters
Book ChapterDOI
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
TL;DR: In this paper, the problem of moving n sensors on a line to form a barrier coverage of a specified segment of the line such that the maximum moving distance of the sensors is minimized was solved in O(n2lognloglogn) time.
Proceedings ArticleDOI
Sorting with Asymmetric Read and Write Costs
TL;DR: This paper considers the PRAM model with asymmetric write cost, and presents write-efficient, cache-oblivious parallel algorithms for sorting, FFTs, and matrix multiplication, which yield provably good bounds for parallel machines with private caches or with a shared cache.
Proceedings ArticleDOI
Parallel Algorithms for Asymmetric Read-Write Costs
Naama Ben-David,Guy E. Blelloch,Jeremy T. Fineman,Phillip B. Gibbons,Yan Gu,Charles McGuffey,Julian Shun +6 more
TL;DR: A nested-parallel model of computation is presented that combines a small per-task stack-allocated memories with symmetric read-write costs and an unbounded heap- allocated shared memory with asymmetric reading costs, and how the costs in the model map efficiently onto a more concrete machine model under a work-stealing scheduler is shown.
Proceedings ArticleDOI
Sequential random permutation, list contraction and tree contraction are highly parallel
TL;DR: This work shows that simple sequential randomized iterative algorithms for random permutation, list contraction, and tree contraction are highly parallel if iterations of the algorithms are run as soon as all of their dependencies have been resolved, and the resulting computations have logarithmic depth with high probability.
Journal ArticleDOI
Mixed-Domain Edge-Aware Image Manipulation
TL;DR: A novel approach to edge-aware image manipulation that processes a Gaussian pyramid from coarse to fine, and at each level, applies a nonlinear filter bank to the neighborhood of each pixel using an explicit mixed-domain solution.