( en | de | ru )

 

Disambiguation of "Crochemore, Maxime"

Author of the publication

copydeleteadd this publication to your clipboard
On the maximal sum of exponents of runs in a string.

, , , , and . J. Discrete Algorithms, (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.

Maxime Lorrillere

Maxime Crepel

Maxime Senot

Maxime Folschette

Maxime Derome

 

Other publications of authors with the same name

String-matching and periods.. Bulletin of the EATCS, (1989)Pattern Matching and Text Compression Algorithms., and . Computing Handbook, 3rd ed. (1), CRC Press, (2014)Constant-space string-matching in sublinear average time., , and . SEQUENCES, page 230-239. IEEE, (1997)A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum., , , and . MFCS, volume 2747 of Lecture Notes in Computer Science, page 622-631. Springer, (2003)Three Heuristics for delta-Matching: delta-BM Algorithms., , , , and . CPM, volume 2373 of Lecture Notes in Computer Science, page 178-189. Springer, (2002)String Matching., and . Encyclopedia of Algorithms, (2016)A sub-quadratic sequence alignment algorithm for unrestricted cost matrices., , and . SODA, page 679-688. ACM/SIAM, (2002)Overlapping repetitions in weighted sequence., , , and . CUBE, page 435-440. ACM, (2012)Extracting Powers and Periods in a String from Its Runs Structure., , , , , and . SPIRE, volume 6393 of Lecture Notes in Computer Science, page 258-269. Springer, (2010)Algorithms for Three Versions of the Shortest Common Superstring Problem., , , , , , and . CPM, volume 6129 of Lecture Notes in Computer Science, page 299-309. Springer, (2010)