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-05-31 13:00] Patrick Dinklage |
staff:dinklage [2021-06-09 08:30] 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), accepted and to be published. | + | * **[[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. | ||