Presentation Slides by Shunsuke Inenaga

[home in English] [home in Japanese]

Talks in English

  1. Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space, 35th International Workshop on Combinatorial Algorithms (IWOCA 2024), Ischia, Italy, July 2024.

  2. Sensitivity of string compressors and repetitiveness measures, Sequences in London 2024, London, UK, February 2024.

  3. Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings, 30th International Symposium on String Processing and Information Retrieval (SPIRE 2023), Pisa, Italy, September 2023.

  4. Suffix Trees, DAWGs, and CDAWGs for Forward and Backward Tries, 14th Latin American Theoretical Informatics Symposium (LATIN 2020), Virtual Conference, January 2021.

  5. Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings, Prague Stringology Conference (PSC 2020), Prague, Czech Republic, August-September 2020.

  6. Combinatorial algorithms for grammar-based text compression, Tutorial on Combinatorial Methods for String and Graph (followed by WALCOM 2020), Singapore, March 2020.

  7. Fully-online suffix tree and DAWG construction for multiple texts, Palermo Workshops in Algorithms (PWA 2018), Palermo, Italy, July 2018.

  8. Computing longest common square subsequences, 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), Qingdao, China, July 2018.

  9. The myriad virtues of DAWGs, 1st Summer School on Bioinformatics Data Structures, Helsinki, Finland, August 2016.

  10. Factorizing a string into squares in linear time, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), Tel Aviv, Israel, June 2016.

  11. Compacting a Dynamic Edit Distance Table by RLE Compression, 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016), Harrachov, Czech Republic, January 2016.

  12. Faster Longest Common Extension on Compressed Strings and Applications (Invited Talk), The Prague Stringology Conference 2015 (PSC 2015), Prague, Czech Republic, August 2015.

  13. An opportunistic text indexing structure based on run length encoding, 9th International Conference on Algorithms and Complexity (CIAC 2015), Paris, Farnce, May 2015.

  14. Converting SLP to LZ78 in almost Linear Time, 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), Bad Herrenalb, Germany, June 2013.

  15. Algorithms on grammar compressed strings, Dagstuhl Seminar 13232 (Indexes and Computation over Compressed Structured Data), Schloss Dagstuhl, Germany, June 2013.

  16. Faster Subsequence and Dont-Care Pattern Matching on Compressed Texts, Guest Lecture at Karlsruhe Institute of Technology (hosted by Dr. Johannes Fischer), Karlsruhe, Germany, June 2013.

  17. Finding Characteristic Substrings from Compressed Texts, The Prague Stringology Conference 2009 (PSC 2009), Prague, Czech Republic, August-September 2009.

  18. Pattern Matching on Compressed Texts II, Dagstuhl Seminar 08261 (Structure-Based Compression of Complex Massive Data), Schloss Dagstuhl, Germany, June 2008.

  19. Simple Linear-Time Off-Line Text Compression by Longest-First Substitution, Data Compression Conference 2007 (DCC 2007), Snowbird, Utah, USA, March 2007.

  20. Sparse DirectedAcyclic Word Graphs, 13th International Symposium on String Processing and Information Retrieval (SPIRE 2006), Glasgow, UK, October 2006.

  21. Sparse Compact DirectedAcyclic Word Graphs, The Prague Stringology Conference 2006 (PSC 2006), Prague, Czech Republic, August 2006.

  22. On-line Linear-time Construction of Word Suffix Trees, 17th Annual Symposium on Combinatorial Pattern Matching (CPM 2006), Barcelona, Spain, July, 2006.

  23. Composite Pattern Discovery for PCR Application, 12th International Symposium on String Processing and Information Retrieval (SPIRE 2005), Buenos Aires, Argentina, November 2005.

  24. Fully Incremental LCS Computation, 15th International Symposium on Fundamentals on Computing Theory (FCT 2005), Luebeck, Germany, August 2005.

  25. Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance, 7th International Conference on Discovery Science 2004 (DS 2004), Padova, Italy, October 2004.

  26. Directed Acyclic Word Graphs and Their Efficient Implementations, Guest Lecture at Helsinki University of Technology (hosted by Prof. Jorma Tarhio), Helsinki, Finland, April 2004.

  27. Discovering Most Classificatory Patterns for Very Expressive Pattern Classes, 6th International Conference on Discovery Science 2003 (DS 2003), Sapporo, Japan, October 2003.

日本語スライド

  1. 情報科学入門，九州大学理学部物理学科オープンキャンパス模擬講義，九州大学，2024年8月．

  2. 情報科学における高大接続についての考察，福岡県高等学校情報科研究部会 研修会，福岡講倫館高校，2023年10月．

  3. Symmetric CDAWG，札幌離散構造セミナー 2023夏（文字列編），北海道大学，2023年8月．

  4. 文字列圧縮アルゴリズムの感度，冬のLAシンポジウム 2021，オンライン，2022年2月．

  5. ラベル付き木に対する索引構造，冬のLAシンポジウム 2020，オンライン，2021年2月．

  6. 文字列方程式について，STRセミナー2020冬，東北大学，仙台市，2020年3月．

  7. 複数テキスト索引構造のオンライン構築，冬のLAシンポジウム 2019，京都市，2020年2月．

  8. 索引構造オンライン構築四方山話，StringBeginners，AIP，東京，2019年4月．

  9. アルゴリズムのチカラ 大規模データ処理からAIまで，日本工学アカデミー九州支部 工業高等専門学校出張講演会「身近な情報技術の現状と将来」，佐世保工業高等専門学校，佐世保市，2018年2月．

  10. 一般教養としてのAIとその周辺，博多支部税理士会例会研修，ハイアットリージェンシー博多，福岡市，2016年12月．

  11. 連長圧縮に基づく漸増的最長共通部分列アルゴリズム，夏のLAシンポジウム 2016，奈良県平群町，2016年7月．

  12. 情報科学入門「コンピュータにどう考えさせるか？」，大学研究セミナーI (出前講義)，福岡高校，福岡市，2016年7月．(2012年から2018年にかけて，同校にて出前講義を継続的に実施)

  13. Finding Characteristic Substrings from Compressed Texts，夏のLAシンポジウム 2010，氷見市，2010年7月．

  14. 「研究者」という職業，職業紹介（総合授業），春日野中学校，春日市，2007年11月．

  15. Weighted Directed Word Graph (論文紹介)，ゼミ発表資料，2005年4月．