Pureに変更を加えた場合、すぐここに表示されます。

研究成果 2001 2019

11 引用 (Scopus)

A faster algorithm for computing maximal α-gapped repeats in a string

Tanimura, Y., Fujishige, Y., I, T., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2015, String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings. Puglisi, S. J., Iliopoulos, C. S. & Yilmaz, E. (版). Springer Verlag, p. 124-136 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9309).

研究成果: 著書/レポートタイプへの貢献会議での発言

Fast Algorithm
Strings
Computing
3 引用 (Scopus)

A Faster longest common extension algorithm on compressed strings and its applications: (Invited talk)

Inenaga, S., 1 1 2015, Proceedings of the Prague Stringology Conference 2015, PSC 2015. Zd'arek, J. & Holub, J. (版). Prague Stringology Club, p. 1-4 4 p. (Proceedings of the Prague Stringology Conference 2015, PSC 2015).

研究成果: 著書/レポートタイプへの貢献会議での発言

Strings
Straight-line Programs
Data Structures
Query
Grammar
1 引用 (Scopus)

A fully compressed pattern matching algorithm for simple collage systems

Inenaga, S., Shinohara, A. & Takeda, M., 12 1 2005, : : International Journal of Foundations of Computer Science. 16, 6, p. 1155-1166 12 p.

研究成果: ジャーナルへの寄稿記事

Pattern matching
Glossaries
4 引用 (Scopus)

A hardness result and new algorithm for the longest common palindromic subsequence problem

Inenaga, S. & Hyyrö, H., 1 2018, : : Information Processing Letters. 129, p. 11-15 5 p.

研究成果: ジャーナルへの寄稿記事

Longest Common Subsequence
Hardness
Denote
Strings
Distinct
1 引用 (Scopus)

Algorithms and combinatorial properties on shortest unique palindromic substrings

Inoue, H., Nakashima, Y., Mieno, T., Inenaga, S., Bannai, H. & Takeda, M., 9 1 2018, : : Journal of Discrete Algorithms. 52-53, p. 122-132 11 p.

研究成果: ジャーナルへの寄稿記事

Strings
Interval
Query
Palindrome
Optimal Solution

Almost linear time computation of maximal repetitions in run length encoded strings

Fujishige, Y., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., 12 1 2017, 28th International Symposium on Algorithms and Computation, ISAAC 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 巻 92.

研究成果: 著書/レポートタイプへの貢献会議での発言

An anonymous authentication protocol with single-database PIR

Nakamura, T., Inenaga, S., Baba, K., Ikeda, D. & Yasuura, H., 12 1 2011, Information Security 2011 - Proceedings of the Ninth Australasian Information Security Conference, AISC 2011. p. 3-8 6 p. (Conferences in Research and Practice in Information Technology Series; 巻数 116).

研究成果: 著書/レポートタイプへの貢献会議での発言

Authentication
Managers
Communication
4 引用 (Scopus)

An efficient algorithm to test square-freeness of strings compressed by straight-line programs

Bannai, H., Gagie, T., I, T., Inenaga, S., Landau, G. M. & Lewenstein, M., 10 15 2012, : : Information Processing Letters. 112, 19, p. 711-714 4 p.

研究成果: ジャーナルへの寄稿記事

Straight-line Programs
Efficient Algorithms
Strings
Square free
Arbitrary
4 引用 (Scopus)
Context free grammars
Context-free Grammar
Pattern matching
Pattern Matching
Matching Algorithm
23 引用 (Scopus)

A new characterization of maximal repetitions by Lyndon trees

Bannai, H., I, T., Inenaga, S., Nakashima, Y., Takeda, M. & Tsuruta, K., 1 1 2015, Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015. January 版 Association for Computing Machinery, p. 562-571 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; 巻数 2015-January, 番号 January).

研究成果: 著書/レポートタイプへの貢献会議での発言

Strings
Factorization
Linear-time Algorithm
Lyndon Words
Upper bound

A new family of string classifiers based on local relatedness

Higa, Y., Inenaga, S., Bannai, H. & Takeda, M., 2006, Discovery Science - 9th International Conference, DS 2006, Proceedings. Springer Verlag, 巻 4265 LNAI. p. 114-124 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 4265 LNAI).

研究成果: 著書/レポートタイプへの貢献会議での発言

Longest Common Subsequence
Classifiers
Strings
Classifier
String Matching

An identifiable yet unlinkable authentication system with smart cards for multiple services

Nakamura, T., Inenaga, S., Ikeda, D., Baba, K. & Yasuura, H., 5 20 2010, Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings. PART 4 版 p. 236-251 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6019 LNCS, 番号 PART 4).

研究成果: 著書/レポートタイプへの貢献会議での発言

Smart cards
Smart Card
Authentication
Data storage equipment
Hash functions
4 引用 (Scopus)

Anonymous authentication systems based on private information retrieval

Nakamura, T., Inenaga, S., Ikeda, D., Baba, K. & Yasuura, H., 2009, 2009 1st International Conference on Networked Digital Technologies, NDT 2009. p. 53-58 6 p. 5272083

研究成果: 著書/レポートタイプへの貢献会議での発言

Information retrieval
Authentication
Network protocols
Servers
1 引用 (Scopus)

An opportunistic text indexing structure based on run length encoding

Tamakoshi, Y., Goto, K., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2015, Algorithms and Complexity - 9th International Conference, CIAC 2015, Proceedings. Widmayer, P. & Paschos, V. T. (版). Springer Verlag, p. 390-402 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9079).

研究成果: 著書/レポートタイプへの貢献会議での発言

Run-length Encoding
Text Indexing
Data structures
Data Structures
Strings
15 引用 (Scopus)

A practical algorithm to find the best episode patterns

Hirao, M., Inenaga, S., Shinohara, A., Takeda, M. & Arikawa, S., 2001, Discovery Science - 4th International Conference, DS 2001, Proceedings. Springer Verlag, 巻 2226. p. 435-440 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2226).

研究成果: 著書/レポートタイプへの貢献会議での発言

Subsequence
NP-complete problem
Strings
Optimization Problem
Concepts
17 引用 (Scopus)
Introns
Zebrafish
Diptera
Gene Expression
Datasets

Block palindromes: A new generalization of palindromes

Goto, K., I, T., Bannai, H. & Inenaga, S., 1 1 2018, String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Proceedings. Gagie, T., Moffat, A., Cuadros-Vargas, E. & Navarro, G. (版). Springer Verlag, p. 183-190 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 11147 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Palindrome
Strings
Generalization
5 引用 (Scopus)

Closed factorization

Badkobeh, G., Bannai, H., Goto, K., I, T., Iliopoulos, C. S., Inenaga, S., Puglisi, S. J. & Sugimoto, S., 10 30 2016, : : Discrete Applied Mathematics. 212, p. 23-29 7 p.

研究成果: ジャーナルへの寄稿記事

Factorization
Strings
Closed
Sturmian Words
Factorise
4 引用 (Scopus)

Closed factorization

Badkobeh, G., Bannai, H., Goto, K., I, T., Iliopoulos, C. S., Inenaga, S., Puglisi, S. J. & Sugimoto, S., 1 1 2014, Proceedings of the Prague Stringology Conference 2014, PSC 2014. Holub, J. & Zd'arek, J. (版). Prague Stringology Club, p. 162-168 7 p. (Proceedings of the Prague Stringology Conference 2014, PSC 2014).

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Strings
Closed
Sturmian Words
Suffix
5 引用 (Scopus)

Compact directed acyclic word graphs for a sliding window

Inenaga, S., Shinohara, A., Takeda, M. & Arikawa, S., 1 1 2002, String Processing and Information Retrieval - 9th International Symposium, SPIRE 2002, Proceedings. Laender, A. H. F. & Oliveira, A. L. (版). Springer Verlag, p. 310-324 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2476).

研究成果: 著書/レポートタイプへの貢献会議での発言

Suffix Tree
Sliding Window
Data structures
Data Structures
Data compression
7 引用 (Scopus)

Compact directed acyclic word graphs for a sliding window

Inenaga, S., Shinohara, A., Takeda, M. & Arikawa, S., 1 1 2004, : : Journal of Discrete Algorithms. 2, 1 SPEC. ISS., p. 33-51 19 p.

研究成果: ジャーナルへの寄稿記事

Suffix Tree
Sliding Window
Data structures
Data Structures
Data compression
2 引用 (Scopus)

Compacting a dynamic edit distance table by RLE compression

Hyyrö, H. & Inenaga, S., 1 1 2016, SOFSEM 2016: Theory and Practice of Computer Science - 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Freivalds, R. M., Engels, G. & Catania, B. (版). Springer Verlag, p. 302-313 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9587).

研究成果: 著書/レポートタイプへの貢献会議での発言

Edit Distance
Table
Compression
Strings
Time Complexity
2 引用 (Scopus)

Composite pattern discovery for PCR application

Angelov, S. & Inenaga, S., 12 1 2005, String Processing and Information Retrieval - 12th International Conference, SPIRE 2005, Proceedings. p. 167-178 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 3772 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Pattern Discovery
Composite
Composite materials
Genome
Genes

Compressed automata for dictionary matching

I, T., Nishimoto, T., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2013, Implementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings. Springer Verlag, p. 319-330 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7982).

研究成果: 著書/レポートタイプへの貢献会議での発言

Glossaries
Automata
Matching Problem
Dictionary
5 引用 (Scopus)

Compressed automata for dictionary matching

I, T., Nishimoto, T., Inenaga, S., Bannai, H. & Takeda, M., 5 1 2015, : : Theoretical Computer Science. 578, p. 30-41 12 p.

研究成果: ジャーナルへの寄稿記事

Glossaries
Automata
Straight-line Programs
Matching Problem
Dictionary
3 引用 (Scopus)

Computing Abelian covers and Abelian runs

Matsuda, S., Inenaga, S., Bannai, H. & Takeda, M., 2014, Proceedings of the Prague Stringology Conference 2014, PSC 2014. Prague Stringology Club, p. 43-51 9 p.

研究成果: 著書/レポートタイプへの貢献会議での発言

Strings
Cover
Computing
Permutation
Regularity
1 引用 (Scopus)

Computing abelian string regularities based on RLE

Sugimoto, S., Noda, N., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2018, Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers. Smyth, W. F., Brankovic, L. & Ryan, J. (版). Springer Verlag, p. 420-431 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 10765 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Run-length Encoding
Strings
Regularity
Computing
Permutation
3 引用 (Scopus)

Computing all distinct squares in linear time for integer alphabets

Bannai, H., Inenaga, S. & Köppl, D., 7 1 2017, 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017. Radoszewski, J., Karkkainen, J., Radoszewski, J. & Rytter, W. (版). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 22. (Leibniz International Proceedings in Informatics, LIPIcs; 巻数 78).

研究成果: 著書/レポートタイプへの貢献会議での発言

Topology
4 引用 (Scopus)

Computing convolution on grammar-compressed text

Tanaka, T., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2013, Proceedings - DCC 2013: 2013 Data Compression Conference. Institute of Electrical and Electronics Engineers Inc., p. 451-460 10 p. 6543081. (Data Compression Conference Proceedings).

研究成果: 著書/レポートタイプへの貢献会議での発言

Convolution
Context free grammars
Fast Fourier transforms
Redundancy
7 引用 (Scopus)

Computing DAWGs and minimal absent words in linear time for integer alphabets

Fujishige, Y., Tsujimaru, Y., Inenaga, S., Bannai, H. & Takeda, M., 8 1 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 巻 58. 38

研究成果: 著書/レポートタイプへの貢献会議での発言

Polynomials

Computing left-right maximal generic words

Nishimoto, T., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2015, Proceedings of the Prague Stringology Conference 2015, PSC 2015. Zd'arek, J. & Holub, J. (版). Prague Stringology Club, p. 5-16 12 p. (Proceedings of the Prague Stringology Conference 2015, PSC 2015).

研究成果: 著書/レポートタイプへの貢献会議での発言

Computing
Data Structures
Distinct
Word problem

Computing longest common square subsequences

Inoue, T., Inenaga, S., Hyyrö, H., Bannai, H. & Takeda, M., 5 1 2018, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. Zhu, B., Navarro, G. & Sankoff, D. (版). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 151-1513 1363 p. (Leibniz International Proceedings in Informatics, LIPIcs; 巻数 105).

研究成果: 著書/レポートタイプへの貢献会議での発言

Computing longest common substring/subsequence of non-linear texts

Shimohira, K., Inenaga, S., Bannai, H. & Takeda, M., 12 1 2011, Proceedings of the Prague Stringology Conference 2011. p. 197-208 12 p. (Proceedings of the Prague Stringology Conference 2011).

研究成果: 著書/レポートタイプへの貢献会議での発言

Longest Common Subsequence
Computing
Directed Graph
Arc of a curve
Strings
5 引用 (Scopus)

Computing longest common substring and all palindromes from compressed strings

Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T. & Hashimoto, K., 2008, SOFSEM 2008: Theory and Practice of Computer Science - 34th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. 巻 4910 LNCS. p. 364-375 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 4910 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Straight-line Programs
Palindrome
Strings
Polynomials
Computing
4 引用 (Scopus)

Computing longest single-arm-gapped palindromes in a string

Narisada, S., Diptarama, Narisawa, K., Inenaga, S. & Shinohara, A., 1 1 2017, SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. & Steffen, B. (版). Springer Verlag, p. 375-386 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 10139 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Palindrome
Strings
Computing
Suffix Array
Experiments
19 引用 (Scopus)

Computing palindromic factorizations and palindromic covers on-line

I, T., Sugimoto, S., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2014, Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings. Springer Verlag, p. 150-161 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8486).

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Prefix
Cover
Computing
Strings
1 引用 (Scopus)

Computing q-gram non-overlapping frequencies on SLP compressed texts

Goto, K., Bannai, H., Inenaga, S. & Takeda, M., 1 25 2012, SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. 巻 7147 LNCS. p. 301-312 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7147 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Straight-line Programs
Data mining
Learning systems
Computing
Data Mining
1 引用 (Scopus)

Computing reversed Lempel-Ziv factorization online

Sugimoto, S., I, T., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2013, Proceedings of the Prague Stringology Conference 2013, PSC 2013. Prague Stringology Club, p. 107-118 12 p. (Proceedings of the Prague Stringology Conference 2013, PSC 2013).

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Computing
Computer Science
Strings

Computing runs on a trie

Sugahara, R., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., 6 1 2019, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. Pisanti, N. & Pissis, S. P. (版). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 23. (Leibniz International Proceedings in Informatics, LIPIcs; 巻数 128).

研究成果: 著書/レポートタイプへの貢献会議での発言

5 引用 (Scopus)

Constructing LZ78 tries and position heaps in linear time for large alphabets

Nakashima, Y., I, T., Inenaga, S., Bannai, H. & Takeda, M., 9 1 2015, : : Information Processing Letters. 115, 9, p. 655-659 5 p.

研究成果: ジャーナルへの寄稿記事

Heap
Linear Time
Strings
Factorization
Suffix Tree
6 引用 (Scopus)

Converting SLP to LZ78 in almost linear time

Bannai, H., Gawrychowski, P., Inenaga, S. & Takeda, M., 9 24 2013, Combinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Proceedings. p. 38-49 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7922 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Data structures
Linear Time
Labels
Straight-line Programs
15 引用 (Scopus)

Counting and verifying maximal palindromes

I, T., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2010, String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings. Springer Verlag, p. 135-146 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6393).

研究成果: 著書/レポートタイプへの貢献会議での発言

Palindrome
Counting
Strings
Distinct
Linear-time Algorithm
24 引用 (Scopus)

Counting parameterized border arrays for a binary alphabet

I, T., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2009, Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings. Springer Verlag, p. 422-433 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5457).

研究成果: 著書/レポートタイプへの貢献会議での発言

Counting
Binary
Pattern matching
Pattern Matching
Matching Problem
2 引用 (Scopus)

Detecting regularities on grammar-compressed strings

I, T., Matsubara, W., Shimohira, K., Inenaga, S., Bannai, H., Takeda, M., Narisawa, K. & Shinohara, A., 1 1 2013, Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings. Springer Verlag, p. 571-582 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8087).

研究成果: 著書/レポートタイプへの貢献会議での発言

Straight-line Programs
Grammar
Strings
Regularity
Palindrome
7 引用 (Scopus)

Detecting regularities on grammar-compressed strings

I, T., Matsubara, W., Shimohira, K., Inenaga, S., Bannai, H., Takeda, M., Narisawa, K. & Shinohara, A., 2 1 2015, : : Information and Computation. 240, p. 74-89 16 p.

研究成果: ジャーナルへの寄稿記事

Straight-line Programs
Grammar
Strings
Regularity
Context free grammars
4 引用 (Scopus)

Deterministic sub-linear space LCE data structures with efficient construction

Tanimura, Y., I, T., Bannai, H., Inenaga, S., Puglisi, S. J. & Takeda, M., 6 1 2016, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. Grossi, R. & Lewenstein, M. (版). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1.1-1.10 (Leibniz International Proceedings in Informatics, LIPIcs; 巻数 54).

研究成果: 著書/レポートタイプへの貢献会議での発言

Data structures
Sorting
Processing
11 引用 (Scopus)

Discovering best variable-length-don’t-care patterns

Inenaga, S., Bannai, H., Shinohara, A., Takeda, M. & Arikawa, S., 1 1 2002, Discovery Science - 5th International Conference, DS 2002, Proceedings. Smith, C. H., Lange, S. & Satoh, K. (版). Springer Verlag, p. 86-97 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2534).

研究成果: 著書/レポートタイプへの貢献会議での発言

Strings
Pattern matching
Pruning
Heuristics
Pattern Matching
14 引用 (Scopus)
Pattern matching
Strings
Pattern Matching
Pruning
Class
7 引用 (Scopus)

Diverse palindromic factorization is NP-complete

Bannai, H., Gagie, T., Inenaga, S., Kärkkäinen, J., Kempa, D., Piątkowski, M., Puglisi, S. J. & Sugimoto, S., 1 1 2015, Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings. Potapov, I. (版). Springer Verlag, p. 85-96 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9168).

研究成果: 著書/レポートタイプへの貢献会議での発言

Palindrome
Factorization
NP-complete problem
Strings
1 引用 (Scopus)

Diverse Palindromic Factorization is NP-Complete

Bannai, H., Gagie, T., Inenaga, S., Kärkkäinen, J., Kempa, D., Piakowski, M. & Sugimoto, S., 2 1 2018, : : International Journal of Foundations of Computer Science. 29, 2, p. 143-163 21 p.

研究成果: ジャーナルへの寄稿記事

Factorization