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

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI