default search action
Massimo Equi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Nicola Rizzo
, Massimo Equi, Tuukka Norri
Elastic founder graphs improved and enhanced. Theor. Comput. Sci. 982: 114269 (2024) - [c6]Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Estéban Gabory, Roberto Grossi, Nadia Pisanti:
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs. WABI 2024: 14:1-14:21 - 2023
- [j3]Massimo Equi, Tuukka Norri
Algorithms and Complexity on Indexing Founder Graphs. Algorithmica 85(6): 1586-1623 (2023) - [j2]Massimo Equi, Veli Mäkinen
On the Complexity of String Matching for Graphs. ACM Trans. Algorithms 19(3): 21:1-21:25 (2023) - [j1]Massimo Equi
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. Theor. Comput. Sci. 975: 114128 (2023) - [c5]Massimo Equi, Arianne Meijer-van de Griend
From Bit-Parallelism to Quantum String Matching for Labelled Graphs. CPM 2023: 9:1-9:20 - [i6]Nicola Rizzo, Massimo Equi, Tuukka Norri, Veli Mäkinen:
Elastic Founder Graphs Improved and Enhanced. CoRR abs/2303.05336 (2023) - 2021
- [c4]Massimo Equi, Tuukka Norri
Algorithms and Complexity on Indexing Elastic Founder Graphs. ISAAC 2021: 20:1-20:18 - [c3]Massimo Equi
Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails. SOFSEM 2021: 608-622 - [i5]Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen:
Algorithms and Complexity on Indexing Founder Graphs. CoRR abs/2102.12822 (2021) - 2020
- [c2]Veli Mäkinen
Linear Time Construction of Indexable Founder Block Graphs. WABI 2020: 7:1-7:18 - [i4]Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu:
Conditional Indexing Lower Bounds Through Self-Reducibility. CoRR abs/2002.00629 (2020) - [i3]Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu:
Linear Time Construction of Indexable Founder Block Graphs. CoRR abs/2005.09342 (2020)
2010 – 2019
- 2019
- [c1]Massimo Equi, Roberto Grossi, Veli Mäkinen
On the Complexity of String Matching for Graphs. ICALP 2019: 55:1-55:15 - [i2]Massimo Equi, Roberto Grossi, Veli Mäkinen:
On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree. CoRR abs/1901.05264 (2019) - [i1]Massimo Equi, Roberto Grossi, Alexandru I. Tomescu, Veli Mäkinen:
On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching. CoRR abs/1902.03560 (2019)
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-08-27 22:53 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: