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-09 08:33] Patrick Dinklage |
staff:dinklage [2021-07-14 11:18] Patrick Dinklage |
||
---|---|---|---|
Line 15: | Line 15: | ||
<div itemscope itemtype="https://schema.org/Person"><a itemprop="sameAs" content="https://orcid.org/0000-0002-2004-6781" href="https://orcid.org/0000-0002-2004-6781" target="orcid.widget" rel="me noopener noreferrer" style="vertical-align:top;"><img src="https://orcid.org/sites/default/files/images/orcid_16x16.png" style="width:1em;margin-right:.5em;" alt="ORCID iD icon">https://orcid.org/0000-0002-2004-6781</a></div> | <div itemscope itemtype="https://schema.org/Person"><a itemprop="sameAs" content="https://orcid.org/0000-0002-2004-6781" href="https://orcid.org/0000-0002-2004-6781" target="orcid.widget" rel="me noopener noreferrer" style="vertical-align:top;"><img src="https://orcid.org/sites/default/files/images/orcid_16x16.png" style="width:1em;margin-right:.5em;" alt="ORCID iD icon">https://orcid.org/0000-0002-2004-6781</a></div> | ||
</html> | </html> | ||
+ | |||
+ | 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.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. | ||
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 ===== |