井 智弘 (Tomohiro I)

Japanese | English

portrait

所属

九州工業大学 若手研究者フロンティア研究アカデミー
特任助教 - (略歴
(情報工学研究院 知能情報工学研究系 飯塚勤務)

研究テーマ

外部サイト

研究成果

学術論文誌

  1. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda and Kazuya Tsuruta, The "Runs" Theorem, SIAM Journal on Computing, to appear.
  2. Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl and Florin Manea, Tighter Bounds and Optimal Algorithms for all Maximal alpha-gapped Repeats and Palindromes, Theory of Computing Systems, In Press.
  3. Johannes Fischer, Tomohiro I, Dominik Köppl and Kunihiko Sadakane, Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees, Algorithmica, In Press.
  4. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Inferring Strings from Lyndon Factorization, Theoretical Computer Science, In Press. [link]
  5. 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:215-224, December 2016. [link]
  6. Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi and Shiho Sugimoto, Closed factorization, Discrete Applied Mathematics, 212:23-29, October 2016. [link]
  7. 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, September 2015. [link]
  8. Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Compressed automata for dictionary matching, Theoretical Computer Science, 578:30-41, May 2015. [link]
  9. Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa and Ayumi Shinohara, Detecting regularities on grammar-compressed strings, Information and Computation, 240:74-89, February 2015. [link]
  10. Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Inferring strings from suffix trees and links on a binary alphabet, Discrete Applied Mathematics, 163(3):316-325, January 2014. [link]
  11. Tomohiro I, Shunsuke Inenaga and Masayuki Takeda, Palindrome pattern matching, Theoretical Computer Science, 483:162-170, April 2013. [link]
  12. Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau and Moshe Lewenstein, An efficient algorithm to test square-freeness of strings compressed by straight-line programs, Information Processing Letters, 112(19):711-714, October 2012. [link]
  13. Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Verifying and enumerating parameterized border arrays, Theoretical Computer Science, 412(50):6959-6981, November 2011. [link]

国際会議(査読有)

  1. Yoshimasa Takabatake, Tomohiro I and Hiroshi Sakamoto, A Space-Optimal Grammar Compression, In Proc. 25th Annual European Symposium on Algorithms (ESA 2017), accepted, September 2017.
  2. Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I and Hiroshi Sakamoto, A Faster Implementation of Online Run-Length Burrows-Wheeler Transform, In Proc. 28th International Workshop on Combinatorial Algorithms (IWOCA 2017), accepted, July 2017.
  3. Tomohiro I, Longest Common Extensions with Recompression, In Proc. the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), accepted, July 2017.
  4. Shouhei Fukunaga, Yoshimasa Takabatake, Tomohiro I and Hiroshi Sakamoto, Online Grammar Compression for Frequent Pattern Discovery, In Proc. the 13th International Conference on Grammatical Inference (ICGI 2016), pp. 93-104, October 2016. [link]
  5. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Dynamic index and LZ factorization in compressed space, In Proc. The Prague Stringology Conference (PSC 2016), pp. 158-170, August 2016. [link]
  6. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Fully dynamic data structure for LCE queries in compressed space, In Proc. the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), pp. 72:1-72:15, August 2016. [link]
  7. Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi and Masayuki Takeda, Deterministic sub-linear space LCE data structures with efficient construction, In Proc. the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), pp. 1:1-1:10, June 2016. [link]
  8. Johannes Fischer, Tomohiro I and Dominik Köppl, Deterministic Sparse Suffix Sorting on Rewritable Texts, In Proc. the 12th Latin American Theoretical Informatics Symposium (LATIN 2016), Lecture Notes in Computer Science (LNCS 9644), pp. 483-496, Springer-Verlag, April 2016. [link]
  9. Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl and Florin Manea, Efficiently Finding All Maximal alpha-gapped Repeats, In Proc. the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016), pp. 39:1-39:14, February 2016. [link]
  10. Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Inferring Strings from Full Abelian Periods, In Proc. the 26th International Symposium on Algorithms and Computation (ISAAC 2015), Lecture Notes in Computer Science (LNCS 9472), pp. 768-779, Springer-Verlag, December 2015. [link]
  11. Dominik Köppl and Tomohiro I, Arithmetics on Suffix Arrays of Fibonacci Words, In Proc. the 10th conference WORDS 2015 (WORDS 2015), Lecture Notes in Computer Science (LNCS 9304), pp. 135-146, Springer-Verlag, September 2015. [link]
  12. Johannes Fischer, Štěpán Holub, Tomohiro I and Moshe Lewenstein, Beyond the Runs Theorem, In Proc. the 22nd Symposium on String Processing and Information Retrieval (SPIRE 2015), Lecture Notes in Computer Science (LNCS 9309), pp. 277-286, Springer-Verlag, September 2015. [link]
  13. Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, A faster algorithm for computing maximal alpha-gapped repeats in a string, In Proc. the 22nd Symposium on String Processing and Information Retrieval (SPIRE 2015), Lecture Notes in Computer Science (LNCS 9309), pp. 124-136, Springer-Verlag, September 2015. [link]
  14. Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Semi-dynamic compact index for short patterns and succinct van Emde Boas tree, In Proc. the 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), Lecture Notes in Computer Science (LNCS 9133), pp. 355-366, Springer-Verlag, June-July 2015. [link]
  15. Johannes Fischer, Tomohiro I and Dominik Köppl, Lempel Ziv Computation In Small Space (LZ-CISS), In Proc. the 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), Lecture Notes in Computer Science (LNCS 9133), pp. 172-184, Springer-Verlag, June-July 2015. [link]
  16. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda and Kazuya Tsuruta, A new characterization of maximal repetitions by Lyndon trees, In Proc. the 26th ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 562-571, January 2015. [link]
  17. Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi and Shiho Sugimoto, Closed Factorization, In Proc. The Prague Stringology Conference (PSC 2014), pp. 162-168, Czech Technical University, September 2014. [link]
  18. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Inferring Strings from Lyndon factorization, In Proc. the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), Lecture Notes in Computer Science (LNCS 8635), pp. 565-576, Springer-Verlag, August 2014. [link]
  19. Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Computing palindromic factorizations and palindromic covers on-line, In Proc. the 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), Lecture Notes in Computer Science (LNCS 8486), pp. 150-161, Springer-Verlag, June 2014. [link]
  20. Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda, Faster Compact On-Line Lempel-Ziv Factorization, In Proc. the 31st Symposium on Theoretical Aspects of Computer Science (STACS 2014), pp. 675-686, March 2014. [link]
  21. Tomohiro I, Juha Kärkkäinen and Dominik Kempa, Faster Sparse Suffix Sorting, In Proc. the 31st Symposium on Theoretical Aspects of Computer Science (STACS 2014), pp. 386-396, March 2014. [link]
  22. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Faster Lyndon factorization algorithms for SLP and LZ78 compressed text, In Proc. the 20th Symposium on String Processing and Information Retrieval (SPIRE 2013), Lecture Notes in Computer Science (LNCS 8214), pp. 174-185, Springer-Verlag, October 2013. [link]
  23. Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Computing Reversed Lempel-Ziv Factorization Online, In Proc. The Prague Stringology Conference (PSC 2013), pp. 107-118, Czech Technical University, September 2013. [link]
  24. Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa and Ayumi Shinohara, Detecting regularities on grammar-compressed strings, In Proc. the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), Lecture Notes in Computer Science (LNCS 8087), pp. 571-582, Springer-Verlag, August 2013. [link]
  25. Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Compressed Automata for Dictionary Matching, In Proc. the 18th International Conference on Implementation and Application of Automata (CIAA 2013), Lecture Notes in Computer Science (LNCS 7982), pp. 319-330, Springer-Verlag, July 2013. [link]
  26. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Efficient Lyndon factorization of grammar compressed text, In Proc. the 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), Lecture Notes in Computer Science (LNCS 7922), pp. 153-164, Springer-Verlag, June 2013. [link]
  27. Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Computing convolution on grammar-compressed text, In Proc. the Data Compression Conference 2013 (DCC 2013), IEEE Computer Society Press CPS Online, pp. 451-460, March 2013. [link]
  28. Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, From Run Length Encoding to LZ78 and Back Again, In Proc. the Data Compression Conference 2013 (DCC 2013), IEEE Computer Society Press CPS Online, pp. 143-152, March 2013. [link]
  29. Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, The position heap of a trie, In Proc. 19th Symposium on String Processing and Information Retrieval (SPIRE 2012), Lecture Notes in Computer Science (LNCS 7608), pp. 360-371, Springer-Verlag, October 2012. [link] [preprint (The original publication is available at www.springerlink.com)]
  30. Tomohiro I, Yuki Enokuma, Hideo Bannai and Masayuki Takeda, General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations, In Proc. the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2012), Lecture Notes in Computer Science (LNCS 7524), pp. 435-450, Springer-Verlag, September 2012. [link] [preprint (The original publication is available at www.springerlink.com)]
  31. Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Inferring Strings from Suffix Trees and Links on a Binary Alphabet, In Proc. The Prague Stringology Conference (PSC 2011), pp. 121-131, Czech Technical University, August 2011. [link]
  32. Tomohiro I, Shunsuke Inenaga and Masayuki Takeda, Palindrome Pattern Matching, In Proc. 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), Lecture Notes in Computer Science (LNCS 6661), pp. 232-245, Springer-Verlag, June 2011. [link] [preprint (The original publication is available at www.springerlink.com)]
  33. Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Counting and Verifying Maximal Palindromes, In Proc. 17th Symposium on String Processing and Information Retrieval (SPIRE 2010), Lecture Notes in Computer Science (LNCS 6393), pp. 135-146, Springer-Verlag, October 2010. [link] [preprint (The original publication is available at www.springerlink.com)]
  34. Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Verifying a Parameterized Border Array in O(n1.5) Time, In Proc. 21st Annual Symposium on Combinatorial Pattern Matching (CPM 2010), Lecture Notes in Computer Science (LNCS 6129), pp. 238-250, Springer-Verlag, June 2010. [link] [preprint (The original publication is available at www.springerlink.com)]
  35. Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda, Lightweight Parameterized Suffix Array Construction, In Proc. 20th International Workshop on Combinatorial Algorithms (IWOCA 2009), Lecture Notes in Computer Science (LNCS 5874), pp. 312-323, Springer-Verlag, June-July 2009. [link] [preprint (The original publication is available at www.springerlink.com)]
  36. Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Counting Parameterized Border Arrays for a Binary Alphabet, In Proc. 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), Lecture Notes in Computer Science(LNCS 5457), pp. 422-433, Springer-Verlag, April 2009. [link] [preprint (c) Springer-Verlag]

国内研究会, 口頭発表等

  1. Tomohiro I, A Space-Optimal Grammar Compression, Dagstuhl Seminar 16431, October 2016.
  2. 福永祥平, 高畠嘉将, 井智弘, 坂本比呂志, オンライン文法圧縮による頻出パターン発見, 人工知能基本問題研究会, 101, pp. 29-34, 2016年8月.
  3. 谷村優佳, 井智弘, 稲永俊介, 坂内英夫, 竹田正幸, 最長共通一致クエリのためのデータ構造とアルゴリズム, 冬のLAシンポジウム2015, [S2], 2016年1月.
  4. Golnaz Badkobeh, 坂内英夫, 後藤啓介, 井智弘, Costas S. Iliopoulos, 稲永俊介, Simon J. Puglisi, 杉本志穂, 最長閉文字列分解, 夏のLAシンポジウム2015, [1], 2015年7月.
  5. 西本崇晃, 井智弘, 稲永俊介, 坂内英夫, 竹田正幸, 動的な圧縮索引, 冬のLAシンポジウム2014, [3-1], 2015年1月.
  6. 西本崇晃, 井智弘, 稲永俊介, 坂内英夫, 竹田正幸, Sorting, Indexing, Computing LCE and LCP of SLP Compressed Strings, 夏のLAシンポジウム2014, [2-5], 2014年7月.
  7. 井智弘, 中島祐人, 稲永俊介, 坂内英夫, 竹田正幸, LZ78圧縮されたテキストに対するLyndon分解アルゴリズム, 冬のLAシンポジウム2013, [23], 2014年1月.
  8. 杉本志穂, 井智弘, 稲永俊介, 坂内英夫, 竹田正幸, 回文による文字列の分解と被覆, 冬のLAシンポジウム2013, [22], 2014年1月.
  9. 松岡禎明, 井智弘, 坂内英夫, 稲永俊介, 竹田正幸, 動的でコンパクトな索引構造, 冬のLAシンポジウム2013, [13], 2014年1月.
  10. 山本淳一, 井智弘, 坂内英夫, 稲永俊介, 竹田正幸, 省スペースオンラインLZ分解, 冬のLAシンポジウム2013, [12], 2014年1月.
  11. Tomohiro I, Faster Compact On-Line Lempel-Ziv Factorization, the 8th Workshop on Compression, Text, and Algorithms (WCTA 2013), October 2013.
  12. 中島祐人, 岡部駿志, 井智弘, 稲永俊介, 坂内英夫, 竹田正幸, Lyndon分解の逆問題, 夏のLAシンポジウム2013, [S7], 2013年7月.
  13. 杉本志穂, 井智弘, 稲永俊介, 坂内英夫, 竹田正幸, 逆向きLZ77分解のオンライン計算について, 冬のLAシンポジウム2012, [S3], 2013年1月.
  14. 井智弘, 中島祐人, 稲永俊介, 坂内英夫, 竹田正幸, 圧縮テキスト上で動作するLyndon分解アルゴリズム, 冬のLAシンポジウム2012, [S2], 2013年1月.
  15. 西田真, 井智弘, 稲永俊介, 坂内英夫, 竹田正幸, 赤黒文法圧縮アルゴリズム, 冬のLAシンポジウム2012, [S1], 2013年1月.
  16. 井智弘, 松原渉, 稲永俊介, 坂内英夫, 竹田正幸, 成澤和志, 篠原歩, 直線的プログラムに含まれる繰り返し構造の検出, 冬のLAシンポジウム2012, [6], 2013年1月.
  17. 西本崇晃, 井智弘, 稲永俊介, 坂内英夫, 竹田正幸, 高速パターン照合を可能にする新しい文法圧縮型自己索引, 冬のLAシンポジウム2012, [5], 2013年1月.
  18. 井智弘, 坂内英夫, 稲永俊介, 直線的プログラムで圧縮された文字列の非反復性検証アルゴリズム, 夏のLAシンポジウム2012, [18], 2012年7月.
  19. 中島祐人, 井智弘, 稲永俊介, 坂内英夫, 竹田正幸, 木構造で表現された複数文字列に対するポジションヒープ, 夏のLAシンポジウム2012, [3], 2012年7月.
  20. 井智弘, 荏隈勇樹, 坂内英夫, 竹田正幸, General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations, ERATO湊離散構造処理系プロジェクト 「2012年度 初夏のワークショップ」, ポスター発表, 2012年6月. [pdf]
  21. 井智弘, 稲永俊介, 坂内英夫, 竹田正幸, バイナリ文字列における接尾辞木の逆問題, 夏のLAシンポジウム2011, [7], 2011年7月.
  22. 井智弘, 荏隈勇樹, 竹田正幸, 文字列パターン上の同値関係と飽和パターンの列挙, 電子情報通信学会 総合大会, DS-1-10, 2011年3月.
  23. 井智弘, 稲永俊介, 竹田正幸, 回文照合問題, 冬のLAシンポジウム2010, [21], 2011年2月.
  24. Tomohiro I, Reverse Engineering of Data Structures on Strings, Kyoto Prize Satellite Workshop in Honor of Professor László Lovász, ポスター発表, 2010年11月. [pdf]
  25. 井智弘, 稲永俊介, 坂内英夫, 竹田正幸, Counting and Verifying Maximal Palindromes, 電子情報通信学会 コンピューテーション研究会, 信学技法 vol. 110, no. 214, COMP2010-27, pp. 25-30, 2010年9月.
  26. 井智弘, 稲永俊介, 坂内英夫, 竹田正幸, Verifying a Parameterized Border Array in O(n1.5) Time, 第9回情報科学技術フォーラム (FIT2010), 2010年9月.
  27. 井智弘, 出口悟史, 坂内英夫, 稲永俊介, 竹田正幸, Lightweight Construction of Parameterized Suffix Arrays, 夏のLAシンポジウム2009, [7], 2009年7月.
  28. 井智弘, 畑埜晃平, 坂内英夫, 竹田正幸, 非定常な木情報源に対応する文脈木重み付け法に関する研究, 電子情報通信学会 コンピューテーション研究会, 信学技法 vol. 108, no. 89, COMP2008-17, pp. 15-22, 2008年6月.

Last modified: 2017-07-24 index.html

連絡先

〒820-8502 福岡県飯塚市川津680-4
E-mail: email

Copyright © 2009-2016 Tomohiro I, All Rights Reserved.