Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.
Explores the transmission probability of protons through a potential barrier, demonstrating the near-impossibility of a proton overcoming the barrier due to extremely low transmission probability.
