default search action
Kazuyuki Narisawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j5]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)
2010 – 2019
- 2019
- [j4]Diptarama Hendrian
Permuted Pattern Matching Algorithms on Multi-Track Strings. Algorithms 12(4): 73 (2019) - 2017
- [j3]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) - [c19]Diptarama
Position Heaps for Parameterized Strings. CPM 2017: 8:1-8:13 - [c18]Yohei Ueki, Diptarama
Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings. SOFSEM 2017: 363-374 - [c17]Shintaro Narisada, Diptarama
Computing Longest Single-arm-gapped Palindromes in a String. SOFSEM 2017: 375-386 - [i4]Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara:
Position Heaps for Parameterized Strings. CoRR abs/1702.02321 (2017) - 2016
- [c16]Shumpei Sakuma, Kazuyuki Narisawa, Ayumi Shinohara
Generalization of Efficient Implementation of Compression by Substring Enumeration. DCC 2016: 630 - [c15]Diptarama, Yohei Ueki, Kazuyuki Narisawa, Ayumi Shinohara:
KMP Based Pattern Matching Algorithms for Multi-Track Strings. SOFSEM (Student Research Forum Papers / Posters) 2016: 100-107 - [c14]Yohei Ueki, Kazuyuki Narisawa, Ayumi Shinohara:
A Fast Order-Preserving Matching with q-neighborhood Filtration Using SIMD Instructions. SOFSEM (Student Research Forum Papers / Posters) 2016: 108-115 - [i3]Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara:
Computing longest single-arm-gapped palindromes in a string. CoRR abs/1609.03000 (2016) - [i2]Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara:
Longest Common Subsequence in at Least k Length Order-isomorphic Substrings. CoRR abs/1609.03668 (2016) - 2015
- [j2]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) - [j1]Heikki Hyyrö, Kazuyuki Narisawa, Shunsuke Inenaga:
Dynamic edit distance table under a general weighted cost function. J. Discrete Algorithms 34: 2-17 (2015) - [c13]Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara:
Position Heaps for Permuted Pattern Matching on Multi-Track String. SOFSEM (Student Research Forum Papers / Posters) 2015: 41-53 - 2014
- [c12]Yusuke Sato, Kazuyuki Narisawa, Ayumi Shinohara
A Simple Classification Method for Class Imbalanced Data using the Kernel Mean. KDIR 2014: 327-334 - [c11]Kouta Oguni, Kazuyuki Narisawa, Ayumi Shinohara
Reducing Sample Complexity in Reinforcement Learning by Transferring Transition and Reward Probabilities. ICAART (1) 2014: 632-638 - [c10]Tomoki Komatsu, Ryosuke Okuta, Kazuyuki Narisawa, Ayumi Shinohara
Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints. SOFSEM 2014: 363-374 - 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 - [c8]Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara
Permuted Pattern Matching on Multi-track Strings. SOFSEM 2013: 280-291 - [c7]Kazuhiko Kusano, Kazuyuki Narisawa, Ayumi Shinohara:
On Morphisms Generating Run-Rich Strings. Stringology 2013: 35-47 - [i1]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) - 2012
- [c6]Junya Saito, Kazuyuki Narisawa, Ayumi Shinohara:
Prediction for Control Delay on Reinforcement Learning. ICAART (1) 2012: 579-586 - [c5]Kazuhiko Kusano, Kazuyuki Narisawa, Ayumi Shinohara
Computing Maximum Number of Runs in Strings. SPIRE 2012: 318-329 - 2010
- [c4]Heikki Hyyrö, Kazuyuki Narisawa, Shunsuke Inenaga:
Dynamic Edit Distance Table under a General Weighted Cost Function. SOFSEM 2010: 515-527
2000 – 2009
- 2008
- [c3]Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda:
String Kernels Based on Variable-Length-Don't-Care Patterns. Discovery Science 2008: 308-318 - 2007
- [c2]Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Computation of Substring Equivalence Classes with Suffix Arrays. CPM 2007: 340-351 - [c1]Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda:
Unsupervised Spam Detection Based on String Alienness Measures. Discovery Science 2007: 161-172
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-25 05:48 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: