Yuto Nakashima

Orcid: 0000-0001-6269-9353

Affiliations:

Kyushu University, Fukuoka, Japan

According to our database¹, Yuto Nakashima authored at least 77 papers between 2012 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Faster space-efficient STR-IC-LCS computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Computing Longest Common Subsequence under Cartesian-Tree Matching Model.

[BibT_eX]

[DOI]

CoRR, 2024

On the Number of Non-equivalent Parameterized Squares in a String.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2024

Edit and Alphabet-Ordering Sensitivity of Lex-Parse.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Computing Longest Common Subsequence Under Cartesian-Tree Matching Model.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Computing Maximal Palindromes in Non-standard Matching Models.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2023

Computing SEQ-IC-LCS of Labeled Graphs.

[BibT_eX]

[DOI]

Yuuki Yonemoto

Yuto Nakashima

Shunsuke Inenaga

Proceedings of the Prague Stringology Conference 2023, 2023

Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2023

Largest Repetition Factorization of Fibonacci Words.

[BibT_eX]

[DOI]

Kaisei Kishi

Yuto Nakashima

Shunsuke Inenaga

Proceedings of the String Processing and Information Retrieval, 2023

Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2023

Space-Efficient STR-IC-LCS Computation.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

On Sensitivity of Compact Directed Acyclic Word Graphs.

[BibT_eX]

[DOI]

Hiroto Fujimaru

Yuto Nakashima

Shunsuke Inenaga

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

Optimal LZ-End Parsing Is Hard.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022

Parameterized DAWGs: Efficient constructions and bidirectional pattern searches.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Combinatorics of minimal absent words for a sliding window.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Factorizing Strings into Repetitions.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

Palindromic trees for a sliding window and its applications.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

c-trie++: A dynamic trie tailored for fast prefix searches.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Computing maximal generalized palindromes.

[BibT_eX]

[DOI]

CoRR, 2022

Computing Minimal Unique Substrings for a Sliding Window.

[BibT_eX]

[DOI]

Algorithmica, 2022

Minimal Absent Words on Run-Length Encoded Strings.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Efficiently computing runs on a trie.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Computing longest palindromic substring after single-character or block-wise edits.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Compressed Communication Complexity of Hamming Distance.

[BibT_eX]

[DOI]

Algorithms, 2021

Counting Lyndon Subsequences.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2021, 2021

Position Heaps for Cartesian-Tree Matching on Strings and Tries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2021

On the Approximation Ratio of LZ-End to LZ77.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2021

Longest Common Rollercoasters.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2021

Grammar Index by Induced Suffix Sorting.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2021

The Parameterized Suffix Tray.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Space-efficient algorithms for computing minimal/shortest unique substrings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Computing Palindromic Trees for a Sliding Window and Its Applications.

[BibT_eX]

[DOI]

CoRR, 2020

Grammar-compressed Self-index with Lyndon Words.

[BibT_eX]

[DOI]

CoRR, 2020

Practical Grammar Compression Based on Maximal Repeats.

[BibT_eX]

[DOI]

Algorithms, 2020

Towards Efficient Interactive Computation of Dynamic Time Warping Distance.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2020

On Repetitiveness Measures of Thue-Morse Words.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2020

Lyndon Words, the Three Squares Lemma, and Primitive Squares.

[BibT_eX]

[DOI]

Hideo Bannai

Takuya Mieno

Yuto Nakashima

Proceedings of the String Processing and Information Retrieval, 2020

Faster STR-EC-LCS Computation.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

On the size of the smallest alphabet for Lyndon trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Dynamic Packed Compact Tries Revisited.

[BibT_eX]

[DOI]

CoRR, 2019

Computing Maximal Palindromes and Distinct Palindromes in a Trie.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2019, 2019

Compact Data Structures for Shortest Unique Substring Queries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

On Longest Common Property Preserved Substring Queries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

An Improved Data Structure for Left-Right Maximal Generic Words Problem.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

MR-RePair: Grammar Compression Based on Maximal Repeats.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2019

On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Computing Runs on a Trie.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Faster Queries for Longest Substring Palindrome After Block Edit.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

The Parameterized Position Heap of a Trie.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Algorithms and combinatorial properties on shortest unique palindromic substrings.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2018

O(n log n)-time Text Compression by LZ-style Longest First Substitution.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2018, 2018

Right-to-left Online Construction of Parameterized Position Heaps.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2018, 2018

Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2018

Longest Lyndon Substring After Edit.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Lyndon Factorization of Grammar Compressed Texts Revisited.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Longest substring palindrome after edit.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Faster Online Elastic Degenerate String Matching.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017

Inferring strings from Lyndon factorization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

The "Runs" Theorem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

On Reverse Engineering the Lyndon Tree.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2017, 2017

On the Size of Lempel-Ziv and Lyndon Factorizations.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Shortest Unique Palindromic Substring Queries in Optimal Time.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Computing Smallest and Largest Repetition Factorizations in O(n log n) Time.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2016, 2016

Longest Common Abelian Factors and Large Alphabets.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2016

2015

Constructing LZ78 tries and position heaps in linear time for large alphabets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Computing Left-Right Maximal Generic Words.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2015, 2015

A new characterization of maximal repetitions by Lyndon trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2013

Efficient Lyndon Factorization of Grammar Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012

The Position Heap of a Trie.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2012

Yuto Nakashima

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...