Fast sequential and parallel algorithms for finding extremal sets
From MaRDI portal
Recommendations
Cites work
- An almost optimal algorithm for unbounded searching
- Fast algorithms for a class of temporal range queries.
- Finding extremal sets in less than quadratic time
- scientific article; zbMATH DE number 742985 (Why is no real title available?)
- Improved nonconservative sequential and parallel integer sorting
- On Computing the Subset Graph of a Collection of Sets
- Opportunistic algorithms for eliminating supersets
- Parallel computation and conflicts in memory access
- Parallel Merge Sort
- Representing sets with constant time equality testing
- Searching, Merging, and Sorting in Parallel Computation
Cited in
(10)- A fast algorithm for finding the compact sets
- Fast RNC and NC algorithms for maximal path sets
- Finding extremal sets in less than quadratic time
- A provably fast linear-expected-time maxima-finding algorithm
- An old sub-quadratic algorithm for finding extremal sets
- Fully dynamic algorithms for maintaining extremal sets in a family of sets∗
- On the size of the subset partial order
- Practical algorithms for finding extremal sets
- Opportunistic algorithms for eliminating supersets
- Computing the subset partial order for dense families of sets
This page was built for publication: Fast sequential and parallel algorithms for finding extremal sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2710788)
