default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Advances in Switching Networks 1997
- Ding-Zhu Du, Frank K. Hwang:
Advances in Switching Networks, Proceedings of a DIMACS Workshop,Princeton, New Jersey, USA, July 7-9, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 42, DIMACS/AMS 1998, ISBN 978-0-8218-0831-3 - Foreword. Advances in Switching Networks 1997: ix-
- Preface. Advances in Switching Networks 1997: xi-
- Nicholas Pippenger:
Average-case bounds for the complexity of path-search. 1-13 - Gaylord W. Richards, Frank K. Hwang:
Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation. 15-48 - Chun-Fai Chan, Chin-Tau Lea:
Constructing nonblocking multicast switching networks with fanout reduction. 49-58 - Dongsoo Stephen Kim, Ding-Zhu Du:
Multirate broadcast switching networks nonblocking in a wide sense. 59-74 - Andrzej Jajszczyk, Marek Kubale:
Repackable networks-The concept and applications. 75-83 - Yuanyuan Yang, Neil H. Kessler:
Modeling the blocking behavior of Clos networks. 85-102 - 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. 103-117 - Italo Busi, Achille Pattavina:
Non-blocking multistage interconnection networks with limited depth. 119-146 - M. Douglas McIlroy, Joseph P. Savicki:
Isomorphism of classical rearrangeable networks. 147-155 - Gerard J. Chang, Frank K. Hwang, Li-Da Tong:
Characterizing bit permutation networks. 157-167 - Emre Gündüzhan, A. Yavuz Oruç:
Structure and density of sparse crossbar concentrators. 169-180 - Tony T. Lee, Philip P. To:
Non-blocking routing properties of Clos networks. 181-195 - Shuo-Yen Robert Li, Gar Man Koo, Hui Li:
An algorithm for the construction of concentrators from 2 x 2 sorters. 197-219 - Yi Du, Gerald M. Masson:
Strictly nonblocking conferencing meshes. 221-233 - Ehab S. Elmallah, Chin-Hung Lam:
An O(N1.695) permutation routing algorithm on augmented data manipulators. 235-243 - Hasan Çam:
Preventing conflicts in input buffering baseline-based ATM switches. 245-271 - Dongjie Huang, Kamran Kiasaleh:
Routing strategy and performance evaluation of multiple-ring ShuffleNet topology for high speed wavelength-division multiplexed optical communications. 273-293 - Jun Gu, Bin Du, Danny H. K. Tsang, Wei Wang:
Multispace search for quorumcast routing. 295-313 - Guo-Hui Lin, Ding-Zhu Du, Weili Wu, Kyeongah Yoo:
On 3-rate rearrangeability of Clos networks. 315-333
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-09-02 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
