Section: Exam papers | 587SM-2 - ALGORITHMIC DESIGN 2022

Home Courses Support

Section outline

This is a partial list of papers that are eligible for the presentation you have to prepare for the exam. You can either pick a paper from this list (I will set up a tool to associate people to papers in the next few days) or propose a paper yourself or ask me to find a paper on your preferred topic, as long as it is related to the topics of the course.
- Select activity 1.Cuckoo Hashing
  
  1.Cuckoo Hashing File PDF
- Select activity 2.Cuckoo Filter
  
  2.Cuckoo Filter File PDF
- Select activity 3.Simplified Cuckoo Filter
  
  3.Simplified Cuckoo Filter File PDF
- Select activity 4.Count min sketch
  
  4.Count min sketch File PDF
- Select activity 5.Set Sketching
  
  5.Set Sketching File PDF
- Select activity 6.Bloom Filter Replacement
  
  6.Bloom Filter Replacement File PDF
- Select activity 7.Resizable arrays until page12
  
  7.Resizable arrays until page12 File PDF
- Select activity 8.Soft Heaps
  
  8.Soft Heaps File PDF
- Select activity 9.Soft Heap Construction
  
  9.Soft Heap Construction File PDF
- Select activity 10.Soft Heaps Application until page16
  
  10.Soft Heaps Application until page16 File PDF
- Select activity 11.Antiperiods
  
  11.Antiperiods File PDF
- Select activity 12.Exact and Approximate Pattern Matching in the Streaming Model
  
  12.Exact and Approximate Pattern Matching in the Streaming Model File PDF
- Select activity 13.LCA revisited
  
  13.LCA revisited File PDF
- Select activity 14.Streaming Pattern-Matching
  
  14.Streaming Pattern-Matching File PDF
- Select activity 15.Weight Ancestors Suffix Tree
  
  15.Weight Ancestors Suffix Tree File PDF
- Select activity 16.FM Index
  
  16.FM Index File PDF
- Select activity 17.FM index revisited
  
  17.FM index revisited File PDF
- Select activity 18.DP RNA folding
  
  18.DP RNA folding File PDF
- Select activity 19.Omnitigs
  
  19.Omnitigs File PDF
- Select activity 20.Safely Filling Gaps
  
  20.Safely Filling Gaps File PDF
- Select activity 21.Dynamic APSP until page14
  
  21.Dynamic APSP until page14 File PDF
- Select activity 22.Fully dynamic APSP
  
  22.Fully dynamic APSP File PDF
- Select activity 23.Dynamic Shortest Path Algorithms for Hypergraphs
  
  23.Dynamic Shortest Path Algorithms for Hypergraphs File PDF
- Select activity 24.K Shortest Paths until page16
  
  24.K Shortest Paths until page16 File PDF
- Select activity 25.QuickHeapSort
  
  25.QuickHeapSort File PDF
- Select activity 26.QuickXsort
  
  26.QuickXsort File PDF
- Select activity 28.Path-length Distance
  
  28.Path-length Distance File PDF
- Select activity 29.Chromatic binary search trees
  
  29.Chromatic binary search trees File PDF
- Select activity 30.Red-Black trees constant update
  
  30.Red-Black trees constant update File PDF
- Select activity 31.AVL trees relaxed
  
  31.AVL trees relaxed File PDF
- Select activity 32.Suffix BST until page 13
  
  32.Suffix BST until page 13 File PDF
- Select activity 33.Suffix Trays
  
  33.Suffix Trays File PDF
- Select activity 34.Property matching
  
  34.Property matching File PDF
- Select activity 36.Bloomier filters
  
  36.Bloomier filters File PDF
- Select activity 37.Bloomier filters second look
  
  37.Bloomier filters second look File PDF
- Select activity 38.WhatsHap
  
  38.WhatsHap File PDF
- Select activity 39.RNA assembly
  
  39.RNA assembly File PDF