Publication:4763424
From MaRDI portal
zbMath0829.68067MaRDI QIDQ4763424
Publication date: 11 April 1995
68Q25: Analysis of algorithms and problem complexity
68W10: Parallel algorithms in computer science
68P05: Data structures
68R99: Discrete mathematics in relation to computer science
Related Items
Fully dynamic algorithms for maintaining extremal sets in a family of sets∗, Data structures for maintaining set partitions, Practical Algorithms for Finding Extremal Sets, On the size of the subset partial order, On the complexity of strongly connected components in directed hypergraphs, Computing the subset partial order for dense families of sets, Finding extremal sets in less than quadratic time, Lazy structure sharing for query optimization, Lower bounds for set intersection queries, Building efficient and compact data structures for simplicial complexes, Fast sequential and parallel algorithms for finding extremal sets