Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Generating combinations in parallel

From MaRDI portal
Publication:1082084
Jump to:navigation, search

DOI10.1007/BF01939357zbMath0602.68057MaRDI QIDQ1082084

Becky Chan, Selim G. Akl

Publication date: 1986

Published in: BIT (Search for Journal in Brave)


zbMATH Keywords

adaptive algorithmparallel algorithmcost-optimal algorithm


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Discrete mathematics in relation to computer science (68R99)


Related Items

A parallel algorithm for the generation of a permutation and applications, On random and adaptive parallel generation of combinatorial objects, A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL, An optimal algorithm for generating equivalence relations on a linear array of processors, A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems, A simple systolic algorithm for generating combinations in lexicographic order, An optimal parallel algorithm for generating combinations, Listing combinatorial objects in parallel, Generating subsets on a systolic array, A parallel algorithm for generating combinations, A systolic generation of combinations



Cites Work

  • Parallel Generation of Permutations
  • Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1082084&oldid=13105835"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 01:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki