====== Dominik Köppl ====== {{ :staff:niki_bild.jpg?nolink&200|}} ===== Contact ===== In September 2018, I moved to the [[https://str.i.kyushu-u.ac.jp/|string data processing laboratory at Kyushu university]]. Please consult my [[https://dkppl.de|private homepage]]. | E-Mail: | Use ''dominik.koeppl@'' as a prefix and either ''cs.tu-dortmund.de'' or ''tu-dortmund.de'' as suffix ({{:staff:niki_pgpkey.txt|PGP-Key}}) | | ORCID: | [[http://orcid.org/0000-0002-8721-4444|http://orcid.org/0000-0002-8721-4444]] | ===== 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 ^ |9-11 | | | AG | | | |12-14 | | (SiWiMi) | | | | |14-16 | PG | | (FakRat) | | | |16-18 | | Sport | | | | Above is my weekly schedule. Terms in parenthesis are on a monthly basis (i.e., not every week). 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 ===== /* * **[[https://ls11-www.cs.uni-dortmund.de/staff/koeppl/howtowrite|Tips on scientific writing and how to prepare your thesis]]** */ == Sommersemester 2018 == * [[fischer:teaching:pg-saca|Projektgruppe 616: "SACABench"]] * [[fischer:teaching:ads-ss2018|Seminar Advanced Data Structures]] == Wintersemester 2017/18 == * [[https://ls11-www.cs.tu-dortmund.de/fischer/teaching/pg-pangea|Projektgruppe 605: "PanGeA" - Effiziente Datenstrukturen für Pan-Genom-Annotationen]] ([[http://dkppl.de/static/bin/paper/gcb2017poster.pdf|Poster zur GCB 2017]], [[http://dkppl.de/static/bin/paper/gcb2017.pdf|Poster-Abstract]]) == Sommersemester 2017 == * [[https://ls11-www.cs.tu-dortmund.de/fischer/teaching/pg-pangea|Projektgruppe 605: "PanGeA" - Effiziente Datenstrukturen für Pan-Genom-Annotationen]] * [[fischer:teaching:ads-ss2017|Seminar Advanced Data Structures]] * [[:teaching:seminarae-ss2017 | Seminar Algorithm Engineering]] == Wintersemester 2016/17 == * Programmierpraktikum zu Datenstrukturen, Algorithmen und Programmierung 1 == Sommersemester 2016 == * [[https://ls11-www.cs.uni-dortmund.de/teaching/dap2_ss16_praktikum|Programmierpraktikum]] zu [[http://ls2-www.cs.uni-dortmund.de/lehre/sommer2016/dap2|Datenstrukturen, Algorithmen und Programmierung 2]] == Wintersemester 2015/16 == * [[fischer:teaching:pg-scienceplag|Projektgruppe 588: "SciencePlag"]] ([[https://ls11-www.cs.tu-dortmund.de/people/koeppl/dat2015poster.pdf|Poster zum DAT 2015]],[[http://dx.doi.org/10.17877/DE290R-17672|Abschlussbericht]]) * [[fischer:teaching:ga-ws2015|Proseminar Geometrische Algorithmen]] == Sommersemester 2015 == * [[fischer:teaching:pg-scienceplag|Projektgruppe 588: "SciencePlag"]] == Wintersemester 2014/15 == * [[http://genomeinformatics.uni-due.de/lehre/projektgruppen/algorithmen-zur-entdeckung-krebsauslosender-genvarianten|PG 583 "Algorithmen zur Entdeckung krebsauslösender Genvarianten"]] ([[http://dkppl.de/static/bin/paper/gcb2015poster.pdf|Poster zur GCB 2015]], [[http://dkppl.de/static/bin/paper/gcb2015.pdf|Poster-Abstract]] [[http://dx.doi.org/10.17877/DE290R-16435|Abschlussbericht]]) * [[fischer:teaching:as-ws2014|Proseminar String-Algorithmen]] == Sommersemester 2014 == * [[http://genomeinformatics.uni-due.de/lehre/projektgruppen/algorithmen-zur-entdeckung-krebsauslosender-genvarianten|PG 583 "Algorithmen zur Entdeckung krebsauslösender Genvarianten"]] * [[http://ls11-www.cs.uni-dortmund.de/fischer/teaching/ir-ss2014| Proseminar Information Retrieval]] ===== Research Interests ===== * [[https://ls11-www.cs.tu-dortmund.de/fischer/research/compression|Lossless Compression]] * Combinatorics on Words * [[https://ls11-www.cs.tu-dortmund.de/fischer/research/ti|Indexing Data Structures]] * Most publications are listed at [[http://www.informatik.uni-trier.de/~ley/pers/hd/k/K=ouml=ppl:Dominik.html|DBLP]] ===== Projects ===== * [[http://tudocomp.org|TuDoComp]] - Lossless Compression Suite \\ If you are looking for a thesis (Bachelor or Master) in the field of [[https://ls11-www.cs.tu-dortmund.de/people/koeppl/compresuite.pdf|lossless compression]], consider making an appointment. There are chances to win the [[http://prize.hutter1.net/|Hutter price]]. Literature: * [[http://mattmahoney.net/dc/dce.html|Data Compression Explained]] ===== Departmental Duties ===== * Assistentensprecher (representative of the non-professorial teaching staff) since 2016 Feb 9; moderator of the SiWiMi. * Substitute member of the [[http://www.cs.tu-dortmund.de/nps/de/Einrichtungen/Gremien/FR/|Fakultätsrat Informatik]] (since 2016 Jun) * Member of the [[http://www.cs.tu-dortmund.de/nps/de/Einrichtungen/Gremien/LuSt|Fakultätskommission für Lehre und Studium (LuST)]] (from 2014 Jun 25 until 2016 Mar 16). . ===== 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 ===== * **[[https://doi.org/10.1007/978-3-319-67428-5_16|Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries]]** ([[https://arxiv.org/abs/1706.03035|arXiv version]],[[http://dkppl.de/static/bin/paper/spire2017s.pdf|slides]])\\ //Johannes Fischer, Dominik Köppl// \\ Proceedings of the 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017), LNCS 9472, 191--207. * **[[http://dx.doi.org/10.4230/LIPIcs.CPM.2017.22|Computing All Distinct Squares in Linear Time for Integer Alphabets]]** ([[https://arxiv.org/abs/1610.03421|arXiv version]],[[http://dkppl.de/static/bin/paper/cpm2017s.pdf|slides]]) \\ //Hideo Bannai, Shunsuke Inenaga, Dominik Köppl// \\ Proceeding of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), LIPIcs 78, 22:1--22:18. \\ * **[[http://dx.doi.org/10.4230/LIPIcs.SEA.2017.13|Compression with the tudocomp Framework]]** ([[http://arxiv.org/abs/1702.07577|arXiv version]],[[http://dkppl.de/static/bin/paper/sea2017s.pdf|slides]]) \\ //Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane // \\ Proceeding of the 16th International Symposium on Experimental Algorithms (SEA 2017), LIPIcs 75, 13:1–13:22. \\ * **[[http://dx.doi.org/10.4230/LIPIcs.CPM.2016.26|On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching]]** [[https://arxiv.org/abs/1606.02465|(arXiv version)]] \\ //Johannes Fischer, Dominik Köppl, Florian Kurpicz// \\ Proceedings of th 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), LIPIcs 54, 2016, 26:1--26:11 * **[[http://link.springer.com/chapter/10.1007/978-3-662-49529-2_36|Deterministic Sparse Suffix Sorting on Rewritable Texts]]** ([[http://arxiv.org/abs/1509.07417|arXiv version]],[[http://dkppl.de/static/bin/paper/latin2016s.pdf|slides]]) \\ //Johannes Fischer, Tomohiro I, Dominik Köppl// \\ Proceedings of the 12th Latin American Symposium on Theoretical Informatics (LATIN 2016), LNCS 9644, 483-496 * **[[http://dx.doi.org/10.1109/DCC.2016.38|Lempel Ziv Computation In Compressed Space (LZ-CICS)]]** ([[http://arxiv.org/abs/1510.02882|arXiv version]],[[http://dkppl.de/static/bin/paper/dcc2016s.pdf|slides]]) \\ //Dominik Köppl, Kunihiko Sadakane// \\ Proceedings of the Data Compression Conference 2016 (DCC 2016), IEEE, 3-12. \\ 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. * **[[http://dx.doi.org/10.4230/LIPIcs.STACS.2016.39|Efficiently Finding All Maximal α-gapped Repeats]]** ([[http://arxiv.org/abs/1509.09237|arXiv version]],[[http://dkppl.de/static/bin/paper/timini2015s.pdf|slides]]) \\ //Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea// \\ STACS, 2016, 39:1-39:14. * **[[http://link.springer.com/chapter/10.1007%2F978-3-319-19929-0_15|Lempel-Ziv Computation in Small Space]]** ([[http://arxiv.org/abs/1504.02605|arXiv version]],[[https://ls11-www.cs.tu-dortmund.de/people/koeppl/cpm2015.pdf|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 * **[[http://link.springer.com/chapter/10.1007%2F978-3-319-23660-5_12|Arithmetics on Suffix Arrays of Fibonacci Words]]** ([[http://dkppl.de/static/bin/paper/words2015.pdf|preprint]],[[https://ls11-www.cs.tu-dortmund.de/people/koeppl/words2015.pdf|slides]])\\ //Dominik Köppl, Tomohiro I//\\ Proceedings of the 10th International Conference on Combinatorics on Words (WORDS 2015), LNCS 9304, 135-146 * **[[http://dx.doi.org/10.1007/978-3-319-15545-6_19|Structured Document Algebra in Action]]** ([[http://dkppl.de/static/bin/paper/sda2015.pdf|preprint]]) \\ //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 /* ===== Pre-Prints ===== * **[[http://arxiv.org/abs/1706.03035|Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries]]**\\ //Johannes Fischer, Dominik Köppl// \\ */ ===== Other Publications ===== * **[[http://dx.doi.org/10.17877/DE290R-19051|Exploring Regular Structures in Strings]]** ([[https://dkppl.de/static/bin/paper/diss18.pdf|mirror]],[[http://dkppl.de/static/bin/paper/diss18s.pdf|slides]]) \\ //Dominik Köppl //\\ Dissertation, TU Dortmund Eldorado, 2018 * **[[https://dkppl.de/static/bin/paper/sobigdata2018.pdf|Lempel-Ziv with Integer Coders]]** \\ //Dominik Köppl //\\ Newsletter of the SoBigData Research Infrastructure, Issue 1, 2018 * **[[http://hdl.handle.net/2003/34360|Dynamic Skyline Computation with the Skyline Breaker Algorithm]]**\\ //Dominik Köppl //\\ Local Proceedings of the Workshop on Massive Data, 2014 (weakly reviewed) ===== Tutorial for Pupils ===== * 2017 Feb 16-17: [[https://ls11-www.cs.uni-dortmund.de/bwinf/2017/3dprinter|BwInf-Workshop]] (3D printing tutorial for highschool students) with [[http://www.openscad.org|OpenSCAD]]. /* Some selected projects done by the participants: * [[http://dkppl.de/static/bin/projects/openscad/hilbert2d.scad|2D Hilbert curve]] * [[http://dkppl.de/static/bin/projects/openscad/hilbert3d.scad|3D Hilbert curve]] * [[http://dkppl.de/static/bin/projects/openscad/menger2d.scad|2D Menger sponge]] * [[http://dkppl.de/static/bin/projects/openscad/menger3d.scad|3D Menger sponge]] * [[http://dkppl.de/static/bin/projects/openscad/2017bwinf.pptx|Final presentation]] */ * 2016 Feb 18-19: [[https://ls11-www.cs.uni-dortmund.de/bwinf/2016/greeps|BwInf-Workshop]] (java tutorial for highschool students) with [[http://www.greenfoot.org/competition/greeps|Greenfoot]] * 2015 Nov 25: Sortieren mit Gnome-Sort (in German), at the [[http://schuelertag.cs.tu-dortmund.de|Studieninformationstag der Fakultät für Informatik 2015]] ([[https://ls11-www.cs.tu-dortmund.de/people/koeppl/gnomesort_slides.pdf|Slides]],[[https://ls11-www.cs.tu-dortmund.de/people/koeppl/gnomesort_worksheet.pdf|Worksheet]]) ===== Talks ===== * 2017 Jun 4: [[http://dkppl.de/static/bin/paper/tudocomp2018s.pdf|Plug&Play Kompression mit dem Framework tudocomp]], Vortragsreihe der [[http://rg-dortmund.gi.de/veranstaltungstermine/naechster-termin.html|Regionalgruppe der Gesellschaft für Informatik]] * 2018 Jan 29: Indexing the Bijective BWT, at the [[https://ls1-www.cs.tu-dortmund.de/de/conferences-events/mini-workshop|Mini-Workshop für Theoretische Informatik]] * 2017 Sep 29: Indexing the Bijective BWT, at the [[http://pages.di.unipi.it/spire2017/wcta.html|WCTA workshop 2017]] ([[http://dkppl.de/static/bin/paper/wcta2017s.pdf|slides]]) * 2017 Jan 19: Computing All Distinct Squares in Linear Time for Integer Alphabets, at the [[https://ls1-www.cs.tu-dortmund.de/de/conferences-events/mini-workshop|Mini-Workshop für Theoretische Informatik]] ([[http://dkppl.de/static/bin/paper/timini2017s.pdf|slides]]) * 2016 Nov 12: [[https://www.jsps-bonn.de/ja/event-information/junior-forum/2439/?type=98|4th JSPS Junior Forum]] * 2016 Feb 15-16: [[https://ls1-www.cs.tu-dortmund.de/de/conferences-events/theorietag-2016|Theorietag 2016]] * 2015 Dec 14: Finding maximal α-gapped repeats and palindromes, at the [[https://ls1-www.cs.tu-dortmund.de/de/conferences-events/mini-workshop|Mini-Workshop für Theoretische Informatik]] ([[http://dkppl.de/static/bin/paper/timini2015s.pdf|slides]]) ===== Supervised/Supervising Theses ===== * Daniel Kurowski (Bachelor): [[https://ls11-www.cs.tu-dortmund.de/fischer/abschlussarbeiten/gappedrepeat|Analyse und Optimierung eines Algorithmus zur Bestimmung aller Wiederholungen mit einer Lücke beschränkter Größe]] * Alexander Kramer (Bachelor): [[fischer:abschlussarbeiten:elscoder|Analyse und Auswertung von Kodierungen für Kompressionsalgorithmen]] * Oliver Magiera (Bachelor, Zweitgutachter, supervised by Igor Vantolkin): [[https://ls11-www.cs.uni-dortmund.de/staff/koeppl/bamageira|Erkennung melodischer Muster an symbolischen Musikdaten]] * Ole Bergenholtz (Master): [[fischer:abschlussarbeiten:greedy|Implementierung und Evaluierung eines grammatikbasierten verlustfreien gierigen Kompressionsalgorithmus]] * Marvin Löbel (Bachelor): [[fischer:abschlussarbeiten:grammar|Grammatikkompression mit Edit Sensitive Parsing]] * Sven Wiemann (Bachelor): [[https://ls11-www.cs.uni-dortmund.de/fischer/abschlussarbeiten/skyline_parallel|Analyse und Auswertung paralleler Skyline-Algorithmen]], 2016 -- see [[https://github.com/sven-wi/SkylineCompare|SkylineCompare]] * Florian Kleine (Bachelor): [[https://ls11-www.cs.uni-dortmund.de/fischer/abschlussarbeiten/lz78var|Textkompression mithilfe einer Variante von LZ78]], 2016 * Viktor Schäfer(Bachelor): [[https://ls11-www.cs.uni-dortmund.de/fischer/abschlussarbeiten/lzcicslz78|Praktische Evaluation zweier Lempel–Ziv Algorithmen mit platzsparenden Datenstrukturen]], 2016 * [[https://www.bio.ifi.lmu.de/mitarbeiter/jens-quedenfeld/index.html|Jens Quedenfeld]] (Master, Zweitgutachten, supervised by Prof. Dr. Sven Rahmann): Variantentolerantes Readmapping durch Locality Sensitive Hashing, 2016 * Andreas Lir (Bachelor): [[https://ls11-www.cs.tu-dortmund.de/fischer/abschlussarbeiten/esp_lce|Evaluation von LCE-Anfragen mit dem hierarchical-stable-parsing-Baum]], 2016, abgebrochen * Patrick Übbing (Bachelor, Zweitgutachten): [[https://ls11-www.cs.tu-dortmund.de/fischer/abschlussarbeiten/formalesprachen|Formale Sprachen und Automaten im Informatikunterricht: Kontextorientierter Unterricht und Querbezüge zu weiteren Inhaltsfeldern]], 2016 * Patrick Dinklage (Bachelor, Zweitgutachten): [[https://ls11-www.cs.tu-dortmund.de/fischer/abschlussarbeiten/lcp-compress|Textkompression mit Hilfe des LCP-Arrays]], 2015 If not stated otherwise, the thesis were supervised by Prof. Dr. Johannes Fischer. ===== Supervisor of Student Assistants and Research Assistants ===== * [[https://ls11-www.cs.tu-dortmund.de/staff/ellert|Jonas Ellert]] (since 2017 Dec 1) * [[https://github.com/Kimundi|Marvin Löbel]] (since 2015 Jun 1) * [[https://github.com/pdinklag|Patrick Dinklage]] (since 2016 Jan 16) * [[http://seanrt.github.io|Sean Tohidi]] - Canadian [[https://ls11-www.cs.tu-dortmund.de/people/koeppl/daadrise2016.pdf|DAAD RISE]] intern (from 2016 May 17 to 2016 Jul 16) ===== Review Activities ===== ==== 2017 ==== * Combinatorial Pattern Matching (CPM 2017), Sub-Reviewer * Symposium on Experimental Algorithms (SEA 2017), Sub-Reviewer * Prague Stringology Conference (PSC 2017), Sub-Reviewer ==== 2016 ==== * Transactions on Computational Biology and Bioinformatics (TCBB-2016-06), IEEE/ACM. Reviewer ==== 2015 ==== * Theoretical Computer Science (TCS-D-15), Elsevier. Reviewer * Transactions on Computational Biology and Bioinformatics (TCBB-2015-05), IEEE/ACM. 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 ==== 2014 ==== * Workshop on Massive Data (MASSIVE 2014), Sub-Reviewer ===== Work experiences ===== * 2014 Apr - 2018 Sep: Researcher at TU Dortmund * 2012 Sep - 2014 Mar: Researcher at the university of Augsburg, Chair of Database and Information Systems ===== Visiting experiences ===== * 2017 Mar 27 - Apr 11 Visiting [[http://acube.di.unipi.it/|Prof. Paolo Ferragina at the Acube Lab of Pisa University]] (travel grant by the [[http://www.sobigdata.eu/|SoBigData project]]) * 2016 Jul 4 to Aug 23: Visiting [[https://str.i.kyushu-u.ac.jp| the string data processing laboratory of Prof. Inenaga and Prof. Bannai at Kyushu]] (part of the [[http://www.jsps.go.jp/english/e-summer|JSPS summer program]]) * 2016 Jun 21 to Jul 1: Visiting [[http://www.misojiro.t.u-tokyo.ac.jp|Prof. Sadakane at the university of Tokyo]] (part of the [[http://www.jsps.go.jp/english/e-summer|JSPS summer program]]) * 2015 Aug/Sep: Visited [[http://www.misojiro.t.u-tokyo.ac.jp|Prof. Sadakane at the university of Tokyo]] (part of the scholarship program of the [[http://www.japan-studienwerk.de/|Studienwerk für Deutsch-Japanischen Kulturaustausch in NRW e.V.]]) ===== Organizing ===== * 2016 Mar 14: [[https://ls11-www.cs.uni-dortmund.de/fischer/informatiktag2016|Informatiktag NRW 2016]] of the [[http://informatiktag-nrw.de/informatiktag/informatiktag2016/|GI]] ===== Participations ===== * 2018 Jul 8-13 [[http://www.dagstuhl.de/18281|Dagstuhl Seminar 18281: Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices]] * 2017 Sep 26-29 [[http://pages.di.unipi.it/spire2017|SPIRE]], supported by a BIRDS travel grant under the Marie Skłodowska-Curie grant agreement No 690941. * 2017 Jul 4-6 [[http://cpm2017.mimuw.edu.pl/|CPM]] * 2017 Jun 21-23 [[https://nms.kcl.ac.uk/informatics/events/SEA2017/|SEA]] * 2016 Apr 10-15: [[http://latin2016.natix.org|Latin]], supported by a DAAD travel grant * 2016 Mar 29 - Apr 1: [[http://www.cs.brandeis.edu/~dcc|DCC]], supported by CREST, JST * 2016 Feb 22-26: [[http://www.cse.iitm.ac.in/abd/?mode=Home|Indo-German Spring School on Algorithms for Big Data]] * 2015 Sep 14 - 17 [[http://words2015.uni-kiel.de|WORDS]] * 2015 Jun 29 - Jul 1: [[http://www.cpm2015.di.unisa.it|CPM]] * 2015 Feb 2-4 [[http://stringmasters.mimuw.edu.pl|Stringmasters]] * 2014 Sep 17-19: [[http://www.algorithm-engineering.de/final-meeting|Final Meeting / Summer School for the DFG in Karlsruhe/Bad Herrenalb]] * 2014 Sep 8-10 [[http://algo2014.ii.uni.wroc.pl/|ALGO]] * 2014 Jun 11-12 [[https://www.seqan.de/archive/1005/seqan-biostore-conference-2014|SeqAn – BioStore Conference]]