A systolic generation of combinations

DOI10.1007/BF01932702zbMath0684.68072OpenAlexW1995479421MaRDI QIDQ1825668

Chau-Jy Lin, Jong-Chuang Tsay

Publication date: 1989

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01932702

zbMATH Keywords

parallel algorithmsystolic arraycombinationsalgorithm verification

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Theory of operating systems (68N25)

Related Items (5)

On random and adaptive parallel generation of combinatorial objects ⋮ Systolic algorithm for the solution of dense linear equations ⋮ An optimal algorithm for generating equivalence relations on a linear array of processors ⋮ A simple systolic algorithm for generating combinations in lexicographic order ⋮ Listing combinatorial objects in parallel

Cites Work

• Generating combinations in parallel
• Parallel generation of permutations and combinations
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• Approximate Algorithms for the 0/1 Knapsack Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: A systolic generation of combinations