Zijin Wan

Orcid: 0009-0005-6372-0843

According to our database¹, Zijin Wan authored at least 4 papers between 2022 and 2024.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Parallel Contraction Hierarchies Can Be Efficient and Scalable.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Parallel Longest Increasing Subsequence and van Emde Boas Trees.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

2022

A Work-Efficient Parallel Algorithm for Longest Increasing Subsequence.

[BibT_eX]

[DOI]

CoRR, 2022

Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient.

[BibT_eX]

[DOI]

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

Zijin Wan

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...