Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
|
staff:dinklage [2021-04-21 12:14] Patrick Dinklage |
staff:dinklage [2022-05-12 09:57] Patrick Dinklage |
||
|---|---|---|---|
| Line 7: | Line 7: | ||
| | Consultation hours: | on appointment (E-Mail) | | | Consultation hours: | on appointment (E-Mail) | | ||
| - | ===== Projects ===== | + | ===== Software ===== |
| * **[[http://tudocomp.org/|tudocomp]]** - Lossless Compression Framework | * **[[http://tudocomp.org/|tudocomp]]** - Lossless Compression Framework | ||
| + | * **[[https://github.com/pdinklag/random-permutation|random-permutation]]** - Generate (prefixes of) random permutations on the fly | ||
| ===== Publications ===== | ===== Publications ===== | ||
| Line 16: | Line 17: | ||
| </html> | </html> | ||
| - | * **Engineering Predecessor Data Structures for Dynamic Integer Sets**\\ // Patrick Dinklage, Johannes Fischer, Alexander Herlez// \\ Symposium on Experimental Algorithms (SEA 2021), accepted and to be published. | + | ACM Journal of Experimental Algorithmics |
| - | * **[[https://doi.org/10.4230/LIPIcs.ESA.2020.39|Practical Performance of Space Efficient Data Structures for Longest Common Extensions]]**\\ // Patrick Dinklage, Johannes Fischer, Alexander Herlez, Tomasz Kociumaka, Florian Kurpicz// \\ European Symposium on Algorithms (ESA 2020), Schloss Dagstuhl, 39:1-39:20. | + | * **[[https://doi.org/10.1145/3457197|Practical Wavelet Tree Construction]]**\\ // Patrick Dinklage, Jonas Ellert, Johannes Fischer, Florian Kurpicz, Marvin Löbel// \\ Journal of Experimental Algorithmics, ACM, 2021. |
| + | |||
| + | * **[[https://doi.org/10.4230/LIPIcs.SEA.2021.7|Engineering Predecessor Data Structures for Dynamic Integer Sets]]** ([[https://arxiv.org/abs/2104.06740|arXiv version]]) ([[http://sci.pdinklag.de/slides/conferences/SEA21%20-%20Engineering%20Predecessor%20Data%20Structures%20for%20Dynamic%20Integer%20Sets.pdf|SEA 2021 slides]])\\ // Patrick Dinklage, Johannes Fischer, Alexander Herlez// \\ Symposium on Experimental Algorithms (SEA 2021), Schloss Dagstuhl, 7:1-7:19. | ||
| + | |||
| + | * **[[https://doi.org/10.4230/LIPIcs.ESA.2020.39|Practical Performance of Space Efficient Data Structures for Longest Common Extensions]]** ([[https://www.kurpicz.org/2020-08-31-Video-Presentation-ESA.html|ESA 2020 presentation]])\\ // Patrick Dinklage, Johannes Fischer, Alexander Herlez, Tomasz Kociumaka, Florian Kurpicz// \\ European Symposium on Algorithms (ESA 2020), Schloss Dagstuhl, 39:1-39:20. | ||
| * **[[https://doi.org/10.1137/1.9781611976007.17|Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory]]**\\ //Patrick Dinklage, Johannes Fischer, Florian Kurpicz// \\ SIAM Symposium on Algorithm Engineering and Experiments (ALENEX 2020), SIAM, 214-228. | * **[[https://doi.org/10.1137/1.9781611976007.17|Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory]]**\\ //Patrick Dinklage, Johannes Fischer, Florian Kurpicz// \\ SIAM Symposium on Algorithm Engineering and Experiments (ALENEX 2020), SIAM, 214-228. | ||
| - | * **[[http://www.stringology.org/papers/PSC2019.pdf|Translating Between Wavelet Tree and Wavelet Matrix Construction]]**\\ //Patrick Dinklage// \\ Prague Stringology Conference (PSC 2019), Prague Stringology Club, 126-135. | + | * **[[http://www.stringology.org/papers/PSC2019.pdf|Translating Between Wavelet Tree and Wavelet Matrix Construction]]** ([[https://arxiv.org/abs/2002.08061|arXiv version]]) ([[http://sci.pdinklag.de/slides/conferences/PSC%202019%20-%20Translating%20Between%0aWavelet%20Tree%20and%20Wavelet%20Matrix%20Construction.pdf|PSC 2019 slides]])\\ //Patrick Dinklage// \\ Prague Stringology Conference (PSC 2019), Prague Stringology Club, 126-135. |
| * **[[https://doi.org/10.4230/LIPIcs.ESA.2019.41|Bidirectional Text Compression in External Memory]]** ([[http://arxiv.org/abs/1907.03235|arXiv version]]) \\ //Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck // \\ 27th Annual European Symposium on Algorithms (ESA 2019), LIPIcs 144, 41:1-41:16. | * **[[https://doi.org/10.4230/LIPIcs.ESA.2019.41|Bidirectional Text Compression in External Memory]]** ([[http://arxiv.org/abs/1907.03235|arXiv version]]) \\ //Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck // \\ 27th Annual European Symposium on Algorithms (ESA 2019), LIPIcs 144, 41:1-41:16. | ||
| Line 31: | Line 36: | ||
| ===== Theses ===== | ===== Theses ===== | ||
| - | * **[[https://ls11-www.cs.tu-dortmund.de/fischer/abschlussarbeiten/lcp-compress|Textkompression mit Hilfe des LCP-Arrays]]** (German) \\ // Supervised by Johannes Fischer and Dominik Köppl// \\ Bachelor's Thesis, Dortmund, 2015 | + | * **[[http://sci.pdinklag.de/theses/Dinklage15%20-%20BSc%20Thesis%20-%20Textkompression%20mithilfe%20von%20Enhanced%20Suffx%20Arrays.pdf|Textkompression mithilfe des LCP-Arrays]]** (German) \\ // Supervised by Johannes Fischer and Dominik Köppl// \\ Bachelor's Thesis, Dortmund, 2015 |
| - | * **[[https://ls11-www.cs.tu-dortmund.de/fischer/abschlussarbeiten/distributed_wt|Distributed Wavelet Tree Construction]]** \\ // Supervised by Johannes Fischer and Florian Kurpicz// \\ Master's Thesis, Dortmund, 2019 | + | * **[[http://sci.pdinklag.de/theses/Dinklage19%20-%20MSc%20Thesis%20-%20Distributed%20Wavelet%20Tree%20Construction.pdf|Distributed Wavelet Tree Construction]]** \\ // Supervised by Johannes Fischer and Florian Kurpicz// \\ Master's Thesis, Dortmund, 2019 |
| ===== Teaching ===== | ===== Teaching ===== | ||
| Line 38: | Line 43: | ||
| === Lectures === | === Lectures === | ||
| + | * **[[https://ls11-www.cs.tu-dortmund.de/de/rudolph/lehre/fp_det_ws_21_22|Fachprojekt Digital Entertainment Technologies]]** \\ WiSe 21/22 | ||
| * **[[https://ls11-www.cs.tu-dortmund.de/de/rudolph/lehre/fp_det_ss_21|Fachprojekt Digital Entertainment Technologies]]** \\ SoSe 21 | * **[[https://ls11-www.cs.tu-dortmund.de/de/rudolph/lehre/fp_det_ss_21|Fachprojekt Digital Entertainment Technologies]]** \\ SoSe 21 | ||
| * **[[https://ls11-www.cs.tu-dortmund.de/fischer/teaching/pg-plads|PG 628: PlaDs]]** \\ WiSe 19/20 & SoSe 20 | * **[[https://ls11-www.cs.tu-dortmund.de/fischer/teaching/pg-plads|PG 628: PlaDs]]** \\ WiSe 19/20 & SoSe 20 | ||
| Line 43: | Line 49: | ||
| === Slides === | === Slides === | ||
| - | For internal work group sessions, I have been preparing slides on selected papers that I read. These are released under the CC0 license: | + | For internal work group sessions, I have been preparing slides on selected papers that I read. These are released under the [[https://creativecommons.org/share-your-work/public-domain/cc0/|CC0 license]] here: http://sci.pdinklag.de/slides |
| * [[http://sci.pdinklag.de/slides/2020-05-07%20-%20Dynamic%20Fusion%20Node.pdf|Visualization of Dynamic Fusion Nodes]] (some labels in German) [Patrascu & Thorup, FOCS 2014] | * [[http://sci.pdinklag.de/slides/2020-05-07%20-%20Dynamic%20Fusion%20Node.pdf|Visualization of Dynamic Fusion Nodes]] (some labels in German) [Patrascu & Thorup, FOCS 2014] | ||
| Line 50: | Line 56: | ||
| * [[http://sci.pdinklag.de/slides/2021-02-24%20-%20Count-Min%20&%20Augmented%20Sketch.pdf|Count-Min and Augmented Sketch]] [Cormode & Muthukrishnan, J. Algorithms 55, 2005],[Roy et al., ACM SIGMOD 2016] | * [[http://sci.pdinklag.de/slides/2021-02-24%20-%20Count-Min%20&%20Augmented%20Sketch.pdf|Count-Min and Augmented Sketch]] [Cormode & Muthukrishnan, J. Algorithms 55, 2005],[Roy et al., ACM SIGMOD 2016] | ||
| * [[http://sci.pdinklag.de/slides/2021-03-17%20-%20Linear%20BWT%20in%20Small%20Space.pdf|Linear-Time BWT Construction in Small Space]] [Munro et al., SODA 2017] | * [[http://sci.pdinklag.de/slides/2021-03-17%20-%20Linear%20BWT%20in%20Small%20Space.pdf|Linear-Time BWT Construction in Small Space]] [Munro et al., SODA 2017] | ||
| + | * [[http://sci.pdinklag.de/slides/2021-05-05%20-%20LZ77%20In%20A%20Sliding%20Window.pdf|LZ77 in a Sliding Window]] [Bille et al., CPM 2017] | ||
| + | * [[http://sci.pdinklag.de/slides/2021-09-29%20-%20Text%20Factorization%20of%20gzip.pdf|Text Factorization of gzip]] | ||
| + | * [[http://sci.pdinklag.de/slides/2021-12-01%20-%20Block%20Trees.pdf|Block Trees]] [Belazzougui et al., DCC 2015 / J.CSS 2021] | ||
| ===== Workshops ===== | ===== Workshops ===== | ||