EIGENVALUES AND EXPANDERS

被引：642

作者：

ALON, N

机构：

[1] MIT, DEPT MATH, CAMBRIDGE, MA 02139 USA

[2] TEL AVIV UNIV, DEPT MATH, IL-69978 TEL AVIV, ISRAEL

来源：

COMBINATORICA | 1986年 / 6卷 / 02期

关键词：

D O I：

10.1007/BF02579166

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：83 / 96

页数：14

共 34 条

[1] NOTE ON TIME-SPACE TRADEOFFS FOR COMPUTING CONTINUOUS-FUNCTIONS [J].

ABELSON, H .

INFORMATION PROCESSING LETTERS, 1979, 8 (04) :215-217

[2] SORTING IN C LOG N PARALLEL STEPS [J].

AJTAI, M ;

KOMLOS, J ;

SZEMEREDI, E .

COMBINATORICA, 1983, 3 (01) :1-19

[3]

Alon N., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P320, DOI 10.1109/SFCS.1984.715931

[4] LAMBDA-1, ISOPERIMETRIC-INEQUALITIES FOR GRAPHS, AND SUPERCONCENTRATORS [J].

ALON, N ;

MILMAN, VD .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 38 (01) :73-88

[5]

ALON N, IN PRESS BETTER EXPA

[6]

ANDERSON WN, 1971, TR7145 U MAR TECHN R

[7]

[Anonymous], 1980, EUROPEAN J COMBIN, DOI [DOI 10.1016/S0195-6698(80)80030-8, 10.1016/S0195-6698(80)80030-8]

[8]

Bassalygo L. A., 1981, Problems of Information Transmission, V17, P206

[9]

Biggs NL., 1974, ALGEBRAIC GRAPH THEO

[10] THE COMPLEXITY OF TESTING WHETHER A GRAPH IS A SUPERCONCENTRATOR [J].

BLUM, M ;

KARP, RM ;

VORNBERGER, O ;

PAPADIMITRIOU, CH ;

YANNAKAKIS, M .

INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) :164-167

← 1 2 3 4 →