SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Almost-uniform Generation with an Unbiased Binary Source
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Communication constraints in the average consensus problem
Automatica (Journal of IFAC)
Cryptography in constant parallel time
Cryptography in constant parallel time
Do all elliptic curves of the same order have the same difficulty of discrete log?
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Simulating undirected st-connectivity algorithms on uniform JAGs and NNJAGs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Entropic security and the encryption of high entropy messages
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On pseudorandom generators with linear stretch in NC0
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Randomness-efficient sampling within NC1
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
MV3: a new word based stream cipher using rapid mixing and revolving buffers
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Erdős-Rényi sequences and deterministic construction of expanding cayley graphs
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Random Structures & Algorithms
Finite Fields and Their Applications
A matrix hyperbolic cosine algorithm and applications
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Near-Optimal expanding generator sets for solvable permutation groups
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
The chromatic number of random Cayley graphs
European Journal of Combinatorics
| Hi-index | 0.00 |
For every 1 δ 0 there exists a c = c(δ) 0 such that for every group G of order n, and for a set S of c(δ) log n random elements in the group, the expected value of the second largest eigenvalue of the normalized adjacency matrix of the Cayley graph X(G, S) is at most (1 ‐ δ). This implies that almost every such a graph is an ϵ(δ)‐expander. For Abelian groups this is essentially tight, and explicit constructions can be given in some cases. © 1994 John Wiley & Sons, Inc.