Tomohiro I

Japanese | English

portrait

About My Name

My family name is 'I', which consists of a single letter. Please note that it is NOT an abbreviation :-)

Affiliation

Research associate at Frontier Research Academy for Young Researchers, Kyushu Institute of Technology, Japan
(Working at Department of Artificial Intelligence in Iizuka Campus)
(Short CV is here)

Research Interests

Publications

Journal Articles

  1. 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]
  2. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Faster Lyndon factorization algorithms for SLP and LZ78 compressed text, Theoretical Computer Science, In Press. [link]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. Tomohiro I, Shunsuke Inenaga and Masayuki Takeda, Palindrome pattern matching, Theoretical Computer Science, 483:162-170, April 2013. [link]
  8. 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]
  9. 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]

Peer Reviewed Conference Papers

  1. 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), accepted, October 2016.
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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, December 2015. [link]
  8. 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, September 2015. [link]
  9. 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, September 2015. [link]
  10. 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, September 2015. [link]
  11. 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, June-July 2015. [link]
  12. 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, June-July 2015. [link]
  13. 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]
  14. 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]
  15. 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, August 2014. [link]
  16. 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, June 2014. [link]
  17. 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]
  18. 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]
  19. 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, October 2013. [link]
  20. 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]
  21. 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, August 2013. [link]
  22. 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, July 2013. [link]
  23. 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]
  24. 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]
  25. 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]
  26. 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)]
  27. 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)]
  28. 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]
  29. 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)]
  30. 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)]
  31. 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)]
  32. 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)]
  33. 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]

Unreviewed Conference Papers, Talks, etc.

  1. Tomohiro I, A Space-Optimal Grammar Compression, Dagstuhl Seminar 16431, October 2016.
  2. Tomohiro I, Faster Compact On-Line Lempel-Ziv Factorization, the 8th Workshop on Compression, Text, and Algorithms (WCTA 2013), October 2013.
  3. Tomohiro I, Reverse Engineering of Data Structures on Strings, Kyoto Prize Satellite Workshop in Honor of Professor László Lovász, Poster Section, November 2010. [pdf]

Last modified: 2016-11-17 index_e.html

Contact

680-4 Kawazu, Iizuka-shi, Fukuoka, 820-8502, Japan
E-mail: email

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