Explicit expanders and the Ramanujan conjectures
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The electrical resistance of a graph captures its commute and cover times
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the second eigenvalue of random regular graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Local expansion of vertex-transitive graphs and random generation in finite groups
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Deciding finiteness of matrix groups in Las Vegas polynomial time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An O(log N) deterministic packet-routing scheme
Journal of the ACM (JACM)
Deciding finiteness of matrix groups in deterministic polynomial time
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Expanders that beat the eigenvalue bound: explicit construction and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Self-routing superconcentrators
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Routing permutations on graphs via matchings
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximate load balancing on dynamic and asynchronous networks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A survey of PRAM simulation techniques
ACM Computing Surveys (CSUR)
A near optimal algorithm for edge separators (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Eigenvalues and expansion of regular graphs
Journal of the ACM (JACM)
Resource scheduling for parallel database and scientific applications
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Towards an analysis of local optimization algorithms
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Static and dynamic path selection on expander graphs (preliminary version): a random walk approach
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The Structure of Trivalent Graphs with Minimal Eigenvalue Gap
Journal of Algebraic Combinatorics: An International Journal
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
Regular Sparse Crossbar Concentrators
IEEE Transactions on Computers
On the performance of spectral graph partitioning methods
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
The path resistance method for bounding &lgr;2 of a Laplacian
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
New algorithmic aspects of the Local Lemma with applications to routing and partitioning
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hill-climbing finds random planted bisections
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Sparse and limited wavelength conversion in all-optical tree networks
Theoretical Computer Science
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Expanders from symmetric codes
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Laplacian spectra and invariants of graphs
Discrete Mathematics
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Clustering Categorical Data: An Approach Based on Dynamical Systems
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Bounding Work and Communication in Robust Cooperative Computation
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Essentially Every Unimodular Matrix Defines and Expander
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Disjoint Paths in Expander Graphs via Random Walks: A Short Survey
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
New Spectral Lower Bounds on the Bisection Width of Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
High-Speed Pseudorandom Number Generation with Small Memory
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Clustering categorical data: an approach based on dynamical systems
The VLDB Journal — The International Journal on Very Large Data Bases
Load balancing of unit size tokens and expansion properties of graphs
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Adiabatic quantum state generation and statistical zero knowledge
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Uniform hashing in constant time and linear space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A proof of alon's second eigenvalue conjecture
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Algebraic proof systems over formulas
Theoretical Computer Science - Logic and complexity in computer science
A spectral lower bound for the treewidth of a graph and its consequences
Information Processing Letters
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
Combinatorics, Probability and Computing
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
Combinatorics, Probability and Computing
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A new family of Cayley expanders (?)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
New spectral lower bounds on the bisection width of graphs
Theoretical Computer Science
The integrity of a cubic graph
Discrete Applied Mathematics
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Subproblem optimization by gene correlation with singular value decomposition
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
The expansion and mixing time of skip graphs with applications
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Combinatorics, Probability and Computing
SIGACT news complexity theory column 51
ACM SIGACT News
On the extreme eigenvalues of regular graphs
Journal of Combinatorial Theory Series B
Using expander graphs to find vertex connectivity
Journal of the ACM (JACM)
Discrete Applied Mathematics
Enhancing the Effectiveness of Clustering with Spectra Analysis
IEEE Transactions on Knowledge and Data Engineering
Spectral clustering by recursive partitioning
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
An elementary construction of constant-degree expanders
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Sparse universal graphs for bounded-degree graphs
Random Structures & Algorithms
On the Expansion of the Giant Component in Percolated (n, d,λ) Graphs
Combinatorics, Probability and Computing
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
Random Structures & Algorithms
The unified theory of pseudorandomness: guest column
ACM SIGACT News
Communication constraints in the average consensus problem
Automatica (Journal of IFAC)
An elementary construction of constant-degree expanders
Combinatorics, Probability and Computing
Bipartite isoperimetric graph partitioning for data co-clustering
Data Mining and Knowledge Discovery
A combinatorial construction of almost-ramanujan graphs using the zig-zag product
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
On the second eigenvalue of random regular graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Undirected connectivity in log-space
Journal of the ACM (JACM)
Geometry, flows, and graph-partitioning algorithms
Communications of the ACM
Revisiting the Efficiency of Malicious Two-Party Computation
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Expansion and Lack Thereof in Randomly Perturbed Graphs
Algorithms and Models for the Web-Graph
Expander flows, geometric embeddings and graph partitioning
Journal of the ACM (JACM)
Elasticity: topological characterization of robustness in complex networks
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Max cut and the smallest eigenvalue
Proceedings of the forty-first annual ACM symposium on Theory of computing
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Economical elimination of cycles in the torus
Combinatorics, Probability and Computing
Concentration on the discrete torus using transportation
Combinatorics, Probability and Computing
Hypertree-decomposition via branch-decomposition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reversible low-density parity-check codes
IEEE Transactions on Information Theory
Testing the expansion of a graph
Information and Computation
Good expander graphs and expander codes: parameters and decoding
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Approximations for the isoperimetric and spectral profile of graphs and related parameters
Proceedings of the forty-second ACM symposium on Theory of computing
Graph expansion and the unique games conjecture
Proceedings of the forty-second ACM symposium on Theory of computing
Maximum flows and minimum cuts in the plane
Journal of Global Optimization
Testing expansion in bounded-degree graphs
Combinatorics, Probability and Computing
Characterising the robustness of complex networks
International Journal of Internet Technology and Secured Transactions
A local search algorithm for branchwidth
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
Modular orientations of random and quasi-random regular graphs
Combinatorics, Probability and Computing
Algebraic connectivity metric for spare capacity allocation problem in survivable networks
Computer Communications
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
High-ordered random walks and generalized laplacians on hypergraphs
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
On testing expansion in bounded-degree graphs
Studies in complexity and cryptography
Bravely, moderately: a common theme in four recent works
Studies in complexity and cryptography
Basic facts about expander graphs
Studies in complexity and cryptography
Algorithmic extensions of cheeger's inequality to higher eigenvalues and partitions
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
A deterministic algorithm for the Frieze-Kannan regularity lemma
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Combinatorial algorithms for distributed graph coloring
DISC'11 Proceedings of the 25th international conference on Distributed computing
Further results on the eccentric distance sum
Discrete Applied Mathematics
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
SIAM Journal on Computing
Rumor spreading and vertex expansion
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Oblivious and adaptive strategies for the majority and plurality problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On a conjecture of Brouwer involving the connectivity of strongly regular graphs
Journal of Combinatorial Theory Series A
Rumor spreading and vertex expansion on regular graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Deterministic polynomial-time algorithms for designing short DNA words
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
On optimality of key pre-distribution schemes for distributed sensor networks
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Multi-way spectral partitioning and higher-order cheeger inequalities
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Many sparse cuts via higher eigenvalues
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Tight Products and Graph Expansion
Journal of Graph Theory
On laplacians of random complexes
Proceedings of the twenty-eighth annual symposium on Computational geometry
A characterization of the smallest eigenvalue of a graph
Journal of Graph Theory
On the Spectra of Certain Graphs Arising from Finite Fields
Finite Fields and Their Applications
Finite Fields and Their Applications
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma
SIAM Journal on Discrete Mathematics
Analysis of accelerated gossip algorithms
Automatica (Journal of IFAC)
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Modularity spectra, eigen-subspaces, and structure of weighted graphs
European Journal of Combinatorics
| Hi-index | 0.09 |