The following pages link to (Q3484355):
Displayed 47 items.
- Embedding meshes into twisted-cubes (Q545387) (← links)
- An optimal parallel algorithm for generating combinations (Q582077) (← links)
- Heaps with bits (Q671419) (← links)
- Fast rehashing in PRAM emulations (Q672145) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- Topological properties of the directional hypercube (Q673998) (← links)
- An efficient selection algorithm on the pyramid (Q674295) (← links)
- On similarity of polynomial configurations (Q688225) (← links)
- Parallel multiple search (Q750158) (← links)
- Building heaps in parallel (Q751273) (← links)
- On the complexity of the recognition of parallel 2D-image languages (Q808271) (← links)
- Solving the minimum bisection problem using a biologically inspired computational model (Q847667) (← links)
- An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950) (← links)
- Parallel time and space upper-bounds for the subset-sum problem (Q955010) (← links)
- Embedding the incomplete hypercube in books (Q1044693) (← links)
- A unified approach to parallel depth-first traversals of general trees (Q1178197) (← links)
- Decomposing a star graph into disjoint cycles (Q1182082) (← links)
- On doing Todd-Coxeter coset enumeration in parallel (Q1182307) (← links)
- Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses (Q1183475) (← links)
- Data-movement-intensive problems: Two folk theorems in parallel computation revisited (Q1184985) (← links)
- Optimal parallel algorithms for finding cut vertices and bridges of interval graphs (Q1198065) (← links)
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application (Q1198069) (← links)
- Stirling networks: A versatile combinatorial topology for multiprocessor systems (Q1199419) (← links)
- A new upper bound on the complexity of the all pairs shortest path problem (Q1199881) (← links)
- A simple systolic algorithm for generating combinations in lexicographic order (Q1205904) (← links)
- Parallel prefix computation with few processors (Q1205906) (← links)
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem (Q1209346) (← links)
- Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs (Q1210310) (← links)
- Optimal circular arc representations: Properties, recognition, and construction (Q1271617) (← links)
- Simulating the CRCW PRAM on reconfigurable networks (Q1275082) (← links)
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms (Q1283779) (← links)
- Developing software for parallel computing systems (Q1294624) (← links)
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs (Q1313723) (← links)
- The representation of permutations by trees (Q1339828) (← links)
- Parallel algorithms for connectivity problems on interval graphs (Q1350233) (← links)
- Solving the tridiagonal linear system and Poisson's equation over a LAN-based computing platform using distributed shared memory (Q1357075) (← links)
- Multiplicative circulant networks. Topological properties and communication algorithms (Q1364475) (← links)
- An algorithm for dynamic load balancing of synchronous Monte Carlo simulations on multiprocessor systems (Q1365903) (← links)
- Honeycomb tori are Hamiltonian (Q1607002) (← links)
- Optimal vertex ordering of graphs (Q1607014) (← links)
- Gray code for derangements (Q1827847) (← links)
- Parallel prefix computation on extended multi-mesh network. (Q1853159) (← links)
- Parallel processing for fuzzy sets operations (Q1855498) (← links)
- Parallelizing Mallat algorithm for 2-D wavelet transforms (Q2366073) (← links)
- A new method for optimal control of Volterra integral equations (Q2383713) (← links)
- Permutation algorithms on optical multi-trees (Q2389510) (← links)
- On generation of permutations of \(m\) out of \(n\) items (Q2628264) (← links)