scientific article; zbMATH DE number 3225079
From MaRDI portal
Publication:5513488
zbMATH Open0138.40904MaRDI QIDQ5513488FDOQ5513488
Authors: Václav E. Beneš 
Publication date: 1965
Title of this publication is not available (Why is that?)
Cited In (59)
- On topological indices for new classes of Benes network
- Arbitrary-size permutation networks using arbitrary-radix switches
- The input/output complexity of transitive closure
- Strict nonblockingness of reduced shuffle‐exchange networks
- On 1-rate wide-sense nonblocking for 3-stage Clos networks
- Title not available (Why is that?)
- Numerical calculation and computer design
- The generalized folding-cube network
- Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies
- Interpolation between bases and the shuffle exchange network
- Maximum entropy and empirical likelihood in length-biased setting: a comparison study
- Multirate multicast switching networks
- Separator-based graph embedding into multidimensional grids with small edge-congestion
- On topological indices of certain interconnection networks
- The presence of exponentiality in entropy maximized M/GI/1 queues
- Detailing losses in the \(\mathrm{M}/\mathrm{M}/1/1\) transient loss system
- On rearrangeable and non-blocking switching networks
- More Efficient Parallel Integer Sorting
- Wide-sense nonblocking for multirate 3-stage Clos networks
- Analyticity of single-server queues in light traffic
- Arithmetic circuits, structured matrices and (not so) deep learning
- Rotator design
- Title not available (Why is that?)
- On rearrangeable multirate three-stage Clos networks
- On some degree-based irregularity indices of certain networks
- Title not available (Why is that?)
- A new routing algorithm for multirate rearrangeable Clos networks.
- Multicommodity flows in simple multistage networks
- Counterexample to a conjecture of Szymanski on hypercube routing
- Rearrangeable nonblocking condition for multi-log\(_ 2 N\) multiconnection networks
- Repackable multi-\(\text{Log}_{2}N\) networks
- Size bounds for superconcentrators
- Entropy maximisation and queueing network models
- Off‐line permutation routing on circuit‐switched fixed‐routing networks
- Computing topological indices of sudoku graphs
- An ME-based approximation for multi-server queues with preemptive priority
- Generalized multi‐stage connection networks
- On non-blocking switching networks
- MAXIMUM-ENTROPY COMPLEXITY MEASURES
- Analyzing permutation capability of multistage interconnection networks with colored Petri nets
- Shorter arithmetization of nondeterministic computations
- Tunable fibre Bragg grating based optical cross connects using multi‐port optical circulators: structure and crosstalk analyses
- The use of learning algorithms in telephone traffic routing - a methodology
- Analysis of a multicast switch via the arrival modulation technique
- Nonblocking self-routing switching networks
- Applications of matching and edge‐coloring algorithms to routing in clos networks
- Analysis of the shortest relay queue policy in a cooperative random access network with collisions
- The number of rearrangements for Clos networks -- new results
- Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
- Communication structures in fault‐tolerant distributed systems
- Permuting data with the Omega network
- Multicolor routing in the undirected hypercube
- Lower bounds for wide-sense nonblocking Clos network
- Wide-sense nonblocking for multi-\(\log_d N\) networks under various routing strategies
- On the probabilistic nature of the species-area relation
- Construction of the stability indicator of wireless D2D connection in a case of fractal random walk of devices
- Some problems in discrete optimization
- Zero knowledge proofs towards verifiable decentralized AI pipelines
- Asymmetrical multiconnection three‐stage clos networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5513488)
