Dominik Köppl
Scholar

Dominik Köppl

Google Scholar ID: T4vDwgwAAAAJ
Faculty for Engineering, University of Yamanashi
stringologyalgorithms and data structurescombinatorics on words
Citations & Impact
All-time
Citations
548
 
H-index
12
 
i10-index
16
 
Publications
20
 
Co-authors
0
 
Resume (English only)
Academic Achievements
  • Publications include: 'Space-Efficient B Trees via Load-Balancing' (2025, Theory of Computing Systems); 'Counting Distinct (Non-)crossing Substrings' (2025, Proc. SPIRE); Invited talk 'Substring Compression Variants' (2025, University of Ulm and the Bézout Labex colloquium); 'Extending the Burrows–Wheeler Transform for Cartesian Tree Matching and Constructing It' (2025, Proc. CPM).
Research Experience
  • Apr 2023 - Sep 2023: Junior Professor at Universität Münster, leading the Arbeitssgruppe Praktische Informatik; Sep 2020 - Mar 2023: Assistant Professor at the M&D Data Science Center of Tokyo Medical and Dental University, Division of Data Science Algorithm Design and Analysis; Sep 2018 - Sep 2020: Post-Doctoral Researcher at the Department of Informatics of Kyushu University, String Data Processing Laboratory; Apr 2014 - Sep 2018: Researcher at TU Dortmund, Chair 11: Algorithm Engineering; Sep 2012 - Mar 2014: Researcher at the University of Augsburg, Chair of Database and Information Systems.
Background
  • Research Interests: Data Structures, String Algorithms, Combinatorics on Words; Professional Field: Theoretical Computer Science; Brief Introduction: Currently a Research Associate Professor at the University of Yamanashi, affiliated with the Department of Computer Science and Engineering.
Miscellany
  • Languages supported: Bavarian, English, French, German, Japanese; Personal interests: Not specifically mentioned
Co-authors
0 total
Co-authors: 0 (list not available)