Searching for "Generating Combinations in Parallel." – sorted by Relevance.
-
A simple systolic algorithm for generating combinations
- , whose running time is O(C(m, n))). Recently, the fast generation of combinations in parallel has been
- Cited by 2 (0 self) – Add To MetaCart
-
Compositional Pointer and Escape Analysis for Multithreaded Java
- of extracting the points-to relationships generated by the interactions between unstructured parallel threads
- Cited by 4 (1 self) – Add To MetaCart

