Constructions of sparse asymmetric connectors with number theoretic methods

DOI10.1002/net.20058zbMath1082.68001OpenAlexW4233384604MaRDI QIDQ4680414

Anand Srivastav, Gerold Jäger, Andreas Baltz

Publication date: 1 June 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20058

zbMATH Keywords

combinatorial number theoryconnectorrearrangeable networkrestricted sumspermutersparse switch

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Construction of asymmetric connectors of depth two ⋮ Interactive Communication, Diagnosis and Error Control in Networks ⋮ Multicast Routing and Design of Sparse Connectors

Cites Work

• On rearrangeable and non-blocking switching networks
• Restricted set addition in groups. II: A generalization of the Erdős-Heilbronn conjecture
• Rearrangeable Networks with Limited Depth
• Cyclic Spaces for Grassmann Derivatives and Additive Theory
• On the Addition of Residue Classes
• Crosspoint complexity of sparse crossbar concentrators

This page was built for publication: Constructions of sparse asymmetric connectors with number theoretic methods