Differences
This shows you the differences between two versions of the page.
|
fischer:teaching:ads-ss2020 [2020-02-12 09:52] |
fischer:teaching:ads-ss2020 [2020-02-12 10:01] |
||
|---|---|---|---|
| Line 25: | Line 25: | ||
| ==== Space Efficient Data Structures ==== | ==== Space Efficient Data Structures ==== | ||
| - | * **(11)** Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti: On Succinct Representations of Binary Trees. Mathematics in Computer Science 11(2): 177-189 (2017) (Maximilian Freese) | + | * **(11)** Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti: On Succinct Representations of Binary Trees. Mathematics in Computer Science 11(2): 177-189 (2017) (Christoph Stockhoff) |
| * **(12)** Andreas Poyias, Simon J. Puglisi, Rajeev Raman: Compact Dynamic Rewritable (CDRW) Arrays. ALENEX 2017: 109-119 (Jan Meinhövel) | * **(12)** Andreas Poyias, Simon J. Puglisi, Rajeev Raman: Compact Dynamic Rewritable (CDRW) Arrays. ALENEX 2017: 109-119 (Jan Meinhövel) | ||
| * **(13)** José Fuentes Sepúlveda, Gonzalo Navarro, Diego Seco: Implementing the Topological Model Succinctly. SPIRE 2019: 499-512 | * **(13)** José Fuentes Sepúlveda, Gonzalo Navarro, Diego Seco: Implementing the Topological Model Succinctly. SPIRE 2019: 499-512 | ||
| - | * **(14)** Michal Ganczorz: Using statistical encoding to achieve tree succinctness never seen before. CoRR abs/1807.06359 (2018) (Christoph Stockhoff) | + | * **(14)** Michal Ganczorz: Using statistical encoding to achieve tree succinctness never seen before. CoRR abs/1807.06359 (2018) |
| * **(15)** Tim Baumann, Torben Hagerup: Rank-Select Indices Without Tears. WADS 2019: 85-98 (Jan-Philipp Tarnowski) | * **(15)** Tim Baumann, Torben Hagerup: Rank-Select Indices Without Tears. WADS 2019: 85-98 (Jan-Philipp Tarnowski) | ||
| * **(16)** Emmanuel Esposito, Thomas Mueller Graf, Sebastiano Vigna: RecSplit: Minimal Perfect Hashing via Recursive Splitting. arXiv:1910.06416v2. To appear in: ALENEX 2020 (Alexander Herlez) | * **(16)** Emmanuel Esposito, Thomas Mueller Graf, Sebastiano Vigna: RecSplit: Minimal Perfect Hashing via Recursive Splitting. arXiv:1910.06416v2. To appear in: ALENEX 2020 (Alexander Herlez) | ||
| Line 38: | Line 38: | ||
| * **(20)** Naila Rahman, Richard Cole, Rajeev Raman: Optimised Predecessor Data Structures for Internal Memory. Algorithm Engineering 2001: 67-78 | * **(20)** Naila Rahman, Richard Cole, Rajeev Raman: Optimised Predecessor Data Structures for Internal Memory. Algorithm Engineering 2001: 67-78 | ||
| * **(21)** Mihai Patrascu, Mikkel Thorup: Time-space trade-offs for predecessor search. STOC 2006: 232-240 | * **(21)** Mihai Patrascu, Mikkel Thorup: Time-space trade-offs for predecessor search. STOC 2006: 232-240 | ||
| - | * **(22)** Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti: Two dimensional range minimum queries and Fibonacci lattices. Theor. Comput. Sci. 638: 33-43 (2016) | + | * **(22)** Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti: Two dimensional range minimum queries and Fibonacci lattices. Theor. Comput. Sci. 638: 33-43 (2016) (Maximilian Freese) |
| ===== Zeitlicher Ablauf ===== | ===== Zeitlicher Ablauf ===== | ||