Explicit construction of natural bounded concentrators

Authors:
Moshe Morgenstern
Affiliations:
-
Venue:
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Year:
1991

Citing 0
Cited 3

A practical constructive scheme for deterministic shared-memory access

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Expanders that beat the eigenvalue bound: explicit construction and applications

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Arithmetically Defined Representations of Groups of TypeSL(2, Fq)

Finite Fields and Their Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

The first known direct construction for linear families of bounded concentrators is given. The construction is explicit, and the results are simple natural bounded concentrators.