Space-efficient routing in vertex-symmetric networks (extended abstract)
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Smaller explicit superconcentrators
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of 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
A proof of alon's second eigenvalue conjecture
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Ramanujan geometries of type &Ãn
Discrete Mathematics
Derandomizing homomorphism testing in general groups
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
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A lower bound on the spectral radius of the universal cover of a graph
Journal of Combinatorial Theory Series B
Explicit constructions of Ramanujan complexes of type Ad
European Journal of Combinatorics - Special issue on combinatorics and representation theory
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
Undirected connectivity in log-space
Journal of the ACM (JACM)
Full Cryptanalysis of LPS and Morgenstern Hash Functions
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Expanders and time-restricted branching programs
Theoretical Computer Science
On Construction of Almost-Ramanujan Graphs
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Optimal configurations for peer-to-peer user-private information retrieval
Computers & Mathematics with Applications
Improved lower bounds for the universal and a priori TSP
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
SIAM Journal on Computing
Edge transitive ramanujan graphs and symmetric LDPC good codes
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Tight Products and Graph Expansion
Journal of Graph Theory
Ramanujan graphs on cosets of PGL2(Fq)
Finite Fields and Their Applications
No sublogarithmic-time approximation scheme for bipartite vertex cover
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Local correctability of expander codes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.00 |