Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space Reviewed

Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige.

Proc. 35th International Workshop on Combinatorial Algorithms (IWOCA 2024)   14764   327 - 340   2024.7

Computing maximal palindromes in non-standard matching models Reviewed

Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.

Proc. 35th International Workshop on Combinatorial Algorithms (IWOCA 2024)   14764   165 - 179   2024.7

Data Structures for Computing Unique Palindromes in Static and Non-Static Strings Reviewed

Takuya Mieno, Mitsuru Funakoshi.

Algorithmica   86   852 - 873   2024.3

Optimal LZ-End Parsing is Hard Reviewed

Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno.

Proc. 34th Annual Symposium on Combinatorial Pattern Matching (CPM2023)   259   3:1 - 3:11   2023.6

Sensitivity of string compressors and repetitiveness measures Reviewed

Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga.

Information and Computation   291   104999   2023.3

Computing Palindromes on a Trie in Linear Time Reviewed

Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga.

Proc. 33rd International Symposium on Algorithms and Computation (ISAAC 2022)   248   15:1 - 15:15   2022.12

Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings Reviewed

Takuya Mieno, Mitsuru Funakoshi.

Proc. 33rd International Workshop on Combinatorial Algorithms (IWOCA 2022)   13270   425 - 438   2022.6

On the Approximation Ratio of LZ-End to LZ77 Reviewed

Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda.

Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)   12944   114 - 126   2021.10

A separation of γ and b via Thue−Morse Words Reviewed

Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto.

Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)   12944   167 - 178   2021.10

Minimal unique palindromic substrings after single-character substitution Reviewed

Mitsuru Funakoshi, Takuya Mieno.

Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)   12944   33 - 46   2021.10

Computing longest palindromic substring after single-character or block-wise edits Reviewed

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.

Theoretical Computer Science   859   116 - 133   2021.3

Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences Reviewed

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara.

Proc. 31st Annual Symposium on Combinatorial Pattern Matching (CPM2020)   161   12:1 - 12:11   2020.6

Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements Reviewed International coauthorship

Mitsuru Funakoshi, Julian Pape-Lange.

Proc. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)   154   30:1 - 30:16   2020.3

Computing Maximal Palindromes and Distinct Palindromes in a Trie Reviewed

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.

Proc. The Prague Stringology Conference 2019 (PSC 2019)   3 - 15   2019.8

Faster queries for longest substring palindrome after block edit Reviewed

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.

Proc. 30th Annual Symposium on Combinatorial Pattern Matching (CPM2019)   128   27:1 - 27:13   2019.6

Longest substring palindrome after edit Reviewed

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.

Proc. 29th Annual Symposium on Combinatorial Pattern Matching (CPM2018)   105   12:1 - 12:14   2018.7

Computing maximal palindromes in non-standard matching models International conference

Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.

35th International Workshop on Combinatorial Algorithms (IWOCA 2024)  2024.7 

高さ制約付きLZ分解 International coauthorship

坂内 英夫, 舩越 満, ディプタラマ ヘンリアン, 松田 美勇史, Simon J. Puglisi.

冬のLAシンポジウム2023  2024.2 

lex-parse の圧縮感度

中島 祐人, クップル ドミニク, 舩越 満, 稲永 俊介, 坂内 英夫.

情報処理学会 第195回アルゴリズム研究発表会  2023.11 

Optimal LZ-End Parsing is Hard International conference

Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno.

34th Annual Symposium on Combinatorial Pattern Matching (CPM2023)  2023.6 

最適 LZ-End 分解

坂内 英夫, 舩越 満, 栗田 和宏, 中島 祐人, 脊戸 和寿, 宇野 毅明.

冬のLAシンポジウム2022  2023.2 

極大一般化回文

舩越 満, 三重野 琢也, 中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸.

冬のLAシンポジウム2022  2023.2 

アルファベット順による lex-parse サイズ比

中島 祐人, クップル ドミニク, 舩越 満, 稲永 俊介.

情報処理学会 第191回アルゴリズム研究発表会  2023.1 

Computing Palindromes on a Trie in Linear Time International conference

Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga.

33rd International Symposium on Algorithms and Computation (ISAAC 2022)  2022.12 

Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings International conference

Takuya Mieno, Mitsuru Funakoshi.

33rd International Workshop on Combinatorial Algorithms (IWOCA 2022)  2022.6 

LZEnd vs LZ77

井手上 卓弥, 三重野 琢也, 舩越 満, 中島 祐人, 稲永 俊介, 竹田 正幸.

冬のLAシンポジウム2021  2022.2 

文字列圧縮アルゴリズムの感度

赤木 亨, 舩越 満, 稲永 俊介.

冬のLAシンポジウム2021  2022.2 

A separation of γ and b via Thue−Morse Words International conference

Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto.

28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)  2021.10 

On the Approximation Ratio of LZ-End to LZ77 International conference

Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda.

28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)  2021.10 

Minimal unique palindromic substrings after single-character substitution International conference

Mitsuru Funakoshi, Takuya Mieno.

28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)  2021.10 

部分文字列編集時における最長回文の計算

舩越 満, 中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸.

STRセミナー 2021  2021.3 

非長方形畳み込み和と3-(Sub-)Cadences International coauthorship

舩越 満, Julian Pape-Lange.

情報処理学会 第181回アルゴリズム研究発表会  2021.1 

Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences International conference

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara.

31st Annual Symposium on Combinatorial Pattern Matching (CPM2020)  2020.6 

Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements International coauthorship International conference

Mitsuru Funakoshi, Julian Pape-Lange.

37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)  2020.3 

畳み込み和ならびにビット並列を用いた縦読みパターン照合

舩越 満, 中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸.

冬のLAシンポジウム2020  2020.2 

凸多角形畳み込み和を用いた 3-(Sub-)Cadences の計算 International coauthorship

舩越 満, Julian Pape-Lange.

基盤(S)離散構造処理系プロジェクト 秋のワークショップ2019  2019.11 

Computing Maximal Palindromes and Distinct Palindromes in a Trie International conference

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.

The Prague Stringology Conference 2019 (PSC 2019)  2019.8 

Faster queries for longest substring palindrome after block edit International conference

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.

30th Annual Symposium on Combinatorial Pattern Matching (CPM2019)  2019.6 

木構造上の異なる回文の列挙

舩越 満, 中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸.

春のSTRセミナー 2019  2019.3 

トライ上の極大回文の列挙

舩越 満, 中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸.

冬のLAシンポジウム2018  2019.2 

トライ上の極大回文の列挙

舩越 満, 中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸.

基盤(S)離散構造処理系プロジェクト 秋のワークショップ2018  2018.11 

Longest substring palindrome after edit International conference

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.

29th Annual Symposium on Combinatorial Pattern Matching (CPM2018)  2018.7 

1ブロック編集時の最長回文部分文字列クエリ

舩越 満, 中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸.

夏のLAシンポジウム2018  2018.7 

1ブロック編集時の最長回文部分文字列クエリ

舩越 満, 中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸.

基盤(S)離散構造処理系プロジェクト 初夏のワークショップ2018  2018.7 

1文字編集時の最長回文部分文字列クエリ

舩越 満, 中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸.

冬のLAシンポジウム2017  2018.2