Följ
Yuto Nakashima
Yuto Nakashima
Verifierad e-postadress på inf.kyushu-u.ac.jp
Titel
Citeras av
Citeras av
År
The “runs” theorem
H Bannai, T I, S Inenaga, Y Nakashima, M Takeda, K Tsuruta
SIAM Journal on Computing 46 (5), 1501-1514, 2017
1562017
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
392014
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
272020
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
232019
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
222018
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
202016
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
192016
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
192015
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
162020
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
152018
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
142018
Longest substring palindrome after edit
M Funakoshi, Y Nakashima, S Inenaga, H Bannai, M Takeda
29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018
142018
Longest Lyndon substring after edit
Y Urabe, Y Nakashima, S Inenaga, H Bannai, M Takeda
29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018
142018
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
132020
The position heap of a trie
Y Nakashima, T I, S Inenaga, H Bannai, M Takeda
String Processing and Information Retrieval: 19th International Symposium …, 2012
132012
c-trie++: A dynamic trie tailored for fast prefix searches
K Tsuruta, D Köppl, S Kanda, Y Nakashima, S Inenaga, H Bannai, ...
Information and Computation 285, 104794, 2022
122022
Computing longest palindromic substring after single-character or block-wise edits
M Funakoshi, Y Nakashima, S Inenaga, H Bannai, M Takeda
Theoretical Computer Science 859, 116-133, 2021
122021
Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
N Fujisato, Y Nakashima, S Inenaga, H Bannai, M Takeda
International Symposium on String Processing and Information Retrieval, 382-391, 2019
102019
Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings
K Watanabe, Y Nakashima, S Inenaga, H Bannai, M Takeda
Theory of Computing Systems 64 (7), 1273-1291, 2020
92020
Computing Maximal Palindromes and Distinct Palindromes in a Trie.
M Funakoshi, Y Nakashima, S Inenaga, H Bannai, M Takeda
Stringology, 3-15, 2019
92019
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20