Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
staff:dinklage [2021-06-08 09:49] Patrick Dinklage |
staff:dinklage [2021-07-14 11:18] Patrick Dinklage |
||
|---|---|---|---|
| Line 16: | Line 16: | ||
| </html> | </html> | ||
| - | * **[[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]])\\ // Patrick Dinklage, Johannes Fischer, Alexander Herlez// \\ Symposium on Experimental Algorithms (SEA 2021), Schloss Dagstuhl, 7:1-7:19. | + | ACM Journal of Experimental Algorithmics |
| + | |||
| + | * **[[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]]**\\ // 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.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. | ||
| Line 22: | Line 26: | ||
| * **[[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]]** ([[https://arxiv.org/abs/2002.08061|arXiv version]])\\ //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 35: | ||
| ===== 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 ===== | ||