|
KOEPPL DOMINIK(クップル ドミニク) KOEPPL Dominik
|
経歴(学内) 【 表示 / 非表示 】
-
2020年10月-2022年06月東京医科歯科大学 M&Dデータ科学センター データ科学アルゴリズム設計・解析部門 助教
-
2022年07月-現在東京医科歯科大学 M&Dデータ科学センター データ科学アルゴリズム設計・解析部門 データ科学アルゴリズム設計・解析分野 助教
委員歴 【 表示 / 非表示 】
-
2020年01月-2020年07月Member of the Program Committee of the 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)
-
2020年03月-2020年10月Member of the Program Committee of the 27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)
-
2021年07月-2021年08月Member of the Program Committee of the 27th International Computing and Combinatorics Conference (COCOON'21)
-
2022年Member of the Program Committee of the 28th International Computing and Combinatorics Conference (COCOON'22)
-
2022年Member of the Program Committee of the 29th International Symposium on String Processing and Information Retrieval (SPIRE 2022)
研究テーマ 【 表示 / 非表示 】
競争的資金等の研究課題 【 表示 / 非表示 】
-
文字列圧縮と組合せ論による大規模データ管理・処理技法の開発
文部科学省/日本学術振興会 : 2018年 - 2020年
-
Indexing Massive Datasets with Algorithmic Engineered Compression Techniques on Modern Computer Architectures
文部科学省/日本学術振興会
-
Resource-Constraint Privacy-Aware Data Structures Tackling Problems in Bioinformatics
文部科学省/日本学術振興会
-
広義文字列のアルゴリズムと組合せ論
文部科学省/日本学術振興会
-
Resource-Constraint Privacy-Aware Data Structures Tackling Problems in Bioinformatics
文部科学省/日本学術振興会
論文・総説 【 表示 / 非表示 】
-
Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto. Computing NP-hard Repetitiveness Measures via MAX-SAT Proc. The 30th Annual European Symposium on Algorithms. 2022.09; 244 12:1-12:16. ( DOI )
-
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi. Computing Longest (Common) Lyndon Subsequences Proc. International Workshop on Combinatorial Algorithms (IWOCA 2022). 2022.06; 13270 128-142. ( DOI )
-
Tomohiro I, Robert W. Irving, Dominik Köppl, Lorna Love. Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree String Processing and Information Retrieval. 2021.10; 143-150. ( DOI )
-
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto. A Separation of $\gamma$ and $b$ via Thue–Morse Words String Processing and Information Retrieval. 2021.10; 167-178. ( DOI )
-
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Grammar Index by Induced Suffix Sorting String Processing and Information Retrieval. 2021.10; 85-99. ( DOI )
-
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. c-trie++: A dynamic trie tailored for fast prefix searches Information and Computation. 2021.08; ( DOI )
-
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piątkowski. Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021). 2021.07; 7:1-7:16. ( DOI )
-
Dominik Köppl. Reversed Lempel–Ziv Factorization with Suffix Trees Algorithms. 2021.05; 14 (6): 161. ( DOI )
-
Christina Boucher, Travis Gagie, Tomohiro I, Dominik Köppl, Ben Langmead, Giovanni Manzini, Gonzalo Navarro, Alejandro Pacheco, Massimiliano Rossi 0001. PHONI: Streamed Matching Statistics with Multi-Genome References. 2021.04; 193-202. ( DOI )
-
Köppl, Dominik. Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees Algorithms. 2021.01; 14 (2):
-
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Space-efficient algorithms for computing minimal/shortest unique substrings 2020.12; 845 230-242. ( DOI )
-
Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa. Dynamic Path-decomposed Tries ACM Journal of Experimental Algorithmics. 2020.12; 25 1-28. ( DOI )
-
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto. Re-Pair in Small Space Algorithms. 2020.12; 14 (1): 5. ( DOI )
-
Jacqueline W. Daykin, Dominik Köppl, David Kübel, Florian Stober. On Arithmetically Progressed Suffix Arrays Prague Stringology Conference 2020. 2020.09; 96-110.
-
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto. Re-Pair in Small Space Prague Stringology Conference 2020. 2020.09; 134-147.
-
Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Grammar-compressed Self-index with Lyndon Words Transactions on mathematical modeling and its applications. 2020.08; 13 (2): 84-92.
-
Dominik Köppl, Simon J. Puglisi, Rajeev Raman. Fast and Simple Compact Hashing via Bucketing. SEA. 2020; 7-14. ( DOI )
-
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. DCC. 2020; 243-252. ( DOI )
-
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto. Re-Pair in Small Space. DCC. 2020; 377. ( DOI )
-
Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara. In-Place Bijective Burrows-Wheeler Transforms. CPM. 2020; 21-15. ( DOI )
-
Roland Glück, Dominik Köppl. Computational Aspects of Ordered Integer Partitions with Bounds. Algorithmica. 2020; 82 (10): 2955-2984. ( DOI )
-
Johannes Fischer, Tomohiro I, Dominik Köppl. Deterministic Sparse Suffix Sorting in the Restore Model. ACM Trans. Algorithms. 2020; 16 (4): 50-53. ( DOI )
-
Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Lobel, Kunihiko Sadakane. Compression with the tudocomp framework SEA. 2017.08; 13:1-13:22. ( DOI )
-
Hideo Bannai, Shunsuke Inenaga, Dominik Köppl. Computing all distinct squares in linear time for integer alphabets CPM. 2017.07; 22:1-22:18. ( DOI )
-
Paweł Gawrychowski, I. Tomohiro, Shunsuke Inenaga, Dominik Köppl, Florin Manea. Efficiently finding all maximal α-gapped repeats STACS. 2016.02; 47 483-496. ( DOI )
-
Space-efficient Huffman codes revisited 2023.01; 179 106274. ( DOI )
-
Improving matrix-vector multiplication via lossless grammar-compressed matrices 2022.06; 15 (10): 2175-2187. ( DOI )
-
Space-Efficient B Trees via Load-Balancing. 2022.06; 327-340. ( DOI )
-
Graph Compression for Adjacency-Matrix Multiplication 2022.05; 3 (3): ( DOI )
-
Computing Lexicographic Parsings 2022.03; 232-241. ( DOI )
-
Inferring Spatial Distance Rankings with Partial Knowledge on Routing Networks 2022.03; 13 (4): 1-28. ( DOI )
-
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances 2022.03; 83-92.
-
FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns 2022.03; 63-73. ( DOI )
-
Fast and Simple Compact Hashing via Bucketing. 2022; 84 (9): 2735-2766. ( DOI )
-
Linking Off-Road Points to Routing Networks. 2022; 15 (5): 163. ( DOI )
-
Tomohiro I, Dominik Köppl. Improved upper bounds on all maximal α-gapped repeats and palindromes Theoretical Computer Science. 2019.01; 753 1-15. ( DOI )
-
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Compact Data Structures for Shortest Unique Substring Queries. SPIRE. 2019; 107-123. ( DOI )
-
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski. Indexing the Bijective BWT. CPM. 2019; 17-14. ( DOI )
-
Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck. Bidirectional Text Compression in External Memory. ESA. 2019; 41-16. ( DOI )
-
Johannes Fischer, Tomohiro I, Dominik Köppl, Kunihiko Sadakane. Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees Algorithmica. 2018.07; 80 (7): 2048-2081. ( DOI )
-
Paweł Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea. Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes Theory of Computing Systems. 2018.01; 62 (1): 162-191. ( DOI )
-
Dominik Koppl, Kunihiko Sadakane. Lempel-Ziv Computation in Compressed Space (LZ-CICS) DCC. 2016.03; 3-12. ( DOI )
-
Johannes Fischer, Dominik Köppl, Florian Kurpicz. On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching CPM. 2016; 54 26:1-26:11.
-
Köppl Dominik. Dynamic Skyline Computation with the Skyline Breaker Algorithm 2014; ( DOI )
講演・口頭発表等 【 表示 / 非表示 】
-
Computation of Variations of the LZ77 factorization and the LPF Array with Suffix Trees. 2021.10.01
-
Computation of Variations of the LZ77 factorization and the LPF Array with Suffix Trees. WCTA 2021.10
-
Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree. SPIRE 2021.10
-
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. CPM 2021.07
-
Open Problems on the BBWT. StringMasters 2021.07
-
PHONI: Streamed Matching Statistics with Multi-Genome References. DSB2021 (Data Structures in Bioinformatics) 2021.02
-
Re-Pair in Small Space. PSC 2020.09
-
クップル ドミニク. 省領域な lexicographic parse 構築アルゴリズム. COMP2021-28 2021.11.26
-
(Resource‑Constraint + Privacy)‑Aware Data Structures Tackling Problems in Bioinformatics. AFSA 2021年度 第2回領域集会 2021.10.12
-
Computing Lexicographic Parsings. DCC 2022.03.01