PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Crochemore, Maxime"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient computation of maximal anti-exponent in palindrome-free strings.

, , , and . Theor. Comput. Sci., (2016)

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.

No persons found for author name Crochemore, Maxime
add a person with the name Crochemore, Maxime
 

Other publications of authors with the same name

Preface., , and . Fundam. Inform., 163 (3): i (2018)An Optimal Test on Finite Unavoidable Sets of Words., , and . Inf. Process. Lett., 16 (4): 179-180 (1983)Computing Longest Previous Factor in linear time and applications., and . Inf. Process. Lett., 106 (2): 75-80 (2008)Longest Motifs with a Functionally Equivalent Central Block., , and . SPIRE, volume 3246 of Lecture Notes in Computer Science, page 298-209. Springer, (2004)A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval., , , and . SPIRE, volume 2857 of Lecture Notes in Computer Science, page 211-223. Springer, (2003)Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time., , and . SPIRE, volume 7608 of Lecture Notes in Computer Science, page 61-72. Springer, (2012)Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays., , , , and . SOFSEM, volume 5901 of Lecture Notes in Computer Science, page 296-307. Springer, (2010)On the Right-Seed Array of a String., , , , and . COCOON, volume 6842 of Lecture Notes in Computer Science, page 492-502. Springer, (2011)Improved Algorithms for the Range Next Value Problem and Applications., , , , and . STACS, volume 1 of LIPIcs, page 205-216. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, (2008)Pattern Matching and Text Compression Algorithms., and . The Computer Science and Engineering Handbook, CRC Press, (1997)