The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1972-1993 (15) 1994-2004 (15) 2005-2023 (15)
Publication types (Num. hits)
article(23) inproceedings(22)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 40 occurrences of 31 keywords

Results
Found 45 publication records. Showing 45 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
73Xuesong 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
72A. Abbinante, Pietro Camarda GSN: A New Multihop Architecture for Optical Networks. Search on Bibsonomy LCN The full citation details ... 1996 DBLP  DOI  BibTeX  RDF optical fibre communication, multihop architecture, Generalized ShuffleNet, table free routing, distributed hardware based decisions, modularity, optical networks, high performance, computer program, necessary conditions, rearrangeability, virtual topology, sufficiency
68Yuanyuan Yang 0001, Gerald M. Masson Broadcast ring sandwich networks. Search on Bibsonomy SPDP The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
55Kyungsook Y. Lee On the Rearrangeability of 2(log2N) - 1 Stage Permutation Networks. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1985 DBLP  DOI  BibTeX  RDF hardware requirement, passable permutations, interconnection network, permutation, multistage networks, Control algorithm, rearrangeability, hardware redundancy
51Rza Bashirov On the Rearrangeability of Multistage Networks Employing Uniform Connection Patterns. Search on Bibsonomy ADVIS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
49José R. Correa, Michel X. Goemans An approximate König's theorem for edge-coloring weighted bipartite graphs. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF bipartite edge coloring, rearrangeability of 3-stage clos networks, bin packing
28Bey-Chi Lin Rearrangeability and repackability of a multicast wavelength-space-wavelength elastic optical network. Search on Bibsonomy Opt. Switch. Netw. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
28Fitz Gerald Cabangcla, Daniele Izzi, Annalisa Massini A New Perspective for Rearrangeability of MINs. Search on Bibsonomy SoftCOM The full citation details ... 2021 DBLP  BibTeX  RDF
28Wojciech Kabacinski, Atyaf Al-Tameemi, Remigiusz Rajewski Necessary and Sufficient Conditions for the Rearrangeability of WSW1 Switching Fabrics. Search on Bibsonomy IEEE Access The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
28Wojciech Kabacinski, Atyaf Al-Tameemi, Remigiusz Rajewski Rearrangeability of Wavelength-Space-Wavelength Switching Fabric Architecture for Elastic Optical Switches. Search on Bibsonomy IEEE Access The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
28Li-Da Tong, Yun-Ruei Li Rearrangeability of Multicast Banyan-Type Networks with Crosstalk Constraints. Search on Bibsonomy J. Interconnect. Networks The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
28Ibrahima Sakho, Jean-Pierre Jung One Step Ahead towards the Rearrangeability of 4D-Hypercube Interconnection Networks. Search on Bibsonomy ACIIDS (2) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
28Shuo-Yen Robert Li, Xuesong Jonathan Tan On rearrangeability of tandem connection of banyan-type networks. Search on Bibsonomy IEEE Trans. Commun. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
28Xuesong Tan, Shuo-Yen Robert Li Rearrangeability of Tandem Cascade of Banyan-Type Networks. Search on Bibsonomy IEICE Trans. Inf. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
28Xuewen Bao, Frank K. Hwang, Qiao Li Rearrangeability of bit permutation networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Nabanita Das 0001 More on rearrangeability of combined (2n. Search on Bibsonomy J. Syst. Archit. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Xuesong Tan, Shuo-Yen Robert Li On Rearrangeability of Cascaded Banyan-type Networks. Search on Bibsonomy PDCS The full citation details ... 2005 DBLP  BibTeX  RDF
28Hasan Cam Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
28Andrzej Jajszczyk Rearrangeability of multicast Clos networks with middle-stage fan-out. Search on Bibsonomy IEEE Commun. Lett. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
28Rza Bashirov On the rearrangeability of (2s-1)-stage nonsymmetric interconnection networks. Search on Bibsonomy PDPTA The full citation details ... 2000 DBLP  BibTeX  RDF
28Guo-Hui Lin, Ding-Zhu Du, Xiao-Dong Hu 0001, Guoliang Xue On Rearrangeability of Multirate Clos Networks. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
28Guo-Hui Lin, Ding-Zhu Du, Weili Wu 0001, Kyeongah Yoo On 3-rate rearrangeability of Clos networks. Search on Bibsonomy Advances in Switching Networks The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
28Nabanita Das 0001, Jayasree Dattagupta Two-Pass Rearrangeability in Faulty Benes Networks. Search on Bibsonomy J. Parallel Distributed Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
28B. Park, Karan L. Watson On the Rearrangeability of Reverse Shuffle/Exchange Networks. Search on Bibsonomy ICPP (1) The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
28Dung T. Huynh, Hai N. Nguyen On the Rearrangeability of Switching Networks Composed of Digital Symmetrical Matrices. Search on Bibsonomy ICCI The full citation details ... 1993 DBLP  BibTeX  RDF
28Akram Abdennadher, Tse-Yun Feng On Rearrangeability of Omega-Omega Networks. Search on Bibsonomy ICPP (1) The full citation details ... 1992 DBLP  BibTeX  RDF
28Abdulraouf Y. Al-Hallaq Rearrangeability of 2 log N-1 shuffle/exchange network. Search on Bibsonomy TAI The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
28Anujan Varma, Cauligi S. Raghavendra Rearrangeability of multistage shuffle/exchange networks. Search on Bibsonomy IEEE Trans. Commun. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
28Cauligi S. Raghavendra, Anujan Varma Rearrangeability of the Five-Stage Shuffle/Exchange Network for N = 8. Search on Bibsonomy IEEE Trans. Commun. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
28Anujan Varma, Cauligi S. Raghavendra Rearrangeability of Multistage Shuffle/Exchange Networks. Search on Bibsonomy ISCA The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
28Anujan Varma, Cauligi S. Raghavendra Rearrangeability of the 5-Stage Shuffle/Exchange Network for N=8 9. Search on Bibsonomy ICPP The full citation details ... 1986 DBLP  BibTeX  RDF
28Suresh C. Kothari, S. Lakshmivarahan A Condition Known to be Sufficient for Rearrangeability of the Benes Class of Interconnection Networks with 2x2 Switches Is Also Necessary. Search on Bibsonomy ICPP The full citation details ... 1983 DBLP  BibTeX  RDF
28Frank K. Hwang On the rearrangeability of some multistage connecting networks. Search on Bibsonomy Bell Syst. Tech. J. The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
28Vaclav Edvard Benes Proving the rearrangeability of connecting networks by group calculations. Search on Bibsonomy Bell Syst. Tech. J. The full citation details ... 1975 DBLP  DOI  BibTeX  RDF
28Vaclav Edvard Benes Toward a group-theoretic proof of the rearrangeability theorem for clos' network. Search on Bibsonomy Bell Syst. Tech. J. The full citation details ... 1975 DBLP  DOI  BibTeX  RDF
28Frank K. Hwang Rearrangeability of multi-connection three-stage clos networks. Search on Bibsonomy Networks The full citation details ... 1972 DBLP  DOI  BibTeX  RDF
27Serge Burckel, Emeric Gioan, Emmanuel Thomé Mapping Computation with No Memory. Search on Bibsonomy UC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF mapping computation, boolean mapping, linear mapping, processor optimization, multistage interconnection network, circuit design, memory optimization, butterfly, program design, rearrangeability
27Rajgopal 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
27Hasan Cam, José A. B. Fortes Frames: A Simple Characterization of Permutations Realized by Frequently Used Networks. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1995 DBLP  DOI  BibTeX  RDF topological equivalence, balanced matrices, Network, permutations, frames, rearrangeability
27David Goldfeld, Tuvi Etzion UPP Graphs and UMFA Networks-Architecture for Parallel Systems. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1992 DBLP  DOI  BibTeX  RDF UMFA networks, unique path property, uniform minimal full access, interconnection networks, parallel architectures, lower bound, multiprocessor interconnection networks, isomorphism, Omega network, rearrangeability
23Badar Gillani, Robert D. Kent, Akshai K. Aggarwal Topology Reconfiguration Mechanism for Traffic Engineering in WDM Optical Network. Search on Bibsonomy HPCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF wavelength division multiplexing (WDM) and single lightpath change (SLPC), reconfiguration, Lightpath (LP)
23Mohammad 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
23Mao-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
23Linjiang 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
23Dongsoo S. Kim, Ding-Zhu Du Multirate Multicast Switching Networks. Search on Bibsonomy COCOON The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #45 of 45 (100 per page; Change: )
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