Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
112 | Yuanyuan Yang 0001, Jianchao Wang |
Fault-Tolerant Rearrangeable Permutation Network. |
IEEE Trans. Computers |
2004 |
DBLP DOI BibTeX RDF |
losing-contact fault, Fault tolerance, routing, cluster computing, fault model, permutation, switching networks, Clos networks, rearrangeable |
95 | Hasan Cam, José A. B. Fortes |
Work-Efficient Routing Algorithms for Rearrangeable Symmetrical Networks. |
IEEE Trans. Parallel Distributed Syst. |
1999 |
DBLP DOI BibTeX RDF |
Rearrangeable symmetrical network, parallel routing algorithm, work-efficient PRAM algorithm, balanced matrix, permutations, frame, Benes network |
83 | Xuesong Tan, Shuo-Yen Robert Li, Yuxiu Shen |
Rearrangeability of the Tandem Cascade of Banyan-type Networks. |
PDCAT |
2005 |
DBLP DOI BibTeX RDF |
|
78 | Frank K. Hwang, Wen-Dar Lin, Vadim Lioubimov |
On noninterruptive rearrangeable networks. |
IEEE/ACM Trans. Netw. |
2006 |
DBLP DOI BibTeX RDF |
Paull's matrix, doubled path, noninterruptive rearrangeable (NIR), output (input)-divertability, rearrangeably nonblocking (RNB), strictly nonblocking (SNB), wide-sense nonblocking (WSNB), clos network |
73 | Hongbing Fan, Yu-Liang Wu |
A New Approach for Rearrangeable Multicast Switching Networks. |
COCOA |
2009 |
DBLP DOI BibTeX RDF |
|
73 | Rajgopal Kannan |
The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network. |
IEEE Trans. Computers |
2005 |
DBLP DOI BibTeX RDF |
optimal control algorithm, Benes network, rearrangeability |
62 | Mao-Hsu Yen, Sao-Jie Chen, Sanko Lan |
A Three-Stage One-Sided Rearrangeable Polygonal Switching Network. |
IEEE Trans. Computers |
2001 |
DBLP DOI BibTeX RDF |
polygonal switching network, switching network, Rearrangeable |
56 | Si-Qing Zheng, Ashwin Gumaste, Enyue Lu |
A practical fast parallel routing architecture for Clos networks. |
ANCS |
2006 |
DBLP DOI BibTeX RDF |
rearrangeable nonblocking, strictly nonblocking, parallel algorithm, parallel architecture, pipelining, packet switching, circuit switching, permutation routing, Clos network |
56 | Seung-Woo Seo, Tse-Yun Feng, Hyoung-Il Lee |
Permutation Realizability and Fault Tolerance Property of the Inside-Out Routing Algorithm. |
IEEE Trans. Parallel Distributed Syst. |
1999 |
DBLP DOI BibTeX RDF |
Omega + Omega network, looping algorithm, inside-out routing algorithm, fault tolerance, Benes network, Rearrangeable networks |
50 | S. Q. Zheng 0001 |
Scalable and Practical Nonblocking Switching Networks (Extended Abstract). |
PDCAT |
2005 |
DBLP DOI BibTeX RDF |
|
50 | Enyue Lu, S. Q. Zheng 0001 |
Parallel Routing and Wavelength Assignment for Optical Multistage Interconnection Networks. |
ICPP |
2004 |
DBLP DOI BibTeX RDF |
|
50 | Linjiang Ma, Tse-Yun Feng |
Routing A Class of Concatenated Omega Networks. |
FTDCS |
1999 |
DBLP DOI BibTeX RDF |
topological equivalence, omega + omega networks, labeling scheme, Benes networks |
45 | Amitabha Chakrabarty, Martin Collier, Sourav Mukhopadhyay |
Symmetric Rearrangeable Networks: Algorithms and Rearrangement Limits. |
ITNG |
2010 |
DBLP DOI BibTeX RDF |
Routing Tags, Interconnection Networks, Permutation, Blocking, Rearrangeable Network |
45 | Tse-Yun Feng, Seung-Woo Seo |
A New Routing Algorithm for a Class of Rearrangeable Networks. |
IEEE Trans. Computers |
1994 |
DBLP DOI BibTeX RDF |
butterfly connections, symmetric networks, looping algorithm, center-stage connection patterns, topological equivalence, interchangeable group, destination-tag scheme, multiprocessor interconnection networks, routing algorithm, reconfigurable architectures, multistage interconnection networks, network routing, Omega networks, rearrangeable networks |
45 | Barry G. Douglass |
Rearrangeable Three-Stage Interconnection Networks and Their Routing Properties. |
IEEE Trans. Computers |
1993 |
DBLP DOI BibTeX RDF |
Clos three-stage networks, switch settings, computational complexity, interconnection network, multiprocessor interconnection networks, permutations, routing scheme, rearrangeable network, network complexity |
39 | Xiaohong Jiang 0001, Achille Pattavina, Susumu Horiguchi |
Rearrangeable f-cast multi-log2 N networks. |
IEEE Trans. Commun. |
2008 |
DBLP DOI BibTeX RDF |
|
39 | Jiun-Shiou Deng, Ming-Feng Lu, Yang-Tung Huang |
High performance rearrangeable nonblocking networks with polarization selective elements. |
ICON |
2008 |
DBLP DOI BibTeX RDF |
|
39 | Frank K. Hwang, Wen-Dar Lin |
Necessary and sufficient conditions for rearrangeable Logd(N, m, p). |
IEEE Trans. Commun. |
2005 |
DBLP DOI BibTeX RDF |
|
39 | Hongbing Fan, Jiping Liu, Yu-Liang Wu, Chak-Chung Cheung |
On optimal hyperuniversal and rearrangeable switch box designs. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
39 | Hung Q. Ngo 0001, Van H. Vu |
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs. |
SODA |
2003 |
DBLP BibTeX RDF |
|
39 | Mohammad R. Salehnamadi, Mehdi N. Fesharaki |
A "Single-Box" Re-routing Architecture for a 3-Stage Rearrangeable CLOS Interconnection Networks. |
PARA |
2002 |
DBLP DOI BibTeX RDF |
|
39 | Ming-Jye Lee, Chi-Chang Chen, Chien-Ning Yeh |
Permutation Routing in All-Optical Multistage Clos Network. |
ITNG |
2008 |
DBLP DOI BibTeX RDF |
Optical Crosstalk, Rearrangeable non-blocking, Paull’s Matrix, Edge Coloring, Clos network |
39 | Si-Qing Zheng, Ashwin Gumaste |
Scalable and Practical Nonblocking Switching Networks. |
J. Comput. Sci. Technol. |
2006 |
DBLP DOI BibTeX RDF |
rearrangeable nonblocking network, wide-sense nonblocking network, strictly nonblocking network, switching network, circuit switching, optical switching |
39 | Rudolf Ahlswede, Harout K. Aydinian |
Sparse Asymmetric Connectors in Communication Networks. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
fault–tolerant connector, connector, rearrangeable network |
39 | Enyue Lu, S. Q. Zheng 0001 |
Parallel Routing Algorithms for Nonblocking Electronic and Photonic Switching Networks. |
IEEE Trans. Parallel Distributed Syst. |
2005 |
DBLP DOI BibTeX RDF |
rearrangeable nonblocking network, strictly nonblocking network, parallel algorithm, graph coloring, crosstalk, optical switching, Banyan network, self-routing, switch control |
39 | Hung-Lin Fu, Frank K. Hwang |
On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls. |
J. Comb. Optim. |
2005 |
DBLP DOI BibTeX RDF |
3-stage Clos networks, nonblocking networks, rearrangeable networks |
39 | Nabanita Das 0001, Jayasree Dattagupta |
A fault location technique and alternate routing in Benes network. |
Asian Test Symposium |
1995 |
DBLP DOI BibTeX RDF |
fault location technique, single switch fault, recirculation, source-destination path, routing technique, exact locations, multiple switch fault detection, one bit test vectors, equivalent fault set, fault diagnosis, fault tolerant computing, reconfiguration, reconfigurable architectures, multistage interconnection networks, multistage interconnection networks, network routing, Benes network, rearrangeable network, alternate routing |
33 | Wojciech Kabacinski, Marek Michalski |
The Routing Algorithm and Wide-Sense Nonblocking Conditions for Multiplane Baseline Switching Networks. |
IEEE J. Sel. Areas Commun. |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Chin-Tau Lea |
Expanding the switching capabilities of optical crossconnects. |
IEEE Trans. Commun. |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Rza Bashirov, Valentino Crespi |
Quantitative Analysis of Permutation Capability with Colored Petri Nets. |
MASCOTS |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Wojciech Kabacinski, Marek Michalski |
Lower Bounds for WSNB Multi-Log2N Switching Networks. |
AICT/SAPIR/ELETE |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Abdulraouf Y. Al-Hallaq |
Robustness of the destination tag based routing algorithm for the control of unique path networks (abstract only). |
ACM Conference on Computer Science |
1987 |
DBLP DOI BibTeX RDF |
|
23 | Satoru Ohta, Naoki Tsuji |
On the Existence of Unknown Rearrangeable Banyan-type Networks. |
ICECC |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Wojciech Kabacinski, Remigiusz Rajewski, Atyaf Al-Tameemi |
Rearrangeable \(2 \times 2\) elastic optical switch with two connection rates and spectrum conversion capability. |
Photonic Netw. Commun. |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Bey-Chi Lin |
New upper bound for a rearrangeable non-blocking WSW architecture. |
IET Commun. |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Bey-Chi Lin |
Rearrangeable W-S-W Elastic Optical Networks Generated by Graph Approaches: erratum. |
JOCN |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Muhammad Rehan Yahya, Ning Wu, Gaizhen Yan, Fen Ge, Tanveer Ahmed |
RoR: A low insertion loss design of rearrangeable hybrid photonic-plasmonic 6 × 6 non-blocking router for ONoCs. |
IEICE Electron. Express |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Bey-Chi Lin |
Rearrangeable W-S-W Elastic Optical Networks Generated by Graph Approaches. |
JOCN |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Satoru Ohta |
A New Result on Rearrangeable 3-Stage Clos Networks. |
ITNAC |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Abdelbaset S. Hamza, Jitender S. Deogun, Dennis R. Alexander |
New Class of Rearrangeable Nonblocking Multicast Free-Space Optical Switches. |
JOCN |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Mao-Hsu Yen, Hung-Kuan Yen, Chu Yu |
Comment on "On Optimal Hyperuniversal and Rearrangeable Switch Box Designs". |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Abdelbaset S. Hamza, Jitender S. Deogun, Dennis R. Alexander |
Rearrangeable Non-Blocking Multicast FSO Switch Using Fixed Switching Elements. |
GLOBECOM |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Serge Burckel, Emeric Gioan, Emmanuel Thomé |
Computation with No Memory, and Rearrangeable Multicast Networks. |
Discret. Math. Theor. Comput. Sci. |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Mao-Hsu Yen, Chu Yu, Horng-Ru Liao, Chin-Fa Hsieh |
A Generic Three-Sided Rearrangeable Switching Network for Polygonal FPGA Design. |
VLSI Design |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Serge Burckel, Emeric Gioan, Emmanuel Thomé |
Computation with No Memory, and Rearrangeable Multicast Networks. |
CoRR |
2013 |
DBLP BibTeX RDF |
|
23 | Wojciech Kabacinski, Marek Michalski |
The control algorithm and the FPGA controller for non-interruptive rearrangeable Log2(N, 0, p) switching networks. |
ICC |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Amitabha Chakrabarty, Martin Collier |
Low Complexity Routing Algorithm for Rearrangeable Switching Networks. |
AINA |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Yonghao Yue, Kei Iwasaki, Bing-Yu Chen 0004, Yoshinori Dobashi, Tomoyuki Nishita |
Pixel Art with Refracted Light by Rearrangeable Sticks. |
Comput. Graph. Forum |
2012 |
DBLP DOI BibTeX RDF |
|
23 | D. J. Guan, Li-Da Tong, Irene Ya-Ping Chen |
A Routing Algorithm for Rearrangeable Nonblocking Optical Banyan-type Networks. |
BWCCA |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Wojciech Kabacinski, Marek Michalski |
FPGA controller for rearrangeable Log2(N, 0, p) fabrics with an even number of stages. |
HPSR |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Si-Qing Zheng, Ashwin Gumaste, Hong Shen 0001 |
A parallel self-routing rearrangeable nonblocking multi-log2 N photonic switching network. |
IEEE/ACM Trans. Netw. |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Irene Ya-Ping Chen, Li-Da Tong, Yi-Ming Huang |
Rearrangeable Nonblocking Optical Interconnection Network Fabrics With Crosstalk Constraints. |
IEEE/ACM Trans. Netw. |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Amitabha Chakrabarty, Martin Collier, Sourav Mukhopadhyay |
Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks. |
Int. J. Grid High Perform. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Hung Q. Ngo 0001, Yang Wang 0014, Dazhen Pan |
Rearrangeable and nonblocking [w, f] -distributors. |
IEEE/ACM Trans. Netw. |
2009 |
DBLP DOI BibTeX RDF |
WDM optical cross-connects, distributors, optimal connectors, complexity, multicast |
23 | Grzegorz Danilewicz, Wojciech Kabacinski, Mariusz Zal |
Reduced banyan-type multiplane rearrangeable switching networks. |
IEEE Commun. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Wenqing Dou, Enyu Yao |
On rearrangeable multirate three-stage Clos networks. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Hong-Bin Chen, Frank K. Hwang |
On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out. |
SIAM J. Discret. Math. |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Si-Qing Zheng, Ashwin Gumaste, Hong Shen 0001 |
A Rearrangeable Nonblocking Multi-log2N Multicast Switching Network. |
GLOBECOM |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Xiaohong Jiang 0001, Susumu Horiguchi |
Design of Optical Rearrangeable Nonblocking MINs Under Various Crosstalk Constraints. |
Photonic Netw. Commun. |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Hung Quang Ngo |
WDM Switching Networks, Rearrangeable and Nonblocking [w, f]-connectors. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Nicolas Villar, Adam Lindsay, Hans-Werner Gellersen |
Pin&Play&Perform: A rearrangeable tangible interface for musical composition and performance. |
NIME |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Andrzej Jajszczyk |
Nonblocking, repackable, and rearrangeable Clos networks: fifty years of the theory evolution. |
IEEE Commun. Mag. |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Hung Q. Ngo 0001 |
A new routing algorithm for multirate rearrangeable Clos networks. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Rajgopal Kannan |
The KR-Benes Network: A (almost) Control-Optimal Rearrangeable Permutation Network |
CoRR |
2003 |
DBLP BibTeX RDF |
|
23 | Frank K. Hwang, Sheng-Chyang Liaw, Li-Da Tong |
Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability. |
IEEE Trans. Commun. |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Hung Q. Ngo 0001, Van H. Vu |
Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Siamack Ayandeh |
A distributed semi-rearrangeable nonblocking path hunt algorithm for Clos networks with TDM links. |
ICC |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Yang Yang 0001, Tak-Shing Peter Yum |
Rearrangeable compact assignment of OVSF codes for multi-rate traffic. |
GLOBECOM |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Xiao-Dong Hu 0001, Xiaohua Jia, Ding-Zhu Du, Frank K. Hwang |
Monotone Routing in Multirate Rearrangeable Clos Networks. |
J. Parallel Distributed Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Guido Maier, Achille Pattavina |
Design of photonic rearrangeable networks with zero first-order switching-element-crosstalk. |
IEEE Trans. Commun. |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Nabanita Das 0001, Krishnendu Mukhopadhyaya, Jayasree Dattagupta |
O(n) routing in rearrangeable networks. |
J. Syst. Archit. |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Rza Bashirov |
Combinatorial model of the class of rearrangeable nonsymmetric interconnection networks. |
PDPTA |
2000 |
DBLP BibTeX RDF |
|
23 | Qing Hu 0007, Yixin Zhang, Xiaojun Shen 0002 |
Rearrangeable Graphs. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Sriram Raghavan, G. Manimaran, C. Siva Ram Murthy |
A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees. |
IEEE/ACM Trans. Netw. |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Achille Pattavina, Guido Maier |
Photonic Rearrangeable Networks with Zero Switching-Element Crosstalk. |
INFOCOM |
1999 |
DBLP DOI BibTeX RDF |
|
23 | R. Sriram, G. Manimaran, C. Siva Ram Murthy |
A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees. |
INFOCOM |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Dominique Barth, Petrisor Panaite |
Undirected graphs rearrangeable by 2-length walks. |
Networks |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Jadranka Skorin-Kapov, Jean-François P. Labourdette |
Rearrangeable multihop lightwave networks: congestion minimization on regular topologies. |
Telecommun. Syst. |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Ding-Zhu Du, Biao Gao, Frank K. Hwang, J. H. Kim |
On Multirate Rearrangeable Clos Networks. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Dan M. Marom, David Mendlovic |
Comment on "A New Routing Algorithm for a Class of Rearrangeable Networks". |
IEEE Trans. Computers |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Fred Bauer, Anujan Varma |
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm. |
IEEE J. Sel. Areas Commun. |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Ioannis Gragopoulos, Fotini-Niovi Pavlidou |
A new evaluation criterion for Clos- and Benes-type rearrangeable switching networks. |
IEEE Trans. Commun. |
1997 |
DBLP DOI BibTeX RDF |
|
23 | John D. Carpinelli, Catherine B. Wang |
Performance of a new decomposition algorithm for rearrangeable fault-tolerant Clos interconnection networks under sub-maximal and no-fault conditions. |
Advances in Switching Networks |
1997 |
DBLP DOI BibTeX RDF |
|
23 | M. Douglas McIlroy, Joseph P. Savicki |
Isomorphism of classical rearrangeable networks. |
Advances in Switching Networks |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Qing Hu 0007, Yixin Zhang, Xiaojun Shen 0002 |
Rearrangeable Graphs. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Hyun Yeop Lee, Frank K. Hwang, John D. Carpinelli |
A new decomposition algorithm for rearrangeable Clos interconnection networks. |
IEEE Trans. Commun. |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Yanggon Kim, Tse-Yun Feng |
New Graph Model and Its Routing Algorithm for Rearrangeable Networks. |
PARA |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Fred Bauer, Anujan Varma |
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm. |
INFOCOM |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Bülent Yener, Terrance E. Boult |
Flow Trees: A Lower Bound Computation Tool with Applications to Rearrangeable Multihop Lightwave Network Optimization. |
J. High Speed Networks |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Jadranka Skorin-Kapov, Jean-François P. Labourdette |
On minimum congestion routing in rearrangeable multihop lightwave networks. |
J. Heuristics |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Cenk Gazen, Cem Ersoy |
Optimization of Logically Rearrangeable Multihop Lightwave Networks With Genetic Algorithms. |
Data Communications and their Performance |
1995 |
DBLP BibTeX RDF |
|
23 | Young-Keun Park, Vladimir Cherkassky |
Neural Network for Control of Rearrangeable Clos Networks. |
Int. J. Neural Syst. |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Dong-Jye Shyy, Chin-Tau Lea |
Rearrangeable nonblocking Log2d (N, m, p) networks. |
IEEE Trans. Commun. |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Terence D. Todd, Allan M. Bignell |
A slot-reuse protocol for rearrangeable dual-bus networks. |
IEEE Trans. Commun. |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Seung-Woo Seo, Tse-Yun Feng |
A General Inside-Out Routing Algorithm for a Class of Rearrangeable Networks. |
ICPP (1) |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Yeonghwan Tscha, Yanghee Choi, Kyoon Ha Lee |
Rearrangeable Nonblocking Condition for Multi-log_2 N Multiconnection Networks. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
23 | Sang-Bang Choi, Arun K. Somani |
Rearrangeable Circuit-Switched Hypercube Architecture for Routing Permutations. |
J. Parallel Distributed Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
23 | Janusz Filipiak |
A Model of a Rearrangeable User-Network Interface in B-ISDN. |
Eur. Trans. Telecommun. |
1993 |
DBLP DOI BibTeX RDF |
|
23 | Young-Keun Park, Vladimir Cherkassky |
Neural network controller for rearrangeable switching networks. |
ICNN |
1993 |
DBLP DOI BibTeX RDF |
|
23 | Jean-François P. Labourdette, Anthony S. Acampora |
Logical Clustering for the Optimization and Analysis of a Rearrangeable Distributed ATM Switch. |
INFOCOM |
1993 |
DBLP DOI BibTeX RDF |
|