Asymptotically optimal switching circuits

MaRDI QIDQ1165218zbMATH OpenFDO

Authors 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

Applications of graph theory to circuits and networks (94C15)

Cited in

(22)

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

This page was built for publication: Asymptotically optimal switching circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165218)