No. |
Title |
Author |
Year |
---|

1 |
Shortest Beer Path Queries in Interval Graphs |
Das, Rathish et al. |
2022 |

2 |
Dynamic Boolean Formula Evaluation |
Das, Rathish et al. |
2021 |

3 |
Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima |
Munro, J. Ian et al. |
2021 |

4 |
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees |
He, Meng et al. |
2020 |

5 |
Space Efficient Construction of Lyndon Arrays in Linear Time |
Bille, Philip et al. |
2020 |

6 |
Space-Efficient Data Structures for Lattices |
Munro, J. Ian et al. |
2020 |

7 |
Text Indexing and Searching in Sublinear Time |
Munro, J. Ian et al. |
2020 |

8 |
Categorical Range Reporting with Frequencies |
Ganguly, Arnab et al. |
2019 |

9 |
Dynamic Planar Point Location in External Memory |
Munro, J. Ian et al. |
2019 |

10 |
On Approximate Range Mode and Range Selection |
El-Zein, Hicham et al. |
2019 |

11 |
Dynamic Trees with Almost-Optimal Access Cost |
Golin, Mordecai et al. |
2018 |

12 |
Improved Time and Space Bounds for Dynamic Range Mode |
El-Zein, Hicham et al. |
2018 |

13 |
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs |
Munro, J. Ian et al. |
2018 |

14 |
Succinct Data Structures for Chordal Graphs |
Munro, J. Ian et al. |
2018 |

15 |
Succinct Dynamic One-Dimensional Point Reporting |
El-Zein, Hicham et al. |
2018 |

16 |
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction |
Munro, J. Ian et al. |
2017 |

17 |
Succinct Color Searching in One Dimension |
El-Zein, Hicham et al. |
2017 |

18 |
Raising Permutations to Powers in Place |
El-Zein, Hicham et al. |
2016 |