# Explicit Constructions of Linear-Sized Superconcentrators

@article{Gabber1981ExplicitCO,
title={Explicit Constructions of Linear-Sized Superconcentrators},
author={Ofer Gabber and Zvi Galil},
journal={J. Comput. Syst. Sci.},
year={1981},
volume={22},
pages={407-420}
}
• Published 1 June 1981
• Mathematics
• J. Comput. Syst. Sci.
444 Citations

## Figures from this paper

Network Construction by Group Representations
Simple graphs having the property that every limited size subset of vertices has many outside neighbours are called expanders. These have many applications in the construction of communication
Lecture 10: Expander Constructions
• Mathematics
• 2013
expander graphs using the notion of spectral gap, and derived a number of interesting properties of expander graphs of low degree. In this lecture, we rst argue that expanders with nontrivial
Expander Graphs and their Applications
• Mathematics
• 2006
A major consideration we had in writing this survey was to make it accessible to mathematicians as well as to computer scientists, since expander graphs, the protagonists of our story, come up in
On expander graphs and connectivity in small space
This presentation gives universal exploration sequences for arbitrary graphs and universal traversal sequences for graphs with some natural restriction on their labelling, which are constructible with logarithmic memory and are thus only polynomially long.
Expander Construction in VNC
• Mathematics
• 2017
Expander graphs have become one of the most useful combinatorial objects in theoretical computer science, with many beautiful applications in computer science and mathematics [23], and responsible
Explicit Expanding Expanders
• Mathematics
ESA
• 2015
This work presents an explicit construction of d-regular expanders with expansion cost at most $$\frac{5d}{2}$$, for any d ≥ 6, and leverages the notion of a “2-lift” of a graph.
Large Networks and Graph Limits
Laszlo Lovasz has written an admirable treatise on the exciting new theory of graph limits and graph homomorphisms, an area of great importance in the study of large networks.
Randomness in complexity theory and logics
The goal is to apply techniques from descriptive complexity theory to the study of randomised complexity classes, and indeed it is shown that the randomised logics do capture complexity classes under study in complexity theory.
On Symmetric Structures in Graphs and Applications in Property Testing
This work gives a simple one-sided error testing algorithm for vertex transitivity in the dense-graphs model, whose query complexity is Θ̃(n), and proves that any one- sided errorTesting algorithm for vertices transitivity must perform Ω(n) queries transitivity.

## References

SHOWING 1-9 OF 9 REFERENCES
The Design and Analysis of Computer Algorithms
• Computer Science
• 1974
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Asymptotically invariant sequences and an action of SL (2,Z) on the 2-sphere
LetG be a countable group which acts non-singularly and ergodically on a Lebesgue space (X, ȑ, μ). A sequence (Bn) in ℒ is calledasymptotically invariant in limn μ (BnΔgBn)=0 for everygεG. In this
On concentrators, superconcentrators, generalizers, and nonblocking networks
• F. Chung
• Mathematics, Computer Science
The Bell System Technical Journal
• 1979
Improve bounds for the number of edges (which can be viewed as approximations of the cost) in some networks by combinatorial analysis by studying various communication networks.
Explicit constructions of linear size superconcentrators
• Mathematics
20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
• 1979
We present an explicit construction of an infinite family of N-superconcentrators of density 44. The most economical previously known explicit graphs of this type have density around 60.
A Note on a Construction of Margulis
GALIL, Explicit constructions of linear size superconcentrators, in “Proceedings
• 20th Annual IEEE Symposium on Foundations of Computer
• 1979
VALIANT, On nonlinear lower bounds in computational complexity, in “Proceedings
• 7th Annual ACM Symposium on Theory of Computing,
• 1975
MARGULUS, Explicit construction of concentrators
• Problemy Peredafi Iqfiwmacii 9, NO
• 1973
PINSKER, On the complexity of a concentrator, in “Proceedings, 7th International Telegrafftc Conference, Stockholm, June 1973,
• pp. 3
• 1973