Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKeisuke Goto 0001
Person information
- affiliation: Fujitsu Laboratories Ltd., Kawasaki, Japan
- affiliation (PhD 2014): Kyushu University, Department of Informatics, Japan
Other persons with the same name
- Keisuke Goto 0002 — Osaka University, Graduate School of Information Science and Technology, Japan
- Keisuke Goto 0003 — Yamagata University, Japan
- Keisuke Goto 0004 — Toyohashi University of Technology, Japan
- Keisuke Goto 0005 — Gifu University, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i18]Hideo Bannai, Keisuke Goto, Shunsuke Kanda, Dominik Köppl:
NP-Completeness for the Space-Optimality of Double-Array Tries. CoRR abs/2403.04951 (2024)- 2023
- [i17]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) - 2022
- [j4]Takashi Katoh, Keisuke Goto:
In-place initializable arrays. Theor. Comput. Sci. 916: 62-69 (2022) - [c20]Hirofumi Suzuki, Hiroaki Iwashita, Takuya Takagi, Keisuke Goto, Yuta Fujishige, Satoshi Hara:
Explainable and Local Correction of Classification Models Using Decision Trees. AAAI 2022: 8404-8413 - [c19]Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto:
Computing NP-Hard Repetitiveness Measures via MAX-SAT. ESA 2022: 12:1-12:16 - [i16]Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto:
Computing NP-hard Repetitiveness Measures via MAX-SAT. CoRR abs/2207.02571 (2022) - 2021
- [j3]Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto:
Re-Pair in Small Space. Algorithms 14(1): 5 (2021) - 2020
- [c18]Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto:
Re-Pair in Small Space. DCC 2020: 377 - [c17]Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto:
Re-Pair in Small Space. Stringology 2020: 134-147 - [i15]Hiroaki Iwashita, Takuya Takagi, Hirofumi Suzuki, Keisuke Goto, Kotaro Ohori, Hiroki Arimura:
Efficient Constrained Pattern Mining Using Dynamic Item Ordering for Explainable Classification. CoRR abs/2004.08015 (2020)
2010 – 2019
- 2019
- [c16]Kensuke Sakai, Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
RePair in Compressed Space and Time. DCC 2019: 518-527 - [c15]Keisuke Goto:
Optimal Time and Space Construction of Suffix Arrays and LCP Arrays for Integer Alphabets. Stringology 2019: 111-125 - [i14]Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto:
Re-Pair In-Place. CoRR abs/1908.04933 (2019) - 2018
- [c14]Koji Maruhashi, Masaru Todoriki, Takuya Ohwa, Keisuke Goto, Yu Hasegawa, Hiroya Inakoshi, Hirokazu Anai:
Learning Multi-Way Relations via Tensor Decomposition With Neural Networks. AAAI 2018: 3770-3777 - [c13]Naoki Hamada, Keisuke Goto:
Data-driven analysis of pareto set topology. GECCO 2018: 657-664 - [c12]Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression. IWOCA 2018: 323-335 - [c11]Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga:
Block Palindromes: A New Generalization of Palindromes. SPIRE 2018: 183-190 - [i13]Naoki Hamada, Keisuke Goto:
Data-Driven Analysis of Pareto Set Topology. CoRR abs/1804.07179 (2018) - [i12]Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga:
Block Palindromes: A New Generalization of Palindromes. CoRR abs/1806.00198 (2018) - [i11]Kensuke Sakai, Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
RePair in Compressed Space and Time. CoRR abs/1811.01472 (2018) - 2017
- [c10]Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura:
Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression. SPIRE 2017: 304-316 - [i10]Keisuke Goto:
Optimal Time and Space Construction of Suffix Arrays and LCP Arrays for Integer Alphabets. CoRR abs/1703.01009 (2017) - [i9]Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura:
Linear-size CDAWG: new repetition-aware indexing and grammar compression. CoRR abs/1705.09779 (2017) - [i8]Takashi Katoh, Keisuke Goto:
In-Place Initializable Arrays. CoRR abs/1709.08900 (2017) - 2016
- [j2]Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto:
Closed factorization. Discret. Appl. Math. 212: 23-29 (2016) - [c9]Keisuke Goto, Yuiko Ohta, Hiroya Inakoshi, Nobuhiro Yugami:
Extraction Algorithms for Hierarchical Header Structures from Spreadsheets. EDBT/ICDT Workshops 2016 - 2015
- [c8]Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
An Opportunistic Text Indexing Structure Based on Run Length Encoding. CIAC 2015: 390-402 - [c7]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding. CPM 2015: 219-230 - 2014
- [c6]Keisuke Goto, Hideo Bannai:
Space Efficient Linear Time Lempel-Ziv Factorization for Small Alphabets. DCC 2014: 163-172 - [c5]Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto:
Closed Factorization. Stringology 2014: 162-168 - 2013
- [j1]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Fast q-gram mining on SLP compressed strings. J. Discrete Algorithms 18: 89-99 (2013) - [c4]Keisuke Goto, Hideo Bannai:
Simpler and Faster Lempel Ziv Factorization. DCC 2013: 133-142 - [i7]Keisuke Goto, Hideo Bannai:
Space Efficient Linear Time Lempel-Ziv Factorization on Constant~Size~Alphabets. CoRR abs/1310.1448 (2013) - 2012
- [c3]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. CPM 2012: 220-231 - [c2]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. SOFSEM 2012: 301-312 - [i6]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Speeding-up $q$-gram mining on grammar-based compressed texts. CoRR abs/1202.3311 (2012) - [i5]Keisuke Goto, Hideo Bannai:
Simpler and Faster Lempel Ziv Factorization. CoRR abs/1211.3642 (2012) - 2011
- [c1]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Fast q-gram Mining on SLP Compressed Strings. SPIRE 2011: 278-289 - [i4]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Fast $q$-gram Mining on SLP Compressed Strings. CoRR abs/1103.3114 (2011) - [i3]Keisuke Goto, Shirou Maruyama, Shunsuke Inenaga, Hideo Bannai, Hiroshi Sakamoto, Masayuki Takeda:
Restructuring Compressed Texts without Explicit Decompression. CoRR abs/1107.2729 (2011) - [i2]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Computing q-gram Frequencies on Collage Systems. CoRR abs/1107.3019 (2011) - [i1]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts. CoRR abs/1107.3022 (2011)
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 01:46 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:
