Hideo Bannai

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 161

Top Venues

Publications

Akiyoshi Kawamoto, Tomohiro I, Dominik Köppl, Hideo Bannai
On the Hardness of Smallest RLSLPs and Collage Systems. DCC (2024)
Hideo Bannai, Panagiotis Charalampopoulos, Jakub Radoszewski
Maintaining the Size of LZ77 on Semi-Dynamic Strings. CPM (2024)
Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Faster space-efficient STR-IC-LCS computation. Theor. Comput. Sci. 1003 (2024)
Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda, Simon J. Puglisi
Height-bounded Lempel-Ziv encodings. CoRR (2024)
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
Constructing and indexing the bijective and extended Burrows-Wheeler transform. Inf. Comput. 297 (2024)
Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai
Edit and Alphabet-Ordering Sensitivity of Lex-Parse. MFCS (2024)
Hideo Bannai, Keisuke Goto, Shunsuke Kanda, Dominik Köppl
NP-Completeness for the Space-Optimality of Double-Array Tries. CoRR (2024)
Golnaz Badkobeh, Hideo Bannai, Dominik Köppl
Bijective BWT based compression schemes. CoRR (2024)
Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai
Edit and Alphabet-Ordering Sensitivity of Lex-parse. CoRR (2024)
Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie
Pfp-fm: an accelerated FM-index. Algorithms Mol. Biol. 19 (1) (2024)
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Maximal Palindromes in Non-standard Matching Models. IWOCA (2024)
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica 86 (3) (2024)
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. SPIRE (2023)
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
Optimal LZ-End Parsing is Hard. CoRR (2023)
Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Space-Efficient STR-IC-LCS Computation. SOFSEM (2023)
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
Sliding suffix trees simplified. 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. CoRR (2023)
Hideo Bannai, Tomohiro I, Dominik Köppl
Longest bordered and periodic subsequences. Inf. Process. Lett. 182 (2023)
Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie
Acceleration of FM-index Queries Through Prefix-free Parsing. CoRR (2023)
Hideo Bannai, Jonas Ellert
Lyndon Arrays in Sublinear Time. ESA (2023)
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
Optimal LZ-End Parsing Is Hard. CPM (2023)
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Linear-time computation of generalized minimal absent words for multiple strings. CoRR (2023)
Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie
Acceleration of FM-Index Queries Through Prefix-Free Parsing. WABI (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)
Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Space-Efficient STR-IC-LCS Computation. CoRR (2022)
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)
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
Computing Longest (Common) Lyndon Subsequences. CoRR (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)
Hideo Bannai, Tomohiro I, Dominik Köppl
Longest (Sub-)Periodic Subsequence. CoRR (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)
Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto
Computing NP-Hard Repetitiveness Measures via MAX-SAT. ESA (2022)
Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto
Computing NP-hard Repetitiveness Measures via MAX-SAT. CoRR (2022)
Luís M. S. Russo, Diogo M. Costa, Rui Henriques, Hideo Bannai, Alexandre P. Francisco
Order-preserving pattern matching indeterminate strings. Inf. Comput. 289 (Part) (2022)
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions. CoRR (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)
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
Computing Longest (Common) Lyndon Subsequences. IWOCA (2022)
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. SPIRE (2022)
Hideo Bannai, Shunsuke Inenaga, Neerja Mhaskar
Longest previous overlapping factor array. Inf. Process. Lett. 168 (2021)
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)
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)
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto
A Separation of γ and b via Thue-Morse Words. SPIRE (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)
Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh
The Smallest Grammar Problem Revisited. IEEE Trans. Inf. Theory 67 (1) (2021)
Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Longest Common Rollercoasters. SPIRE (2021)
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. CPM (2021)
Hideo Bannai
Repetitions in Strings: A "Constant" Problem (Invited Talk). CPM (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)
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto
A Separation of γ and b via Thue-Morse Words. CoRR (2021)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CoRR (2020)
Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
Practical Grammar Compression Based on Maximal Repeats. Algorithms 13 (4) (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)
Hideo Bannai, Travis Gagie, Tomohiro I
-index. Theor. Comput. Sci. 812 (2020)
Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai
Longest Square Subsequence Problem Revisited. SPIRE (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)
Hideo Bannai, Takuya Mieno, Yuto Nakashima
Lyndon Words, the Three Squares Lemma, and Primitive Squares. 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)
Hideo Bannai, Takuya Mieno, Yuto Nakashima
Lyndon Words, the Three Squares Lemma, and Primitive Squares. SPIRE (2020)
Hideo Bannai, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi, Luís M. S. Russo
More Time-Space Tradeoffs for Finding a Shortest Unique Substring. Algorithms 13 (9) (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)
Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye
Finding all maximal perfect haplotype blocks in linear time. Algorithms Mol. Biol. 15 (1) (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)
Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai
Longest Square Subsequence Problem Revisited. CoRR (2020)
Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
An Improved Data Structure for Left-Right Maximal Generic Words Problem. ISAAC (2019)
Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh
The smallest grammar problem revisited. CoRR (2019)
Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye
Finding All Maximal Perfect Haplotype Blocks in Linear Time. WABI (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)
Diogo M. Costa, Luís M. S. Russo, Rui Henriques, Hideo Bannai, Alexandre P. Francisco
Order-Preserving Pattern Matching Indeterminate Strings. CoRR (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)
Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
MR-RePair: Grammar Compression Based on Maximal Repeats. DCC (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)

Hideo Bannai.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hideo Bannai