Yuto Nakashima

According to our database1, Yuto Nakashima authored at least 49 papers between 2012 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Space-efficient algorithms for computing minimal/shortest unique substrings.
Theor. Comput. Sci., 2020

Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings.
Theory Comput. Syst., 2020

The Parameterized Suffix Tray.
CoRR, 2020

Computing Palindromic Trees for a Sliding Window and Its Applications.
CoRR, 2020

Grammar-compressed Self-index with Lyndon Words.
CoRR, 2020

Practical Grammar Compression Based on Maximal Repeats.
Algorithms, 2020

Towards Efficient Interactive Computation of Dynamic Time Warping Distance.
Proceedings of the String Processing and Information Retrieval, 2020

On Repetitiveness Measures of Thue-Morse Words.
Proceedings of the String Processing and Information Retrieval, 2020

Lyndon Words, the Three Squares Lemma, and Primitive Squares.
Proceedings of the String Processing and Information Retrieval, 2020

Faster STR-EC-LCS Computation.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches.
Proceedings of the Data Compression Conference, 2020

DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019
On the size of the smallest alphabet for Lyndon trees.
Theor. Comput. Sci., 2019

Dynamic Packed Compact Tries Revisited.
CoRR, 2019

Computing Maximal Palindromes and Distinct Palindromes in a Trie.
Proceedings of the Prague Stringology Conference 2019, 2019

Compact Data Structures for Shortest Unique Substring Queries.
Proceedings of the String Processing and Information Retrieval, 2019

On Longest Common Property Preserved Substring Queries.
Proceedings of the String Processing and Information Retrieval, 2019

Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets.
Proceedings of the String Processing and Information Retrieval, 2019

Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

An Improved Data Structure for Left-Right Maximal Generic Words Problem.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

MR-RePair: Grammar Compression Based on Maximal Repeats.
Proceedings of the Data Compression Conference, 2019

On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Computing Runs on a Trie.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Faster Queries for Longest Substring Palindrome After Block Edit.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

The Parameterized Position Heap of a Trie.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018
Algorithms and combinatorial properties on shortest unique palindromic substrings.
J. Discrete Algorithms, 2018

O(n log n)-time Text Compression by LZ-style Longest First Substitution.
Proceedings of the Prague Stringology Conference 2018, 2018

Right-to-left Online Construction of Parameterized Position Heaps.
Proceedings of the Prague Stringology Conference 2018, 2018

Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays.
Proceedings of the String Processing and Information Retrieval, 2018

Longest Lyndon Substring After Edit.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Lyndon Factorization of Grammar Compressed Texts Revisited.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Longest substring palindrome after edit.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Faster Online Elastic Degenerate String Matching.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017
Inferring strings from Lyndon factorization.
Theor. Comput. Sci., 2017

The "Runs" Theorem.
SIAM J. Comput., 2017

On Reverse Engineering the Lyndon Tree.
Proceedings of the Prague Stringology Conference 2017, 2017

On the Size of Lempel-Ziv and Lyndon Factorizations.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Shortest Unique Palindromic Substring Queries in Optimal Time.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text.
Theor. Comput. Sci., 2016

Computing Smallest and Largest Repetition Factorizations in <i>O</i>(<i>n</i> log <i>n</i>) Time.
Proceedings of the Prague Stringology Conference 2016, 2016

Longest Common Abelian Factors and Large Alphabets.
Proceedings of the String Processing and Information Retrieval, 2016

2015
Constructing LZ78 tries and position heaps in linear time for large alphabets.
Inf. Process. Lett., 2015

Computing Left-Right Maximal Generic Words.
Proceedings of the Prague Stringology Conference 2015, 2015

A new characterization of maximal repetitions by Lyndon trees.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2013
Efficient Lyndon Factorization of Grammar Compressed Text.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012
The Position Heap of a Trie.
Proceedings of the String Processing and Information Retrieval, 2012


  Loading...