From expanders to better superconcentrators without cascading

Eli Shamir

doi:10.1007/3-540-12920-0_11

From expanders to better superconcentrators without cascading

Eli Shamir^*

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

Superconcentration is a strong property of interconnection diagraphs. We characterize its negation by existence of two disjoint and seperated sets which shrink under the forward and backward neighbor relation, respectively. This enables a better, non-cascaded design of superconcentrators, explicit ones with edge density ≤ 118, random ones with edge density ≤ 13.

Original language	English
Title of host publication	STACS 1984 - Symposium of Theoretical Aspects of Computer Science
Editors	K. Mehlhorn, M. Fontet
Publisher	Springer Verlag
Pages	121-128
Number of pages	8
ISBN (Print)	9783540129202
DOIs	https://doi.org/10.1007/3-540-12920-0_11
State	Published - 1984
Event	1st Annual Symposium on Theoretical Aspects of Computer Science, STACS 1985 - Paris, France Duration: 11 Apr 1984 → 13 Apr 1984

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	166 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	1st Annual Symposium on Theoretical Aspects of Computer Science, STACS 1985
Country/Territory	France
City	Paris
Period	11/04/84 → 13/04/84

Bibliographical note

Publisher Copyright:
© 1984, Springer Verlag. All rights reserved.

Access to Document

10.1007/3-540-12920-0_11

Cite this

Shamir, E. (1984). From expanders to better superconcentrators without cascading. In K. Mehlhorn, & M. Fontet (Eds.), STACS 1984 - Symposium of Theoretical Aspects of Computer Science (pp. 121-128). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 166 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-12920-0_11

@inproceedings{7f5c67729da44430bf187f38b59419aa,

title = "From expanders to better superconcentrators without cascading",

abstract = "Superconcentration is a strong property of interconnection diagraphs. We characterize its negation by existence of two disjoint and seperated sets which shrink under the forward and backward neighbor relation, respectively. This enables a better, non-cascaded design of superconcentrators, explicit ones with edge density ≤ 118, random ones with edge density ≤ 13.",

author = "Eli Shamir",

note = "Publisher Copyright: {\textcopyright} 1984, Springer Verlag. All rights reserved.; 1st Annual Symposium on Theoretical Aspects of Computer Science, STACS 1985 ; Conference date: 11-04-1984 Through 13-04-1984",

year = "1984",

doi = "10.1007/3-540-12920-0\_11",

language = "אנגלית",

isbn = "9783540129202",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "121--128",

editor = "K. Mehlhorn and M. Fontet",

booktitle = "STACS 1984 - Symposium of Theoretical Aspects of Computer Science",

address = "גרמניה",

}

Shamir, E 1984, From expanders to better superconcentrators without cascading. in K Mehlhorn & M Fontet (eds), STACS 1984 - Symposium of Theoretical Aspects of Computer Science. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 166 LNCS, Springer Verlag, pp. 121-128, 1st Annual Symposium on Theoretical Aspects of Computer Science, STACS 1985, Paris, France, 11/04/84. https://doi.org/10.1007/3-540-12920-0_11

From expanders to better superconcentrators without cascading. / Shamir, Eli.
STACS 1984 - Symposium of Theoretical Aspects of Computer Science. ed. / K. Mehlhorn; M. Fontet. Springer Verlag, 1984. p. 121-128 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 166 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - From expanders to better superconcentrators without cascading

AU - Shamir, Eli

PY - 1984

Y1 - 1984

N2 - Superconcentration is a strong property of interconnection diagraphs. We characterize its negation by existence of two disjoint and seperated sets which shrink under the forward and backward neighbor relation, respectively. This enables a better, non-cascaded design of superconcentrators, explicit ones with edge density ≤ 118, random ones with edge density ≤ 13.

AB - Superconcentration is a strong property of interconnection diagraphs. We characterize its negation by existence of two disjoint and seperated sets which shrink under the forward and backward neighbor relation, respectively. This enables a better, non-cascaded design of superconcentrators, explicit ones with edge density ≤ 118, random ones with edge density ≤ 13.

UR - https://www.scopus.com/pages/publications/0002358835

U2 - 10.1007/3-540-12920-0_11

DO - 10.1007/3-540-12920-0_11

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0002358835

SN - 9783540129202

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 121

EP - 128

BT - STACS 1984 - Symposium of Theoretical Aspects of Computer Science

A2 - Mehlhorn, K.

A2 - Fontet, M.

PB - Springer Verlag

T2 - 1st Annual Symposium on Theoretical Aspects of Computer Science, STACS 1985

Y2 - 11 April 1984 through 13 April 1984

ER -

Shamir E. From expanders to better superconcentrators without cascading. In Mehlhorn K, Fontet M, editors, STACS 1984 - Symposium of Theoretical Aspects of Computer Science. Springer Verlag. 1984. p. 121-128. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-12920-0_11

From expanders to better superconcentrators without cascading

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this