


Остановите войну!
for scientists:


default search action
Shunsuke Inenaga
Person information

Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [c148]Yuuki Yonemoto, Yuto Nakashima
, Shunsuke Inenaga
, Hideo Bannai
:
Space-Efficient STR-IC-LCS Computation. SOFSEM 2023: 372-384 - [i78]Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto, Mitsuru Funakoshi:
Linear Time Online Algorithms for Constructing Linear-size Suffix Trie. CoRR abs/2301.04295 (2023) - 2022
- [j57]Takuya Mieno
, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Minimal Unique Substrings for a Sliding Window. Algorithmica 84(3): 670-693 (2022) - [j56]Yoshifumi Sakai, Shunsuke Inenaga
:
A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. Algorithmica 84(9): 2581-2596 (2022) - [j55]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): 104794 (2022) - [j54]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: 106174 (2022) - [j53]Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima
, Shunsuke Inenaga
, Hideo Bannai
, Masayuki Takeda
:
Factorizing Strings into Repetitions. Theory Comput. Syst. 66(2): 484-501 (2022) - [j52]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: 109-119 (2022) - [j51]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: 21-42 (2022) - [c147]Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura:
Cartesian Tree Subsequence Matching. CPM 2022: 14:1-14:18 - [c146]Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama:
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. CPM 2022: 26:1-26:17 - [c145]Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Minimal Absent Words on Run-Length Encoded Strings. CPM 2022: 27:1-27:17 - [c144]Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga:
Computing Palindromes on a Trie in Linear Time. ISAAC 2022: 15:1-15:15 - [c143]Laurentius Leonard
, Shunsuke Inenaga
, Hideo Bannai
, Takuya Mieno
:
Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. SPIRE 2022: 24-37 - [i77]Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura:
Cartesian Tree Subsequence Matching. CoRR abs/2202.04349 (2022) - [i76]Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama:
RePair Grammars are the Smallest Grammars for Fibonacci Words. CoRR abs/2202.08447 (2022) - [i75]Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Minimal Absent Words on Run-Length Encoded Strings. CoRR abs/2202.13591 (2022) - [i74]Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno:
Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions. CoRR abs/2207.04194 (2022) - [i73]Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing maximal generalized palindromes. CoRR abs/2210.02067 (2022) - [i72]Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Space-Efficient STR-IC-LCS Computation. CoRR abs/2210.07979 (2022) - [i71]Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga:
Computing palindromes on a trie in linear time. CoRR abs/2211.03995 (2022) - 2021
- [j50]Shiori Mitsuya, Yuto Nakashima
, Shunsuke Inenaga
, Hideo Bannai
, Masayuki Takeda
:
Compressed Communication Complexity of Hamming Distance. Algorithms 14(4): 116 (2021) - [j49]Hideo Bannai
, Shunsuke Inenaga, Neerja Mhaskar:
Longest previous overlapping factor array. Inf. Process. Lett. 168: 106097 (2021) - [j48]Shunsuke Inenaga:
Towards a Complete Perspective on Labeled Tree Indexing: New Size Bounds, Efficient Constructions, and Beyond. J. Inf. Process. 29: 1-13 (2021) - [j47]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: 116-133 (2021) - [j46]Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
, Masayuki Takeda:
Efficiently computing runs on a trie. Theor. Comput. Sci. 887: 143-151 (2021) - [j45]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): 317-328 (2021) - [c142]Noriki Fujisato, Yuto Nakashima
, Shunsuke Inenaga
, Hideo Bannai
, Masayuki Takeda
:
The Parameterized Suffix Tray. CIAC 2021: 258-270 - [c141]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták
, Nicola Prezza, Marinella Sciortino, Anna Toffanello:
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. SOFSEM 2021: 249-262 - [c140]Kosuke Fujita, Yuto Nakashima
, Shunsuke Inenaga
, Hideo Bannai
, Masayuki Takeda
:
Longest Common Rollercoasters. SPIRE 2021: 21-32 - [c139]Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Grammar Index by Induced Suffix Sorting. SPIRE 2021: 85-99 - [c138]Takumi Ideue, Takuya Mieno
, Mitsuru Funakoshi
, Yuto Nakashima
, Shunsuke Inenaga
, Masayuki Takeda
:
On the Approximation Ratio of LZ-End to LZ77. SPIRE 2021: 114-126 - [c137]Akio Nishimoto, Noriki Fujisato, Yuto Nakashima
, Shunsuke Inenaga
:
Position Heaps for Cartesian-Tree Matching on Strings and Tries. SPIRE 2021: 241-254 - [c136]Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda:
Counting Lyndon Subsequences. Stringology 2021: 53-60 - [i70]Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed Communication Complexity of Hamming Distance. CoRR abs/2103.03468 (2021) - [i69]Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Combinatorics of minimal absent words for a sliding window. CoRR abs/2105.08496 (2021) - [i68]Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Grammar Index By Induced Suffix Sorting. CoRR abs/2105.13744 (2021) - [i67]Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda:
On the approximation ratio of LZ-End to LZ77. CoRR abs/2106.01173 (2021) - [i66]Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda:
Counting Lyndon Subsequences. CoRR abs/2106.01190 (2021) - [i65]Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga:
Position Heaps for Cartesian-tree Matching on Strings and Tries. CoRR abs/2106.01595 (2021) - [i64]Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga:
Sensitivity of string compressors and repetitiveness measures. CoRR abs/2107.08615 (2021) - 2020
- [j44]Takuya Takagi
, Shunsuke Inenaga
, Hiroki Arimura, Dany Breslauer, Diptarama Hendrian
:
Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts. Algorithmica 82(5): 1346-1377 (2020) - [j43]Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida:
Practical Grammar Compression Based on Maximal Repeats. Algorithms 13(4): 103 (2020) - [j42]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic index and LZ factorization in compressed space. Discret. Appl. Math. 274: 116-129 (2020) - [j41]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): 1273-1291 (2020) - [j40]Shintaro Narisada, Diptarama Hendrian
, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara
:
Efficient computation of longest single-arm-gapped palindromes in a string. Theor. Comput. Sci. 812: 160-173 (2020) - [j39]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: 230-242 (2020) - [c135]Mitsuru Funakoshi
, Yuto Nakashima
, Shunsuke Inenaga
, Hideo Bannai
, Masayuki Takeda
, Ayumi Shinohara
:
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CPM 2020: 12:1-12:11 - [c134]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: 26:1-26:14 - [c133]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: 243-252 - [c132]Yoshifumi Sakai, Shunsuke Inenaga:
A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. ISAAC 2020: 6:1-6:16 - [c131]Shunsuke Inenaga:
Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. LATIN 2020: 194-206 - [c130]Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-EC-LCS Computation. SOFSEM 2020: 125-135 - [c129]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: 148-160 - [c128]Akihiro Nishi, Yuto Nakashima
, Shunsuke Inenaga
, Hideo Bannai
, Masayuki Takeda
:
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. SPIRE 2020: 27-41 - [c127]Takafumi Inoue, Shunsuke Inenaga
, Hideo Bannai
:
Longest Square Subsequence Problem Revisited. SPIRE 2020: 147-154 - [c126]Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima
, Shunsuke Inenaga
, Hideo Bannai
, Masayuki Takeda
:
On Repetitiveness Measures of Thue-Morse Words. SPIRE 2020: 213-220 - [c125]Shunsuke Inenaga:
Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings. Stringology 2020: 111-124 - [i63]Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-EC-LCS Computation. CoRR abs/2001.05671 (2020) - [i62]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 abs/2002.06786 (2020) - [i61]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara:
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CoRR abs/2002.06796 (2020) - [i60]Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Grammar-compressed Self-index with Lyndon Words. CoRR abs/2004.05309 (2020) - [i59]Shunsuke Inenaga:
Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings. CoRR abs/2005.00681 (2020) - [i58]Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. CoRR abs/2005.08190 (2020) - [i57]Yoshifumi Sakai, Shunsuke Inenaga:
A reduction of the dynamic time warping distance to the longest increasing subsequence length. CoRR abs/2005.09169 (2020) - [i56]Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On repetitiveness measures of Thue-Morse words. CoRR abs/2005.09524 (2020) - [i55]Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai:
Longest Square Subsequence Problem Revisited. CoRR abs/2006.00216 (2020) - [i54]Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Palindromic Trees for a Sliding Window and Its Applications. CoRR abs/2006.02134 (2020) - [i53]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello:
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. CoRR abs/2008.08506 (2020) - [i52]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Suffix Tray. CoRR abs/2012.10092 (2020)
2010 – 2019
- 2019
- [j38]Yuto Nakashima, Takuya Takagi
, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On the size of the smallest alphabet for Lyndon trees. Theor. Comput. Sci. 792: 131-143 (2019) - [j37]Diptarama Hendrian
, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
:
Efficient dynamic dictionary matching with DAWGs and AC-automata. Theor. Comput. Sci. 792: 161-172 (2019) - [c124]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Position Heap of a Trie. CIAC 2019: 237-248 - [c123]Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
, Masayuki Takeda:
Computing Runs on a Trie. CPM 2019: 23:1-23:11 - [c122]Mitsuru Funakoshi
, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
, Masayuki Takeda:
Faster Queries for Longest Substring Palindrome After Block Edit. CPM 2019: 27:1-27:13 - [c121]Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
, Masayuki Takeda:
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. CPM 2019: 29:1-29:11 - [c120]Diptarama Hendrian
, Takuya Takagi
, Shunsuke Inenaga:
Online Algorithms for Constructing Linear-Size Suffix Trie. CPM 2019: 30:1-30:19 - [c119]Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida:
MR-RePair: Grammar Compression Based on Maximal Repeats. DCC 2019: 508-517 - [c118]Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
, Masayuki Takeda:
An Improved Data Structure for Left-Right Maximal Generic Words Problem. ISAAC 2019: 40:1-40:12 - [c117]Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. IWOCA 2019: 430-441 - [c116]Takuya Mieno
, Dominik Köppl
, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
, Masayuki Takeda:
Compact Data Structures for Shortest Unique Substring Queries. SPIRE 2019: 107-123 - [c115]Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
, Masayuki Takeda, Tomasz Kociumaka
:
On Longest Common Property Preserved Substring Queries. SPIRE 2019: 162-174 - [c114]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: 382-391 - [c113]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Maximal Palindromes and Distinct Palindromes in a Trie. Stringology 2019: 3-15 - [c112]Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto:
k-Abelian Pattern Matching: Revisited, Corrected, and Extended. Stringology 2019: 29-40 - [i51]Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga:
Online Algorithms for Constructing Linear-size Suffix Trie. CoRR abs/1901.10045 (2019) - [i50]Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing runs on a trie. CoRR abs/1901.10633 (2019) - [i49]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster queries for longest substring palindrome after block edit. CoRR abs/1901.10722 (2019) - [i48]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Position Heap of a Trie. CoRR abs/1903.06289 (2019) - [i47]Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. CoRR abs/1903.06290 (2019) - [i46]Shunsuke Inenaga:
Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. CoRR abs/1904.04513 (2019) - [i45]Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic Packed Compact Tries Revisited. CoRR abs/1904.07467 (2019) - [i44]Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compact Data Structures for Shortest Unique Substring Queries. CoRR abs/1905.12854 (2019) - [i43]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. CoRR abs/1906.00563 (2019) - [i42]Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka:
On Longest Common Property Preserved Substring Queries. CoRR abs/1906.05486 (2019) - [i41]Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh:
The smallest grammar problem revisited. CoRR abs/1908.06428 (2019) - [i40]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 abs/1909.02804 (2019) - 2018
- [j36]Hideo Bannai, Travis Gagie
, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa
, Marcin Piatkowski, Shiho Sugimoto:
Diverse Palindromic Factorization is NP-Complete. Int. J. Found. Comput. Sci. 29(2): 143-164 (2018) - [j35]Heikki Hyyrö, Shunsuke Inenaga:
Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions. Int. J. Found. Comput. Sci. 29(4): 623-645 (2018) - [j34]Shunsuke Inenaga, Heikki Hyyrö:
A hardness result and new algorithm for the longest common palindromic subsequence problem. Inf. Process. Lett. 129: 11-15 (2018) - [j33]Hiroe Inoue, Yuto Nakashima, Takuya Mieno
, Shunsuke Inenaga, Hideo Bannai
, Masayuki Takeda:
Algorithms and combinatorial properties on shortest unique palindromic substrings. J. Discrete Algorithms 52-53: 122-132 (2018) - [j32]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl
, Florin Manea:
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. Theory Comput. Syst. 62(1): 162-191 (2018) - [c111]Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Online Elastic Degenerate String Matching. CPM 2018: 9:1-9:10 - [c110]Mitsuru Funakoshi
, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Longest substring palindrome after edit. CPM 2018: 12:1-12:14 - [c109]Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda:
Computing longest common square subsequences. CPM 2018: 15:1-15:13 - [c108]Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Longest Lyndon Substring After Edit. CPM 2018: 19:1-19:10 - [c107]Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Lyndon Factorization of Grammar Compressed Texts Revisited. CPM 2018: 24:1-24:10 - [c106]Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga:
Block Palindromes: A New Generalization of Palindromes. SPIRE 2018: 183-190 - [c105]Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. SPIRE 2018: 254-267 - [c104]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: 12-26 - [c103]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Right-to-left Online Construction of Parameterized Position Heaps. Stringology 2018: 91-102 - [i39]Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga:
Block Palindromes: A New Generalization of Palindromes. CoRR abs/1806.00198 (2018) - [i38]Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
O(n log n)-time text compression by LZ-style longest first substitution. CoRR abs/1806.04890 (2018) - [i37]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Right-to-left online construction of parameterized position heaps. CoRR abs/1808.01071 (2018) - [i36]Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida:
MR-RePair: Grammar Compression based on Maximal Repeats. CoRR abs/1811.04596 (2018) - 2017
- [j31]Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
:
Efficient Computation of Substring Equivalence Classes with Suffix Arrays. Algorithmica 79(2): 291-318 (2017) - [j30]