scientific article; zbMATH DE number 3225079

Cited in

(59)

Construction of the stability indicator of wireless D2D connection in a case of fractal random walk of devices
On topological indices for new classes of Benes network
The input/output complexity of transitive closure
On 1-rate wide-sense nonblocking for 3-stage Clos networks
Arbitrary-size permutation networks using arbitrary-radix switches
Numerical calculation and computer design
Strict nonblockingness of reduced shuffle‐exchange networks
scientific article; zbMATH DE number 1208668 (Why is no real title available?)
The generalized folding-cube network
Interpolation between bases and the shuffle exchange network
Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies
Separator-based graph embedding into multidimensional grids with small edge-congestion
On topological indices of certain interconnection networks
Maximum entropy and empirical likelihood in length-biased setting: a comparison study
Multirate multicast switching networks
Some problems in discrete optimization
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
Zero knowledge proofs towards verifiable decentralized AI pipelines
Wide-sense nonblocking for multirate 3-stage Clos networks
Analyticity of single-server queues in light traffic
Rotator design
More Efficient Parallel Integer Sorting
Arithmetic circuits, structured matrices and (not so) deep learning
scientific article; zbMATH DE number 1334213 (Why is no real title available?)
On rearrangeable multirate three-stage Clos networks
On some degree-based irregularity indices of certain networks
scientific article; zbMATH DE number 3652263 (Why is no real title available?)
Asymmetrical multiconnection three‐stage clos networks
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
Computing topological indices of sudoku graphs
An ME-based approximation for multi-server queues with preemptive priority
Off‐line permutation routing on circuit‐switched fixed‐routing networks
On non-blocking switching networks
Generalized multi‐stage connection networks
MAXIMUM-ENTROPY COMPLEXITY MEASURES
Shorter arithmetization of nondeterministic computations
Analyzing permutation capability of multistage interconnection networks with colored Petri nets
The use of learning algorithms in telephone traffic routing - a methodology
Tunable fibre Bragg grating based optical cross connects using multi‐port optical circulators: structure and crosstalk analyses
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
Wide-sense nonblocking for multi-\(\log_d N\) networks under various routing strategies
Lower bounds for wide-sense nonblocking Clos network
On the probabilistic nature of the species-area relation

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)