A fast and simple randomized parallel algorithm for the maximal independent set problem
Checking computations in polylogarithmic time
Journal of Algorithms
Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC ’91
Noga Alon
Leonid A. Levin
Alon Itai
Mario Szegedy
Lance Fortnow
Approximating the cut-norm via Grothendieck’s inequality
Guest column
Two prover protocols