An optimal algorithm for generating equivalence relations on a linear array of processors
type: Item
instance of: scholarly article
title: An optimal algorithm for generating equivalence relations on a linear array of processors
zbMATH Open document ID: 0696.68073
DOI: 10.1007/BF01931658
author: Ivan Stojmenović
published in: BIT
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 4141514
zbMATH Keywords: parallel algorithm
zbMATH Keywords: equivalence relations
zbMATH Keywords: linear array
zbMATH Keywords: subsets
MaRDI profile type: Publication
cites work: Q4003441
cites work: Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations
cites work: An optimal parallel algorithm for generating combinations
cites work: Parallel generation of permutations and combinations
cites work: Generating combinations in parallel
cites work: A Fast Algorithm for Generating Set Partitions
cites work: Parallel Generation of Permutations
cites work: A parallel derangement generation algorithm
cites work: A systolic generation of combinations
cites work: Classification of \(P_{k2}\)
cites work: Permutation Generation on Vector Processors
cites work: The number of orthogonal permutations
cites work: Q3327718
cites work: Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems
full work available at URL: https://doi.org/10.1007/bf01931658
OpenAlex ID: W1973532966
description: scientific article; zbMATH DE number 4141514