Finding extremal sets in less than quadratic time
type: Item
instance of: scholarly article
title: Finding extremal sets in less than quadratic time
zbMATH Open document ID: 0787.68054
DOI: 10.1016/0020-0190(93)90264-A
author: Daniel Yellin
author: C. S. Jutla
published in: Information Processing Letters
publication date: 1994-02-24T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R99
zbMATH DE Number: 500519
zbMATH Keywords: finding of extremal sets
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q4041090
cites work: Universal classes of hash functions
cites work: Parallel concepts in graph theory
cites work: Opportunistic algorithms for eliminating supersets
cites work: New trie data structures which support very fast search operations
cites work: Q4763424
cites work: Representing sets with constant time equality testing
full work available at URL: 0020-0190(93)90264-a
OpenAlex ID: W2006606301
Wikidata QID: Q127673664
description: scientific article; zbMATH DE number 500519