Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.
Explores stochastic models for communications, covering mean, variance, characteristic functions, inequalities, various discrete and continuous random variables, and properties of different distributions.