Seguir
Takuya Mieno
Takuya Mieno
Dirección de correo verificada de uec.ac.jp - Página principal
Título
Citado por
Citado por
Año
Shortest unique substring queries on run-length encoded strings
T Mieno, S Inenaga, H Bannai, M Takeda
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
192016
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
112018
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
Compact data structures for shortest unique substring queries
T Mieno, D Köppl, Y Nakashima, S Inenaga, H Bannai, M Takeda
International Symposium on String Processing and Information Retrieval, 107-123, 2019
52019
Minimal unique palindromic substrings after single-character substitution
M Funakoshi, T Mieno
International Symposium on String Processing and Information Retrieval, 33-46, 2021
32021
Tight bounds on the maximum number of shortest unique substrings
T Mieno, S Inenaga, H Bannai, M Takeda
Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2016
32016
Palindromic trees for a sliding window and its applications
T Mieno, K Watanabe, Y Nakashima, S Inenaga, H Bannai, M Takeda
Information Processing Letters 173, 106174, 2022
22022
On the approximation ratio of LZ-End to LZ77
T Ideue, T Mieno, M Funakoshi, Y Nakashima, S Inenaga, M Takeda
International Symposium on String Processing and Information Retrieval, 114-126, 2021
22021
Combinatorics of minimal absent words for a sliding window
T Akagi, Y Kuhara, T Mieno, Y Nakashima, S Inenaga, H Bannai, ...
Theoretical Computer Science, 2022
12022
Computing minimal unique substrings for a sliding window
T Mieno, Y Fujishige, Y Nakashima, S Inenaga, H Bannai, M Takeda
Algorithmica 84 (3), 670-693, 2022
12022
A Separation of and b via Thue–Morse Words
H Bannai, M Funakoshi, D Koeppl, T Mieno, T Nishimoto
International Symposium on String Processing and Information Retrieval, 167-178, 2021
12021
Space-efficient algorithms for computing minimal/shortest unique substrings
T Mieno, D Köppl, Y Nakashima, S Inenaga, H Bannai, M Takeda
Theoretical Computer Science 845, 230-242, 2020
12020
Lyndon words, the three squares lemma, and primitive squares
H Bannai, T Mieno, Y Nakashima
International Symposium on String Processing and Information Retrieval, 265-273, 2020
12020
Shortest unique palindromic substring queries in optimal time
Y Nakashima, H Inoue, T Mieno, S Inenaga, H Bannai, M Takeda
International Workshop on Combinatorial Algorithms, 397-408, 2017
12017
Minimal Absent Words on Run-Length Encoded Strings
T Akagi, K Okabe, T Mieno, Y Nakashima, S Inenaga
arXiv preprint arXiv:2202.13591, 2022
2022
RePair Grammars are the Smallest Grammars for Fibonacci Words
T Mieno, S Inenaga, T Horiyama
arXiv preprint arXiv:2202.08447, 2022
2022
Cartesian Tree Subsequence Matching
T Oizumi, T Kai, T Mieno, S Inenaga, H Arimura
arXiv preprint arXiv:2202.04349, 2022
2022
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings
T Mieno, M Funakoshi
International Workshop on Combinatorial Algorithms, 425-438, 2022
2022
Space-Efficient Algorithms for Computing Unique Substrings
T Mieno
2021
Computing Palindromic Trees in the Sliding Window Model
T MIENO, K WATANABE, Y NAKASHIMA, S INENAGA, H BANNAI, ...
情報処理学会研究報告 (Web) 2021 (AL-181), 2021
2021
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20