Personnel Information

写真a

KOEPPL Dominik


Job title

Assistant Professor

Laboratory Address

5th Floor of Building 22

Laboratory Phone number

+81-3-5280-8626

Mail Address

The inquiry by e-mail is 《here》

Homepage URL

https://dkppl.de/

To the head of this page.▲

Campus Career 【 display / non-display 】

  • 2020.10
    -
    2022.06
    Tokyo Medical and Dental University， M&D Data Science Center， Division of Data Science Algorithm Design and Analysis， Assistant Professor
  • 2022.07
    -
    Now
    Tokyo Medical and Dental University， M&D Data Science Center， Division of Data Science Algorithm Design and Analysis， Department of Data Science Algorithm Design and Analysis， Assistant Professor
To the head of this page.▲

Academic Activity 【 display / non-display 】

  • 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)
To the head of this page.▲
 

Research Theme 【 display / non-display 】

  • Resource-Constraint Privacy-Aware Data Structures Tackling Problems in Bioinformatics, 2021.09 - 2023.03

  • Indexing Massive Datasets with Algorithmic Engineered Compression Techniques on Modern Computer Architectures, 2021.04 - 2024.03

To the head of this page.▲

Published Papers & Misc 【 display / non-display 】

  1. 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 )

  2. 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 )

  3. 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 )

  4. 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 )

  5. 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 )

  6. 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 )

  7. 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 )

  8. Dominik Köppl. Reversed Lempel–Ziv Factorization with Suffix Trees Algorithms. 2021.05; 14 (6): 161. ( DOI )

  9. 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 )

  10. Köppl, Dominik. Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees Algorithms. 2021.01; 14 (2):

  11. 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 )

  12. 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 )

  13. 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 )

  14. Jacqueline W. Daykin, Dominik Köppl, David Kübel, Florian Stober. On Arithmetically Progressed Suffix Arrays Prague Stringology Conference 2020. 2020.09; 96-110.

  15. 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.

  16. 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.

  17. Dominik Köppl, Simon J. Puglisi, Rajeev Raman. Fast and Simple Compact Hashing via Bucketing. SEA. 2020; 7-14. ( DOI )

  18. Roland Glück, Dominik Köppl. Computational Aspects of Ordered Integer Partitions with Bounds. Algorithmica. 2020; 82 (10): 2955-2984. ( DOI )

  19. Johannes Fischer, Tomohiro I, Dominik Köppl. Deterministic Sparse Suffix Sorting in the Restore Model. ACM Trans. Algorithms. 2020; 16 (4): 50-53. ( DOI )

  20. Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara. In-Place Bijective Burrows-Wheeler Transforms. CPM. 2020; 21-15. ( DOI )

  21. 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 )

  22. Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto. Re-Pair in Small Space. DCC. 2020; 377. ( DOI )

  23. Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Lobel, Kunihiko Sadakane. Compression with the tudocomp framework SEA. 2017.08; 13:1-13:22. ( DOI )

  24. 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 )

  25. Paweł Gawrychowski, I. Tomohiro, Shunsuke Inenaga, Dominik Köppl, Florin Manea. Efficiently finding all maximal α-gapped repeats STACS. 2016.02; 47 483-496. ( DOI )

▼display all

To the head of this page.▲

Conference Activities & Talks 【 display / non-display 】

  1. Computation of Variations of the LZ77 factorization and the LPF Array with Suffix Trees. 2021.10.01

  2. Computation of Variations of the LZ77 factorization and the LPF Array with Suffix Trees. WCTA 2021.10

  3. Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree. SPIRE 2021.10

  4. Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. CPM 2021.07

  5. Open Problems on the BBWT. StringMasters 2021.07

  6. PHONI: Streamed Matching Statistics with Multi-Genome References. DSB2021 (Data Structures in Bioinformatics) 2021.02

  7. Re-Pair in Small Space. PSC 2020.09

▼display all

To the head of this page.▲