Finding extremal sets in less than quadratic time (Q1313720): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127673664, #quickstatements; #temporary_batch_1722791855867
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4041090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal classes of hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Opportunistic algorithms for eliminating supersets / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trie data structures which support very fast search operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing sets with constant time equality testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding extremal sets in less than quadratic time / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(93)90264-a / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006606301 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127673664 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:20, 4 August 2024

scientific article
Language Label Description Also known as
English
Finding extremal sets in less than quadratic time
scientific article

    Statements