COMP 150-ALG: Topics on Algorithms, Graphs and Data Structures
(Spring 2017)

Projects

---

---

In arbitrary order:

1. Cori J and Alex K
   • Comparing implementations of optimal binary search trees
   • github
2. Gabby R
   • Braess' paradox
3. Morgan G and Alex T
   • [broken link] Algorithms for distributed maximal independent set
4. Matt J
   • [broken link] Dynamic fractional cascading
5. Duc N
   • Application of linear programming in the network interdiction problem
6. Guy D and Walton L
   • Demo: geometric approach to linear programming in two dimensions
7. Flora L, Bill Y, and Cecilie U
   • Hashing algorithms (Analysis and implementation of Cuckoo hashing and Hopscotch hashing)
8. Nick Y and Graham G
   • [broken link] A redesign of MBTA routes (Genetic algorithms for network flow optimization)
9. Abdi M
   • [broken link] Combining the best performing binary search trees
10. Larry Z
    • [broken link] Exact string matching (Comparing Z to KMP)
11. Ben T
    • Visualizing adaptive Huffman coding
12. Joel R and John W
    • [broken link] Solving Sudoku (via Exact Cover)
13. Helen L-R and Michael M
    • [broken link] Boyer-Moore string matching algorithm
14. Mary M
    • The stable roommate problem
    • jump to demo
15. Zhaokun X
    • Parallel algorithm for red-black trees
16. Tom M
    • LZW compression
    • github
17. Sam H
    • Succinct data structures: Exploring succinct trees in theory and practice
    • Succinct data structures: Calculating Rank and Select
18. David S and Adam P
    • [broken link] Ramsey number R(3,10). Use the > button to advance.
19. Matthew A and Harrison K
    • Geometric interpretation of BSTs (visualization and analysis tool)
    • PDF
20. Ivan C
    • [broken links] Vantage point trees
    • jump to demo (use right and left arrows on keyboard)
    • Bonus: Euclidean shortest paths
21. Ethan D
    • A quantitative comparison of WAVL trees and splay trees
22. Peter L
    • [broken link] B-trees
23. Tim H
    • [broken link] Edge coloring algorithms (in progress)

---