Author of the publication

Quasi-Linear-Time Algorithm for Longest Common Circular Factor.

, , , , , , , , and . CPM, volume 128 of LIPIcs, page 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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

Computing minimal and maximal suffixes of a substring., , , , and . Theor. Comput. Sci., (2016)Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays., and . CoRR, (2021)The Dynamic k-Mismatch Problem., , , , and . CoRR, (2021)Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance., and . FOCS, page 1168-1179. IEEE, (2020)Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet., , and . ESA, volume 8125 of Lecture Notes in Computer Science, page 625-636. Springer, (2013)Dynamic Dynamic Time Warping., , , , , and . SODA, page 208-242. SIAM, (2024)Resolution of the burrows-wheeler transform conjecture., and . Commun. ACM, 65 (6): 91-98 (2022)Weighted Shortest Common Supersequence Problem Revisited., , , , , , , and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 221-238. Springer, (2019)Efficient Algorithms for Shortest Partial Seeds in Words., , , , and . CPM, volume 8486 of Lecture Notes in Computer Science, page 192-201. Springer, (2014)Longest Unbordered Factor in Quasilinear Time., , , and . ISAAC, volume 123 of LIPIcs, page 70:1-70:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)