Average case intractability of matrix and diophantine problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Queries are easier than you thought (probably)
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Circuit complexity: from the worst case to the average case
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the learnability of discrete distributions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Average-case completeness of a word problem for groups
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On the hardness of approximating optimum schedule problems in store and forward networks
IEEE/ACM Transactions on Networking (TON)
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Hiding Cliques for Cryptographic Security
Designs, Codes and Cryptography
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Theoretical Computer Science
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
The importance of the P versus NP question
Journal of the ACM (JACM)
Complete on average Boolean satisfiability
Journal of Complexity
Tilings: Recursivity and Regularity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The Non-Recursive Power of Erroneous Computation
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Complexity of manipulating elections with few candidates
Eighteenth national conference on Artificial intelligence
A note on universal distributions for polynomial-time computable distributions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
LR(k) Testing is Average Case Complete
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Tilings: recursivity and regularity
Theoretical Computer Science
Average-case intractability vs. worst-case intractability
Information and Computation
Threshold values of random K-SAT from the cavity method
Random Structures & Algorithms
Generating Outerplanar Graphs Uniformly at Random
Combinatorics, Probability and Computing
When are elections with few candidates hard to manipulate?
Journal of the ACM (JACM)
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
Computational Complexity
A theory of average-case compilability in knowledge representation
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Nearly bounded error probabilistic sets
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Universal distributions and time-bounded kolmogorov complexity
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Distributionally-hard languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Algorithms and theory of computation handbook
Yuri, logic, and computer science
Fields of logic and computation
Economies with non-convex production and complexity equilibria
Proceedings of the 12th ACM conference on Electronic commerce
Some results on average-case hardness within the polynomial hierarchy
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
A family of fast syndrome based cryptographic hash functions
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Average-case non-approximability of optimisation problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Relations between average-case and worst-case complexity
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |