Improving the performance guarantee for approximate graph coloring
Journal of the ACM (JACM)
Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Average case complete problems
SIAM Journal on Computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
The steiner problem with edge lengths 1 and 2,
Information Processing Letters
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Hiding instances in multioracle queries
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Completeness in approximation classes
Information and Computation
Fully parallelized multi prover protocols for NEXP-time (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A mathematical theory of self-checking, self-testing and self-correcting programs
A mathematical theory of self-checking, self-testing and self-correcting programs
Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The power of interaction
On the approximation of maximum satisfiability
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Self-testing polynomial functions efficiently and over rational domains
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
The traveling salesman problem with distances one and two
Mathematics of Operations Research
The NP-completeness column: an ongoing guide
Journal of Algorithms
On the complexity of approximating the independent set problem
Information and Computation
A still better performance guarantee for approximate graph coloring
Information Processing Letters
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximate max-flow min-(multi)cut theorems and their applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient checking of polynomials and proofs and the hardness of approximation problems
Efficient checking of polynomials and proofs and the hardness of approximation problems
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Two prover protocols: low error at affordable rates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
The complexity of the max word problem and the power of one-way interactive proof systems
Computational Complexity
Probabilistic checking of proofs and hardness of approximation problems
Probabilistic checking of proofs and hardness of approximation problems
The complexity of approximating a nonlinear program
Mathematical Programming: Series A and B
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Approximation algorithms for scheduling
Approximation algorithms for NP-hard problems
The primal-dual method for approximation algorithms and its application to network design problems
Approximation algorithms for NP-hard problems
Cut problems and their application to divide-and-conquer
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Random Debaters and the Hardness of Approximating Stochastic Functions
SIAM Journal on Computing
The hardness of approximate optima in lattices, codes, and systems of linear equations
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A public-key cryptosystem with worst-case/average-case equivalence
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Approximating the bandwidth via volume respecting embeddings (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Complexity theory retrospective II
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM (JACM)
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
P-Complete Approximation Problems
Journal of the ACM (JACM)
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Approximating the Longest Path in a Graph (Preliminary Version)
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
On the Structure of Combinatorial Problems and Structure Preserving Reductions
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
The Approximation of Maximum Subgraph Problems
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Probabilistic Proof Systems - A Survey
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Structure in Approximation Classes (Extended Abstract)
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Zero Knowledge and the Chromatic Number
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Improved hardness results for approximating the chromatic number
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Worst-case analysis of memory allocation algorithms
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The regularity lemma and approximation schemes for dense problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Property testing and its connection to learning and approximation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Linearity testing in characteristic two
IEEE Transactions on Information Theory - Part 1
Approximating the minimum bisection size (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Algebraic testing and weight distributions of codes
Theoretical Computer Science
A Probabilistic Approach to Buffer Insertion
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
A preference processing model for cooperative agents
Journal of Intelligent Information Systems
Random Structures & Algorithms
Local search study of honeycomb clustering problem for cellular planning
International Journal of Mobile Network Design and Innovation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.00 |