学位

• 博士（情報科学）(九州大学 2021.9)

経歴

学歴

受賞

その他

論文

• Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations [DOI] [Othres link]
• Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space [DOI] [Othres link]
• Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. [DOI] [DBLP] [Othres link] [Othres link]
• Computing Maximal Palindromes in Non-standard Matching Models. [DOI] [DBLP] [Othres link] [Othres link]
• Shortest Cover After Edit. [DOI] [DBLP] [Othres link] [Othres link]
• Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings [DOI] [Othres link] [ResearchMap]
• Finding top-k longest palindromes in substrings [DOI] [ResearchMap] [ResearchMap]
• Data Structures for Computing Unique Palindromes in Static and Non-Static Strings [DOI] [Othres link] [Othres link] [ResearchMap] [ResearchMap]
• Internal Longest Palindrome Queries in Optimal Time [DOI] [Othres link]
• Computing Palindromes on a Trie in Linear Time [DOI] [Scopus] [Scopus]
• Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions [DOI] [Othres link]
• RePair Grammars are the Smallest Grammars for Fibonacci Words [DOI] [DBLP] [Othres link] [Othres link]
• Cartesian Tree Subsequence Matching [DOI] [DBLP] [Othres link] [Othres link]
• Minimal Absent Words on Run-Length Encoded Strings. [DOI] [DBLP] [Othres link] [Othres link]
• Combinatorics of minimal absent words for a sliding window [DOI]
• Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings [DOI] [Scopus] [Scopus]
• Computing Minimal Unique Substrings for a Sliding Window [DOI] [DBLP] [Othres link] [Othres link]
• Palindromic trees for a sliding window and its applications [DOI] [DBLP]
• A Separation of γ and b via Thue–Morse Words [DOI] [DBLP] [Othres link] [Scopus] [Scopus]
• On the Approximation Ratio of LZ-End to LZ77 [DOI] [DBLP] [Othres link] [Scopus] [Scopus]
• Minimal Unique Palindromic Substrings After Single-Character Substitution [DOI] [DBLP] [Othres link] [Scopus] [Scopus]
• String Sanitization Under Edit Distance: Improved and Generalized. [DOI] [DBLP] [Othres link] [Othres link]
• Space-efficient algorithms for computing minimal/shortest unique substrings [DOI] [DBLP]
• Lyndon Words, the Three Squares Lemma, and Primitive Squares [DOI] [DBLP] [Othres link]
• Minimal Unique Substrings and Minimal Absent Words in a Sliding Window [DOI] [DBLP] [Othres link]
• Compact Data Structures for Shortest Unique Substring Queries [DOI] [DBLP] [Othres link]
• Algorithms and combinatorial properties on shortest unique palindromic substrings [DOI] [DBLP]
• Shortest Unique Palindromic Substring Queries in Optimal Time [DOI] [DBLP] [Othres link]
• Tight Bounds on the Maximum Number of Shortest Unique Substrings. [DOI] [DBLP] [Othres link] [Othres link]
• Shortest unique substring queries on run-length encoded strings [DOI] [DBLP]

その他業績

講演・口頭発表等

• 基盤的文字列索引構造の拡張とその応用

書籍等出版物

作品等

共同研究・競争的資金等の研究課題

• 不在/稀少文字列の計算技法と一般化文字列への展開
• 文字列処理におけるNP困難問題の高速解法の追求
• 動的文字列処理に対するアルゴリズム技法の開発と計算限界の解明
• 最先端文字列アルゴリズム理論に基づく巨大データ解析技法

メディア報道

産業財産権

所属学協会

• 情報処理学会

委員歴

担当経験のある科目

社会貢献活動

学術貢献活動

• CPM 2024 Organising Committee
• Pre-CPM 2024 summer school Co-chair