中島祐人(Yuto Nakashima)

所属

    • 九州大学 大学院システム情報科学研究院 情報学部門 数理情報講座 助教
    • 文字列情報学研究室 [竹田・坂内・稲永研究室]

略歴

    • 2017.04-現在 九州大学 大学院システム情報科学研究院 情報学部門 助教
    • 2017.03 九州大学 大学院システム情報科学府 情報学専攻 博士後期課程 修了(博士(情報科学))
    • 2014.03 九州大学 大学院システム情報科学府 情報学専攻 修士課程 修了
    • 2012.03 九州大学 理学部 物理学科(情報理学コース) 卒業
    • 2008.03 愛知県立時習館高等学校 卒業

研究テーマ

    • 文字列処理アルゴリズム
    • 文字列組み合わせ論

国際学術雑誌(査読あり)

    1. Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Algorithms and combinatorial properties on shortest unique palindromic substrings. Journal of Discrete Algorithms, Vol. 52-53 122-132 (2018).
    2. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, and Kazuya Tsuruta. The "Runs" Theorem. SIAM Journal of Computing, Vol. 46 (5) 1501-1514 (2017).
    3. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Inferring Strings from Lyndon Factorization. Theoretical Computer Science 689, 147-156 (2017).
    4. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. Theoretical Computer Science 656, part B:215-224 (2016).
    5. Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Constructing LZ78 tries and position heaps in linear time for large alphabets. Information Processing Letters 115(9):655-659 (2015).

国際会議録(査読あり)

    1. Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Takuya Kida. MR-RePair: Grammar Compression based on Maximal Repeats. In Proceedings of the Data Compression Conference 2019 (DCC 2019), to appear.
    2. Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. The Parameterized Position Heap of a Trie. In Proceedings of 11th International Conference on Algorithms and Complexity (CIAC 2019), to appear.
    3. Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Recovering, counting and enumerating strings from forward and backward suffix arrays. In Proceedings of the 25th International Symposium on String Processing and Information Retrieval (SPIRE 2018), LNCS 11147 : 254-267 (2018).
    4. Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Right-to-left online construction of parameterized position heaps. In Proceedings of the Prague Stringology Conference 2018 (PSC 2018), 91-102 (2018).
    5. Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. O(n log n)-time text compression by LZ-style longest first substitution. In Proceedings of the Prague Stringology Conference 2018 (PSC 2018), 12-26 (2018).
    6. Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Faster Online Elastic Degenerate String Matching. In Proceedings of the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), LIPICS Vol.105, 9:1--9:10 (2018).
    7. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Longest substring palindrome after edit. In Proceedings of the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), LIPICS Vol.105, 12:1--12:14 (2018).
    8. Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Longest Lyndon Substring After Edit. In Proceedings of the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), LIPICS Vol.105, 19:1--19:10 (2018).
    9. Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Lyndon Factorization of Grammar Compressed Texts Revisited. In Proceedings of the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), LIPICS Vol.105, 24:1--24:10 (2018).
    10. Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Almost linear time computation of maximal repetitions in run length encoded strings. In Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), 33:1--33:12 (2017).
    11. Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. On Reverse Engineering the Lyndon Tree. In Proceedings of the Prague Stringology Conference 2017 (PSC 2017), 108-117 (2017).
    12. Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Shortest Unique Palindromic Substring Queries in Optimal Time. In Proceedings of the 28th International Workshop on Combinatorial Algorithms (IWOCA 2017), LNCS 10765:397-408 (2018).
    13. Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, and Arseny M. Shur. On the Size of Lempel-Ziv and Lyndon Factorizations. In Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), LIPIcs:45:1--45:13 (2017).
    14. Golnaz Badkobeh, Travis Gagie, Szymon Grabowski, Yuto Nakashima, Simon J. Puglisi, and Shiho Sugimoto. Longest Common Abelian Factors and Large Alphabets. In Proceedings of the 23th International Symposium on String Processing and Information Retrieval (SPIRE 2016), LNCS 9954:254-259 (2016).
    15. Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Computing Smallest and Largest Repetition Factorizations in O(n log n) time. In Proceedings of the Prague Stringology Conference 2016 (PSC 2016), 135-145 (2016).
    16. Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Computing Left-Right Maximal Generic Words. In Proceedings of the Prague Stringology Conference 2015 (PSC 2015), 5-16 (2015).
    17. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, and Kazuya Tsuruta. A New Characterization of Maximal Repetitions by Lyndon Trees. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), 562-571 (2015).
    18. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Inferring Strings from Lyndon Factorization. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), LNCS 8635:565-576 (2014).
    19. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. In Proceedings of the 20th International Symposium on String Processing and Information Retrieval (SPIRE 2013), LNCS 8214:174-185 (2013).
    20. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Efficient Lyndon Factorization of Grammar Compressed Text. In Proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), LNCS 7922:153-164, (2013).
    21. Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. The position heap of a trie. In Proceedings of the 19th International Symposium on String Processing and Information Retrieval (SPIRE 2012), LNCS 7608:360-371 (2012).

講演等

    • 国外学会発表等はこちら(準備中)
    • 国内学会発表はこちら

招待講演

    • 中島祐人. Lyndon 文字列とテキスト圧縮. 2018年電子情報通信学会総合大会 COMP-ELC学生シンポジウム(2018.03)

受賞

    • EATCS/LA Student Presentation Award. 冬のLAシンポジウム2016(2017.02).
    • EATCS/LA Student Presentation Award. 冬のLAシンポジウム2014(2015.01).

外部資金

    • 2018-2020年度 科研費/若手研究
    • 2017年度 科研費/研究活動スタート支援
    • 2016年度 科研費/特別研究員奨励費

連絡先

    • 住所 〒819-0395 福岡県福岡市西区元岡744番地
    • 所在 九州大学 伊都キャンパス ウエスト2号館10階1046
    • E-mail:yuto.nakashima( at )inf.kyushu-u.ac.jp