Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
staff:dinklage [2022-01-06 11:38] Patrick Dinklage |
staff:dinklage [2022-05-24 10:58] 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 | ||
| + | * **[[https://github.com/pdinklag/word-packing|word-packing]]** - Word-Packed Integer Vectors for C++ | ||
| ===== Publications ===== | ===== Publications ===== | ||
| Line 22: | Line 24: | ||
| * **[[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. | ||
| - | * **[[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]]** ([[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. | ||