Остановите войну!
for scientists:
default search action
Simone Faro
- > Home > Persons > Simone Faro
Publications
- 2023
- [j28]Simone Faro, Thierry Lecroq, Kunsoo Park, Stefano Scafiti:
On the Longest Common Cartesian Substring Problem. Comput. J. 66(4): 907-923 (2023) - 2021
- [j24]Siwoo Song, Geonmo Gu, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast algorithms for single and multiple pattern Cartesian tree matching. Theor. Comput. Sci. 849: 47-63 (2021) - 2020
- [c50]Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings. Stringology 2020: 48-60 - [c47]Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Multiple Pattern Cartesian Tree Matching. WALCOM 2020: 107-119 - 2019
- [c44]Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Cartesian Tree Matching. SPIRE 2019: 124-137 - [i14]Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Cartesian Tree Matching. CoRR abs/1908.04937 (2019) - [i12]Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Multiple Pattern Cartesian Tree Matching. CoRR abs/1911.01644 (2019) - 2016
- [c38]Simone Faro, Thierry Lecroq, Stefano Borzi, Simone Di Mauro, Alessandro Maggio:
The String Matching Algorithms Research Tool. Stringology 2016: 99-111 - 2013
- [j13]Simone Faro, Thierry Lecroq:
The exact online string matching problem: A review of the most recent results. ACM Comput. Surv. 45(2): 13:1-13:42 (2013) - 2012
- [c28]Simone Faro, Thierry Lecroq:
Fast searching in biological sequences using multiple hash functions. BIBE 2012: 175-180 - [c26]Simone Faro, Thierry Lecroq:
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. SEA 2012: 172-183 - [c25]Simone Faro, Thierry Lecroq:
A Fast Suffix Automata Based Algorithm for Exact Online String Matching. CIAA 2012: 149-158 - 2011
- [c23]Simone Faro, Thierry Lecroq:
2001-2010: Ten Years of Exact String Matching Algorithms. Stringology 2011: 1-2 - 2010
- [i2]Simone Faro, Thierry Lecroq:
The Exact String Matching Problem: a Comprehensive Experimental Evaluation. CoRR abs/1012.2547 (2010) - 2009
- [j6]Simone Faro, Thierry Lecroq:
Efficient Variants of the Backward-Oracle-Matching Algorithm. Int. J. Found. Comput. Sci. 20(6): 967-984 (2009) - [c17]Simone Faro, Thierry Lecroq:
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings. CPM 2009: 106-115 - 2008
- [c11]Simone Faro, Thierry Lecroq:
Efficient Variants of the Backward-Oracle-Matching Algorithm. Stringology 2008: 146-160 - [i1]Simone Faro, Thierry Lecroq:
Efficient Pattern Matching on Binary Strings. CoRR abs/0810.2390 (2008)
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-01 20:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint