Xiaojun Dong

Orcid: 0000-0003-4828-7066

Affiliations:
  • University of California, Riverside, CA, USA


According to our database1, Xiaojun Dong authored at least 14 papers between 2021 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers.
Proc. VLDB Endow., May, 2024

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

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering.
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

Parallel Integer Sort: Theory and Practice.
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 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
Parallel Strong Connectivity Based on Faster Reachability.
Proc. ACM Manag. Data, 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

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

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


  Loading...