default search action
Chiara Epifanio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c6]Chiara Epifanio, Luca Forlizzi, Francesca Marzi, Filippo Mignosi, Giuseppe Placidi, Matteo Spezialetti:
On the k-Hamming and k-Edit Distances. ICTCS 2023: 143-156 - [i1]Chiara Epifanio, Luca Forlizzi, Francesca Marzi
, Filippo Mignosi, Giuseppe Placidi, Matteo Spezialetti:
On the k-Hamming and k-Edit Distances. CoRR abs/2306.09144 (2023)
2010 – 2019
- 2016
- [j7]Maxime Crochemore
Linear-size suffix tries. Theor. Comput. Sci. 638: 171-178 (2016) - 2012
- [j6]Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey O. Shallit:
Sturmian graphs and integer representations over numeration systems. Discret. Appl. Math. 160(4-5): 536-547 (2012) - 2010
- [c5]Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi
On Lazy Representations and Sturmian Graphs. CIAA 2010: 125-134
2000 – 2009
- 2009
- [j5]Maxime Crochemore
From Nerode's congruence to suffix automata with mismatches. Theor. Comput. Sci. 410(37): 3471-3480 (2009) - 2007
- [j4]Chiara Epifanio, Filippo Mignosi, Jeffrey O. Shallit, Ilaria Venturini:
On Sturmian graphs. Discret. Appl. Math. 155(8): 1014-1030 (2007) - [j3]Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Languages with mismatches. Theor. Comput. Sci. 385(1-3): 152-166 (2007) - [c4]Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi:
On the Suffix Automaton with Mismatches. CIAA 2007: 144-156 - 2005
- [j2]Chiara Epifanio, Filippo Mignosi:
A multidimensional critical factorization theorem. Theor. Comput. Sci. 346(2-3): 265-280 (2005) - [c3]Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi:
Languages with Mismatches and an Application to Approximate Indexing. Developments in Language Theory 2005: 224-235 - 2004
- [c2]Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi:
A Trie-Based Approach for Compacting Automata. CPM 2004: 145-158 - [c1]Chiara Epifanio, Filippo Mignosi, Jeffrey O. Shallit, Ilaria Venturini:
Sturmian Graphs and a Conjecture of Moser. Developments in Language Theory 2004: 175-187 - 2003
- [j1]Chiara Epifanio, Michel Koskas, Filippo Mignosi:
On a conjecture on bidimensional words. Theor. Comput. Sci. 299(1-3): 123-150 (2003)
Coauthor Index
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-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: