scientific article; zbMATH DE number 3225079

Cited in

(59)

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

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)