List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| From bit-parallelism to quantum string matching for labelled graphs | 2024-10-21 | Paper |
| Elastic founder graphs improved and enhanced Theoretical Computer Science | 2024-02-23 | Paper |
| scientific article; zbMATH DE number 7788593 (Why is no real title available?) | 2024-01-15 | Paper |
| On the Complexity of String Matching for Graphs ACM Transactions on Algorithms | 2023-10-23 | Paper |
| Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails Theoretical Computer Science | 2023-09-21 | Paper |
| Algorithms and complexity on indexing founder graphs Algorithmica | 2023-06-05 | Paper |
| Linear time construction of indexable founder block graphs | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7561548 (Why is no real title available?) | 2022-07-21 | Paper |
| Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (available as arXiv preprint) | 2022-03-24 | Paper |
Research outcomes over time
This page was built for person: Massimo Equi