Massimo Equi 个人学术档案 - 学术资源搜索

2019202020212022202320244 15 31 35 43 29

开放获取的出版物数量

4 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

Veli MäkinenProfessor of Computer Science, University of Helsinki在 helsinki.fi 的电子邮件经过验证
Alexandru I. TomescuDepartment of Computer Science, University of Helsinki在 helsinki.fi 的电子邮件经过验证
Roberto GrossiProfessor of Computer Science, University of Pisa, Italy在 unipi.it 的电子邮件经过验证
Tuukka Norri在 helsinki.fi 的电子邮件经过验证
Bastien CazauxMCF Polytech Lille在 univ-lille.fr 的电子邮件经过验证
Jarno Niklas AlankoUniversity of Helsinki and Dalhousie University在 helsinki.fi 的电子邮件经过验证
Arianne Meijer - van de GriendUniversity of Helsinki, Finland在 helsinki.fi 的电子邮件经过验证

Massimo Equi

University of Helsinky

在 helsinki.fi 的电子邮件经过验证 - 首页


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
On the complexity of string matching for graphs M Equi, V Mäkinen, AI Tomescu, R Grossi ACM Transactions on Algorithms, 2023	72*	2023
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails M Equi, V Mäkinen, AI Tomescu SOFSEM 2021: Theory and Practice of Computer Science: 47th International …, 2021	43*	2021
Linear time construction of indexable founder block graphs V Mäkinen, B Cazaux, M Equi, T Norri, AI Tomescu arXiv preprint arXiv:2005.09342, 2020	25	2020
Algorithms and Complexity on Indexing Elastic Founder Graphs M Equi, T Norri, J Alanko, B Cazaux, AI Tomescu, V Mäkinen 32nd International Symposium on Algorithms and Computation (ISAAC 2021), 2021	10*	2021
Elastic founder graphs improved and enhanced N Rizzo, M Equi, T Norri, V Mäkinen Theoretical Computer Science 982, 114269, 2024	2	2024
From Bit-Parallelism to Quantum String Matching for Labelled Graphs M Equi, A Meijer-van de Griend, V Mäkinen 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023) 259, 9:1 …, 2023	2	2023
Pattern matching in labeled graphs M Equi	2	2018
Lower and Upper Bounds for String Matching in Labelled Graphs M Equi PhD thesis, University of Helsinki, 2022	1	2022

系统目前无法执行此操作，请稍后再试。

文章 1–8

每年引用数