研究業績（論文、学会発表リスト）

【学術論文誌（査読あり）】

1. Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Kotaro Matsuda, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, and Sharma V. Thankachan. A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. Theoretical Computer Science, 2020.
2. Kotaro Matsuda, Atsushi Takayasu, and Tsuyoshi Takagi. Explicit Relation between Low-dimensional LLL-reduced Bases and the Shortest Vectors. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science(Special Section on Discrete Mathematics and Its Applications), E 102-A, No. 9, pp.1091-1100. 2019.

【国際会議（査読あり）】

1. Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, and Masakazu Tateshita. Compressed Orthogonal Search on Suffix Arrays with applications to Range LCP. CPM 2020, 2020.
2. Kotaro Matsuda, Shuhei Denzumi, and Kunihiko Sadakane. Storing Set Families More Compactly with Top ZDDs. SEA 2020, 2020.
3. Kotaro Matsuda, Shuhei Denzumi, Kengo Nakamura, Masaaki Nishino, and Norihito Yasuda. Approximated ZDD Construction Considering Inclusion Relations of Models. SEA^2 2019, 2019.

【国際会議（査読なし）, 国内発表, 研究会など】

1. 松田康太郎, 定兼邦彦, 伝住周平.top ZDDの性能評価.基盤(S)離散構造処理系プロジェクト「2019年度　秋のワークショップ」, 2019.
2. Kotaro Matsuda, Shuhei Denzumi, Kengo Nakamura, Masaaki Nishino, and Norihito Yasuda. Constructing Approximated ZDDs by Inclusion Relations of Models. AAAC 2019, 2019.
3. 松田康太郎, 伝住周平, 中村健吾, 西野正彬, 安田宜仁.偽陽性を許容する近似ZDDの構築.基盤(S)離散構造処理系プロジェクト「2018年度　秋のワークショップ」, 2018.
4. 松田康太郎, 高安敦, 高木剛.低次元LLL簡約基底が最短ベクトルを含まない必要十分条件.最適化とその応用：未来を担う若手研究者の集い 2018, 2018.
5. Kotaro Matsuda, Atsushi Takayasu, and Tsuyoshi Takagi. Explicit Relation between Low-dimensional LLL-reduced Bases and the Shortest Vectors. AAAC 2018, 2018.
6. 松田康太郎, 高安敦, 高木剛.低次元におけるLLL簡約基底が最短ベクトルを含まない必要十分条件.日本応用数理学会2018年研究部会連合発表会, 数論アルゴリズムとその応用(1) 3, 2018.