Random instances of a graph coloring problem are hard
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the theory of average case complexity
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On generating solved instances of computational problems
CRYPTO '88 Proceedings on Advances in cryptology
Journal of the ACM (JACM)
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
Average-case completeness of a word problem for groups
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Algorithmic complexity in coding theory and the minimum distance problem
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Random generation of embedded graphs and an extension to Dobrushin uniqueness (extended abstract)
STOC '98 Proceedings of the thirtieth 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
Hiding cliques for cryptographic security
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Hiding Cliques for Cryptographic Security
Designs, Codes and Cryptography
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Strict polynomial-time in simulation and extraction
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth 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
Boosting and Hard-Core Set Construction
Machine Learning
Coping with the NP-Hardness of the Graph Bandwidth Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
QoS Routing: Average Complexity and Hopcount in m Dimensions
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Tilings: Recursivity and Regularity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Average-Case Quantum Query Complexity
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
Some Results on Derandomization
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Necessary and Sufficient Conditions For Collision-Free Hashing
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
The Non-Recursive Power of Erroneous Computation
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
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
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
SIGACT news complexity theory column 40
ACM SIGACT News
Tilings: recursivity and regularity
Theoretical Computer Science
Average-case intractability vs. worst-case intractability
Information and Computation
Typical properties of winners and losers in discrete optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Guest Column: NP-complete problems and physical reality
ACM SIGACT News
Conditions that impact the complexity of QoS routing
IEEE/ACM Transactions on Networking (TON)
Threshold values of random K-SAT from the cavity method
Random Structures & Algorithms
On the typical case complexity of graph optimization
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Generating Outerplanar Graphs Uniformly at Random
Combinatorics, Probability and Computing
Computational depth: concept and applications
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Quantum cryptography: A survey
ACM Computing Surveys (CSUR)
A new look at survey propagation and its generalizations
Journal of the ACM (JACM)
Foundations and Trends® in Theoretical Computer Science
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
Computational Complexity
Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword
Computational Complexity
Using average case intractability in cryptography
AIC'04 Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications
Complete and incomplete randomized NP problems
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Limits on the Hardness of Lattice Problems in lp Norms
Computational Complexity
An Infinitely-Often One-Way Function Based on an Average-Case Assumption
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Combinatorial dominance guarantees for problems with infeasible solutions
ACM Transactions on Algorithms (TALG)
Worst-Case to Average-Case Reductions Revisited
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
On smoothed k-CNF formulas and the Walksat algorithm
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Polyhedral outer approximations with application to natural language parsing
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
The status of the P versus NP problem
Communications of the ACM - The Status of the P versus NP Problem
Frequency of correctness versus average polynomial time
Information Processing Letters
Note: Generalized juntas and NP-hard sets
Theoretical Computer Science
Structural Complexity of AvgBPP
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
A theory of average-case compilability in knowledge representation
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On the typical case complexity of graph optimization
Discrete Applied Mathematics
Nearly bounded error probabilistic sets
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
TCC'07 Proceedings of the 4th conference on Theory of cryptography
A secret sharing scheme using matrices
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
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
Saving private randomness in one-way functions and pseudorandom generators
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Typically-correct derandomization
ACM SIGACT News
Using complexity to protect elections
Communications of the ACM
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Average case analysis of algorithms
Algorithms and theory of computation handbook
Relativized worlds without worst-case to average-case reductions for NP
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The very particular structure of the very hard instances
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
On the Implementation of Huge Random Objects
SIAM Journal on Computing
The complexity of manipulative attacks in nearly single-peaked electorates
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Quantum Information & Computation
Notes on Levin's theory of average-case complexity
Studies in complexity and cryptography
Studies in complexity and cryptography
Average case complexity, revisited
Studies in complexity and cryptography
Query complexity in errorless hardness amplification
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
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
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Guarantees for the success frequency of an algorithm for finding dodgson-election winners
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hardness amplification of weakly verifiable puzzles
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Relations between average-case and worst-case complexity
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
An encoding invariant version of polynomial time computable distributions
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
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
Finding the most probable string and the consensus string: an algorithmic study
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
On the complexity of QoS routing
Computer Communications
Relativized Worlds without Worst-Case to Average-Case Reductions for NP
ACM Transactions on Computation Theory (TOCT)
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On the Average-Case Complexity of the Graph Reliability Problem on Gaussian Distributions
Fundamenta Informaticae
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
The complexity of manipulative attacks in nearly single-peaked electorates
Artificial Intelligence
Encoding Invariance in Average Case Complexity
Theory of Computing Systems
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.02 |