Följ
Takuya Mieno
Takuya Mieno
Verifierad e-postadress på uec.ac.jp - Startsida
Titel
Citeras av
Citeras av
År
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
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
A Separation of and b via Thue–Morse Words
H Bannai, M Funakoshi, T I, D Köppl, T Mieno, T Nishimoto
International Symposium on String Processing and Information Retrieval, 167-178, 2021
82021
Minimal unique palindromic substrings after single-character substitution
M Funakoshi, T Mieno
String Processing and Information Retrieval: 28th International Symposium …, 2021
72021
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
62021
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
52022
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
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
Computing palindromes on a trie in linear time
T Mieno, M Funakoshi, S Inenaga
arXiv preprint arXiv:2211.03995, 2022
22022
Combinatorics of minimal absent words for a sliding window
T Akagi, Y Kuhara, T Mieno, Y Nakashima, S Inenaga, H Bannai, ...
Theoretical Computer Science 927, 109-119, 2022
22022
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
22022
Repair grammars are the smallest grammars for Fibonacci words
T Mieno, S Inenaga, T Horiyama
arXiv preprint arXiv:2202.08447, 2022
22022
Cartesian tree subsequence matching
T Oizumi, T Kai, T Mieno, S Inenaga, H Arimura
arXiv preprint arXiv:2202.04349, 2022
22022
String sanitization under edit distance: improved and generalized
T Mieno, SP Pissis, L Stougie, M Sweering
arXiv preprint arXiv:2007.08179, 2020
22020
Linear-time computation of generalized minimal absent words for multiple strings
K Okabe, T Mieno, Y Nakashima, S Inenaga, H Bannai
International Symposium on String Processing and Information Retrieval, 331-344, 2023
12023
Data structures for computing unique palindromes in static and non-static strings
T Mieno, M Funakoshi
Algorithmica, 1-22, 2023
12023
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings
T Mieno, M Funakoshi
International Workshop on Combinatorial Algorithms, 425-438, 2022
12022
Minimal absent words on run-length encoded strings
T Akagi, K Okabe, T Mieno, Y Nakashima, S Inenaga
arXiv preprint arXiv:2202.13591, 2022
12022
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
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20