Author of the publication

Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets.

, , , , and . Theory Comput. Syst., 62 (1): 162-191 (2018)

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

Optimal Near-Linear Space Heaviest Induced Ancestors., , , and . CPM, volume 259 of LIPIcs, page 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search., , and . ACM Trans. Algorithms, 16 (2): 16:1-16:24 (2020)Fault-tolerant distance labeling for planar graphs., , , , and . Theor. Comput. Sci., (2022)Computing minimal and maximal suffixes of a substring., , , , and . Theor. Comput. Sci., (2016)Minimum Cut in O(m log² n) Time., , and . ICALP, volume 168 of LIPIcs, page 57:1-57:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Average-Case Behavior of k-Shortest Path Algorithms., , , and . COMPLEX NETWORKS (1), volume 812 of Studies in Computational Intelligence, page 28-40. Springer, (2018)A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem., and . ISAAC, volume 181 of LIPIcs, page 4:1-4:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Dynamic k-Mismatch Problem., , , , and . CoRR, (2021)Optimal Heaviest Induced Ancestors., , , and . CoRR, (2023)Slowing Down Top Trees for Better Worst-Case Compression., and . CPM, volume 105 of LIPIcs, page 16:1-16:8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)