Differences
This shows you the differences between two versions of the page.
|
fischer:teaching:ads-ss2019 [2018-12-04 14:29] |
fischer:teaching:ads-ss2019 [2019-02-02 10:06] |
||
|---|---|---|---|
| Line 9: | Line 9: | ||
| ===== Themenliste ===== | ===== Themenliste ===== | ||
| - | tba | + | ==== Allgemein ==== |
| + | * 1. Michael Mitzenmacher, Salvatore Pontarelli, and Pedro Reviriego. Adaptive cuckoo filters [ALENEX'18] | ||
| + | * Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, and Ayellet Tal. The Bloomier filter: an efficient data structure for static support lookup tables [SODA'04] | ||
| + | * Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Rob Johnson, Samuel McCauley, Shikha Singh: Bloom Filters, Adaptivity, and the Dictionary Problem [FOCS'18] | ||
| + | |||
| + | ==== Erweiterte Rechenmodelle ==== | ||
| + | * 4. Jiang/Larsen: A Faster External Memory Priority Queue with DecreaseKey [SODA'19] | ||
| + | * Bender et al.: Cache-oblivious B-trees [SIAM J. Comput., 35(2):341–358, 2005.] | ||
| + | * Bender et al.: A locality-preserving cache-oblivious dynamic dictionary. [Journal of Algorithms 53(2), 115-136, 2004] | ||
| + | * Lee et al.: Partitioned Parallel Radix Sort [Journal of Parallel and Distributed Computing 62(4), 656–668, 2002] | ||
| + | * Brodal et al.: Engineering a Cache-Oblivious Sorting Algorithm [ACM Journal of Experimental Algorithmics, Vol. 12, Article No. 2.2, 2008] | ||
| + | ==== Texte ==== | ||
| + | * 9. Kempa: Optimal Construction of Compressed Indexes for Highly Repetitive Texts [SODA'19] | ||
| + | * Dudek/Gawrychowski: Slowing Down Top Trees for Better Worst-Case Compression [CPM'18] | ||
| + | * Kaneta: Fast Wavelet Tree Construction in Practice [SPIRE'18] | ||
| + | * Gog et al.: Fixed Block Compression Boosting in FM-Indexes: Theory and Practice [Algorithmica 2018] | ||
| + | * Jo et al.: Compressed Range Minimum Queries [SPIRE'18] | ||
| + | * Enno Ohlebusch et al.: Trickier XBWT Tricks [SPIRE'18] | ||
| + | |||
| + | ==== Succinct Data Structures ==== | ||
| + | * 15. Philip Bille, Anders Roy Christiansen, Nicola Prezza, and Frederik Rye Skjoldjensen. Succinct partial sums and Fenwick trees. In Proc. SPIRE, volume 10508 of LNCS, pages 91–96, 2017. | ||
| + | * Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, and Srinivasa Rao Satti. Selection from read-only memory with limited workspace. Theor. Comput. Sci., 554:64–73, 2014. | ||
| ===== Zeitlicher Ablauf ===== | ===== Zeitlicher Ablauf ===== | ||
| - | * 25.1.2019, 14:00 Vorbesprechung in OH12 3.030 | + | * <del>25.1.2019, 14:00 Vorbesprechung in OH12 3.030</del> |
| - | * Doodle zur Themenvergabe schließt | + | * <del>01.02.2019: Doodle zur Themenvergabe schließt</del> |
| - | * Einreichung der Kurzzusammenfassungen ("abstracts") | + | * 29.4.2019: Einreichung der Kurzzusammenfassungen ("abstracts") |
| - | * Einreichung der Ausarbeitungen ("submission deadline") | + | * 20.5.2019: Einreichung der Ausarbeitungen ("submission deadline") |
| - | * Deadline für die Gutachten | + | * 11.6.2019: Deadline für die Gutachten |
| - | * Einreichung der finalen Ausarbeitungen | + | * 24.6.2019: Einreichung der finalen Ausarbeitungen |
| * 10.-12.7.2019: Seminarvorträge | * 10.-12.7.2019: Seminarvorträge | ||