default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMitsuru Funakoshi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Takuya Mieno, Mitsuru Funakoshi:
Data Structures for Computing Unique Palindromes in Static and Non-Static Strings. Algorithmica 86(3): 852-873 (2024)- [j3]Diptarama Hendrian
, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto, Mitsuru Funakoshi:
Linear time online algorithms for constructing linear-size suffix trie. Theor. Comput. Sci. 1015: 114765 (2024) - [c15]Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda, Simon J. Puglisi:
Height-Bounded Lempel-Ziv Encodings. ESA 2024: 18:1-18:18 - [c14]Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Maximal Palindromes in Non-standard Matching Models. IWOCA 2024: 165-179 - [c13]Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige:
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. IWOCA 2024: 327-340 - [c12]Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai:
Edit and Alphabet-Ordering Sensitivity of Lex-Parse. MFCS 2024: 75:1-75:15 - [i15]Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige:
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. CoRR abs/2402.18090 (2024) - [i14]Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai:
Edit and Alphabet-Ordering Sensitivity of Lex-parse. CoRR abs/2402.19223 (2024) - [i13]Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda, Simon J. Puglisi:
Height-bounded Lempel-Ziv encodings. CoRR abs/2403.08209 (2024) - 2023
- [j2]Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga:
Sensitivity of string compressors and repetitiveness measures. Inf. Comput. 291: 104999 (2023) - [c11]Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno:
Optimal LZ-End Parsing Is Hard. CPM 2023: 3:1-3:11 - [i12]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) - [i11]Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno:
Optimal LZ-End Parsing is Hard. CoRR abs/2302.02586 (2023) - 2022
- [c10]Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga:
Computing Palindromes on a Trie in Linear Time. ISAAC 2022: 15:1-15:15 - [c9]Takuya Mieno, Mitsuru Funakoshi:
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings. IWOCA 2022: 425-438 - [i10]Takuya Mieno, Mitsuru Funakoshi:
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings. CoRR abs/2204.07327 (2022) - [i9]Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing maximal generalized palindromes. CoRR abs/2210.02067 (2022) - [i8]Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga:
Computing palindromes on a trie in linear time. CoRR abs/2211.03995 (2022) - 2021
- [j1]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) - [c8]Mitsuru Funakoshi, Takuya Mieno:
Minimal Unique Palindromic Substrings After Single-Character Substitution. SPIRE 2021: 33-46 - [c7]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 - [c6]Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto:
A Separation of γ and b via Thue-Morse Words. SPIRE 2021: 167-178 - [i7]Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto:
A Separation of γ and b via Thue-Morse Words. CoRR abs/2104.09985 (2021) - [i6]Mitsuru Funakoshi, Takuya Mieno:
Minimal unique palindromic substrings after single-character substitution. CoRR abs/2105.11693 (2021) - [i5]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) - [i4]Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga:
Sensitivity of string compressors and repetitiveness measures. CoRR abs/2107.08615 (2021) - 2020
- [c5]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 - [c4]Mitsuru Funakoshi, Julian Pape-Lange:
Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements. STACS 2020: 30:1-30:16 - [i3]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)
2010 – 2019
- 2019
- [c3]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 - [c2]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Maximal Palindromes and Distinct Palindromes in a Trie. Stringology 2019: 3-15 - [i2]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster queries for longest substring palindrome after block edit. CoRR abs/1901.10722 (2019) - [i1]Mitsuru Funakoshi, Julian Pape-Lange:
Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements. CoRR abs/1910.11564 (2019) - 2018
- [c1]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Longest substring palindrome after edit. CPM 2018: 12:1-12:14
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 00:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
