No photo of 俊介 稲永

View Scopus Profile

Shunsuke Inenaga

Professor

Calculated based on number of publications stored in Pure and citations from Scopus
20012025

Research activity per year

Search results

  • 2013

    Computing reversed Lempel-Ziv factorization online

    Sugimoto, S., I, T., Inenaga, S., Bannai, H. & Takeda, M., 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).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    1 Citation (Scopus)

  • Converting SLP to LZ78 in almost linear time

    Bannai, H., Gawrychowski, P., Inenaga, S. & Takeda, M., 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); vol. 7922 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    8 Citations (Scopus)

  • Detecting regularities on grammar-compressed strings

    I, T., Matsubara, W., Shimohira, K., Inenaga, S., Bannai, H., Takeda, M., Narisawa, K. & Shinohara, A., 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); vol. 8087).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    2 Citations (Scopus)

  • Efficient Lyndon factorization of grammar compressed text

    I, T., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., 2013, Combinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Proceedings. Springer Verlag, p. 153-164 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7922).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    7 Citations (Scopus)

  • Faster lyndon factorization algorithms for SLP and LZ78 compressed text

    I, T., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., 2013, String Processing and Information Retrieval - 20th International Symposium, SPIRE 2013, Proceedings. Springer Verlag, p. 174-185 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8214).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    8 Citations (Scopus)

  • Fast q-gram mining on SLP compressed strings

    Goto, K., Bannai, H., Inenaga, S. & Takeda, M., Jan 2013, In: Journal of Discrete Algorithms. 18, p. 89-99 11 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    15 Citations (Scopus)

  • Foreword

    Inenaga, S. & Martín-Vide, C., 2013, In: International Journal of Computer Mathematics. 90, 6, p. 1129-1131 3 p.

    Research output: Contribution to journal › Editorial › peer-review

  • From run length encoding to LZ78 and back again

    Tamakoshi, Y., I, T., Inenaga, S., Bannai, H. & Takeda, M., 2013, Proceedings - DCC 2013: 2013 Data Compression Conference. Institute of Electrical and Electronics Engineers Inc., p. 143-152 10 p. 6543050. (Data Compression Conference Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    8 Citations (Scopus)

  • Palindrome pattern matching

    I, T., Inenaga, S. & Takeda, M., Apr 29 2013, In: Theoretical Computer Science. 483, p. 162-170 9 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    18 Citations (Scopus)

  • Permuted pattern matching on multi-track strings

    Katsura, T., Narisawa, K., Shinohara, A., Bannai, H. & Inenaga, S., 2013, SOFSEM 2013: Theory and Practice of Computer Science - 39th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. p. 280-291 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7741 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    6 Citations (Scopus)
  • 2012

    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., Oct 15 2012, In: Information Processing Letters. 112, 19, p. 711-714 4 p.

    Research output: Contribution to journal › Article › peer-review

    5 Citations (Scopus)

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

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

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    2 Citations (Scopus)

  • Efficient LZ78 factorization of grammar compressed text

    Bannai, H., Inenaga, S. & Takeda, M., 2012, String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. Springer Verlag, p. 86-98 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7608 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    16 Citations (Scopus)

  • Finding characteristic substrings from compressed texts

    Inenaga, S. & Bannai, H., Feb 2012, In: International Journal of Foundations of Computer Science. 23, 2, p. 261-280 20 p.

    Research output: Contribution to journal › Article › peer-review

    3 Citations (Scopus)

  • Speeding up q-gram mining on grammar-based compressed texts

    Goto, K., Bannai, H., Inenaga, S. & Takeda, M., 2012, Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Proceedings. p. 220-231 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7354 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    7 Citations (Scopus)

  • The position heap of a trie

    Nakashima, Y., I, T., Inenaga, S., Bannai, H. & Takeda, M., 2012, String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. Springer Verlag, p. 360-371 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7608 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    8 Citations (Scopus)
  • 2011

    An anonymous authentication protocol with single-database PIR

    Nakamura, T., Inenaga, S., Baba, K., Ikeda, D. & Yasuura, H., 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; vol. 116).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Computing longest common substring/subsequence of non-linear texts

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

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Faster subsequence and don't-care pattern matching on compressed texts

    Yamamoto, T., Bannai, H., Inenaga, S. & Takeda, M., 2011, Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Proceedings. p. 309-322 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6661 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    17 Citations (Scopus)

  • Fast q-gram mining on SLP compressed strings

    Goto, K., Bannai, H., Inenaga, S. & Takeda, M., 2011, String Processing and Information Retrieval - 18th International Symposium, SPIRE 2011, Proceedings. p. 278-289 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7024 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    9 Citations (Scopus)

  • Inferring strings from suffix trees and links on a binary alphabet

    I, T., Inenaga, S., Bannai, H. & Takeda, M., 2011, Proceedings of the Prague Stringology Conference 2011. Prague Stringology Club, p. 121-130 10 p. (Proceedings of the Prague Stringology Conference 2011).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    5 Citations (Scopus)

  • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

    Dediu, A. H., Inenaga, S. & Martín-Vide, C., 2011, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6638 LNCS, p. VI

    Research output: Contribution to journal › Editorial › peer-review

    Open Access

  • Missing pattern discovery

    Angelov, S., Inenaga, S., Kivioja, T. & Mäkinen, V., Jun 2011, In: Journal of Discrete Algorithms. 9, 2, p. 153-165 13 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access

  • Palindrome pattern matching

    I, T., Inenaga, S. & Takeda, M., 2011, Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Proceedings. Springer Verlag, p. 232-245 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6661).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    6 Citations (Scopus)

  • Password based anonymous authentication with private information retrieval

    Nakamura, T., Inenaga, S., Ikeda, D., Baba, K. & Yasuura, H., Apr 2011, In: Journal of Digital Information Management. 9, 2, p. 72-78 7 p.

    Research output: Contribution to journal › Article › peer-review

  • Preface

    Dediu, A. H., Inenaga, S. & Martín-Vide, C., 2011, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6638 LNCS, p. 1-21 21 p.

    Research output: Contribution to journal › Editorial › peer-review

  • Verifying and enumerating parameterized border arrays

    I, T., Inenaga, S., Bannai, H. & Takeda, M., Nov 25 2011, In: Theoretical Computer Science. 412, 50, p. 6959-6981 23 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    17 Citations (Scopus)
  • 2010

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

    Nakamura, T., Inenaga, S., Ikeda, D., Baba, K. & Yasuura, H., 2010, Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings. PART 4 ed. Springer Verlag, p. 236-251 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6019 LNCS, no. PART 4).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Counting and verifying maximal palindromes

    I, T., Inenaga, S., Bannai, H. & Takeda, M., 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); vol. 6393).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    19 Citations (Scopus)

  • Dynamic edit distance table under a general weighted cost function

    Hyyrö, H., Narisawa, K. & Inenaga, S., 2010, SOFSEM 2010: Theory and Practice of Computer Science - 36th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. p. 515-527 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5901 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    3 Citations (Scopus)

  • Verifying a parameterized border array in O(n1.5) time

    I, T., Inenaga, S., Bannai, H. & Takeda, M., 2010, Combinatorial Pattern Matching - 21st Annual Symposium, CPM 2010, Proceedings. Springer Verlag, p. 238-250 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6129).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    13 Citations (Scopus)
  • 2009

    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. (2009 1st International Conference on Networked Digital Technologies, NDT 2009).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    5 Citations (Scopus)

  • Counting parameterized border arrays for a binary alphabet

    I, T., Inenaga, S., Bannai, H. & Takeda, M., 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); vol. 5457).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    26 Citations (Scopus)

  • Efficient algorithms to compute compressed longest common substrings and compressed palindromes

    Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T. & Hashimoto, K., Mar 1 2009, In: Theoretical Computer Science. 410, 8-10, p. 900-913 14 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    60 Citations (Scopus)

  • Finding characteristic substrings from compressed texts

    Inenaga, S. & Bannai, H., 2009, Proceedings of the Prague Stringology Conference 2009. p. 40-54 15 p. (Proceedings of the Prague Stringology Conference 2009).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    5 Citations (Scopus)

  • Lightweight parameterized suffix array construction

    I, T., Deguchi, S., Bannai, H., Inenaga, S. & Takeda, M., 2009, Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers. Springer Verlag, p. 312-323 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5874).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    22 Citations (Scopus)

  • Linear-Time text compression by longest-first substitution

    Nakamura, R., Inenaga, S., Bannai, H., Funamoto, T., Takeda, M. & Shinohara, A., Dec 2009, In: Algorithms. 2, 4, p. 1429-1448 20 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    16 Citations (Scopus)

  • Testing square-freeness of strings compressed by balanced straight line program

    Matsubara, W., Inenaga, S. & Shinohara, A., 2009, Theory of Computing 2009 - Proceedings of the Fifteenth Computing: The Australasian Theory Symposium, CATS 2009. (Conferences in Research and Practice in Information Technology Series; vol. 94).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    1 Citation (Scopus)

  • Towards modeling stored-value electronic money systems

    Inenaga, S., Oyama, K. & Yasuura, H., 2009, 2009 World Congress on Nature and Biologically Inspired Computing, NABIC 2009 - Proceedings. p. 902-907 6 p. 5393854. (2009 World Congress on Nature and Biologically Inspired Computing, NABIC 2009 - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    1 Citation (Scopus)
  • 2008

    An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program

    Matsubara, W., Inenaga, S. & Shinohara, A., 2008, In: Dagstuhl Seminar Proceedings. 8261

    Research output: Contribution to journal › Conference article › peer-review

  • 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. Springer Verlag, p. 364-375 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4910 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    6 Citations (Scopus)

  • Parameterized suffix arrays for binary strings

    Deguchi, S., Higashijima, F., Bannai, H., Inenaga, S. & Takeda, M., 2008, Proceedings of the Prague Stringology Conference 2008. p. 84-94 11 p. (Proceedings of the Prague Stringology Conference 2008).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    31 Citations (Scopus)

  • Reachability on suffix tree graphs

    Higa, Y., Bannai, H., Inenaga, S. & Takeda, M., Feb 2008, In: International Journal of Foundations of Computer Science. 19, 1, p. 147-162 16 p.

    Research output: Contribution to journal › Article › peer-review

  • String Kernels based on variable-length-don't-care patterns

    Narisawa, K., Bannai, H., Hatano, K., Inenaga, S. & Takeda, M., 2008, Discovery Science - 11th International Conference, DS 2008, Proceedings. Springer Verlag, p. 308-318 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5255 LNAI).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 2007

    Efficient computation of substring equivalence classes with suffix arrays

    Narisawa, K., Inenaga, S., Bannai, H. & Takeda, M., 2007, Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings. Springer Verlag, p. 340-351 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4580 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    17 Citations (Scopus)
  • 2006

    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, p. 114-124 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4265 LNAI).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • On-line linear-time construction of word suffix trees

    Inenaga, S. & Takeda, M., 2006, Combinatorial Pattern Matching - 17th Annual Symposium, CPM 2006, Proceedings. Springer Verlag, p. 60-71 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4009 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    17 Citations (Scopus)

  • Reachability on suffix tree graphs

    Higa, Y., Bannai, H., Inenaga, S. & Takeda, M., 2006, Proceedings of the Prague Stringology Conference '06. p. 212-225 14 p. (Proceedings of the Prague Stringology Conference '06).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Sparse compact directed acyclic word graphs

    Inenaga, S. & Takeda, M., 2006, Proceedings of the Prague Stringology Conference '06. p. 197-211 15 p. (Proceedings of the Prague Stringology Conference '06).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    4 Citations (Scopus)

  • Sparse directed acyclic word graphs

    Inenaga, S. & Takeda, M., 2006, String Processing and Information Retrieval - 13th International Conference, SPIRE 2006, Proceedings. Springer Verlag, p. 61-73 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4209 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    4 Citations (Scopus)