Author of the publication

Compressed Indexing for Consecutive Occurrences.

, , , and . CPM, volume 259 of LIPIcs, page 12:1-12:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Differentially Private Approximate Pattern Matching.. CoRR, (2023)Differentially Private Histogram, Predecessor, and Set Cardinality under Continual Observation., , and . CoRR, (2023)Differentially Private Data Structures under Continual Observation for Histograms and Related Queries., , and . CoRR, (2023)String Indexing with Compressed Patterns., , and . ACM Trans. Algorithms, 19 (4): 32:1-32:19 (October 2023)A Conditional Lower Bound for Episode Matching., , , , and . CoRR, (2021)Gapped String Indexing in Subquadratic Space and Sublinear Query Time., , , , , and . CoRR, (2022)Compressed Indexing for Consecutive Occurrences., , , and . CPM, volume 259 of LIPIcs, page 12:1-12:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)String Indexing for Top-k Close Consecutive Occurrences., , , , and . FSTTCS, volume 182 of LIPIcs, page 14:1-14:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)String Indexing with Compressed Patterns., , and . STACS, volume 154 of LIPIcs, page 10:1-10:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Fine-Grained Complexity of Episode Matching., , , , and . CPM, volume 223 of LIPIcs, page 4:1-4:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)