No. Title Author Year
1 Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima Munro, J. Ian et al. 2021
2 Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees He, Meng et al. 2020
3 Space Efficient Construction of Lyndon Arrays in Linear Time Bille, Philip et al. 2020
4 Space-Efficient Data Structures for Lattices Munro, J. Ian et al. 2020
5 Text Indexing and Searching in Sublinear Time Munro, J. Ian et al. 2020
6 Categorical Range Reporting with Frequencies Ganguly, Arnab et al. 2019
7 Dynamic Planar Point Location in External Memory Munro, J. Ian et al. 2019
8 On Approximate Range Mode and Range Selection El-Zein, Hicham et al. 2019
9 Dynamic Trees with Almost-Optimal Access Cost Golin, Mordecai et al. 2018
10 Improved Time and Space Bounds for Dynamic Range Mode El-Zein, Hicham et al. 2018
11 Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs Munro, J. Ian et al. 2018
12 Succinct Data Structures for Chordal Graphs Munro, J. Ian et al. 2018
13 Succinct Dynamic One-Dimensional Point Reporting El-Zein, Hicham et al. 2018
14 Fast Compressed Self-Indexes with Deterministic Linear-Time Construction Munro, J. Ian et al. 2017
15 Succinct Color Searching in One Dimension El-Zein, Hicham et al. 2017
16 Raising Permutations to Powers in Place El-Zein, Hicham et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 16


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