Yuto Nakashima
Yuto Nakashima
Verified email at inf.kyushu-u.ac.jp
Title
Cited by
Cited by
Year
The “runs” theorem
H Bannai, T I, S Inenaga, Y Nakashima, M Takeda, K Tsuruta
SIAM Journal on Computing 46 (5), 1501-1514, 2017
1122017
A new characterization of maximal repetitions by Lyndon trees
H Bannai, T I, S Inenaga, Y Nakashima, M Takeda, K Tsuruta
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
362014
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
I Tomohiro, Y Nakashima, S Inenaga, H Bannai, M Takeda
Theoretical Computer Science 656, 215-224, 2016
172016
On the size of Lempel-Ziv and Lyndon factorizations
J Kärkkäinen, D Kempa, Y Nakashima, SJ Puglisi, AM Shur
arXiv preprint arXiv:1611.08898, 2016
162016
MR-RePair: Grammar compression based on maximal repeats
I Furuya, T Takagi, Y Nakashima, S Inenaga, H Bannai, T Kida
2019 Data Compression Conference (DCC), 508-517, 2019
152019
Constructing LZ78 tries and position heaps in linear time for large alphabets
Y Nakashima, I Tomohiro, S Inenaga, H Bannai, M Takeda
Information Processing Letters 115 (9), 655-659, 2015
152015
Faster online elastic degenerate string matching
K Aoyama, Y Nakashima, S Inenaga, H Bannai, M Takeda
Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018
132018
The position heap of a trie
Y Nakashima, I Tomohiro, S Inenaga, H Bannai, M Takeda
International Symposium on String Processing and Information Retrieval, 360-371, 2012
122012
Longest substring palindrome after edit
M Funakoshi, Y Nakashima, S Inenaga, H Bannai, M Takeda
Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018
102018
Minimal unique substrings and minimal absent words in a sliding window
T Mieno, Y Kuhara, T Akagi, Y Fujishige, Y Nakashima, S Inenaga, ...
International Conference on Current Trends in Theory and Practice of …, 2020
92020
Algorithms and combinatorial properties on shortest unique palindromic substrings
H Inoue, Y Nakashima, T Mieno, S Inenaga, H Bannai, M Takeda
Journal of Discrete Algorithms 52, 122-132, 2018
92018
On repetitiveness measures of Thue-Morse words
K Kutsukake, T Matsumoto, Y Nakashima, S Inenaga, H Bannai, ...
International Symposium on String Processing and Information Retrieval, 213-220, 2020
82020
Right-to-left online construction of parameterized position heaps
N Fujisato, Y Nakashima, S Inenaga, H Bannai, M Takeda
arXiv preprint arXiv:1808.01071, 2018
82018
Longest Lyndon substring after edit
Y Urabe, Y Nakashima, S Inenaga, H Bannai, M Takeda
Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018
82018
Grammar-compressed self-index with Lyndon words
K Tsuruta, D Köppl, Y Nakashima, S Inenaga, H Bannai, M Takeda
arXiv preprint arXiv:2004.05309, 2020
72020
Computing runs on a trie
R Sugahara, Y Nakashima, S Inenaga, H Bannai, M Takeda
30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 2019
72019
Longest common Abelian factors and large alphabets
G Badkobeh, T Gagie, S Grabowski, Y Nakashima, SJ Puglisi, S Sugimoto
International Symposium on String Processing and Information Retrieval, 254-259, 2016
72016
On the size of overlapping Lempel-Ziv and Lyndon factorizations
Y Urabe, Y Nakashima, S Inenaga, H Bannai, M Takeda
30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 2019
62019
Inferring strings from Lyndon factorization
Y Nakashima, T Okabe, I Tomohiro, S Inenaga, H Bannai, M Takeda
International Symposium on Mathematical Foundations of Computer Science, 565-576, 2014
62014
Efficient Lyndon factorization of grammar compressed text
I Tomohiro, Y Nakashima, S Inenaga, H Bannai, M Takeda
Annual Symposium on Combinatorial Pattern Matching, 153-164, 2013
62013
The system can't perform the operation now. Try again later.
Articles 1–20