Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
112 | Yuanyuan Yang 0001, Jianchao Wang |
Fault-Tolerant Rearrangeable Permutation Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 53(4), pp. 414-426, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 10(7), pp. 733-741, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2005), 5-8 December 2005, Dalian, China, pp. 11-15, 2005, IEEE Computer Society, 0-7695-2405-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
78 | Frank K. Hwang, Wen-Dar Lin, Vadim Lioubimov |
On noninterruptive rearrangeable networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 14(5), pp. 1141-1149, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 384-394, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
73 | Rajgopal Kannan |
The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 54(5), pp. 534-544, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 50(11), pp. 1291-1294, 2001. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANCS ![In: Proceedings of the 2006 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, ANCS 2006, San Jose, California, USA, December 3-5, 2006, pp. 21-30, 2006, ACM, 1-59593-580-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 10(9), pp. 946-957, 1999. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2005), 5-8 December 2005, Dalian, China, pp. 8-10, 2005, IEEE Computer Society, 0-7695-2405-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
50 | Enyue Lu, S. Q. Zheng 0001 |
Parallel Routing and Wavelength Assignment for Optical Multistage Interconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 33rd International Conference on Parallel Processing (ICPP 2004), 15-18 August 2004, Montreal, Quebec, Canada, pp. 214-221, 2004, IEEE Computer Society, 0-7695-2197-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
50 | Linjiang Ma, Tse-Yun Feng |
Routing A Class of Concatenated Omega Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTDCS ![In: 7th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS '99), 20-22 December 1999, Cape Town, South Africa, Proceedings, pp. 29-35, 1999, IEEE Computer Society, 0-7695-0468-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Seventh International Conference on Information Technology: New Generations, ITNG 2010, Las Vegas, Nevada, USA, 12-14 April 2010, pp. 1274-1277, 2010, IEEE Computer Society, 978-0-7695-3984-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 43(11), pp. 1270-1280, 1994. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(5), pp. 559-567, 1993. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 56(11), pp. 1929-1938, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
39 | Jiun-Shiou Deng, Ming-Feng Lu, Yang-Tung Huang |
High performance rearrangeable nonblocking networks with polarization selective elements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICON ![In: Proceedings of the 16th International Conference on Networks, ICON 2008, December 12-14, 2008, held at India Habitat Centre, New Delhi, India, pp. 1-5, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
39 | Frank K. Hwang, Wen-Dar Lin |
Necessary and sufficient conditions for rearrangeable Logd(N, m, p). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 53(12), pp. 2020-2023, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
39 | Hongbing Fan, Jiping Liu, Yu-Liang Wu, Chak-Chung Cheung |
On optimal hyperuniversal and rearrangeable switch box designs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(12), pp. 1637-1649, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 834-840, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARA ![In: Applied Parallel Computing Advanced Scientific Computing, 6th International Conference, PARA 2002, Espoo, Finland, June 15-18, 2002, Proceedings, pp. 531-541, 2002, Springer, 3-540-43786-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
39 | Ming-Jye Lee, Chi-Chang Chen, Chien-Ning Yeh |
Permutation Routing in All-Optical Multistage Clos Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Fifth International Conference on Information Technology: New Generations (ITNG 2008), 7-8 April 2008, Las Vegas, Nevada, USA, pp. 1192-1193, 2008, IEEE Computer Society, 978-0-7695-3099-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 21(4), pp. 466-475, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GTIT-C ![In: General Theory of Information Transfer and Combinatorics, pp. 1056-1062, 2006, Springer, 3-540-46244-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(8), pp. 702-713, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(3), pp. 263-266, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 4th Asian Test Symposium (ATS '95), November 23-24, 1995. Bangalore, India, pp. 71-, 1995, IEEE Computer Society, 0-8186-7129-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 24(S-12), pp. 35-44, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Chin-Tau Lea |
Expanding the switching capabilities of optical crossconnects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 53(11), pp. 1940-1944, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Rza Bashirov, Valentino Crespi |
Quantitative Analysis of Permutation Capability with Colored Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MASCOTS ![In: 13th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2005), 27-29 September 2005, Atlanta, GA, USA, pp. 463-470, 2005, IEEE Computer Society, 0-7695-2458-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Wojciech Kabacinski, Marek Michalski |
Lower Bounds for WSNB Multi-Log2N Switching Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICT/SAPIR/ELETE ![In: Telecommunications 2005: Advanced Industrial Conference on Telecommunications / Service Assurance with Partial and Intermittent Resources Conference / E-Learning on Telecommunications Workshop (AICT / SAPIR / ELETE 2005), 17-22 July 2005, Lisbon, Portugal, pp. 202-206, 2005, IEEE Computer Society, 0-7695-2388-9. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the 15th ACM Annual Conference on Computer Science, St. Louis, Missouri, USA, February 16-19, 1987, pp. 459, 1987, ACM, 0-89791-218-7. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
23 | Satoru Ohta, Naoki Tsuji |
On the Existence of Unknown Rearrangeable Banyan-type Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICECC ![In: Proceedings of the 6th International Conference on Electronics, Communications and Control Engineering, ICECC 2023, Fukuoka, Japan, March 24-26, 2023, pp. 153-158, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Photonic Netw. Commun. ![In: Photonic Netw. Commun. 39(1), pp. 78-90, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Bey-Chi Lin |
New upper bound for a rearrangeable non-blocking WSW architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IET Commun. ![In: IET Commun. 13(20), pp. 3425-3433, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Bey-Chi Lin |
Rearrangeable W-S-W Elastic Optical Networks Generated by Graph Approaches: erratum. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JOCN ![In: JOCN 11(6), pp. 282-284, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Electron. Express ![In: IEICE Electron. Express 16(13), pp. 20190346, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Bey-Chi Lin |
Rearrangeable W-S-W Elastic Optical Networks Generated by Graph Approaches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JOCN ![In: JOCN 10(8), pp. 675-685, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Satoru Ohta |
A New Result on Rearrangeable 3-Stage Clos Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNAC ![In: 28th International Telecommunication Networks and Applications Conference, ITNAC 2018, Sydney, Australia, November 21-23, 2018, pp. 1-6, 2018, IEEE Computer Society, 978-1-5386-7177-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JOCN ![In: JOCN 8(8), pp. 569-581, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Mao-Hsu Yen, Hung-Kuan Yen, Chu Yu |
Comment on "On Optimal Hyperuniversal and Rearrangeable Switch Box Designs". ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 34(7), pp. 1133-1137, 2015. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GLOBECOM ![In: 2015 IEEE Global Communications Conference, GLOBECOM 2015, San Diego, CA, USA, December 6-10, 2015, pp. 1-6, 2015, IEEE, 978-1-4799-5952-5. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Serge Burckel, Emeric Gioan, Emmanuel Thomé |
Computation with No Memory, and Rearrangeable Multicast Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 16(1), pp. 121-142, 2014. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: VLSI Design 2013, pp. 103473:1-103473:15, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Serge Burckel, Emeric Gioan, Emmanuel Thomé |
Computation with No Memory, and Rearrangeable Multicast Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1310.5380, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: Proceedings of IEEE International Conference on Communications, ICC 2013, Budapest, Hungary, June 9-13, 2013, pp. 3840-3845, 2013, IEEE. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Amitabha Chakrabarty, Martin Collier |
Low Complexity Routing Algorithm for Rearrangeable Switching Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA ![In: 27th IEEE International Conference on Advanced Information Networking and Applications, AINA 2013, Barcelona, Spain, March 25-28, 2013, pp. 145-152, 2013, IEEE Computer Society, 978-1-4673-5550-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Graph. Forum ![In: Comput. Graph. Forum 31(2pt3), pp. 575-582, 2012. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BWCCA ![In: 2012 Seventh International Conference on Broadband, Wireless Computing, Communication and Applications, Victoria, BC, Canada, November 12-14, 2012, pp. 289-295, 2012, IEEE, 978-1-4673-2972-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPSR ![In: Proceedings of the 12th IEEE International Conference on High Performance Switching and Routing, HPSR 2011, 4-6 July 2011, Cartagena, Spain, pp. 52-57, 2011, IEEE, 978-1-4244-8456-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 18(2), pp. 529-539, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 18(5), pp. 1413-1421, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Amitabha Chakrabarty, Martin Collier, Sourav Mukhopadhyay |
Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Grid High Perform. Comput. ![In: Int. J. Grid High Perform. Comput. 2(2), pp. 53-63, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Hung Q. Ngo 0001, Yang Wang 0014, Dazhen Pan |
Rearrangeable and nonblocking [w, f] -distributors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 17(3), pp. 990-1001, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Commun. Lett. ![In: IEEE Commun. Lett. 12(12), pp. 900-902, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Wenqing Dou, Enyu Yao |
On rearrangeable multirate three-stage Clos networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 372(1), pp. 103-107, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Hong-Bin Chen, Frank K. Hwang |
On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 20(2), pp. 287-290, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Si-Qing Zheng, Ashwin Gumaste, Hong Shen 0001 |
A Rearrangeable Nonblocking Multi-log2N Multicast Switching Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GLOBECOM ![In: Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November - 1 December 2006, 2006, IEEE, 1-4244-0357-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Xiaohong Jiang 0001, Susumu Horiguchi |
Design of Optical Rearrangeable Nonblocking MINs Under Various Crosstalk Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Photonic Netw. Commun. ![In: Photonic Netw. Commun. 10(2), pp. 225-232, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Hung Quang Ngo |
WDM Switching Networks, Rearrangeable and Nonblocking [w, f]-connectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 35(3), pp. 766-785, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NIME ![In: New Interfaces for Musical Expression, NIME-05, Proceedings, Vancouver, BC, Canada, May 26-28, 2005, pp. 188-191, 2005, University of British Columbia, Media and Graphics Interdisciplinary Center (MAGIC), 0-88865-808-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Andrzej Jajszczyk |
Nonblocking, repackable, and rearrangeable Clos networks: fifty years of the theory evolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Commun. Mag. ![In: IEEE Commun. Mag. 41(10), pp. 28-33, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Hung Q. Ngo 0001 |
A new routing algorithm for multirate rearrangeable Clos networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 290(3), pp. 2157-2167, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Rajgopal Kannan |
The KR-Benes Network: A (almost) Control-Optimal Rearrangeable Permutation Network ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.NI/0309006, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 51(11), pp. 1765-1767, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 32(4), pp. 1040-1049, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Siamack Ayandeh |
A distributed semi-rearrangeable nonblocking path hunt algorithm for Clos networks with TDM links. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: IEEE International Conference on Communications, ICC 2002, April 28 - May 2, 2002, New York City, NY, USA, pp. 2832-2842, 2002, IEEE, 0-7803-7400-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Yang Yang 0001, Tak-Shing Peter Yum |
Rearrangeable compact assignment of OVSF codes for multi-rate traffic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GLOBECOM ![In: Proceedings of the Global Telecommunications Conference, 2002. GLOBECOM '02, Taipei, Taiwan, 17-21 November, 2002, pp. 824-829, 2002, IEEE, 0-7803-7632-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 61(9), pp. 1382-1388, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Guido Maier, Achille Pattavina |
Design of photonic rearrangeable networks with zero first-order switching-element-crosstalk. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 49(7), pp. 1268-1279, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Nabanita Das 0001, Krishnendu Mukhopadhyaya, Jayasree Dattagupta |
O(n) routing in rearrangeable networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Syst. Archit. ![In: J. Syst. Archit. 46(6), pp. 529-542, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Rza Bashirov |
Combinatorial model of the class of rearrangeable nonsymmetric interconnection networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDPTA ![In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2000, June 24-29, 2000, Las Vegas, Nevada, USA, 2000, CSREA Press. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
23 | Qing Hu 0007, Yixin Zhang, Xiaojun Shen 0002 |
Rearrangeable Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 71(1), pp. 23-27, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 7(4), pp. 514-529, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Achille Pattavina, Guido Maier |
Photonic Rearrangeable Networks with Zero Switching-Element Crosstalk. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: Proceedings IEEE INFOCOM '99, The Conference on Computer Communications, Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, The Future Is Now, New York, NY, USA, March 21-25, 1999, pp. 337-344, 1999, IEEE Computer Society, 0-7803-5417-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: Proceedings IEEE INFOCOM '99, The Conference on Computer Communications, Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, The Future Is Now, New York, NY, USA, March 21-25, 1999, pp. 1073-1080, 1999, IEEE Computer Society, 0-7803-5417-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Dominique Barth, Petrisor Panaite |
Undirected graphs rearrangeable by 2-length walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 31(4), pp. 239-247, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Jadranka Skorin-Kapov, Jean-François P. Labourdette |
Rearrangeable multihop lightwave networks: congestion minimization on regular topologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Telecommun. Syst. ![In: Telecommun. Syst. 9(1), pp. 113-132, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Ding-Zhu Du, Biao Gao, Frank K. Hwang, J. H. Kim |
On Multirate Rearrangeable Clos Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 28(2), pp. 463-470, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Dan M. Marom, David Mendlovic |
Comment on "A New Routing Algorithm for a Class of Rearrangeable Networks". ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 46(6), pp. 734, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Fred Bauer, Anujan Varma |
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 15(3), pp. 382-397, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Ioannis Gragopoulos, Fotini-Niovi Pavlidou |
A new evaluation criterion for Clos- and Benes-type rearrangeable switching networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 45(1), pp. 119-126, 1997. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances in Switching Networks ![In: Advances in Switching Networks, Proceedings of a DIMACS Workshop,Princeton, New Jersey, USA, July 7-9, 1997, pp. 103-117, 1997, DIMACS/AMS, 978-0-8218-0831-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | M. Douglas McIlroy, Joseph P. Savicki |
Isomorphism of classical rearrangeable networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances in Switching Networks ![In: Advances in Switching Networks, Proceedings of a DIMACS Workshop,Princeton, New Jersey, USA, July 7-9, 1997, pp. 147-155, 1997, DIMACS/AMS, 978-0-8218-0831-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Qing Hu 0007, Yixin Zhang, Xiaojun Shen 0002 |
Rearrangeable Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997, Proceedings, pp. 441-450, 1997, Springer, 3-540-63357-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Hyun Yeop Lee, Frank K. Hwang, John D. Carpinelli |
A new decomposition algorithm for rearrangeable Clos interconnection networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 44(11), pp. 1572-1578, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Yanggon Kim, Tse-Yun Feng |
New Graph Model and Its Routing Algorithm for Rearrangeable Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARA ![In: Applied Parallel Computing, Industrial Computation and Optimization, Third International Workshop, PARA 96, Lyngby, Denmark, August 18-21, 1996, Proceedings, pp. 423-432, 1996, Springer, 3-540-62095-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Fred Bauer, Anujan Varma |
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: Proceedings IEEE INFOCOM '96, The Conference on Computer Communications, Fifteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking the Next Generation, San Francisco, CA, USA, March 24-28, 1996, pp. 361-368, 1996, IEEE Computer Society, 0-8186-7292-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. High Speed Networks ![In: J. High Speed Networks 4(1), pp. 99-113, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Jadranka Skorin-Kapov, Jean-François P. Labourdette |
On minimum congestion routing in rearrangeable multihop lightwave networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 1(1), pp. 129-145, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Cenk Gazen, Cem Ersoy |
Optimization of Logically Rearrangeable Multihop Lightwave Networks With Genetic Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Communications and their Performance ![In: Data Communications and their Performance, Proceedings of the Sixth IFIP WG6.3 Conference on Performance of Computer Networks, Istanbul, Turkey, 1995, pp. 125-138, 1995, Chapman & Hall, 0-412-73250-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
23 | Young-Keun Park, Vladimir Cherkassky |
Neural Network for Control of Rearrangeable Clos Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Neural Syst. ![In: Int. J. Neural Syst. 5(3), pp. 195-205, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Dong-Jye Shyy, Chin-Tau Lea |
Rearrangeable nonblocking Log2d (N, m, p) networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 42(5), pp. 2084-2086, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Terence D. Todd, Allan M. Bignell |
A slot-reuse protocol for rearrangeable dual-bus networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 42(234), pp. 1131-1140, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Seung-Woo Seo, Tse-Yun Feng |
A General Inside-Out Routing Algorithm for a Class of Rearrangeable Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP (1) ![In: Proceedings of the 1994 International Conference on Parallel Processing, North Carolina State University, NC, USA, August 15-19, 1994. Volume I: Architecture., pp. 17-20, 1994, CRC Press, 0-8493-2493-9. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Yeonghwan Tscha, Yanghee Choi, Kyoon Ha Lee |
Rearrangeable Nonblocking Condition for Multi-log_2 N Multiconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 48(3), pp. 107-112, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
23 | Sang-Bang Choi, Arun K. Somani |
Rearrangeable Circuit-Switched Hypercube Architecture for Routing Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 19(2), pp. 125-130, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
23 | Janusz Filipiak |
A Model of a Rearrangeable User-Network Interface in B-ISDN. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. Trans. Telecommun. ![In: Eur. Trans. Telecommun. 4(4), pp. 435-442, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
23 | Young-Keun Park, Vladimir Cherkassky |
Neural network controller for rearrangeable switching networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNN ![In: Proceedings of International Conference on Neural Networks (ICNN'88), San Francisco, CA, USA, March 28 - April 1, 1993, pp. 1896-1901, 1993, IEEE. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: Proceedings IEEE INFOCOM '93, The Conference on Computer Communications, Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking: Foundation for the Future, San Francisco, CA, USA, March 28 - April 1, 1993, pp. 464-472, 1993, IEEE Computer Society, 0-8186-3580-0. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|