The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for rearrangeable with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1974-1987 (19) 1988-1992 (15) 1993-1995 (15) 1996-1998 (17) 1999-2001 (18) 2002-2004 (16) 2005-2006 (20) 2007-2011 (15) 2012-2019 (15) 2020-2023 (2)
Publication types (Num. hits)
article(90) inproceedings(62)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 100 occurrences of 57 keywords

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