32 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of WarsawPL4 papers
- Curtin UniversityAU2 papers
- King's College LondonGB2 papers
- Missouri University of Science and TechnologyUS2 papers
- Nicolaus Copernicus UniversityPL2 papers
- Paris-Est SupFR2 papers
- Pôle de recherche et d'enseignement supérieur Université Paris-EstFR2 papers
- Institute for Coastal Marine EnvironmentIT1 paper
- National Research CouncilLK1 paper
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013
A Note on the Longest Common Compatible Prefix Problem for Partial Words
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +6
For a partial word the longest common compatible prefix of two positions , denoted , is the largest such that , where $\uparr…
cs.DS2012
A Note on Efficient Computation of All Abelian Periods in a String
Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka +6
We derive a simple efficient algorithm for Abelian periods knowing all Abelian squares in a string. An efficient algorithm for the latter problem was given by Cummings and Smyth in…