8 citations · 9 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
PaB-tree: Parallel B+-tree with Batch Updates
Ziyang Men, Yan Gu, Yihan Sun +1
The B+-tree is a ubiquitous search index due to its provable I/O (cache) efficiency. Yet unlike batch-parallel binary search trees, which are both fast and widely available, no bat…
cs.DS2024
Parallel d-tree with Batch Updates
Ziyang Men, Zheqi Shen, Yan Gu +1
The d-tree is one of the most widely used data structures to manage multi-dimensional data. Due to the ever-growing data volume, it is imperative to consider parallelism in d…
cs.DS2022★ 8 cited
Parallel Longest Increasing Subsequence and van Emde Boas Trees
Yan Gu, Ziyang Men, Zheqi Shen +2
This paper studies parallel algorithms for the longest increasing subsequence (LIS) problem. Let be the input size and be the LIS length of the input. Sequentially, LIS is…