default search action
Wataru Matsubara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j5]Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
:
Detecting regularities on grammar-compressed strings. Inf. Comput. 240: 74-89 (2015) - 2013
- [c9]Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
Detecting Regularities on Grammar-Compressed Strings. MFCS 2013: 571-582 - [i3]Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara:
Detecting regularities on grammar-compressed strings. CoRR abs/1304.7067 (2013) - 2010
- [j4]Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara:
An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs. Chic. J. Theor. Comput. Sci. 2010 (2010) - [c8]Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Inferring Strings from Runs. Stringology 2010: 150-160 - [c7]Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson:
The Number of Runs in a Ternary Word. Stringology 2010: 178-181
2000 – 2009
- 2009
- [j3]Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara
Average Value of Sum of Exponents of Runs in a String. Int. J. Found. Comput. Sci. 20(6): 1135-1146 (2009) - [j2]Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara
Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theor. Comput. Sci. 410(8-10): 900-913 (2009) - [c6]Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara:
Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program. CATS 2009: 19-28 - [c5]Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara
A Series of Run-Rich Strings. LATA 2009: 578-587 - [c4]Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Bit-parallel Algorithms for Computing all the Runs in a String. Stringology 2009: 203-213 - 2008
- [c3]Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara
Computing Longest Common Substring and All Palindromes from Compressed Strings. SOFSEM 2008: 364-375 - [c2]Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara:
New Lower Bounds for the Maximum Number of Runs in a String. Stringology 2008: 140-145 - [c1]Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Average Value of Sum of Exponents of Runs in Strings. Stringology 2008: 185-192 - [i2]Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara:
An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program. Structure-Based Compression of Complex Massive Data 2008 - [i1]Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Hideo Bannai, Ayumi Shinohara:
New Lower Bounds for the Maximum Number of Runs in a String. CoRR abs/0804.1214 (2008) - 2006
- [j1]Koichi Maezawa, Mario Sakou, Wataru Matsubara, Takashi Mizutani:
Dual-clock MASH delta-sigma modulator employing a frequency modulated intermediate signal. IEICE Electron. Express 3(21): 459-463 (2006)
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-04-24 23:03 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: