scientific article
From MaRDI portal
Publication:4002466
zbMath0743.68007MaRDI QIDQ4002466
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cellular automata (computational aspects) (68Q80) Distributed algorithms (68W15)
Related Items
Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes, Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges, Two node-disjoint paths in balanced hypercubes, Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions, Faithful 1-edge fault tolerant graphs, A new 3D representation of trivalent Cayley networks, Disjoint Hamiltonian cycles in recursive circulant graphs, Containment of butterflies in networks constructed by the line digraph operation, Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks, VLSI layouts of complete graphs and star graphs, Christmas tree: a versatile 1-fault-tolerant design for token rings, Cyclic-cubes and wrap-around butterflies, Incidence coloring on hypercubes, Complexity of linear circuits and geometry, On some properties of doughnut graphs, Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks, More agents may decrease global work: a case in butterfly decontamination, Diagnosable evaluation of enhanced optical transpose interconnection system networks, New spectral lower bounds on the bisection width of graphs, Scheduling and routing of autonomous moving objects on a mesh topology, On excessive index of certain networks, Fault isolation and identification in general biswapped networks under the PMC diagnostic model, Conditional edge-fault pancyclicity of augmented cubes, Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges, In-place permuting and perfect shuffling using involutions, Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes, A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube, Conditional edge-fault-tolerant Hamiltonicity of dual-cubes, Bipanconnectivity of balanced hypercubes, The \(3^{*}\)-connected property of pyramid networks, Geodesic pancyclicity and balanced pancyclicity of the generalized base-\(b\) hypercube, Scalability and communication in parallel low-complexity lossless compression, Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees, Geodesic pancyclicity of twisted cubes, Bipanconnectivity of faulty hypercubes with minimum degree, Fast evaluation of interlace polynomials on graphs of bounded treewidth, A special antidilation problem for meshes and Hamming graphs, Embedding a mesh of trees in the crossed cube, Succinct representations of permutations and functions, One-to-many node-disjoint paths of hyper-star networks, The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model, Derandomized parallel repetition via structured PCPs, Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism, Testing connectivity of faulty networks in sublinear time, A fast fault-identification algorithm for bijective connection graphs using the PMC model, FREP: energy proportionality for disk storage using replication, Edge-bipancyclicity of star graphs with faulty elements, Edge-fault-tolerant vertex-pancyclicity of augmented cubes, Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons, Mutually independent Hamiltonian connectivity of \((n,k)\)-star graphs, Design of fault-tolerant on-board networks with variable switch sizes, The pessimistic diagnosability of alternating group graphs under the PMC model, Combinatorial PCPs with efficient verifiers, Random walks, bisections and gossiping in circulant graphs, Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs, Routing and wavelength assignment for hypercube in array-based WDM optical networks, Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks, Maintaining the Ranch topology, The kissing problem: how to end a gathering when everyone kisses everyone else goodbye, Embedding even cycles on folded hypercubes with conditional faulty edges, Shorter arithmetization of nondeterministic computations, Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance, Adaptive system-level diagnosis for hypercube multiprocessors using a comparison model, Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults, Fault-tolerant cycle embedding in the faulty hypercubes, Hamiltonian cycles in hypercubes with faulty edges, On the generalized twisted cube, A grid embedding into the star graph for image analysis solutions, Hamilton cycles in Trivalent Cayley graphs, Compact embedding of binary trees into hypercubes, On 3-regular bipancyclic subgraphs of hypercubes, Mapping a functional notation for parallel programs onto hypercubes, Parallel stereocorrelation on a reconfigurable multi-ring network., Hypercube sandwich approach to conferencing., Cycles embedding in folded hypercubes with conditionally faulty vertices, The generalized 4-connectivity of hypercubes, Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes, Odd cycles embedding on folded hypercubes with conditional faulty edges, An efficient algorithm for the Knight's tour problem, On vertex-pancyclicity and edge-pancyclicity of the WK-recursive network, A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes, Many-to-many disjoint paths in hypercubes with faulty vertices, Parallel parsing of tree adjoining grammars on the connection machine, A new variation on hypercubes with smaller diameter, Optimal simulation of multidimensional reconfigurable meshes by two- dimensional reconfigurable meshes, Cycles embedding in folded hypercubes under the conditional fault model, Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges, Various cycles embedding in faulty balanced hypercubes, Fault-tolerant Hamiltonian laceability of balanced hypercubes, A theory of decomposition into prime factors of layered interconnection networks, A novel algorithm to embed a multi-dimensional torus into a locally twisted cube, Embedding a subclass of trees into hypercubes, Efficient CRT-based residue-to-binary converter for the arbitrary moduli set, Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design, Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges, Fault-tolerant edge-pancyclicity of locally twisted cubes, Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions, Embedding longest fault-free paths onto star graphs with more vertex faults, The super connectivity of the pancake graphs and the super laceability of the star graphs, Combinatorial PCPs with short proofs, Algorithms for the fixed linear crossing number problem, Methods for message routing in parallel machines, Local base station assignment with time intervals in mobile computing environments, Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps, Two edge-disjoint hamiltonian cycles in the butterfly graph, On transmitting delay in a distance-transitive strongly antipodal graph, A mathematical model for mesh's dynamic behavior, New results on edge-bandwidth, Methods and problems of communication in usual networks, Decomposition of the product of cycles based on degree partition, Broadcasting multiple messages in the 1-in port model in optimal time, Work-preserving emulations of shuffle-exchange networks: An analysis of the complex plane diagram, Some topological properties of star connected cycles, A probably optimal embedding of hyper-rings in hypercubes, The complexity of resource allocation and price mechanisms under bounded rationality, An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs, A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues, Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults, Optimal algorithms for broadcast and gossip in the edge-disjoint modes, Optimizing adiabatic quantum program compilation using a graph-theoretic framework, A unified \(O(\log N)\) and optimal sorting vector algorithm, Multiplicative circulant networks. Topological properties and communication algorithms, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Divide-and-conquer algorithms on the hypercube, Simulating shared memory in real time: On the computation power of reconfigurable architectures, Designing checkers for programs that run in parallel, Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three, On the multisearching problem for hypercubes, Experience in implementing the algebraic multilevel iteration method on a SIMD-type computer, Medial axis transform on mesh-connected computers with hyperbus broadcasting, Embedding de Bruijn, Kautz and shuffle-exchange networks in books, A parallel algorithm for functions of triangular matrices, Conditional diagnosability of multiprocessor systems based on complete-transposition graphs, Edge-fault-tolerant diameter and bipanconnectivity of hypercubes, A parametric algorithm for semigroup computation on mesh with buses, Node-disjoint paths in a level block of generalized hierarchical completely connected networks, Algorithmic graph embeddings, Small weight bases for Hamming codes, Odd-even sort in powerlists, The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width, Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks, Bisecting de Bruijn and Kautz graphs, Hamilton circuits in the directed wrapped Butterfly network, Bisection width of transposition graphs, Beyond good partition shapes: an analysis of diffusive graph partitioning, Power domination in Knödel graphs and Hanoi graphs, List-ranking on interconnection networks., Constant time parallel sorting: An empirical view., Super spanning connectivity on WK-recursive networks, Super-connectivity and super-edge-connectivity for some interconnection networks, A note on cycle embedding in hypercubes with faulty vertices, rDAN: toward robust demand-aware network designs, Expansion of layouts of complete binary trees into grids, The calculation of average distance in mesh structures., Expanding and forwarding parameters of product graphs, Parallel computation for acoustic radiation in a subsonic nonuniform flow with a coupled FEM/BEM formulation, Fault tolerant supergraphs with automorphisms, Connectivity of \(h\)-complexes., The bisection width and the isoperimetric number of arrays., On conditional fault tolerance of hierarchical cubic networks, Hamiltonian paths passing through prescribed edges in balanced hypercubes, Multicolor routing in the undirected hypercube, Ubiquitous integrity via network integration and parallelism-sustaining pedestrian/bike urbanism, Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model, Linear time construction of a compressed Gray code, Lower bounds on systolic gossip, Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs, Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs, Optimal oblivious routing on \(d\)-dimensional meshes, A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube, Structural properties of subdivided-line graphs, Fast scheduling in distributed transactional memory, A universal tree-based network with the minimum number of reticulations, Block-cyclic matrix triangulation on the Cartesian product of star graphs, Sparse hypercube -- a minimal \(k\)-line broadcast graph., Topological properties of twisted cube, From Hall's matching theorem to optimal routing on hypercubes, Linear array and ring embeddings in conditional faulty hypercubes, Optimal broadcast on parallel locality models, Periodic comparator networks, Optimal dimension-exchange token distribution on complete binary trees, Computing the cycles in the perfect shuffle permutation, Dense edge-disjoint embedding of complete binary trees in interconnection networks, The average diameter and its estimation in nonlinear structures, A time-optimal distributed sorting algorithm on a line network., A note on constructing binary heaps with periodic networks., New bounds on the size of the minimum feedback vertex set in meshes and butterflies., Fault-tolerant Hamiltonian laceability of hypercubes., On the area of hypercube layouts., Optimal 1-edge fault-tolerant designs for ladders., Ring embedding in faulty honeycomb rectangular torus., Improved fast integer sorting in linear space, Optimal deterministic protocols for mobile robots on a grid, A finite automata approach to modeling the cross product of interconnection networks., Algorithmic construction of Hamiltonians in pyramids, Fault-tolerant algorithm for Fast Fourier Transform on hypercubes, A new routing algorithm for cyclic shifts on BRGC hypercubes, The correct diameter of trivalent Cayley graphs., An optimal layout of multigrid networks, A mathematical model of a mesh system and its implementation, Dynamic scheduling in distributed transactional memory, Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks, Adaptive diagnosis for torus systems under the comparison model, Fast integer merging on the EREW PRAM, Dense edge-disjoint embedding of complete binary trees in the hypercube, Selection on rectangular meshes with multiple broadcasting, Direct routing: Algorithms and complexity, Hamiltonian paths with prescribed edges in hypercubes, Spanning multi-paths in hypercubes, Distance distribution of nodes in star graphs, Faster merging networks with a small constant period, A negative answer to a problem on generalized Fibonacci cubes, DISJOINT-PATHS AND FAULT-TOLERANT ROUTING ON RECURSIVE DUAL-NET, Fault-tolerant pancyclicity of augmented cubes, An improved upper bound on the queue number of the hypercube, Cycles passing through prescribed edges in a hypercube with some faulty edges, Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes, Dense bipartite circulants and their routing via rectangular twisted torus, Feedback vertex sets in mesh-based networks, Node-disjoint paths in hierarchical hypercube networks, Decontamination of hypercubes by mobile agents, Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges, A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks, Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs, Hamiltonian properties on the class of hypercube-like networks, Constructing the nearly shortest path in crossed cubes, Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices, A randomized sorting algorithm on the BSP model, Cluster connectivity of hypercube-based networks under the super fault-tolerance condition, The vulnerability of the diameter of the enhanced hypercubes, Fan-crossing free graphs and their relationship to other beyond-planar graphs, Factorizations of the product of cycles, Existence of 3-regular subgraphs in Cartesian product of cycles, Embedding longest fault-free paths in arrangement graphs with faulty vertices, Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle, Path and cycle fault tolerance of bubble-sort graph networks, Using semidirect products of groups to build classes of interconnection networks, Unnamed Item, Conditional diagnosability of component-composition graphs under the PMC model, Hamiltonian cycles of balanced hypercube with more faulty edges, Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model, Panpositionable hamiltonicity and panconnectivity of the arrangement graphs, The spanning cyclability of Cayley graphs generated by transposition trees, The geodesic transversal problem on some networks, \( R_3\)-connectivity of folded hypercubes, Regular connected bipancyclic spanning subgraphs of hypercubes, Single-Sink Multicommodity Flow with Side Constraints, A class of almost-optimal size-independent parallel prefix circuits, On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube, Reliability measure of multiprocessor system based on enhanced hypercubes, Paired many-to-many disjoint path covers of the hypercubes, On the mutually independent Hamiltonian cycles in faulty hypercubes, Cycles embedding on folded hypercubes with faulty nodes, Disjoint cycles in hypercubes with prescribed vertices in each cycle, Brushing without capacity restrictions, The spanning laceability on the faulty bipartite hypercube-like networks, Fault-free mutually independent Hamiltonian cycles of faulty star graphs, The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube, Approximating the fixed linear crossing number, Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes, Testing set proportionality and the Ádám isomorphism of circulant graphs, Efficient Connectivity Testing of Hypercubic Networks with Faults, Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks, Cutwidth of ther-dimensional Mesh ofd-ary Trees, Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity, Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes, ON THE PARALLEL IMPLEMENTATION OF A GENERALIZED BROADCAST, The globally bi-\(3^{*}\)-connected property of the honeycomb rectangular torus, Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes, The \(m\)-pancycle-connectivity of a WK-recursive network, The generalized 3-connectivity of two kinds of regular networks, Fault diagnosis in hypercube multiprocessor systems, To the role of decomposition strategy in high parallel algorithms, Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults, Panconnectivity and edge-pancyclicity ofk-aryn-cubes, Optimal permutation routing for low-dimensional hypercubes, Hamiltonian paths in hypercubes with local traps, On the \(g\)-good-neighbor connectivity of graphs, Analyzing permutation capability of multistage interconnection networks with colored Petri nets, Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults, Linear layout of directed grid graph, On the isometric path partition problem, An explicit infinite family of \(\mathbb{M}\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)\log_{K-1}\mathbb{M}\) for each \(K-1\) a prime power], Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs, Breaking the \(\log n\) barrier on rumor spreading, Compression and expansion in graphs using overlays, The 3-path-connectivity of the hypercubes, Self-spanner graphs, Cycles in folded hypercubes with two adjacent faulty vertices, Vertex-disjoint paths joining adjacent vertices in faulty hypercubes, Optimizing Hamiltonian panconnectedness for the crossed cube architecture, Parallel computation of the multi-exponentiation for cryptosystems, The impact of the apex node on routing inside a pyramid structure, On the crossing numbers of loop networks and generalized Petersen graphs, Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes, Edge decompositions of hypercubes by paths and by cycles, Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant, On testing single connectedness in directed graphs and some related problems, An upper bound for the crossing number of augmented cubes, On conditional connectivity of the Cartesian product of cycles, Longest fault-free paths in hypercubes with vertex faults, Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes, On the partitions associated with the smallest eigenvalues of certain Cayley graphs on symmetric group generated by cycles, Cops and robber on butterflies and solid grids, The super laceability of the hypercubes, Atomic routing games on maximum congestion, Path bipancyclicity of hypercubes, Cycles embedding in hypercubes with node failures, A bypassing path based routing algorithm for the pyramid structures, Containment properties of product and power graphs, Dense sets and embedding binary trees into hypercubes, The average diameter of general tree structures, On XRAM and PRAM models, and on data-movement-intensive problems, Efficient delay routing, Real-time emulations of bounded-degree networks, Queue layouts of iterated line directed graphs, Conditional fault diameter of crossed cubes, Multiple regular graph embeddings into a hypercube with unbounded expansion, Store-and-forward multicast routing on the mesh, Diameter variability of cycles and tori, The foundation of self-developing blob machines for spatial computing, Embedding of meshes in Möbius cubes, Edge-bipancyclicity of a hypercube with faulty vertices and edges, Some problems on Cayley graphs, Fault-tolerant cycles embedded in hypercubes with mixed link and node failures, An efficient representation of Benes networks and its applications, Fault-free Hamiltonian cycles in twisted cubes with conditional link faults, Embedding meshes of trees into deBruijn graphs, Non-associative parallel prefix computation, The unpredictable deviousness of models, Faster approximate string matching for short patterns, Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position, A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges, A new upper bound on the queuenumber of hypercubes, Fault-tolerant routing in unique-path multistage Omega network, 1-vertex-fault-tolerant cycles embedding on folded hypercubes, The 4-star graph is not a subgraph of any hypercube, Communication algorithms with advice, A note on ``An improved upper bound on the queue number of the hypercube, Fault-free cycles in folded hypercubes with more faulty elements, A note about some properties of BC graphs, Path partitions of hypercubes, Finding cycles in hierarchical hypercube networks, On embedding cycles into faulty dual-cubes, Hyper Hamiltonian laceability on edge fault star graph, Embedding of tori and grids into twisted cubes, The bipanpositionable bipancyclic property of the hypercube, Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position, Conditional edge-fault Hamiltonicity of augmented cubes, On path bipancyclicity of hypercubes, Embedding cycles of various lengths into star graphs with both edge and vertex faults, A further result on fault-free cycles in faulty folded hypercubes, Cycles embedding in exchanged hypercubes, Cycle embedding of augmented cubes, Path embedding in faulty hypercubes, Pancyclicity and bipancyclicity of conditional faulty folded hypercubes, The panpositionable panconnectedness of augmented cubes, Vertex-pancyclicity of augmented cubes with maximal faulty edges, On the spanning connectivity and spanning laceability of hypercube-like networks, On compact and efficient routing in certain graph classes, Long paths in hypercubes with a quadratic number of faults, Many-to-many disjoint paths in faulty hypercubes, A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges, Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults, On randomized broadcasting in star graphs, On the bipanpositionable bipanconnectedness of hypercubes, On embedding subclasses of height-balanced trees in hypercubes, Minor-embedding in adiabatic quantum computation. I: The parameter setting problem, Improving the average delay of sorting, Generalized honeycomb torus, Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs, The bipancycle-connectivity of the hypercube, Decomposing the cube into paths, Embedding multidimensional grids into optimal hypercubes, Long paths in hypercubes with conditional node-faults, Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes, A spectral lower bound for the treewidth of a graph and its consequences, Shelling Coxeter-like complexes and sorting on trees, The exponent of Cartesian product of cycles, Fault-free cycles passing through prescribed paths in hypercubes with faulty edges, Sorting in linear time?, Boolean circuit programming: A new paradigm to design parallel algorithms, Improved book-embeddings of incomplete hypercubes, Paired many-to-many disjoint path covers of hypercubes with faulty edges, Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges, Cycles passing through a prescribed path in a hypercube with faulty edges, Hamiltonian connectivity of the WK-recursive network with faulty nodes, Embedding height balanced trees and Fibonacci trees in hypercubes, Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\), An efficient multiway merging algorithm, A generalization of the 0-1 principle for sorting, Survey on path and cycle embedding in some networks, Scheduling a divisible task in a two-dimensional toroidal mesh, Embedding the incomplete hypercube in books, Optimal many-to-one routing on the mesh with constant queues, Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs, A parallel algorithm for solving Toeplitz linear systems, Cayley graphs as models of deterministic small-world networks, Continuous algorithms, A note on edge fault tolerance with respect to hypercubes, Augmented cubes, Flit-serial packet routing on meshes and tori, Fast fault‐tolerant parallel communication for de bruijn and digit‐exchange networks using information dispersal, Routing permutations on a graph, Unnamed Item, Unnamed Item, ROUTING MULTIPLE WIDTH COMMUNICATIONS ON THE CIRCUIT SWITCHED TREE, A better upper bound on the bisection width of de Bruijn networks, Oriented hypercubes, Decomposition of hypercubes into regular connected bipancyclic subgraphs, Sorting and Permuting without Bank Conflicts on GPUs, Optimal algorithms for broadcast and gossip in the edge-disjoint path modes, On self-stabilizing wait-free clock synchronization, Exploiting locality in LT-RAM computations, Determinant: Old algorithms, new insights, N latency 2N I/O‐bandwidth 2D‐array matrix multiplication algorithm, Stochastic analysis of dynamic processes, k-k Sorting on the multi-mesh, Decomposing hypercubes into regular connected subgraphs, Towards a better understanding of pure packet routing, Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers, Strongly adaptive token distribution, Understanding retiming through maximum average-delay cycles, An Introduction to Temporal Graphs: An Algorithmic Perspective, AN EFFICIENT NETWORK ANALYSER BASED ON LINEAR ARRAY ARCHITECTURE∗, MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗, TOKEN DISTRIBUTION AND LOAD BALANCING ON RECONFIGURABLEd-DIMENSIONAL MESHES, Efficient binary and grey level morphological operations on a massively parallel processor, Structure and Substructure Connectivity of Hypercube-Like Networks, A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model, A lower bound for sorting networks based on the shuffle permutation, Automated reasoning about parallel algorithms using powerlists, Compressing grids into small hypercubes, Communication throughput of interconnection networks, Embedding complete binary trees into star networks, The relationship between gossiping in vertex-disjoint paths mode and bisection width, The Performance of greedy algorithms for the on-line steiner tree and related problems, Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus, On 4-regular 4-connected bipancyclic subgraphs of hypercubes, Vertex-fault-tolerant cycles embedding on enhanced hypercube networks, Greedy hot-potato routing on the two-dimensional mesh, Automorphisms of augmented cubes, LINEAR LAYOUT OF GENERALIZED HYPERCUBES, Interconnection Networks and Their Eigenvalues, EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES, A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES, TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION, On bandwidth, cutwidth, and quotient graphs, Oblivious Routing for Sensor Network Topologies, Embedding double starlike trees into hypercubes, On the theory of interconnection networks for parallel computers, Unnamed Item, A super-logarithmic lower bound for hypercubic sorting networks, Cycle and Path Embedding on 5-ary N-cubes, Algebraic specification of interconnection network relationships by permutation voltage graph mappings, The shuffle exchange network has a Hamiltonian path, Parallel matching for ranking all teams in a tournament, Vertex-pancyclicity of twisted cubes with maximal faulty edges, Packing the hypercube, A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES, Compact roundtrip routing with topology-independent node names, A parallel algorithm for subset selection, A Wavelet-Based Almost-Sure Uniform Approximation of Fractional Brownian Motion with a Parallel Algorithm, Disjoint paths in hypercubes with prescribed origins and lengths, Edge‐fault‐tolerant pancyclicity of alternating group graphs, Low-congested interval routing schemes for hypercubelike networks, Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks, A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs, On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism, VLSI layout of Benes networks, Congestion-free, dilation-2 embedding of complete binary trees into star graphs, Optical implementation of rearrangeable nonblocking double banyan interconnection network in free space, Cycle embedding in faulty wrapped butterfly graphs, Optimal deterministic protocols for mobile robots on a grid, Priority queues on parallel machines, Nearly optimal three dimensional layout of hypercube networks, Thek-degree Cayley graph and its topological properties, Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets, Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges, Efficient Parallel Routing Algorithms for Cartesian and Composition Networks, Efficient VLSI Layout of WK-Recursive and WK-Pyramid Interconnection Networks, Sorting on OTIS-Networks, Black hole search in common interconnection networks, Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group, Parallel ART for image reconstruction in CT using processor arrays, Unchanging the diameter ofk-aryn-cube networks with faulty vertices, MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS, Unnamed Item, Complete binary trees in folded and enhanced cubes, Scalable algorithms for the mesh with buses: merging, sorting and selection, An Introduction to Temporal Graphs: An Algorithmic Perspective*, On regular subgraphs of augmented cubes, Unnamed Item, Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks, Embedding of Generalized Wheels into Arbitrary Trees, Embedding some hierarchical caterpillars into hypercube, Decomposition of hypercubes into sunlet graphs of order eight, Automorphisms and isomorphisms of enhanced hypercubes, Random test problems and parallel methods for quadratic programs and quadratic stochastic programs∗, A split-correct parallel algorithm for solving tridiagonal symmetric toeplitz systems, The generalized 4-connectivity of locally twisted cubes, The disjoint path cover in the data center network HSDC with prescribed vertices in each path, Extending the Hong-Kung model to memory hierarchies, Small weight bases for hamming codes, Uni-directional alternating group graphs, Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity, Shared memory simulations with triple-logarithmic delay, Routing with bounded buffers and hot-potato routing in vertex-symmetric networks, On the parallel complexity of constrained read-once refutations in UTVPI constraint systems, Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest, Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes, An Efficient Algorithm for Embedding Two-Dimensional Tori into Balanced Hypercubes, The folded Petersen network: A new versatile multiprocessor interconnection topology, Cops and robber on butterflies, grids, and AT-free graphs, Particle computation: complexity, algorithms, and logic, (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn, Cartesian products of graphs as spanning subgraphs of de Bruijn graphs, Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality, Linear layouts of generalized hypercubes, On some similarity of finite sets (and what we can say today about certain old problem), Parallel algorithms on circular-arc graphs, Architecture and design of a hardware accelerator for efficient 3D object recognition using the LC method, Routing properties of supercubes, Efficient randomized routing algorithms on the two-dimensional mesh of buses, Communication in the two-way listen-in vertex-disjoint paths mode, Improved fault-tolerance sorting algorithm in hypercubes, On the benefit of supporting virtual channels in wormhole routers, A lower bound for the shortest path problem, Optimal embeddings of odd ladders into a hypercube, Some permutation routing algorithms for low-dimensional hypercubes, On the design of efficient ATM routing schemes, On-line scheduling of parallel jobs with runtime restrictions, Optimal oblivious routing in polynomial time
