Yihan Sun

Orcid: 0000-0002-3212-0934

Affiliations:
  • University of California, Riverside, CA, USA
  • Carnegie Mellon University, Pittsburgh, PA, USA (former, PhD 2019)


According to our database1, Yihan Sun authored at least 52 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
PASGAL: Parallel And Scalable Graph Algorithm Library.
CoRR, 2024

Parallel and (Nearly) Work-Efficient Dynamic Programming.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Brief Announcement: PASGAL: Parallel And Scalable Graph Algorithm Library.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms.
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

Parallel Integer Sort: Theory and Practice.
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

Teaching Parallel Algorithms Using the Binary-Forking Model.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2024

Fast and Space-Efficient Parallel Algorithms for Influence Maximization (Abstract).
Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

Parallel Integer Sort: Theory and Practice (Abstract).
Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

Efficient Parallel Output-Sensitive Edit Distance (Abstract).
Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

2023
Fast and Space-Efficient Parallel Algorithms for Influence Maximization.
Proc. VLDB Endow., November, 2023

Parallel Strong Connectivity Based on Faster Reachability.
Proc. ACM Manag. Data, 2023

Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis.
CoRR, 2023

High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Parallel Longest Increasing Subsequence and van Emde Boas Trees.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Provably Fast and Space-Efficient Parallel Biconnectivity.
Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

Parallel Strong Connectivity Based on Faster Reachability (Abstract).
Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

Provably Fast and Space-Efficient Parallel Biconnectivity (Abstract).
Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

Efficient Parallel Output-Sensitive Edit Distance.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Joinable Parallel Balanced Binary Trees.
ACM Trans. Parallel Comput., 2022

A Work-Efficient Parallel Algorithm for Longest Increasing Subsequence.
CoRR, 2022

Bi-directional Log-Structured Merge Tree.
Proceedings of the SSDBM 2022: 34th International Conference on Scientific and Statistical Database Management, Copenhagen, Denmark, July 6, 2022

Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Parallel Cover Trees and their Applications.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

The problem-based benchmark suite (PBBS), V2.
Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

PaC-trees: supporting parallel and compressed purely-functional collections.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

Analysis of Work-Stealing and Parallel Cache Complexity.
Proceedings of the 3rd Symposium on Algorithmic Principles of Computer Systems, 2022

2021
Space and Time Bounded Multiversion Garbage Collection.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Constant-time snapshots with applications to concurrent data structures.
Proceedings of the PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021

2020
Parallelism in Randomized Incremental Algorithms.
J. ACM, 2020

Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures.
CoRR, 2020

Randomized Incremental Convex Hull is Highly Parallel.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Optimal Parallel Algorithms in the Binary-Forking Model.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019
On Supporting Efficient Snapshot Isolation for Hybrid Workloads with Multi-Versioned Indexes.
Proc. VLDB Endow., 2019

Multiversion Concurrency with Bounded Delay and Precise Garbage Collection.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Implementing parallel and concurrent tree structures.
Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

Parallel Range, Segment and Rectangle Queries with Augmented Maps.
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2018
Parallel Range and Segment Queries with Augmented Maps.
CoRR, 2018

Efficient Single Writer Concurrency.
CoRR, 2018

Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

PAM: parallel augmented maps.
Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

Algorithmic Building Blocks for Asymmetric Memories.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Efficient Construction of Probabilistic Tree Embeddings.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Parallel Ordered Sets Using Join.
CoRR, 2016

A New Efficient Construction on Probabilistic Tree Embeddings.
CoRR, 2016

Just Join for Parallel Ordered Sets.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Parallel Shortest Paths Using Radius Stepping.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

2015
Fair evaluation of global network aligners.
Algorithms Mol. Biol., 2015

Simultaneous Optimization of both Node and Edge Conservation in Network Alignment via WAVE.
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

A Top-Down Parallel Semisort.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014
Cascading A*: a Parallel Approach to Approximate Heuristic Search.
CoRR, 2014

2013
Influence Maximization in Dynamic Social Networks.
Proceedings of the 2013 IEEE 13th International Conference on Data Mining, 2013


  Loading...