Explicit expanders and the Ramanujan conjectures
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Combinatorica
Asymptotic theory of finite dimensional normed spaces
Asymptotic theory of finite dimensional normed spaces
Existence and construction of edge disjoint paths on expander graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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
Optimal construction of edge-disjoint paths in random regular graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Optimal construction of edge-disjoint paths in random graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Constructing worst case instances for semidefinite programming based approximation algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A spectral technique for random satisfiable 3CNF formulas
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A proof of alon's second eigenvalue conjecture
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs
Combinatorics, Probability and Computing
On the Edge-Expansion of Graphs
Combinatorics, Probability and Computing
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The Lovász Number of Random Graphs
Combinatorics, Probability and Computing
MAX k-CUT and approximating the chromatic number of random graphs
Random Structures & Algorithms
Random Lifts of Graphs: Edge Expansion
Combinatorics, Probability and Computing
Slow emergence of cooperation for win-stay lose-shift on trees
Machine Learning
Spectral clustering by recursive partitioning
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Spectral clustering with limited independence
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Undirected connectivity in log-space
Journal of the ACM (JACM)
Expansion and Lack Thereof in Randomly Perturbed Graphs
Algorithms and Models for the Web-Graph
Scalable onion routing with torsk
Proceedings of the 16th ACM conference on Computer and communications security
Matrix completion from a few entries
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Graph partitioning via adaptive spectral techniques
Combinatorics, Probability and Computing
Max k-cut and approximating the chromatic number of random graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Matrix completion from a few entries
IEEE Transactions on Information Theory
Finding Planted Partitions in Random Graphs with General Degree Distributions
SIAM Journal on Discrete Mathematics
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
The spectral gap of random graphs with given expected degrees
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On laplacians of random complexes
Proceedings of the twenty-eighth annual symposium on Computational geometry
Loose laplacian spectra of random hypergraphs
Random Structures & Algorithms
On the complexity of Newman's community finding approach for biological and social networks
Journal of Computer and System Sciences
Efficient crowdsourcing for multi-class labeling
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
On the tree-depth of random graphs
Discrete Applied Mathematics
| Hi-index | 0.06 |