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