Asymptotically optimal switching circuits

zbMath0486.94021MaRDI QIDQ1165218

L. A. Bassalygo

Publication date: 1981

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

superconcentratorsconcentratorsconnections of graph inputs and outputsnon-unary concentratorsnonblocking circuits

Mathematics Subject Classification ID

Related Items (22)

On the relationship between the diameter and the size of a boundary of a directed graph ⋮ A lower bound for tree resolution ⋮ Multi-processor scheduling and expanders ⋮ Smaller superconcentrators of density 28 ⋮ Expanders obtained from affine transformations ⋮ Bipartite multigraphs with expander-like properties ⋮ Eigenvalues and expanders ⋮ An FPTAS for the hardcore model on random regular bipartite graphs ⋮ Expanders and Diffusers ⋮ Note on ``Smaller explicit superconcentrators ⋮ Algorithms for #BIS-Hard Problems on Expander Graphs ⋮ The Steiner tree problem on graphs: inapproximability results ⋮ Some ``good properties of LDA lattices ⋮ Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack ⋮ Highly symmetric expanders ⋮ Sparse and limited wavelength conversion in all-optical tree networks ⋮ Low-complexity error correction of Hamming-code-based LDPC codes ⋮ Stabilizing network bargaining games by blocking players ⋮ Decoding concatenated codes with inner convolutional codes ⋮ Natural bounded concentrators ⋮ Some Graph-Colouring Theorems with Applications to Generalized Connection Networks ⋮ Diameters and Eigenvalues

This page was built for publication: Asymptotically optimal switching circuits