1. Derandomized graph products;Alon;Comput. Complexity,1995
2. Constructing the highest degree subgraph for dense graphs is in NCAS;Andreev;Theoret. Comput. Sci.,1995
3. Polynomial time approximation schemes for dense instances of NP-hard problems;Arora,1995
4. Proof verification and hardness of approximation problems;Arora,1992
5. Probabilistic checking of proofs; a new characterization of NP;Arora,1992