Author of the publication

Weighted Ancestors in Suffix Trees Revisited.

, , , and . CPM, volume 191 of LIPIcs, page 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

Compact Routing Schemes for Dynamic Ring Networks., , and . Theory Comput. Syst., 37 (5): 585-607 (2004)In-memory Representations of Databases via Succinct Data Structures: Tutorial Abstract.. PODS, page 323-324. ACM, (2018)Priority Queues: Small, Monotone and Trans-dichotomous.. ESA, volume 1136 of Lecture Notes in Computer Science, page 121-137. Springer, (1996)Succinct Representations of Binary Trees for Range Minimum Queries., , and . COCOON, volume 7434 of Lecture Notes in Computer Science, page 396-407. Springer, (2012)Range Extremum Queries.. IWOCA, volume 7643 of Lecture Notes in Computer Science, page 280-287. Springer, (2012)Engineering the LOUDS Succinct Tree Representation., , and . WEA, volume 4007 of Lecture Notes in Computer Science, page 134-145. Springer, (2006)Succinct Representations of Permutations., , , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 345-356. Springer, (2003)Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix., and . SODA, page 613-621. ACM/SIAM, (1994)Space efficient data structures for nearest larger neighbor., , , , and . J. Discrete Algorithms, (2016)Asymptotically Optimal Encodings for Range Selection., , and . FSTTCS, volume 29 of LIPIcs, page 291-301. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)