Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Wataru Matsubara

dblp:26/1920 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithms and data structures · 87% Coding theory · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithms and data structures › sequence algorithms › string algorithms › string compression
grammar-compressed strings		 0.212015
Detecting regularities on grammar-compressed strings · Inf. Comput. 2015
Algorithms and data structures › sequence algorithms
string algorithms		 0.212015
Detecting regularities on grammar-compressed strings · Inf. Comput. 2015
Coding theory › source coding
grammar-based compression		 0.112015
Detecting regularities on grammar-compressed strings · Inf. Comput. 2015

Methods — techniques the papers use, named apart from their topics

regularity detection · 0.2pattern matching · 0.2
YearPublicationVenuePosition
2015 Detecting regularities on grammar-compressed strings
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
 Inf. Comput.2
2013 Detecting Regularities on Grammar-Compressed Strings
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
 MFCS2
2009 A Series of Run-Rich Strings
Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara
 LATA1
2009 Efficient algorithms to compute compressed longest common substrings and compressed palindromes
Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto
 Theor. Comput. Sci.1
2008 Computing Longest Common Substring and All Palindromes from Compressed Strings
Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto
 SOFSEM1