Computer Science 614 - RandomizedAlgorithms/App to DS

Randomness has proven to be an important resource in developing provably efficient algorithms and protocols for large scale data processing. This course will explore advanced techniques for designing and analyzing randomized algorithms, with applications to data compression, sketching and sampling, communication and space efficient protocols, approximation algorithms, and beyond. The course is a natural follow on to both COMPSCI 514: Algorithms for Data Science and COMPSCI 611: Advanced Algorithms.

Open to Masters and PhD Computer Science students only. STRONG BACKGROUND IN ALGORITHMS AND MATHEMATICS, PARTICULARLY IN LINEAR ALGEBRA AND PROBABILITY IS REQUIRED. NOT RECOMMENDED FOR UNDERGRADUATES AND MS STUDENTS UNLESS SUCCESSFUL COMPLETION OF EITHER COMPSCI 514 OR COMPSCI 611. IF UNSURE OF PREPARATION, CONTACT INSTRUCTOR. STUDENTS NEEDING SPECIAL PERMISSION MUST REQUEST OVERRIDES VIA THE ON-LINE FORM: https://www.cics.umass.edu/academics/course-overrides.