| Algorithmic topic | Geometry/math topics |
| Maxcut Sparsest cut |
Volume in n-dim Levy concentration Metric embeddings |
| Convex optimization Learning with membership queries |
Brunn-Minkowski, Prekopa-Leindler Logconcave distributions, tail bounds |
| Learning convex sets Polynomial threshold functions Agnostic learning |
Gaussian isoperimetry 1-dim localization Invariance principles |
| Rounding/Sandwiching | Isotropic position estimating covariance |
| Near(est) neighbors | Random projection Locality-sensitive hashhing Intrinsic dimensionality |
| Volume computation Integration |
Logconcavity Prob. concentration, comparison |
| Sampling in high-dimension |
Isoperimetry Localization Geometric vs probabilistic distance |
| Shortest lattice vector Integer Programming |
Lattice flatness Blaschke-Santalo Discrepancy |
Santosh Vempala