30 results on '"Nakashima, Yuto"'
Search Results
2. Computing Longest Common Subsequence Under Cartesian-Tree Matching Model
3. Computing Maximal Palindromes in Non-standard Matching Models
4. Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph
5. Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings
6. Largest Repetition Factorization of Fibonacci Words
7. On Sensitivity of Compact Directed Acyclic Word Graphs
8. Space-Efficient STR-IC-LCS Computation
9. Position Heaps for Cartesian-Tree Matching on Strings and Tries
10. On the Approximation Ratio of LZ-End to LZ77
11. Longest Common Rollercoasters
12. Grammar Index by Induced Suffix Sorting
13. The Parameterized Suffix Tray
14. Lyndon Words, the Three Squares Lemma, and Primitive Squares
15. On Repetitiveness Measures of Thue-Morse Words
16. Towards Efficient Interactive Computation of Dynamic Time Warping Distance
17. Faster STR-EC-LCS Computation
18. Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
19. Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets
20. Compact Data Structures for Shortest Unique Substring Queries
21. On Longest Common Property Preserved Substring Queries
22. Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings
23. The Parameterized Position Heap of a Trie
24. Shortest Unique Palindromic Substring Queries in Optimal Time
25. Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays
26. Longest Common Abelian Factors and Large Alphabets
27. Inferring Strings from Lyndon Factorization
28. Efficient Lyndon Factorization of Grammar Compressed Text
29. Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text
30. The Position Heap of a Trie
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.