Differences
This shows you the differences between two versions of the page.
fischer:teaching:ads-ss2018 [2018-07-16 08:11] |
fischer:teaching:ads-ss2018 [2018-07-16 09:48] |
||
---|---|---|---|
Line 39: | Line 39: | ||
===== Zuordnung ===== | ===== Zuordnung ===== | ||
^ # ^ Autoren ^ Titel ^ Teilnehmer/in ^ Betreuer^ Termin^ | ^ # ^ Autoren ^ Titel ^ Teilnehmer/in ^ Betreuer^ Termin^ | ||
- | |17. |Bender et al.|Bloom Filters, Adaptivity, and the Dictionary Problem|Simon Demming| Fischer | | | + | |17. |Bender et al.|Bloom Filters, Adaptivity, and the Dictionary Problem|Simon Demming| Fischer | Mi 9 | |
- | |18. |Bender et al.|Cache-oblivious B-trees|Sven Brümmer| Kurpicz | | | + | |7. |Brengel et al.|An experimental study of priority queues in external memory|Danny Textores| Fischer | Mi 10 | |
- | |7. |Brengel et al.|An experimental study of priority queues in external memory|Danny Textores| Fischer | | | + | |6. |Labeit et al.|Parallel lightweight wavelet tree, suffix array and FM-index construction|Daniel Sendzik| Kurpicz | Mi 11 | |
- | |6. |Labeit et al.|Parallel lightweight wavelet tree, suffix array and FM-index construction|Daniel Sendzik| Kurpicz | | | + | |21. |Klitzke/Nicholson|A general framework for dynamic succinct and compressed data structures|Nico Bertram| Kurpicz | Mi 13 | |
- | |21. |Klitzke/Nicholson|A general framework for dynamic succinct and compressed data structures|Nico Bertram| Kurpicz | | | + | |12. |Durocher et al.|Range majority in constant time and linear space|Jonas Ellert| Fischer | Mi 14 | |
- | |12. |Durocher et al.|Range majority in constant time and linear space|Jonas Ellert| Fischer | | | + | |20. |Gagie et al.|Wheeler graphs: A framework for BWT-based data structures|Timo Walter| Fischer | Mi 15 | |
- | |5. |Irving/Love|The suffix binary search tree and suffix AVL tree|Philipp Mewes| Köppl | | | + | |10. |Belazzougui et al.|Access, rank, and select in grammar-compressed strings|Julian Sauer| Köppl | Do 9 | |
- | |10. |Belazzougui et al.|Access, rank, and select in grammar-compressed strings|Julian Sauer| Köppl | | | + | |15. |I| Longest common extensions with recompression|Christopher Osthues| Köppl | Do 10 | |
- | |15. |I| Longest common extensions with recompression|Christopher Osthues| Köppl | | | + | |5. |Irving/Love|The suffix binary search tree and suffix AVL tree|Philipp Mewes| Köppl | Do 11 | |
- | |20. |Gagie et al.|Wheeler graphs: A framework for BWT-based data structures|Timo Walter| Fischer | | | + | |
===== Zeitlicher Ablauf ===== | ===== Zeitlicher Ablauf ===== | ||