The following pages link to (Q5513488):
Displaying 50 items.
- On topological indices of certain interconnection networks (Q278478) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Rotator design (Q585173) (← links)
- Wide-sense nonblocking for multi-\(\log_d N\) networks under various routing strategies (Q818134) (← links)
- On rearrangeable multirate three-stage Clos networks (Q870844) (← links)
- Repackable multi-\(\text{Log}_{2}N\) networks (Q897857) (← links)
- Counterexample to a conjecture of Szymanski on hypercube routing (Q911780) (← links)
- The use of learning algorithms in telephone traffic routing - a methodology (Q1056346) (← links)
- Interpolation between bases and the shuffle exchange network (Q1114665) (← links)
- The presence of exponentiality in entropy maximized M/GI/1 queues (Q1120462) (← links)
- Size bounds for superconcentrators (Q1170885) (← links)
- Analysis of a multicast switch via the arrival modulation technique (Q1197772) (← links)
- Nonblocking self-routing switching networks (Q1199436) (← links)
- On rearrangeable and non-blocking switching networks (Q1250088) (← links)
- Numerical calculation and computer design (Q1251894) (← links)
- Rearrangeable nonblocking condition for multi-log\(_ 2 N\) multiconnection networks (Q1313749) (← links)
- Entropy maximisation and queueing network models (Q1315336) (← links)
- An ME-based approximation for multi-server queues with preemptive priority (Q1333541) (← links)
- The input/output complexity of transitive closure (Q1360681) (← links)
- On 1-rate wide-sense nonblocking for 3-stage Clos networks (Q1377657) (← links)
- Wide-sense nonblocking for multirate 3-stage Clos networks (Q1391127) (← links)
- A new routing algorithm for multirate rearrangeable Clos networks. (Q1401226) (← links)
- Computing topological indices of sudoku graphs (Q1677121) (← links)
- On the probabilistic nature of the species-area relation (Q1717336) (← links)
- Detailing losses in the \(\mathrm{M}/\mathrm{M}/1/1\) transient loss system (Q1753368) (← links)
- Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies (Q1826639) (← links)
- Analyticity of single-server queues in light traffic (Q1892643) (← links)
- Multicolor routing in the undirected hypercube (Q1971219) (← links)
- On topological indices for new classes of Benes network (Q1983422) (← links)
- Permuting data with the Omega network (Q2265809) (← links)
- Analysis of the shortest relay queue policy in a cooperative random access network with collisions (Q2302271) (← links)
- The number of rearrangements for Clos networks -- new results (Q2304555) (← links)
- Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
- Analyzing permutation capability of multistage interconnection networks with colored Petri nets (Q2509234) (← links)
- The generalized folding-cube network (Q3204022) (← links)
- Some Graph-Colouring Theorems with Applications to Generalized Connection Networks (Q3689205) (← links)
- (Q3852121) (← links)
- On non-blocking switching networks (Q4062904) (← links)
- MAXIMUM-ENTROPY COMPLEXITY MEASURES (Q4162287) (← links)
- (Q4211698) (← links)
- (Q4262017) (← links)
- Applications of matching and edge‐coloring algorithms to routing in clos networks (Q4313624) (← links)
- Tunable fibre Bragg grating based optical cross connects using multi‐port optical circulators: structure and crosstalk analyses (Q4543674) (← links)
- Strict nonblockingness of reduced shuffle‐exchange networks (Q4651935) (← links)
- Construction of the Stability Indicator of Wireless D2D Connection in a Case of Fractal Random Walk of Devices (Q4685103) (← links)
- Multicommodity flows in simple multistage networks (Q4698226) (← links)
- On some degree-based irregularity indices of certain networks (Q5035111) (← links)
- Communication structures in fault‐tolerant distributed systems (Q5289382) (← links)
- Asymmetrical multiconnection three‐stage clos networks (Q5289385) (← links)
- Off‐line permutation routing on circuit‐switched fixed‐routing networks (Q5289386) (← links)
