1. The complexity and approximability of finding maximum feasible subsystems of linear relations;Amaldi;Theoret. Comput. Sci.,1995
2. On the approximability of removing the smallest number of relations from linear systems to achieve feasibility;Amaldi,1995
3. Probabilistic checking of proofs and hardness of approximation problems;Arora,1994
4. The hardness of approximate optima in lattices, codes and systems of linear equations;Arora,1993
5. Proof verification and hardness of approximation problems;Arora,1992