@inproceedings{136d470b96034a4e987bb8e3231b3650,
title = "EIGENVALUES, EXPANDERS AND SUPERCONCENTRATORS.",
abstract = "Explicit construction of families of linear expanders and superconcentrators is relevant to theoretical computer science in several ways. There is essentially only one known explicit construction. Here, a correspondence is shown between the eigenvalues of the adjacency matrix of a graph and its expansion properties, and this result is combined with results on group representations to obtain many new examples of families of linear expanders. Better expanders than those previously known are obtained and used to construct explicitly n-superconcentrators with congruent 157. 4n edges, much less than the previous most economical construction.",
author = "Noga Alon and Milman, \{V. D.\}",
year = "1984",
month = dec,
day = "1",
language = "English",
isbn = "081860591X",
series = "Annual Symposium on Foundations of Computer Science (Proceedings)",
publisher = "Institute of Electrical and Electronics Engineers",
pages = "320--322",
booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",
address = "United States",
}