Computer Science 284/484
Advanced Algorithms
Fall 2022
Instructor: Daniel Stefankovic
Class: Tuesday, Thursday 12:30pm-13:45pm, Hylan 203.
Instructor office hours: ONLINE (zoom link on blackboard) Monday 9:30pm-10:30pm and Wednesday 9:30pm-10:30pm.
Textbooks: there is no required textbook; see each section for the recommended reading (mostly online; I will also supply handouts).
Other resources/recommended reading:
- [CLRS09] Introduction to Algorithms (3rd edition), T. Cormen, C. Leiserson, R. Rivest, and C. Stein, 2009.
- [K91] The Design and Analysis of Algorithms, D. Kozen, 1991.
- [KT05] Algorithm Design, J. Kleinberg and E. Tardos, 2005.
- [AHU74] The Design and Analysis of Computer Algorithms, A. Aho, J. Hopcroft, J. Ulman, 1974.
- [MU05] Probability and Computing: Randomized Algorithms and Probabilistic Analysis, M. Mitzenmacher, E. Upfal, 2005.
- [MR95] Randomized Algorithms, R. Motwani, P. Raghavan, 1995.
- [H02] Finite Markov chains and algorithmic applications, O. Haggstrom, 2002.
- [G97] Counting, sampling and integrating: algorithms and complexity, M. Jerrum, 2003.
- [WS11] The Design of Approximation Algorithms, D.Williamson, D. Shmoys, 2011
- [V04] Approximation Algorithms, V. Vazirani, 2004.
- [BE98] Online Computation and Competitive Analysis, A. Borodin, R. El-Yaniv, 1998.
- [M05] Data Streams: Algorithms and Applications, S. Muthukrishnan, 2005.
- [BCKO08] Computational Geometry: Algorithms and Applications, M. de Berg, O. Cheong, M. van Kreveld, M. Overmars, 2008.
- [PS85] Computational Geometry: An Introduction, F. Preparata, M. Shamos, 1985.
- [DO11] Discrete and Computational Geometry, S. Devadoss, J. O'Rourke, 2011.
- [M93] Computational Geometry: An Introduction Through Randomized Algorithms, K. Mulmuley, 1993.
- [G97] Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, D. Gusfield, 1997.
Prerequisites: CSC282.
Schedule
TOPIC 1: Max-Flow
Sep. 1 Th - Max Flow I (basics, Ford-Fulkerson, min-cut max-flow).
Sep. 6 Tu - Max Flow II (Edmonds Karp).
Sep. 8 Th - Max Flow III (Push Relabel).
TOPIC 2: Computational Geometry
Sep. 13 Tu - Computational Geometry I (sweep technique).
Sep. 15 Th - Computational Geometry II (convex hulls).
Sep. 20 Tu - Computational Geometry III (closest pair of points).
Sep. 22 Th - Computational Geometry IV (Voronoi diagrams).
TOPIC 3: String Algorithms
Sep. 27 Tu - String Algorithms I (Suffix Trees).
Sep. 29 Th - String Algorithms II (Suffix Trees).
Oct. 4 Tu - String Algorithms III (Suffix Arrays).
Oct. 6 Th - String Algorithms IV (Suffix Arrays).
TOPIC 4: Streaming Algorithms
reading:
Oct. 11 Tu - FALL BREAK (no class)
Oct. 13 Th - Probability I.
Oct. 18 Tu - Probability II.
Oct. 20 Th - Streaming Algorithms I (distinct elements).
Oct. 25 Tu - Streaming Algorithms II (sketching).
Oct. 27 Th - Streaming Algorithms III (frequency moments).
Nov. 1 Tu - Streaming Algorithms IV.
TOPIC 5: Sampling/Counting, Markov chain Monte Carlo
Nov. 3 Th - MCMC I (basics: stationary distribution, detailed balance condition, ergodicity)
Nov. 8 Tu - MCMC II (mixing time)
Nov. 10 Tu - MCMC III (bounds on mixing time)
Nov. 15 Th - MCMC IV (coupling from the past)
Nov. 17 Tu - MCMC V (high dimensional expanders)
Nov. 22 Tu - (online/zoom class) MCMC VI (sampling bases of matroids)
Nov. 24 Th - THANKSGIVING (no class).
TOPIC 6: Something Fun (likely topics: simplex algorithm, Tarski's quantifier elimination, dynamic connectivity)
Nov. 29 Tu - TBD
Dec. 1 Th - TBD
Dec. 6 Tu - TBD
Dec. 8 Th - TBD
Dec. 13 Tu - TBD
Grading
The grade for the course is based on the homework (theoretical and applied; there will be 5-6 problem sets); there are no exams.
Homework Rules
- Theoretical homework should be typeset (LaTeX preferred) and submitted on Gradescope by the deadline (specific for each assignment). You may work with other people on the theoretical homework, but you must each write up your solutions separately (without any written aid). If you work with other people, indicate who you worked with on your solution.
- No late homework will be accepted without instructor's permission (a permission must be requested at least 24 hours before the due date).
This course follows
The University Policy on Academic Honesty .