No. Title Author Year
1 Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard Gibney, Daniel et al. 2021
2 FM-Index Reveals the Reverse Suffix Array Ganguly, Arnab et al. 2020
3 On the Complexity of BWT-Runs Minimization via Alphabet Reordering Bentley, Jason W. et al. 2020
4 The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance Hoppenworth, Gary et al. 2020
5 Categorical Range Reporting with Frequencies Ganguly, Arnab et al. 2019
6 On the Hardness and Inapproximability of Recognizing Wheeler Graphs Gibney, Daniel et al. 2019
7 Non-Overlapping Indexing - Cache Obliviously Hooshmand, Sahar et al. 2018
8 The Heaviest Induced Ancestors Problem Revisited Abedin, Paniz et al. 2018
9 Structural Pattern Matching - Succinctly Ganguly, Arnab et al. 2017
10 Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching Ganguly, Arnab et al. 2016
11 Space-Time Trade-Offs for the Shortest Unique Substring Problem Ganguly, Arnab et al. 2016
12 Forbidden Extension Queries Biswas, Sudip et al. 2015
13 Shared-Constraint Range Reporting Biswas, Sudip et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 13

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