Dominik Köppl


Room: R. 209 in OH14
Phone: +49 231 755 7712
E-Mail: Use dominik.koeppl@ as a prefix and either or as suffix (PGP-Key)
Consultation hours: Please make an appointment by writing a short mail.

Consultation Rules

I can read and reply to mails written in English, German, Bavarian and French.

Although formalities are not required, I appreciate reading orthographically correct sentences.

Hours Mon Tue Wed Thu Fri
10-12 DAP2 DAP2 AG
12-14 DAP2 DAP2
16-18 DAP2

Above is my weekly schedule. Entries represent time slots when I have definitely no time. This does not imply that I have time when there is no entry given.

Teaching in German

Sommersemester 2016
Wintersemester 2015/16
Sommersemester 2015
Wintersemester 2014/15
Sommersemester 2014

Research Interests

  • String Compression
  • Combinatorics
  • Succinct Data Structures
  • Most publications are listed at DBLP


  • TuDoComp - Lossless Compression Suite
    If you are looking for a thesis (Bachelor or Master) in the field of lossless compression, consider making an appointment. There are chances to win the Hutter price.

Departmental Duties


Chair Duties

  • First Aider (Ersthelfer) since 2014 Sep 24
  • Fire Prevention Helper (Brandschutzhelfer) since 2014 Mai 12
  • Gitolite-Admin since 2014 Oct 9
  • Linux IT consultant of the Fischer group (Ansprechpartner für die IRB)

Peer Reviewed Publications

  • Lempel-Ziv Computation in Small Space (arXiv version,slides)
    Johannes Fischer, Tomohiro I, Dominik Köppl
    Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), LNCS 9133, Springer, 172-184
  • Arithmetics on Suffix Arrays of Fibonacci Words (slides)
    Dominik Köppl, Tomohiro I
    Proceedings of the 10th International Conference on Combinatorics on Words (WORDS 2015), Springer, 135-146
  • Structured Document Algebra in Action
    Don S. Batory, Peter Höfner, Dominik Köppl, Bernhard Möller, Andreas Zelend
    Structured Document Algebra in Action. Software, Services, and Systems 2015, Springer, 291-311
  • DCC'16 Errata: the number of giant nodes can be in the worst case O(n) - O(lg n), not O(n/lg n) like proposed in the paper. This is not a problem since it is sufficient to store the exploration counters of the lowest giant nodes, which are O(n/ lg n) many. A giant node that is not the lowest giant node can adopt one exploration counter of one lowest giant node in its subtree until it got fully explored.

Weakly Reviewed Publications


Supervised/Supervising Theses

Supervisor of Student Assistants and Research Assistants

Review Activities


  • Theoretical Computer Science (TCS-D-15), Elsevier. Reviewer
  • Transactions on Computational Biology and Bioinformatics (TCBB-2015-05). Reviewer
  • Journal of Computer and System Sciences (JCSS-D-15). Sub-Reviewer
  • 22nd edition of the International Symposium on String Processing and Information Retrieval (SPIRE 2015), Sub-Reviewer
  • Journal of Discrete Algorithms (JDA-15). Sub-Reviewer
  • Combinatorial Pattern Matching (CPM 2015), Sub-Reviewer


  • Workshop on Massive Data (MASSIVE 2014), Sub-Reviewer

Work experiences

  • since 2014 Apr: Researcher at TU Dortmund
  • 2012 Sep - 2014 Mar: Researcher at the university of Augsburg, Chair of Database and Information Systems

Visiting experiences



Last modified: 2016-10-18 09:35 by Dominik Köppl