Author of the publication

Two Dimensional Range Minimum Queries and Fibonacci Lattices.

, , , , and . ESA, volume 7501 of Lecture Notes in Computer Science, page 217-228. Springer, (2012)

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

Dictionary matching and indexing with errors and don't cares., , and . STOC, page 91-100. ACM, (2004)Conditional Lower Bounds for Space/Time Tradeoffs., , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 421-436. Springer, (2017)Quick Greedy Computation for Minimum Common String Partitions., and . CPM, volume 6661 of Lecture Notes in Computer Science, page 273-284. Springer, (2011)Range Minimum Query Indexes in Higher Dimensions., , , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 149-159. Springer, (2015)Approximate Parameterized Matching., , and . ESA, volume 3221 of Lecture Notes in Computer Science, page 414-425. Springer, (2004)Approximating Constrained LCS., and . SPIRE, volume 4726 of Lecture Notes in Computer Science, page 164-172. Springer, (2007)Approximate Swapped Matching., , and . FSTTCS, volume 1974 of Lecture Notes in Computer Science, page 302-311. Springer, (2000)Can We Recover the Cover?, , , , and . Algorithmica, 81 (7): 2857-2875 (2019)Can We Recover the Cover?., , , , and . CPM, volume 78 of LIPIcs, page 25:1-25:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Approximate subset matching with Don't Cares., , and . SODA, page 305-306. ACM/SIAM, (2001)