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 [2020-09-09 18:58] Patrick Dinklage [Workshops] |
staff:dinklage [2021-04-21 12:15] 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> | ||
| + | |||
| + | * **[[https://arxiv.org/abs/2104.06740|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. | ||
| * **[[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 33: | Line 35: | ||
| ===== Teaching ===== | ===== Teaching ===== | ||
| + | |||
| + | === Lectures === | ||
| + | |||
| + | * **[[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 | ||
| + | |||
| + | === Slides === | ||
| + | |||
| + | For internal work group sessions, I have been preparing slides on selected papers that I read. These are released under the CC0 license: | ||
| + | |||
| + | * [[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/2021-02-10%20-%20RLBWT%20to%20LZ77.pdf|RLBWT to LZ77]] [Policriti & Prezza, Algorithmica 80, 2018] | ||
| + | * [[http://sci.pdinklag.de/slides/2021-02-17%20-%20Online%20BWT.pdf|Online construction of the RLBWT]] [Policriti et al., LATA 2015],[Ohno et al., J. Discrete Algorithms 52-53, 2018],[Bannai et al., CPM 2018] | ||
| + | * [[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] | ||
| ===== Workshops ===== | ===== Workshops ===== | ||