Fast sequential and parallel algorithms for finding extremal sets
From MaRDI portal
Publication:2710788
DOI10.1080/00207169608804512zbMath1001.68973MaRDI QIDQ2710788
Publication date: 19 December 2002
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169608804512
68W10: Parallel algorithms in computer science
Cites Work
- Unnamed Item
- Opportunistic algorithms for eliminating supersets
- Improved nonconservative sequential and parallel integer sorting
- Parallel computation and conflicts in memory access
- An almost optimal algorithm for unbounded searching
- Finding extremal sets in less than quadratic time
- Searching, Merging, and Sorting in Parallel Computation
- Parallel Merge Sort
- Representing sets with constant time equality testing
- On Computing the Subset Graph of a Collection of Sets
- Algorithms and Data Structures