On rearrangeable and non-blocking switching networks-Reference-Cited by-同舟云学术

On rearrangeable and non-blocking switching networks

Author:

Pippenger Nicholas

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference14 articles.

1. Asymptotic estimation of the number of switching points in non-blocking circuits;Bassalygo;Elektrosvyaz,1970

2. Asymptotic estimation of the number of switching points in non-blocking circuits;Bassalygo;Telecomm. and Radio Eng.,1970

3. Complexity of an optimum non-blocking switching network without reconnections;Bassalygo;Problemy Peredachi Informatsi,1973

4. Complexity of an optimum non-blocking switching network without reconnections;Bassalygo;Problems of Information Transmission,1974

5. The analysis and synthesis of signal switching networks;Beizer,1962

Cited by 35 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. MUSE: A Runtime Incrementally Reconfigurable Network Adapting to HPC Real-Time Traffic;2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2024-05-27

3. A Non-Blocking System-Area Network with Multiple Direct Channels;2023 7th International Conference on Information, Control, and Communication Technologies (ICCT);2023-10-02