From expanders to better superconcentrators without cascading

Eli Shamir*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationSTACS 1984 - Symposium of Theoretical Aspects of Computer Science
EditorsK. Mehlhorn, M. Fontet
PublisherSpringer Verlag
Pages121-128
Number of pages8
ISBN (Print)9783540129202
DOIs
StatePublished - 1984
Event1st Annual Symposium on Theoretical Aspects of Computer Science, STACS 1985 - Paris, France
Duration: 11 Apr 198413 Apr 1984

Publication series

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

Conference

Conference1st Annual Symposium on Theoretical Aspects of Computer Science, STACS 1985
Country/TerritoryFrance
CityParis
Period11/04/8413/04/84

Bibliographical note

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

Fingerprint

Dive into the research topics of 'From expanders to better superconcentrators without cascading'. Together they form a unique fingerprint.

Cite this