Listing combinatorial objects in parallel

DOI10.1080/17445760500355777zbMATH Open1088.68180OpenAlexW1970643267MaRDI QIDQ3378053FDOQ3378053

Authors: Ivan Stojmenović 

Publication date: 29 March 2006

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445760500355777

Recommendations

• Generating combinations in parallel
• Parallel comparison merging of many-ordered lists
• Fast enumeration of combinatorial objects
• Spectral Analysis of an Oscillating Thermoviscoelastic Plate in a Transverse Magnetic Field
• On linear list recursion in parallel
• Deterministic parallel list ranking
• scientific article; zbMATH DE number 4064468
• Parallel generation of permutations and combinations
• A parallel algorithm for generating combinations

zbMATH Keywords

permutationscombinatorial algorithmscombinationslinear array of processorssubsets

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• On \(O(1)\) time algorithms for combinatorial generation
• Title not available (Why is that?)
• Gray code for derangements
• An optimal algorithm for generating equivalence relations on a linear array of processors
• Generating combinations in parallel
• Parallel generation of permutations and combinations
• New methods for the generation of permutations, combinations, and other combinatorial objects in parallel
• An optimal parallel algorithm for generating combinations
• A parallel derangement generation algorithm
• A systolic generation of combinations
• Parallel Generation of Permutations
• Parallel algorithm for generating permutations on linear array
• On generation of permutations through decomposition of symmetric groups into cosets
• Constant time generation of derangements
• On random and adaptive parallel generation of combinatorial objects
• A systolic design for generating permutations in lexicographic order
• An optimal systolic algorithm for generating permutations in lexicographic order
• Loopless Generation of Schroder Trees
• A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL

Cited In (5)

• Unified selection from lists, arrays, and objects.
• Sequential and parallel enumeration
• Direct-chaining with coalescing lists
• Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order
• Efficient Algorithms for Listing Combinatorial Structures

This page was built for publication: Listing combinatorial objects in parallel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3378053)