메뉴 건너뛰기




Volumn 15, Issue 1, 1995, Pages 111-122

Natural bounded concentrators

Author keywords

Mathematics Subject Classification (1991): Primary: 05C35, Secondary: 05C25

Indexed keywords


EID: 51249168838     PISSN: 02099683     EISSN: 14396912     Source Type: Journal    
DOI: 10.1007/BF01294463     Document Type: Article
Times cited : (15)

References (20)
  • 7
    • 84931430925 scopus 로고    scopus 로고
    • I. M. Gelfand, M. I. Graev, and I. I. Pyatetskii-Shapiro: Representation Theory and Automorphic Functions, W. B. Saunders Com., 1969.
  • 8
    • 84931465358 scopus 로고    scopus 로고
    • D. Gorenstein: Finite Groups, Chelsea, 1980.
  • 9
    • 0021372575 scopus 로고
    • Limitations on explicit constructions of expanding graphs
    • (1984) SIAM J. Comp. , vol.13 , pp. 155-156
    • Klawe, M.1
  • 12
    • 84931347048 scopus 로고    scopus 로고
    • A. Lubotzky: Discrete Groups, Expanding Graphs and Invariant Measures, Birkhauser Progress in Math, 1994.
  • 13
    • 84931432302 scopus 로고    scopus 로고
    • G. A. Margulis: Explicit construction of concentrators, Problems of Inform. Transmission (1975), 325–332.
  • 14
    • 84931338202 scopus 로고    scopus 로고
    • M. Morgenstern: Ramanujan diagrams, SIAM J. of Discrete Math., November 1994.
  • 16
    • 84931381250 scopus 로고    scopus 로고
    • M. Morgenstern: Ramanujan Diagrams and Explicit Construction of Expanding Graphs, Ph.D. Thesis, Hebrew Univ. of Jerusalem, 1990.
  • 18
    • 84931418763 scopus 로고    scopus 로고
    • J. P. Serre: Trees, Springer-Verlag, 1980.
  • 19
    • 84931431336 scopus 로고    scopus 로고
    • A. Siegel: On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications, 30th Annual IEEE conference on Foundations of Computer Science, (1989), 20–25.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.