When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Algorithmic complexity in coding theory and the minimum distance problem
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Bounded queries, approximations, and the Boolean hierarchy
Information and Computation
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Using Approximation Hardness to Achieve Dependable Computation
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Guest column: inapproximability results via Long Code based PCPs
ACM SIGACT News
Almost Orthogonal Linear Codes are Locally Testable
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Robust locally testable codes and products of codes
Random Structures & Algorithms
The PCP theorem by gap amplification
Journal of the ACM (JACM)
Maximizing the guarded boundary of an Art Gallery is APX-complete
Computational Geometry: Theory and Applications
An improved lower bound for approximating minimum GCD multiplier in l∞ norm (GCDM∞)
Theoretical Computer Science
maximizing the guarded boundary of an art gallery is APX-complete
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Inapproximability results for equations over infinite groups
Theoretical Computer Science
Short locally testable codes and proofs: a survey in two parts
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Covering cubes and the closest vector problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
Short locally testable codes and proofs
Studies in complexity and cryptography
The tensor product of two codes is not necessarily robustly testable
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Better inapproximability results for maxclique, chromatic number and min-3lin-deletion
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Tight approximability results for the maximum solution equation problem over Zp
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |