Average case complete problems
SIAM Journal on Computing
On the probable performance of Heuristics for bandwidth minimization
SIAM Journal on Computing
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Expected computation time for Hamiltonian path problem
SIAM Journal on Computing
Random instances of a graph coloring problem are hard
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The solution of some random NP-hard problems in polynomial expected time
Journal of Algorithms
Finding hidden Hamiltonian cycles
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth 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
Coloring random and semi-random k-colorable graphs
Journal of Algorithms
Testing of the long code and hardness for clique
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Finding a large hidden clique in a random graph
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
Hard graphs for the randomized Boppana-Halldórsson algorithm for MAXCLIQUE
Nordic Journal of Computing
Improved Lower Bounds for the Randomized Boppana-Halldórsson Algorithm for MAXCLIQUE
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
A Generalized Encryption Scheme Based on Random Graphs
WG '91 Proceedings of the 17th International Workshop
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Topics in black-box combinatorial optimization
Topics in black-box combinatorial optimization
Finding a large hidden clique in a random graph
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
General partitioning on random graphs
Journal of Algorithms
Coloring Sparse Random Graphs in Polynominal Average Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Max Cut for Random Graphs with a Planted Partition
Combinatorics, Probability and Computing
Finding cliques by quantum adiabatic evolution
Quantum Information & Computation
Maximum cliques in graphs with small intersection number and random intersection graphs
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |