Differences
This shows you the differences between two versions of the page.
|
fischer:teaching:ads-ss2018 [2018-05-06 07:53] |
fischer:teaching:ads-ss2018 [2018-05-08 11:18] |
||
|---|---|---|---|
| Line 46: | Line 46: | ||
| |6. |Brengel et al.|An experimental study of priority queues in external memory|Danny Textores| Kurpicz | | | |6. |Brengel et al.|An experimental study of priority queues in external memory|Danny Textores| Kurpicz | | | ||
| |7. |Labeit et al.|Parallel lightweight wavelet tree, suffix array and FM-index construction|Daniel Sendzik| Kurpicz | | | |7. |Labeit et al.|Parallel lightweight wavelet tree, suffix array and FM-index construction|Daniel Sendzik| Kurpicz | | | ||
| - | |8. |Bille et al.|Succinct partial sums and Fenwick trees|Thomas Buß| Fischer | | | ||
| |9. |Klitzke/Nicholson|A general framework for dynamic succinct and compressed data structures|Nico Bertram| Fischer | | | |9. |Klitzke/Nicholson|A general framework for dynamic succinct and compressed data structures|Nico Bertram| Fischer | | | ||
| |10. |Durocher et al.|Range majority in constant time and linear space|Jonas Ellert| Fischer | | | |10. |Durocher et al.|Range majority in constant time and linear space|Jonas Ellert| Fischer | | | ||
| Line 56: | Line 55: | ||
| |16. |Prezza|In-place sparse suffix sorting|Oliver Magiera| Köppl | | | |16. |Prezza|In-place sparse suffix sorting|Oliver Magiera| Köppl | | | ||
| |17. |Gawrychowski et al.|Optimal dynamic strings|Lin Du| Köppl | | | |17. |Gawrychowski et al.|Optimal dynamic strings|Lin Du| Köppl | | | ||
| - | |18. |Gagie et al.|A framework for BWT-based data structures|Timo Walter| Fischer | | | + | |18. |Gagie et al.|Wheeler graphs: A framework for BWT-based data structures|Timo Walter| Fischer | | |
| ===== Zeitlicher Ablauf ===== | ===== Zeitlicher Ablauf ===== | ||