1. On constant time approximation of parameters of bounded degree graphs;Alon,2010
2. A fast and simple randomized parallel algorithm for the maximal independent set problem;Alon;J. Algorithms,1986
3. The Probabilistic Method;Alon,2016
4. Inapproximability of vertex cover and independent set in bounded degree graphs;Austrin,2009
5. Hardness of distributed optimization;Bachrach,2019