1. Two theorems on random polynomial time;Adleman,1978
2. A fast and simple randomized algorithm for the maximal independent set problem;Alon;J. Algorithms,1986
3. R. Anderson, Set intersection problems, unpublished manuscript, 1985.
4. An efficient algorithm for coloring the edges of a graph with Δ + 1 colors;Arjomandi;Canad. J. Oper. Res. Inform. Process. (INFOR),1982
5. Balanced two-colorings of finite sets in the cube;Beck;Discrete Math.,1988