Остановите войну!
for scientists:
default search action
Maxime Crochemore
- > Home > Persons > Maxime Crochemore
Publications
- 2017
- [j111]Maxime Crochemore, Costas S. Iliopoulos, Alessio Langiu, Filippo Mignosi:
The longest common substring problem. Math. Struct. Comput. Sci. 27(2): 277-295 (2017) - 2016
- [j102]Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi:
Linear-size suffix tries. Theor. Comput. Sci. 638: 171-178 (2016) - 2014
- [j89]Maxime Crochemore, Alessio Langiu, Filippo Mignosi:
Note on the greedy parsing optimality for dictionary-based text compression. Theor. Comput. Sci. 525: 55-59 (2014) - 2013
- [c81]Maxime Crochemore, Alessio Langiu, Filippo Mignosi:
The Rightmost Equal-Cost Position Problem. DCC 2013: 421-430 - 2012
- [j75]Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo:
Dictionary-symbolwise flexible parsing. J. Discrete Algorithms 14: 74-90 (2012) - [i8]Maxime Crochemore, Alessio Langiu, Filippo Mignosi:
The Rightmost Equal-Cost Position Problem. CoRR abs/1211.5108 (2012) - [i7]Maxime Crochemore, Alessio Langiu, Filippo Mignosi:
Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression. CoRR abs/1211.5350 (2012) - 2010
- [c64]Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo:
Dictionary-Symbolwise Flexible Parsing. IWOCA 2010: 390-403 - 2009
- [j64]Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi:
From Nerode's congruence to suffix automata with mismatches. Theor. Comput. Sci. 410(37): 3471-3480 (2009) - 2008
- [c49]Maxime Crochemore, Alessandra Gabriele, Filippo Mignosi, Mauriana Pesaresi:
On the Longest Common Factor Problem. IFIP TCS 2008: 143-155 - 2007
- [c41]Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi:
On the Suffix Automaton with Mismatches. CIAA 2007: 144-156 - 2004
- [c37]Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi:
A Trie-Based Approach for Compacting Automata. CPM 2004: 145-158 - 2003
- [j45]Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Computing forbidden words of regular languages. Fundam. Informaticae 56(1-2): 121-135 (2003) - 2000
- [j35]Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi:
Data compression using antidictionaries. Proc. IEEE 88(11): 1756-1768 (2000) - 1999
- [c21]Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi:
Text Compression Using Antidictionaries. ICALP 1999: 261-270 - 1998
- [j30]Maxime Crochemore, Filippo Mignosi, Antonio Restivo:
Automata and Forbidden Words. Inf. Process. Lett. 67(3): 111-117 (1998) - [c19]Maxime Crochemore, Filippo Mignosi, Antonio Restivo:
Minimal Forbidden Words and Factor Automata. MFCS 1998: 665-673
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-29 23:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint