Presentation #1 Schedule
Section 201
| # | February 12 | February 14 | ||
|---|---|---|---|---|
| Topic | Presenter | Topic | Presenter | |
| 1 | Boyer-Moore string matching | Elad Michaeli | General matching | Kenny Park |
| 2 | k-th shortest path | Karan Grover | Hungarian algorithm | Andrew Bolyachevets |
| 3 | Short LCSes | Ben Zheng | Fast Fourier Transform | Victor Pineda |
| 4 | Convex hull optimization | Rehim Memmedli | String hashing and Rabin-Karp | Barak Jacob |
| 5 | Smart gambling | Lauren Bentley | Finding Euler tours | Justin Oh |
| 6 | Suurballe's algorithm | Leif Pedersen | ||
Section 202
| # | February 12 | February 14 | ||
|---|---|---|---|---|
| Topic | Presenter | Topic | Presenter | |
| 1 | Knuth-Morris-Pratt string matching | Arian Naderi-Azad | Black-white graph colouring | Trevin Wong |
| 2 | Johnson's algorithm | Michelle Lee | Tree cutting | Juan Lee |
| 3 | Context-free grammar parsing | Sam Sung | Games and Grundy numbers | Daniel Brodsky |
| 4 | Alternating permutation counting | Edwin Zhou | All minimum spanning trees | Ryan Knauer |