Alon, N., and Milman, V. D. Eigenvalues, expanders and superconcentrators. In Proc. 25th Annual Symp. on Foundations of Comp.Sci. Florida (1984), pp. 320{ 322. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Essentially Every Unimodular Matrix Defines an Expander - Cai (Correct)
....grant CCR 9820806 and by a Guggenheim Fellowship. 2 Jin Yi Cai Gabber Galil proof also has the added advantage of being relatively elementary. We will follow the proofs of [10] closely. There is an extensive literature on expanders and their applications to the theory of computing [1] 2] 4] 5][6] [8] 9] 14] 15] It was realized that expansion properties are closely related to the second largest eigenvalues of the graph #(G) see [6] and for d regular graphs the gap between d and #(G) provides estimates for both upper and lower bound for the expansion constant. The best construction was ....
....We will follow the proofs of [10] closely. There is an extensive literature on expanders and their applications to the theory of computing [1] 2] 4] 5] 6] 8] 9] 14] 15] It was realized that expansion properties are closely related to the second largest eigenvalues of the graph #(G) see [6]) and for d regular graphs the gap between d and #(G) provides estimates for both upper and lower bound for the expansion constant. The best construction was given by Lubotsky, Phillip and Sarnak [11] and by Margulis [13] where asymptotically optimal #(G) was achieved. The proofs in [11] use ....
N. Alon and V. D. Milman, Eigenvalues, expanders and superconcentrators. Proc of the 25th ACM STOC, 320--322. 1984.
General Purpose Parallel Computing - McColl (1993) (64 citations) (Correct)
....can be used to realise a 1 relation in O(log p) steps on a randomly wired, bounded degree network known as a multibutterfly. An important feature of multibutterflies is that they have powerful expansion properties. In addition to permitting fast deterministic routing, such expander graphs [13, 14, 16, 141, 177, 255] also have very strong fault tolerance properties. The techniques and results that we have described for various types of randomised routing show convincingly that for the problem of routing h relations at least, there are a variety of theoretically and practically efficient methods which can be ....
N Alon and V D Milman. Eigenvalues, expanders and superconcentrators. In Proc. 25th Annual IEEE Symposium on Foundations of Computer Science, pages 320--322, 1984. McCOLL : GENERAL PURPOSE PARALLEL COMPUTING
Ramsey Theory Applications - Vera Rosta Dept (Correct)
No context found.
Alon, N., and Milman, V. D. Eigenvalues, expanders and superconcentrators. In Proc. 25th Annual Symp. on Foundations of Comp.Sci. Florida (1984), pp. 320{ 322.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC