◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Crochemore

29 papers hereh-index 4610.4k citations372 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author17
  • middle author7
  • last author5

Across the 29 of 29 papers where every author was matched, so the position is known.

fields
  • cs.DS23
  • cs.DM3
  • cs.FL2
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20052022
most citedFinite-Repetition threshold for infinite ternary words

8 citations · 32 across the 26 of their papers we have counts for

collaborators
Showing 2016 · cs.DSShow all

1 paper · 2 filters

cs.DS2016

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries

Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +5

Longest common extension queries (LCE queries) and runs are ubiquitous in algorithmic stringology. Linear-time algorithms computing runs and preprocessing for constant-time LCE que…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.