An optimal algorithm for generating equivalence relations on a linear array of processors
From MaRDI portal
DOI10.1007/BF01931658zbMATH Open0696.68073OpenAlexW1973532966MaRDI QIDQ911295FDOQ911295
Authors: Ivan Stojmenović 
Publication date: 1990
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01931658
Recommendations
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Theory of software (68N99)
Cites Work
- The number of orthogonal permutations
- Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations
- A Fast Algorithm for Generating Set Partitions
- Title not available (Why is that?)
- Generating combinations in parallel
- Parallel generation of permutations and combinations
- An optimal parallel algorithm for generating combinations
- Classification of \(P_{k2}\)
- Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems
- A parallel derangement generation algorithm
- A systolic generation of combinations
- Title not available (Why is that?)
- Parallel Generation of Permutations
- Permutation Generation on Vector Processors
Cited In (7)
- A POLYNOMIAL TIME ALGORITHM TO DETERMINE MAXIMAL BALANCED EQUIVALENCE RELATIONS
- 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
- A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL
- Listing combinatorial objects in parallel
- An initial study of time complexity in infinite-domain constraint satisfaction
- Parallel Processing and Applied Mathematics
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)
