Masayuki Takeda

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 107

Top Venues

Publications

Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Maximal Palindromes in Non-standard Matching Models. IWOCA (2024)
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Linear-time Computation of DAWGs, Symmetric Indexing Structures, and MAWs for Integer Alphabets. CoRR (2023)
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets. Theor. Comput. Sci. 973 (2023)
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches. Theor. Comput. Sci. 933 (2022)
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Palindromic trees for a sliding window and its applications. Inf. Process. Lett. 173 (2022)
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
c-trie++: A dynamic trie tailored for fast prefix searches. Inf. Comput. 285 (Part) (2022)
Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Minimal Unique Substrings for a Sliding Window. Algorithmica 84 (3) (2022)
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Combinatorics of minimal absent words for a sliding window. Theor. Comput. Sci. 927 (2022)
Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Factorizing Strings into Repetitions. Theory Comput. Syst. 66 (2) (2022)
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing maximal generalized palindromes. CoRR (2022)
Naoki Sawayanagi, Ryousuke Nakada, Yoshiki Hayama, Naoya Katsumata, Yuki Shimamura, Takumi Hinata, Masayuki Takeda, Katsumi Nakatsuhara
Wavelength characteristics of Nb2O5micro-ring resonators. OECC/PSC (2022)
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compressed Communication Complexity of Hamming Distance. CoRR (2021)
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Efficiently computing runs on a trie. Theor. Comput. Sci. 887 (2021)
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
On the Approximation Ratio of LZ-End to LZ77. SPIRE (2021)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing longest palindromic substring after single-character or block-wise edits. Theor. Comput. Sci. 859 (2021)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
The Parameterized Suffix Tray. CIAC (2021)
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
On the approximation ratio of LZ-End to LZ77. CoRR (2021)
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Combinatorics of minimal absent words for a sliding window. CoRR (2021)
Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Longest Common Rollercoasters. SPIRE (2021)
Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
Counting Lyndon Subsequences. Stringology (2021)
Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
Counting Lyndon Subsequences. CoRR (2021)
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compressed Communication Complexity of Hamming Distance. Algorithms 14 (4) (2021)
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Grammar Index By Induced Suffix Sorting. CoRR (2021)
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Grammar Index by Induced Suffix Sorting. SPIRE (2021)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CoRR (2020)
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. SPIRE (2020)
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Space-efficient algorithms for computing minimal/shortest unique substrings. Theor. Comput. Sci. 845 (2020)
Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Grammar-compressed Self-index with Lyndon Words. CoRR (2020)
Masayuki Takeda, Nobuyuki Yamasaki
Codeword Set Selection for the Error-Correcting 4b/10b Line Code with Maximum Clique Enumeration. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (10) (2020)
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
DAWGs for parameterized matching: online construction and related indexing structures. CoRR (2020)
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Dynamic index and LZ factorization in compressed space. Discret. Appl. Math. 274 (2020)
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings. Theory Comput. Syst. 64 (7) (2020)
Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster STR-EC-LCS Computation. SOFSEM (2020)
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Palindromic Trees for a Sliding Window and Its Applications. CoRR (2020)
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. CoRR (2020)
Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster STR-EC-LCS Computation. CoRR (2020)
Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
On Repetitiveness Measures of Thue-Morse Words. SPIRE (2020)
Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
On repetitiveness measures of Thue-Morse words. CoRR (2020)
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. CPM (2020)
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. DCC (2020)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
The Parameterized Suffix Tray. CoRR (2020)
Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. SOFSEM (2020)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CPM (2020)
Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
An Improved Data Structure for Left-Right Maximal Generic Words Problem. ISAAC (2019)
Masayuki Takeda, Nobuyuki Yamasaki
Finding the Maximum Number of Symbols for the 4b/10b Line Code with Error Correction. CANDAR Workshops (2019)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster queries for longest substring palindrome after block edit. CoRR (2019)
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Dynamic Packed Compact Tries Revisited. CoRR (2019)
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. IWOCA (2019)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. SPIRE (2019)
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compact Data Structures for Shortest Unique Substring Queries. CoRR (2019)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster Queries for Longest Substring Palindrome After Block Edit. CPM (2019)
Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
On Longest Common Property Preserved Substring Queries. SPIRE (2019)
Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. CPM (2019)
Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
On the size of the smallest alphabet for Lyndon trees. Theor. Comput. Sci. 792 (2019)
Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. CoRR (2019)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
The Parameterized Position Heap of a Trie. CIAC (2019)
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Runs on a Trie. CPM (2019)
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. CoRR (2019)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. CoRR (2019)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Maximal Palindromes and Distinct Palindromes in a Trie. Stringology (2019)
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing runs on a trie. CoRR (2019)
Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
On Longest Common Property Preserved Substring Queries. CoRR (2019)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
The Parameterized Position Heap of a Trie. CoRR (2019)
Yoshiki Hayama, Shinta Uchibori, Katsumi Nakatsuhara, Masayuki Takeda, Takeshi Nishizawa
Fabrication of Nb2O5 horizontal slot waveguide structures. OECC/PSC (2019)
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compact Data Structures for Shortest Unique Substring Queries. SPIRE (2019)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Right-to-left online construction of parameterized position heaps. CoRR (2018)
Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster Online Elastic Degenerate String Matching. CPM (2018)
Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Longest Lyndon Substring After Edit. CPM (2018)
Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Algorithms and combinatorial properties on shortest unique palindromic substrings. J. Discrete Algorithms (2018)
Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Lyndon Factorization of Grammar Compressed Texts Revisited. CPM (2018)
Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda
Computing longest common square subsequences. CPM (2018)
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
O(n log n)-time text compression by LZ-style longest first substitution. CoRR (2018)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Longest substring palindrome after edit. CPM (2018)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Right-to-left Online Construction of Parameterized Position Heaps. Stringology (2018)
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
O(n log n)-time Text Compression by LZ-style Longest First Substitution. Stringology (2018)
Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. SPIRE (2018)
Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
Small-Space LCE Data Structure with Constant-Time Queries. MFCS (2017)
Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster STR-IC-LCS computation via RLE. CoRR (2017)
Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
On Reverse Engineering the Lyndon Tree. Stringology (2017)
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
The "Runs" Theorem. SIAM J. Comput. 46 (5) (2017)
Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Order preserving pattern matching on trees and DAGs. CoRR (2017)
Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. ISAAC (2017)
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Tight Bounds on the Maximum Number of Shortest Unique Substrings. CPM (2017)
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Shortest Unique Palindromic Substring Queries in Optimal Time. IWOCA (2017)
Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
Small-space encoding LCE data structure with constant-time queries. CoRR (2017)
Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Inferring strings from Lyndon factorization. Theor. Comput. Sci. 689 (2017)
Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Order Preserving Pattern Matching on Trees and DAGs. SPIRE (2017)
Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster STR-IC-LCS Computation via RLE. CPM (2017)
Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Abelian String Regularities Based on RLE. IWOCA (2017)
Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Abelian regularities on RLE strings. CoRR (2017)
Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Efficient Computation of Substring Equivalence Classes with Suffix Arrays. Algorithmica 79 (2) (2017)
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Dynamic index and LZ factorization in compressed space. CoRR (2016)
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Fully dynamic data structure for LCE queries in compressed space. CoRR (2016)
Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Generalized pattern matching and periodicity under substring consistent equivalence relations. Theor. Comput. Sci. 656 (2016)
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Shortest Unique Substring Queries on Run-Length Encoded Strings. MFCS (2016)
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Shortest unique palindromic substring queries in optimal time. CoRR (2016)
Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea
Factorizing a String into Squares in Linear Time. CPM (2016)
Hirotaka Goto, Asuka Ohta, Tomofumi Matsuzawa, Munehiro Takimoto, Yasushi Kambayashi, Masayuki Takeda
A Guidance System for Wide-area Complex Disaster Evacuation based on Ant Colony Optimization. ICAART (1) (2016)
Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda
Deterministic sub-linear space LCE data structures with efficient construction. CoRR (2016)
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. Theor. Comput. Sci. 656 (2016)

Masayuki Takeda.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Masayuki Takeda