Size bounds for superconcentrators
From MaRDI portal
Cites work
- A note on time-space tradeoffs for computing continuous functions
- A Permutation Network
- Generalized Connection Networks for Parallel Processor Intercommunication
- Generalized Connectors
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3526016 (Why is no real title available?)
- scientific article; zbMATH DE number 3566171 (Why is no real title available?)
- scientific article; zbMATH DE number 3597878 (Why is no real title available?)
- scientific article; zbMATH DE number 3225079 (Why is no real title available?)
- scientific article; zbMATH DE number 3363674 (Why is no real title available?)
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
- On Computing the Discrete Fourier Transform
- On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
- On rearrangeable and non-blocking switching networks
- On the multiplicative complexity of the discrete Fourier transform
- Superconcentrators
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits
- Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
This page was built for publication: Size bounds for superconcentrators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1170885)