Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient. - Zheqi Shen; Zijin Wan; Yan Gu 001; Yihan Sun 001 (SPAA, 2022)

A Work-Efficient Parallel Algorithm for Longest Increasing Subsequence. - Yan Gu 001; Zheqi Shen; Yihan Sun 001; Zijin Wan (CoRR, 2022)

Parallel Longest Increasing Subsequence and van Emde Boas Trees. - Yan Gu 001; Ziyang Men; Zheqi Shen; Yihan Sun 001; Zijin Wan (SPAA, 2023)

Parallel Contraction Hierarchies Can Be Efficient and Scalable. - Zijin Wan; Xiaojun Dong 001; Letong Wang; Enzuo Zhu; Yan Gu 001; Yihan Sun 001 (CoRR, 2024)

Parallel Contraction Hierarchies Can Be Efficient and Scalable (Abstract). - Zijin Wan; Xiaojun Dong 001; Letong Wang; Enzuo Zhu; Yan Gu 001; Yihan Sun 001 (HOPC@SPAA, 2025)