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 |
|---|---|---|
| Efficient algorithms to compute compressed longest common substrings and compressed palindromes Theoretical Computer Science | 2009-03-17 | Paper |
| Computing Longest Common Substring and All Palindromes from Compressed Strings SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Research outcomes over time
This page was built for person: Tomoyuki Nakamura
