No. |
Title |
Author |
Year |
1 |
Data Structures for Categorical Path Counting Queries |
He, Meng et al. |
2021 |
2 |
Space Efficient Two-Dimensional Orthogonal Colored Range Counting |
Gao, Younan et al. |
2021 |
3 |
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees |
He, Meng et al. |
2020 |
4 |
Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing |
Gao, Younan et al. |
2020 |
5 |
Path Query Data Structures in Practice |
He, Meng et al. |
2020 |
6 |
On Approximate Range Mode and Range Selection |
El-Zein, Hicham et al. |
2019 |
7 |
Path and Ancestor Queries over Trees with Multidimensional Weight Vectors |
He, Meng et al. |
2019 |
8 |
Improved Time and Space Bounds for Dynamic Range Mode |
El-Zein, Hicham et al. |
2018 |
9 |
Tree Path Majority Data Structures |
Gagie, Travis et al. |
2018 |
10 |
Deletion without Rebalancing in Non-Blocking Binary Search Trees |
He, Meng et al. |
2017 |
11 |
Path Queries on Functions |
Gagie, Travis et al. |
2017 |