Differences

This shows you the differences between two versions of the page.

Link to this comparison view

fischer:teaching:ads-ss2018 [2018-06-05 11:27]
fischer:teaching:ads-ss2018 [2018-06-07 13:25]
Line 39: Line 39:
 ===== Zuordnung ===== ===== Zuordnung =====
 ^    # ^ Autoren ​           ^ Titel   ^ Teilnehmer/​in ​   ^ Betreuer^ Termin^ ^    # ^ Autoren ​           ^ Titel   ^ Teilnehmer/​in ​   ^ Betreuer^ Termin^
-|9.   ​|Mitzenmacher et al.|Adaptive cuckoo filters|Alexander Brichta| Kurpicz | | 
-|19.   ​|Chazelle et al.|The Bloomier filter: an efficient data structure for static support lookup tables|Roman Bernhard| Kurpicz | | 
 |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 | |
 |18.   ​|Bender et al.|Cache-oblivious B-trees|Sven ​ Brümmer| Kurpicz | | |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 | | |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 | | |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| ​Fischer ​| |+|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 | | |12.  |Durocher et al.|Range majority in constant time and linear space|Jonas Ellert| Fischer | |
 |5.  |Irving/​Love|The suffix binary search tree and suffix AVL tree|Philipp Mewes| Köppl | | |5.  |Irving/​Love|The suffix binary search tree and suffix AVL tree|Philipp Mewes| Köppl | |
-|14.  |Takabatake et al.|Online pattern matching for string edit distance with moves|Dennis ​ Duman| Köppl | | 
 |10.  |Belazzougui et al.|Access, rank, and select in grammar-compressed strings|Julian ​ Sauer| Köppl | | |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 | | |15.  |I| Longest common extensions with recompression|Christopher Osthues| Köppl | |
 
Last modified: 2018-07-16 09:48 (external edit)
DokuWikiRSS-Feed