The Algorithmic Aspects of the Regularity Lemma
Testing Reed–Muller Codes
Better expanders and superconcentrators
IEEE Transactions on Information Theory
Journal of Algorithms
V.D Milman
Z Galil
R. Yuster
D. Ron
V. Rodl
T. Kaufman
Approximating the cut-norm via Grothendieck’s inequality
Fast monte-carlo algorithms for finding low-rank approximations
Guest column
Load balancing of unit size tokens and expansion properties of graphs