On the hardness of computing the permanent of random matrices (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Depth reduction for noncommutative arithmetic circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Combinatorial techniques for universal hashing
Journal of Computer and System Sciences
Non-deterministic communication complexity with few witnesses
Journal of Computer and System Sciences
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The amazing power of pairwise independence (abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Precision-sensitive Euclidean shortest path in 3-space (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Evaluation may be easier than generation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Robust algorithms for restricted domains
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Watermarking of SAT using combinatorial isolation lemmas
Proceedings of the 38th annual Design Automation Conference
Quantum computers that can be simulated classically in polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Generalized topological sorting in linear time
Nordic Journal of Computing
Games with a Uniqueness Property
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Some Results on Derandomization
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On the relative complexity of approximate counting problems
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Dichotomy Theorem for the Generalized Unique Satisfiability Problem
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
On the Derandomization of Constant Depth Circuits
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Mathematical models of quantum computation
New Generation Computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The General Notion of a Dot-Operator
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of tensor calculus
Computational Complexity
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
Combinatorics, Probability and Computing
Robust algorithms for restricted domains
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Theoretical Computer Science
On unique graph 3-colorability and parsimonious reductions in the plane
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Lower bounds and the hardness of counting properties
Theoretical Computer Science
On the reducibility of sets inside NP to sets with low information content
Journal of Computer and System Sciences
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
Intractability results in predicate detection
Information Processing Letters
Quantum verification of matrix products
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Resource bounded symmetry of information revisited
Theoretical Computer Science - Mathematical foundations of computer science 2004
Compression of samplable sources
Computational Complexity
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
Inapproximability of the Tutte polynomial
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Computational Complexity
On computing all abductive explanations from a propositional Horn theory
Journal of the ACM (JACM)
Foundations and Trends® in Theoretical Computer Science
Exploiting functional dependencies in declarative problem specifications
Artificial Intelligence
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
Journal of Computer and System Sciences
Complexity of unique list colorability
Theoretical Computer Science
Inapproximability of the Tutte polynomial
Information and Computation
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
Computational Complexity
Random stimulus generation using entropy and XOR constraints
Proceedings of the conference on Design, automation and test in Europe
Parameterized Learnability of k-Juntas and Related Problems
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Language and Automata Theory and Applications
Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
The complexity of forecast testing
ACM SIGecom Exchanges
On Toda's Theorem in Structural Communication Complexity
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Proceedings of the forty-first annual ACM symposium on Theory of computing
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae - Machines, Computations and Universality, Part I
The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Model counting: a new strategy for obtaining good bounds
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
k-SAT Is No Harder Than Decision-Unique-k-SAT
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
SIGACT news complexity theory column 64
ACM SIGACT News
A unifying framework for structural properties of CSPs: definitions, complexity, tractabilit
Journal of Artificial Intelligence Research
Information and Computation
Parameterized learnability of juntas
Theoretical Computer Science
The computational complexity of ideal semantics
Artificial Intelligence
Mind change optimal learning of Bayes net structure from dependency and independency data
Information and Computation
On equivalent reformulations for absolute value equations
Computational Optimization and Applications
Intractability results in predicate detection
Information Processing Letters
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Private approximation of clustering and vertex cover
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Sparse sets, approximable sets, and parallel queries to NP
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Short XORs for model counting: from theory to practice
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Mind change optimal learning of Bayes net structure
COLT'07 Proceedings of the 20th annual conference on Learning theory
Satisfiability parsimoniously reduces to the Tantrix™ rotation puzzle problem
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
The time complexity of constraint satisfaction
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing
Computers and Operations Research
Abductive and default reasoning: a computational core
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
The computational complexity of the KAKURO puzzle, revisited
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Complexity classes of equivalence problems revisited
Information and Computation
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
On the Power of Isolation in Planar Graphs
ACM Transactions on Computation Theory (TOCT)
Unique small subgraphs are not easier to find
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
The complexity of symmetric Boolean parity Holant problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Lower bounds for lovász-schrijver systems and beyond follow from multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Completeness for parity problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Counting and detecting small subgraphs via equations and matrix multiplication
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the computational complexity of the forcing chromatic number
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Secure computation of constant-depth circuits with applications to database search problems
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Uniquely satisfiable k-SAT instances with almost minimal occurrences of each variable
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Worst-case vs. algorithmic average-case complexity in the polynomial-time hierarchy
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Theoretical Computer Science
The leakage-resilience limit of a computational problem is equal to its unpredictability entropy
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Worst-case optimal join algorithms: [extended abstract]
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Survey: The consequences of eliminating NP solutions
Computer Science Review
On complexity of unconstrained hyperbolic 0-1 programming problems
Operations Research Letters
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae - Machines, Computations and Universality, Part I
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Sparse extractor families for all the entropy
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Guest column: the quantum PCP conjecture
ACM SIGACT News
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
Complexity-sensitive decision procedures for abstract argumentation
Artificial Intelligence
Isolating an Odd Number of Elements and Applications in Complexity Theory
Theory of Computing Systems
Frobenius's Degree Formula and Toda's Polynomials
Theory of Computing Systems
| Hi-index | 5.23 |