How sarielhp/rand_alg_fa26 works
This repository is a 58-chapter set of lecture notes on randomized algorithms and related probability, combinatorics, and theoretical computer science. Its primary user-facing workflow is reading the material as a book or by topic. The tree identifies chapter sources and rendered HTML, but no README or source excerpt documents how chapters are assembled or how readers reach the rendered versions; the graph therefore groups substantive topics without asserting unsupported runtime or build relationships.
Components 18
Foundations
- Introduction
01_intro/intro.tex - Expectation
03_expectation/expectations.tex - Verification
06_verify/verify.tex
Randomized Algorithms
- QuickSort
04_quick_sort/quick_sort.tex - Alias Method
02_alias_method/alias_method.tex - Occupancy
07_occupancy/occupancy.tex - Hashing
10_hashing/hashing.tex
Probability Methods
- Concentration
15_chernoff/chernoff.tex - Martingales
21_martingales/martingales.tex - Probabilistic Methods
50_prob_mtd/prob_mtd.tex - Entropy
43_entropy/entropy.tex
Learning and Streams
- Streaming
27_streaming/streaming.tex - Frequency Estimation
28_frequence_est/frequency_est.tex - VC Dimension
40_vc/vc_dim.tex
Graphs and Optimization
- Random Walks
31_rwalk/rwalk.tex - Expanders
47_expanders/expanders.tex - Optimization
56_lp_d/lp_d.tex
Other components
- Reader