I agree that this site is using cookies. You can find further informations here.
X
Equi, Massimo
28  results:
Search for persons X
?
1

Elastic founder graphs improved and enhanced:

Rizzo, Nicola ; Equi, Massimo ; Norri, Tuukka.
Theoretical Computer Science.  982 (2024)  - p. 114269 , 2024
Link: https://doi.org/10.1016/..
 
?
2

On the Complexity of String Matching for Graphs:

Equi, Massimo ; Mäkinen, Veli ; Tomescu, Alexandru I..
ACM Transactions on Algorithms.  19 (2023)  3 - p. 1-25 , 2023
Link: https://doi.org/10.1145/..
 
?
3

Graphs cannot be indexed in polynomial time for sub-quadrat..:

Equi, Massimo ; Mäkinen, Veli ; Tomescu, Alexandru I.
Theoretical Computer Science.  975 (2023)  - p. 114128 , 2023
Link: https://doi.org/10.1016/..
 
?
4

Algorithms and Complexity on Indexing Founder Graphs:

Equi, Massimo ; Norri, Tuukka ; Alanko, Jarno...
Algorithmica.  85 (2022)  6 - p. 1586-1623 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Graphs Cannot Be Indexed in Polynomial Time for Sub-quadrat..:

, In: SOFSEM 2021: Theory and Practice of Computer Science; Lecture Notes in Computer Science,
Equi, Massimo ; Mäkinen, Veli ; Tomescu, Alexandru I. - p. 608-622 , 2021
Link: https://doi.org/10.1007/..
 
?
6

From Bit-Parallelism to Quantum String Matching for Labelle..:

Equi, Massimo ; Meijer-Van de Griend, Arianne ; Mäkinen, Veli
10.4230/LIPIcs.CPM.2023.9.  , 2023
Link: http://hdl.handle.net/10..
 
?
7

On the Complexity of String Matching for Graphs:

Equi, Massimo ; Mäkinen, Veli ; Tomescu, Alexandru I.
10.1145/3588334.  , 2023
Link: http://hdl.handle.net/10..
 
?
8

Algorithms and Complexity on Indexing Founder Graphs:

Equi, Massimo ; Norri, Tuukka ; Alanko, Jarno...
10.1007/s00453-022-01007-w.  , 2023
Link: http://hdl.handle.net/10..
 
?
9

Elastic Founder Graphs Improved and Enhanced:

Rizzo, Nicola ; Equi, Massimo ; Norri, Tuukka.
http://arxiv.org/abs/2303.05336.  , 2023
Link: http://arxiv.org/abs/230..
 
?
10

Elastic founder graphs improved and enhanced:

Rizzo, Nicola ; Equi, Massimo ; Norri, Tuukka.
10.1016/j.tcs.2023.114269.  , 2023
Link: http://hdl.handle.net/10..
 
?
11

From Bit-Parallelism to Quantum String Matching for Labelle..:

Equi, Massimo ; van de Griend, Arianne Meijer - ; Mäkinen, Veli
http://arxiv.org/abs/2302.02848.  , 2023
Link: http://arxiv.org/abs/230..
 
?
12

Graphs cannot be indexed in polynomial time for sub-quadrat..:

Equi, Massimo ; Mäkinen, Veli ; Tomescu, Alexandru I
10.1016/j.tcs.2023.114128.  , 2023
Link: http://hdl.handle.net/10..
 
?
13

Algorithms and Complexity on Indexing Founder Graphs:

Equi, Massimo ; Norri, Tuukka ; Alanko, Jarno...
10.1007/s00453-022-01007-w.  , 2022
Link: https://hdl.handle.net/2..
 
?
14

Algorithms and Complexity on Indexing Elastic Founder Graph:

Equi, Massimo ; Norri, Tuukka ; Alanko, Jarno...
10.4230/LIPIcs.ISAAC.2021.20.  , 2022
Link: http://hdl.handle.net/10..
 
?
15

Graphs Cannot Be Indexed in Polynomial Time for Sub-quadrat..:

Equi, Massimo ; Mäkinen, Veli ; Tomescu, Alexandru
10.1007/978-3-030-67731-2_44.  , 2022
Link: http://hdl.handle.net/10..
 
1-15