井 智弘 (Tomohiro I)

Japanese | English

portrait

所属

九州工業大学 情報工学研究院 知能情報工学研究系
准教授 - (略歴

研究テーマ

外部サイト

研究成果

学術論文誌

  1. Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl and Simon J. Puglisi, Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica, 86(3):735-756, May 2024. [link]
  2. Hideo Bannai, Tomohiro I and Dominik Köppl, Longest bordered and periodic subsequences, Information Processing Letters, 182: 106398, April 2023. [link]
  3. Shinji Ono, Jun Takata, Masaharu Kataoka, Tomohiro I, Kilho Shin and Hiroshi Sakamoto, Privacy-Preserving Feature Selection with Fully Homomorphic Encryption, Algorithms, 15(7):229, June 2022. [link]
  4. Keita Nonaka, Kazutaka Yamanouchi, Tomohiro I, Tsuyoshi Okita, Kazutaka Shimada and Hiroshi Sakamoto, A Compression-Based Multiple Subword Segmentation for Neural Machine Translation, Electronics, 11(7):1014, March 2022. [link]
  5. Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai and Keisuke Goto, Re-Pair in Small Space, Algorithms, 14(1):5, December 2020. [link]
  6. Johannes Fischer, Tomohiro I and Dominik Köppl, Deterministic Sparse Suffix Sorting in the Restore Model, ACM Transactions on Algorithms, 16(4): Article No. 50, July 2020. [link]
  7. Hideo Bannai, Travis Gagie and Tomohiro I, Refining the r-index, Theoretical Computer Science, 812:96-108, April 2020. [link]
  8. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Dynamic index and LZ factorization in compressed space, Discrete Applied Mathematics, 274:116-129, March 2020. [link]
  9. Tomohiro I and Dominik Köppl, Improved Upper Bounds on all Maximal alpha-gapped Repeats and Palindromes, Theoretical Computer Science, 753:1-15, January 2019. [link]
  10. Tatsuya Ohno, Kensuke Sakai, Yoshimasa Takabatake, Tomohiro I and Hiroshi Sakamoto, A faster implementation of online RLBWT and its application to LZ77 parsing, Journal of Discrete Algorithms, 52:18-28, September, 2018. [link]
  11. Johannes Fischer, Tomohiro I, Dominik Köppl and Kunihiko Sadakane, Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees, Algorithmica, 80(7):2048-2081, July 2018. [link]
  12. Shouhei Fukunaga, Yoshimasa Takabatake, Tomohiro I and Hiroshi Sakamoto, Approximate Frequent Pattern Discovery in Compressed Space, IEICE Transactions on Information and Systems, 101-D(3):593-601, March 2018. [link]
  13. 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, 62(1):162-191, January 2018. [link]
  14. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda and Kazuya Tsuruta, The "Runs" Theorem, SIAM Journal on Computing, 46(5):1501-1514, September 2017. [link]
  15. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Inferring strings from Lyndon factorization, Theoretical Computer Science, 689:147-156, August 2017. [link]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. Tomohiro I, Shunsuke Inenaga and Masayuki Takeda, Palindrome pattern matching, Theoretical Computer Science, 483:162-170, April 2013. [link]
  23. 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]
  24. 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. Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka and Ayumi Shinohara, Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching, In Proc. 51st International Colloquium on Automata, Languages, and Programming (ICALP) 2024, to appear, July 2024.
  2. Akiyoshi Kawamoto, Tomohiro I, Dominik Köppl and Hideo Bannai, On the Hardness of Smallest RLSLPs and Collage Systems, In Proc. Data Compression Conference (DCC) 2024, IEEE Computer Society Press CPS Online, pp. 243-252, March 2024.
  3. Shinya Nagashita and Tomohiro I, PalFM-index: FM-index for Palindrome Pattern Matching, In Proc. 34th Annual Symposium on Combinatorial Pattern Matching (CPM) 2023, pp. 23:1-23:15, June 2023. [link]
  4. Akiyoshi Kawamoto and Tomohiro I, Substring Complexities on Run-length Compressed Strings, In Proc. 29th International Symposium on String Processing and Information Retrieval (SPIRE) 2022, Lecture Notes in Computer Science (LNCS 13617), pp. 132-143, Springer, November 2022. [link]
  5. Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl and Simon J. Puglisi, Computing Longest (Common) Lyndon Subsequences, In Proc. 33rd International Workshop on Combinatorial Algorithms (IWOCA) 2022, Lecture Notes in Computer Science (LNCS 13270), pp. 128-142, Springer-Verlag, June 2022. Best Paper Award. [link]
  6. Tomohiro I and Dominik Köppl, Space-Efficient B Trees via Load-Balancing, In Proc. 33rd International Workshop on Combinatorial Algorithms (IWOCA) 2022, Lecture Notes in Computer Science (LNCS 13270), pp. 327-340, Springer-Verlag, June 2022. [link]
  7. Masaki Shigekuni and Tomohiro I, Converting RLBWT to LZ77 in smaller space, In Proc. Data Compression Conference (DCC) 2022, IEEE Computer Society Press CPS Online, pp. 242-251, March 2022. [link]
  8. Tomohiro I, Robert W. Irving, Dominik Köppl and Lorna Love, Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree, In Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE) 2021, Lecture Notes in Computer Science (LNCS 12944), pp. 143-150, October 2021. [link]
  9. Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno and Takaaki Nishimoto, A Separation of γ and b via Thue-Morse Words, In Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE) 2021, Lecture Notes in Computer Science (LNCS 12944), pp. 167-178, October 2021. [link]
  10. Christina Boucher, Travis Gagie, Tomohiro I, Dominik Köppl, Ben Langmead, Giovanni Manzini, Gonzalo Navarro, Alejandro Pacheco and Massimiliano Rossi, PHONI: Streamed Matching Statistics with Multi-genome References, In Proc. Data Compression Conference (DCC) 2021, IEEE Computer Society Press CPS Online, pp. 193-202, March 2021. [link]
  11. Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Louisa Seelbach Benkner and Yoshimasa Takabatake, Practical Random Access to SLP-Compressed Texts, In Proc. 27th International Symposium on String Processing and Information Retrieval (SPIRE) 2020, Lecture Notes in Computer Science (LNCS 12303), pp. 221-231, October 2020. [link]
  12. Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai and Keisuke Goto, Re-Pair in Small Space, In Proc. Prague Stringology Conference (PSC) 2020, pp. 134-147, August 2020. [link]
  13. Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai and Keisuke Goto, Re-Pair in Small Space, In Proc. Data Compression Conference (DCC) 2020 poster, IEEE Computer Society Press CPS Online, pp. 377-377, March 2020. [link]
  14. Yohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake, Tomohiro I, Kilho Shin and Hiroshi Sakamoto Faster Privacy-Preserving Computation of Edit Distance with Moves, In Proc. 14th International Conference and Workshop on Algorithms and Computation (WALCOM) 2020, Lecture Notes in Computer Science (LNCS 12049), pp. 308-320, February 2020. [link]
  15. Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto and Yoshimasa Takabatake Rpair: Rescaling RePair with Rsync, In Proc. 26th International Symposium on String Processing and Information Retrieval (SPIRE) 2019, Lecture Notes in Computer Science (LNCS 11811), pp. 35-44, October 2019. [link]
  16. Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga and Shiho Sugimoto k-Abelian Pattern Matching: Revisited, Corrected, and Extended, In Proc. Prague Stringology Conference (PSC) 2019, pp. 29-40, August 2019. [link]
  17. Kensuke Sakai, Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I and Hiroshi Sakamoto, RePair in Compressed Space and Time, In Proc. Data Compression Conference (DCC) 2019, IEEE Computer Society Press CPS Online, pp. 518-527, March 2019. [link]
  18. Shunta Nakagawa, Tokio Sakamoto, Yoshimasa Takabatake, Tomohiro I, Kilho Shin and Hiroshi Sakamoto, Privacy-Preserving String Edit Distance with Moves, In Proc. 11th International Conference on Similarity Search and Applications (SISAP) 2018, Lecture Notes in Computer Science (LNCS 11223), pp. 226-240, October 2018. [link]
  19. Keisuke Goto, Tomohiro I, Hideo Bannai and Shunsuke Inenaga, Block Palindromes: A New Generalization of Palindromes, In Proc. 25th International Symposium on String Processing and Information Retrieval (SPIRE) 2018, Lecture Notes in Computer Science (LNCS 11147), pp. 183-190, October 2018. [link]
  20. Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I and Hiroshi Sakamoto, LZ-ABT: A Practical Algorithm for alpha-Balanced Grammar Compression, In Proc. 29th International Workshop on Combinatorial Algorithms (IWOCA) 2018, Lecture Notes in Computer Science (LNCS 10979), pp. 323-335, Springer-Verlag, July 2018. Acceptance rate = 31/69 = 45%. [link]
  21. Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Faster Online Elastic Degenerate String Matching, In Proc. 29th Annual Symposium on Combinatorial Pattern Matching (CPM) 2018, pp. 9:1-9:10, July 2018. Acceptance rate = 24/38 = 63%. [link]
  22. Hideo Bannai, Travis Gagie and Tomohiro I, Online LZ77 Parsing and Matching Statistics with RLBWTs, In Proc. 29th Annual Symposium on Combinatorial Pattern Matching (CPM) 2018, pp. 7:1-7:12, July 2018. Acceptance rate = 24/38 = 63%. [link]
  23. Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Lyndon Factorization of Grammar Compressed Texts Revisited, In Proc. 29th Annual Symposium on Combinatorial Pattern Matching (CPM) 2018, pp. 24:1-24:10, July 2018. Acceptance rate = 24/38 = 63%. [link]
  24. Yoshimasa Takabatake, Tomohiro I and Hiroshi Sakamoto, A Space-Optimal Grammar Compression, In Proc. 25th Annual European Symposium on Algorithms (ESA) 2017, pp. 67:1-67:15, September 2017. Acceptance rate (Track B) = 11/42 = 26%. [link]
  25. 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, Lecture Notes in Computer Science (LNCS 10765), pp. 409-419, Springer-Verlag, July 2017. Acceptance rate = 30/55 = 55%. [link]
  26. Tomohiro I, Longest Common Extensions with Recompression, In Proc. 28th Annual Symposium on Combinatorial Pattern Matching (CPM) 2017, pp. 18:1-18:15, July 2017. Acceptance rate = 28/49 = 57%. [link]
  27. Shouhei Fukunaga, Yoshimasa Takabatake, Tomohiro I and Hiroshi Sakamoto, Online Grammar Compression for Frequent Pattern Discovery, In Proc. 13th International Conference on Grammatical Inference (ICGI) 2016, pp. 93-104, October 2016. Acceptance rate = 10/15 = 67%. [link]
  28. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Dynamic index and LZ factorization in compressed space, In Proc. Prague Stringology Conference (PSC) 2016, pp. 158-170, August 2016. [link]
  29. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Fully dynamic data structure for LCE queries in compressed space, In Proc. 41st International Symposium on Mathematical Foundations of Computer Science (MFCS) 2016, pp. 72:1-72:15, August 2016. Acceptance rate = 84/195 = 43%. [link]
  30. 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. 27th Annual Symposium on Combinatorial Pattern Matching (CPM) 2016, pp. 1:1-1:10, June 2016. Acceptance rate = 29/52 = 56%. [link]
  31. Johannes Fischer, Tomohiro I and Dominik Köppl, Deterministic Sparse Suffix Sorting on Rewritable Texts, In Proc. 12th Latin American Theoretical Informatics Symposium (LATIN) 2016, Lecture Notes in Computer Science (LNCS 9644), pp. 483-496, Springer-Verlag, April 2016. Acceptance rate = 52/131 = 40%. [link]
  32. Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl and Florin Manea, Efficiently Finding All Maximal alpha-gapped Repeats, In Proc. 33rd International Symposium on Theoretical Aspects of Computer Science (STACS) 2016, pp. 39:1-39:14, February 2016. Acceptance rate = 54/205 = 26%. [link]
  33. Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Inferring Strings from Full Abelian Periods, In Proc. 26th International Symposium on Algorithms and Computation (ISAAC) 2015, Lecture Notes in Computer Science (LNCS 9472), pp. 768-779, Springer-Verlag, December 2015. Acceptance rate = 65/180 = 36%. [link]
  34. Dominik Köppl and Tomohiro I, Arithmetics on Suffix Arrays of Fibonacci Words, In Proc. 10th International Conference on Combinatorics on Words (WORDS) 2015, Lecture Notes in Computer Science (LNCS 9304), pp. 135-146, Springer-Verlag, September 2015. Acceptance rate = 14/22 = 64%. [link]
  35. Johannes Fischer, Štěpán Holub, Tomohiro I and Moshe Lewenstein, Beyond the Runs Theorem, In Proc. 22nd Symposium on String Processing and Information Retrieval (SPIRE) 2015, Lecture Notes in Computer Science (LNCS 9309), pp. 277-286, Springer-Verlag, September 2015. Acceptance rate = 34/90 = 38%. [link]
  36. 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. 22nd Symposium on String Processing and Information Retrieval (SPIRE) 2015, Lecture Notes in Computer Science (LNCS 9309), pp. 124-136, Springer-Verlag, September 2015. Acceptance rate = 34/90 = 38%. [link]
  37. 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. 26th Annual Symposium on Combinatorial Pattern Matching (CPM) 2015, Lecture Notes in Computer Science (LNCS 9133), pp. 355-366, Springer-Verlag, June-July 2015. Acceptance rate = 34/83 = 41%. [link]
  38. Johannes Fischer, Tomohiro I and Dominik Köppl, Lempel Ziv Computation In Small Space (LZ-CISS), In Proc. 26th Annual Symposium on Combinatorial Pattern Matching (CPM) 2015, Lecture Notes in Computer Science (LNCS 9133), pp. 172-184, Springer-Verlag, June-July 2015. Acceptance rate = 34/83 = 41%. [link]
  39. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda and Kazuya Tsuruta, A new characterization of maximal repetitions by Lyndon trees, In Proc. 26th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2015, pp. 562-571, January 2015. Acceptance rate = 137/495 = 28%. [link]
  40. Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi and Shiho Sugimoto, Closed Factorization, In Proc. Prague Stringology Conference (PSC) 2014, pp. 162-168, Czech Technical University, September 2014. [link]
  41. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Inferring Strings from Lyndon factorization, In Proc. 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. Acceptance rate = 95/270 = 35%. [link]
  42. Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Computing palindromic factorizations and palindromic covers on-line, In Proc. 25th Annual Symposium on Combinatorial Pattern Matching (CPM) 2014, Lecture Notes in Computer Science (LNCS 8486), pp. 150-161, Springer-Verlag, June 2014. Acceptance rate = 28/54 = 52%. [link]
  43. Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda, Faster Compact On-Line Lempel-Ziv Factorization, In Proc. 31st Symposium on Theoretical Aspects of Computer Science (STACS) 2014, pp. 675-686, March 2014. Acceptance rate = 54/210 = 26%. [link]
  44. Tomohiro I, Juha Kärkkäinen and Dominik Kempa, Faster Sparse Suffix Sorting, In Proc. 31st Symposium on Theoretical Aspects of Computer Science (STACS) 2014, pp. 386-396, March 2014. Acceptance rate = 54/210 = 26%. [link]
  45. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Faster Lyndon factorization algorithms for SLP and LZ78 compressed text, In Proc. 20th Symposium on String Processing and Information Retrieval (SPIRE) 2013, Lecture Notes in Computer Science (LNCS 8214), pp. 174-185, Springer-Verlag, October 2013. Acceptance rate = 28/60 = 47%. [link]
  46. Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Computing Reversed Lempel-Ziv Factorization Online, In Proc. Prague Stringology Conference (PSC) 2013, pp. 107-118, Czech Technical University, September 2013. [link]
  47. 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. 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. Acceptance rate = 67/191 = 35%. [link]
  48. Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Compressed Automata for Dictionary Matching, In Proc. 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. Acceptance rate = 25/43 = 58%. [link]
  49. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Efficient Lyndon factorization of grammar compressed text, In Proc. 24th Annual Symposium on Combinatorial Pattern Matching (CPM) 2013, Lecture Notes in Computer Science (LNCS 7922), pp. 153-164, Springer-Verlag, June 2013. Acceptance rate = 21/51 = 41%. [link]
  50. Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Computing convolution on grammar-compressed text, In Proc. Data Compression Conference (DCC) 2013, IEEE Computer Society Press CPS Online, pp. 451-460, March 2013. [link]
  51. Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, From Run Length Encoding to LZ78 and Back Again, In Proc. Data Compression Conference (DCC) 2013, IEEE Computer Society Press CPS Online, pp. 143-152, March 2013. [link]
  52. 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. Acceptance rate = 39/81 = 48%. [link] [preprint (The original publication is available at www.springerlink.com)]
  53. Tomohiro I, Yuki Enokuma, Hideo Bannai and Masayuki Takeda, General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations, In Proc. 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. Acceptance rate = 105/443 = 24%. [link] [preprint (The original publication is available at www.springerlink.com)]
  54. Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Inferring Strings from Suffix Trees and Links on a Binary Alphabet, In Proc. Prague Stringology Conference (PSC) 2011, pp. 121-131, Czech Technical University, August 2011. [link]
  55. 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. Acceptance rate = 36/70 = 51%. [link] [preprint (The original publication is available at www.springerlink.com)]
  56. 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. Acceptance rate = 39/109 = 36%. [link] [preprint (The original publication is available at www.springerlink.com)]
  57. 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. Acceptance rate = 28/53 = 53%. [link] [preprint (The original publication is available at www.springerlink.com)]
  58. 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. Acceptance rate = 41/100 = 41%. [link] [preprint (The original publication is available at www.springerlink.com)]
  59. 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. Acceptance rate = 58/121 = 48%. [link] [preprint (c) Springer-Verlag]

招待講演

  1. Tomohiro I, The Runs Theorem and Beyond, In Proc. 22nd Developments in Language Theory (DLT) 2018, Lecture Notes in Computer Science (LNCS 11088), pp. 18-23, Springer-Verlag, September 2018. [link]

国内研究会, 口頭発表等

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

Last modified: 2024-05-07 index.html

連絡先

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

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