COMP 480/580 Probabilistic Algorithms and Data Structures
- Instructor: Anshumali Shrivastava (anshumali AT rice)
- TAs: Zhaozhuo Xu (zx22), Zichang Liu (zl71), Aditya Desai (apd10)
- Class Timings: Tue/Thu 01:30PM - 02:50PM
- Location: Zoom (online). Recordings will be avaiable after the class.
- Instructor Office Hours: Wednesday 12:00pm to 1pm via Zoom.
List of sample project topics link
Please sign up for lectures you want to scribe at excel
This course will be ideal for someone wanting to build a strong foundation in the theory and practice of algorithms for
processing Big-Data. We will discuss advanced data structures and algorithms going beyond deterministic setting and emphasize the role
of randomness in getting significant, often exponential, improvements in computations and memory.
COMP 182 or equivalent required. COMP 382 is useful but not required. Basic Knowledge of
Probability. Knowledge of programming is required. Capability to manipulate primitive data structures such as arrays, list, etc. will
be needed for assignments.
Most of the materials (scribes and slides) needed will be posted on this website.
Some of the materials are fairly new and textbook is yet to be written.
A Nice Book to have is "Probability and Computing: Randomized Algorithms and Probabilistic Analysis
" by Michael Mitzenmacher and Eli Upfal.
- 01/26 : Introduction, Logistics, Mark and Re-capture Estimation.Scribe Slide
- 01/28 : Brief Pseudo Randomness, Universal Hashing, Chaining, and Linear Probing.Slide
- 02/02 : Compressed Cache and Bloom Filters. (Why caching does not kill your memory)Slide
- 02/04 : Markov, Chebyshev's, and Chernoff Bounds. Slide
- 02/09 : Analysis of Hashing, Chaining and Probing.Slide
- 02/11 : Resizing Hash Tables: Consistent Hashing and balanced allocations.(The idea behind Akamai Technologies)Slide
- 02/16 : Classes Cancelled
- 02/18 : Classes Cancelled
- Make Up Class TBD: SPOCA: A Stateless, Proportional, Optimally-Consistent Addressing Algorithm. (Best paper in USENIX 2011)
- 02/23 : Introduction to Stream Computing and Reservoir Sampling. (Algorithms at the Edges)Slide
- 02/25 : Stream Estimation 1: Count-Min Sketch (Generalized Bloom Filters)Slide
- 03/02 : Stream Estimation 2: Count-Sketches
- 03/04 : Stream Estimation 3: Count Distinct and Norm Estimation on Streams.
- 03/09 : Minwise Hashing, Near-Duplicate Detection and LSH 1. (What is "hash function" in this NY-Times article)
- 03/11 : Minwise Hashing, Near-Duplicate Detection and LSH 2.
- 03/16 : Spring "Sprinkle" Day: No Classes
- 03/18 : Basic Sampling. (Beyond Random Sampling)
- 03/23 : More LSH (Eliminate Pairwise Comparisons)
- 03/25 : Advanced Sampling. LSH as Computationally Efficient Importance Samplers. (Adaptive Sampling at the Cost of Random Sampling)
- 03/30 : DNF Counting(A closer Look at Estimation via Sampling).
- 04/01 : In Class Mid-Term Exam.
- 04/06 : Markov Chains, Stationary distributions, MCMC 1 (Sampling in Complex Spaces).
- 04/08 : Spring "Sprinkle" Day: No Classes
- 04/13 : Markov Chains, Stationary distributions, MCMC 2.
- 04/15 : Markov Chains, Stationary distributions, MCMC 3.
- 04/20 : Markov Chains, Stationary distributions, MCMC 4.<
- 04/22 : Randomized Routing
- 04/27 : Estimation on Graphs
- 04/29 : ACE and RACE Density Estimation (Analytics over Edge)
Students with Disability
If you have a documented disability that may affect academic performance, you should: 1) make sure this documentation is on file with Disability Support Services (Allen Center, Room 111 / email@example.com / x5841) to determine the accommodations you need; and 2) meet with me to discuss your accommodation needs.