No. Title Author Year
1 External-Memory Dictionaries with Worst-Case Update Cost Das, Rathish et al. 2022
2 Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees He, Meng et al. 2020
3 Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing Gao, Younan et al. 2020
4 Four-Dimensional Dominance Range Reporting in Linear Space Nekrich, Yakov 2020
5 Further Results on Colored Range Searching Chan, Timothy M. et al. 2020
6 Text Indexing and Searching in Sublinear Time Munro, J. Ian et al. 2020
7 Categorical Range Reporting with Frequencies Ganguly, Arnab et al. 2019
8 Dynamic Planar Point Location in External Memory Munro, J. Ian et al. 2019
9 On Approximate Range Mode and Range Selection El-Zein, Hicham et al. 2019
10 Dynamic Trees with Almost-Optimal Access Cost Golin, Mordecai et al. 2018
11 Orthogonal Point Location and Rectangle Stabbing Queries in 3-d Chan, Timothy M. et al. 2018
12 Succinct Dynamic One-Dimensional Point Reporting El-Zein, Hicham et al. 2018
13 Fast Compressed Self-Indexes with Deterministic Linear-Time Construction Munro, J. Ian et al. 2017
14 Succinct Color Searching in One Dimension El-Zein, Hicham et al. 2017
15 Space-Efficient String Indexing for Wildcard Pattern Matching Lewenstein, Moshe et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 15

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