An optimal algorithm for generating equivalence relations on a linear array of processors
From MaRDI portal
(Redirected from Publication:911295)
Recommendations
Cites work
- scientific article; zbMATH DE number 3860390 (Why is no real title available?)
- scientific article; zbMATH DE number 53193 (Why is no real title available?)
- A Fast Algorithm for Generating Set Partitions
- A parallel derangement generation algorithm
- A systolic generation of combinations
- Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations
- An optimal parallel algorithm for generating combinations
- Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems
- Classification of \(P_{k2}\)
- Generating combinations in parallel
- Parallel Generation of Permutations
- Parallel generation of permutations and combinations
- Permutation Generation on Vector Processors
- The number of orthogonal permutations
Cited in
(7)- Parallel Processing and Applied Mathematics
- Listing combinatorial objects in parallel
- A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL
- On random and adaptive parallel generation of combinatorial objects
- An approach to checking link conflicts in the mapping of uniform dependence algorithms into lower dimensional processor arrays
- An initial study of time complexity in infinite-domain constraint satisfaction
- A POLYNOMIAL TIME ALGORITHM TO DETERMINE MAXIMAL BALANCED EQUIVALENCE RELATIONS
This page was built for publication: An optimal algorithm for generating equivalence relations on a linear array of processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911295)
