The monotone circuit complexity of Boolean functions
Combinatorica
The algebraic eigenvalue problem
The algebraic eigenvalue problem
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A spectral technique for coloring random 3-colorable graphs (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Expected complexity of graph partitioning problems
Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
Algorithmic theory of random graphs
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Approximating the independence number via the j -function
Mathematical Programming: Series A and B
Hiding cliques for cryptographic security
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Spectral partitioning works: planar graphs and finite element meshes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Clustering gene expression patterns
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
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
Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Max Cut for Random Graphs with a Planted Partition
Combinatorics, Probability and Computing
Spectral clustering with limited independence
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
Theoretical Computer Science
Correlation clustering with noisy input
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Effecting parallel graph eigensolvers through library composition
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Algorithms for implicit hitting set problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
EigenSpokes: surprising patterns and scalable community chipping in large graphs
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Quantum money from hidden subspaces
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Statistical algorithms and a lower bound for detecting planted cliques
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |