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

Home Courses Support

Section outline

Dear students,
Please find below a set of papers among which you can pick the one to present for the exam. When you choose a paper, please write the title and your name in this file Paper_choice.xlsx to reserve it for the date on which you intend to take the exam.
- Select activity 4.Count min sketchl
  
  4.Count min sketchl File PDF
- Select activity 3.Simplified Cuckoo Filter
  
  3.Simplified Cuckoo Filter File PDF
- Select activity 1.Cuckoo Hashing
  
  1.Cuckoo Hashing File PDF
- Select activity 2.Cuckoo Filter
  
  2.Cuckoo Filter File PDF
- Select activity 5.Set Sketching
  
  5.Set Sketching File PDF
- Select activity 7.Resizable arrays until page12
  
  7.Resizable arrays until page12 File PDF
- Select activity 13.LCA revisited
  
  13.LCA revisited 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 14.Streaming Pattern-Matching
  
  14.Streaming Pattern-Matching File PDF
- Select activity 11.Antiperiods
  
  11.Antiperiods File PDF
- Select activity 17.FM index revisited
  
  17.FM index revisited File PDF
- Select activity 34.Property matching
  
  34.Property matching File PDF
- Select activity 15.Weight Ancestors Suffix Tree
  
  15.Weight Ancestors Suffix Tree File PDF
- Select activity 33.Suffix Trays
  
  33.Suffix Trays File PDF
- Select activity 16.FM Index
  
  16.FM Index File PDF
- Select activity sparse suffix trees
  
  sparse suffix trees File PDF
- Select activity CDAWGS
  
  CDAWGS File PDF
- Select activity Suffix cactus
  
  Suffix cactus File PDF
- Select activity affix array
  
  affix array File PDF
- Select activity 28.Path-length Distance
  
  28.Path-length Distance File PDF
- Select activity Dijkstra-Heuristics
  
  Dijkstra-Heuristics File PDF
- Select activity 22.Fully dynamic APSP
  
  22.Fully dynamic APSP File PDF
- Select activity 24.K Shortest Paths until page16
  
  24.K Shortest Paths until page16 File PDF
- Select activity 21.Dynamic APSP until page14
  
  21.Dynamic APSP until page14 File PDF
- Select activity Dynamic topological sort
  
  Dynamic topological sort File PDF
- Select activity Maintaining shortest paths in digraphs w
  
  Maintaining shortest paths in digraphs w File PDF
- Select activity 23.Dynamic Shortest Path Algorithms for Hypergraphs
  
  23.Dynamic Shortest Path Algorithms for Hypergraphs File PDF
- Select activity Myers 2014 6106
  
  Myers 2014 6106 File PDF
- Select activity 20.Safely Filling Gaps
  
  20.Safely Filling Gaps File PDF
- Select activity 38.WhatsHap
  
  38.WhatsHap File PDF
- Select activity 18.DP RNA folding
  
  18.DP RNA folding File PDF
- Select activity 19.Omnitigs
  
  19.Omnitigs File PDF
- Select activity 39.RNA assembly
  
  39.RNA assembly 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 26.QuickXsort
  
  26.QuickXsort File PDF
- Select activity 10.Soft Heaps Application until page16
  
  10.Soft Heaps Application until page16 File PDF
- Select activity 31.AVL trees relaxed
  
  31.AVL trees relaxed File PDF
- Select activity 29.Chromatic binary search trees
  
  29.Chromatic binary search trees File PDF
- Select activity pairing-heaps
  
  pairing-heaps File PDF
- Select activity 25.QuickHeapSort
  
  25.QuickHeapSort File PDF
- Select activity 30.Red-Black trees constant update
  
  30.Red-Black trees constant update File PDF
- Select activity Sorting topological sort
  
  Sorting topological sort File PDF
- Select activity Relaxed Multi-Way Trees
  
  Relaxed Multi-Way Trees File PDF
- Select activity Hat-trie
  
  Hat-trie File PDF
- Select activity AA-Trees
  
  AA-Trees File PDF
- Select activity 32.Suffix BST until page 13
  
  32.Suffix BST until page 13 File PDF