An Efficient Representation for Sparse Sets

An Efficient Representation for Sparse Sets (1993)

by Preston Briggs , Linda Torczon

Venue:	ACM Letters on Programming Languages and Systems
Citations:	25 - 4 self

Datum	Value	Source
TITLE	An efficient representation for sparse sets	INFERENCE
AUTHOR NAME	Preston Briggs	SVM HeaderParse 0.1
AUTHOR AFFIL	Rice University	SVM HeaderParse 0.2
AUTHOR NAME	Linda Torczon	SVM HeaderParse 0.1
AUTHOR AFFIL	Rice University	SVM HeaderParse 0.2
ABSTRACT	this paper, we have described a representation suitable for sets with a fixed-size universe. The representation supports constant-time implementations of clear-set, member, add-member, delete-member, cardinality, and choose-one. Based on the efficiency of these operations, the new representation will often be superior to alternatives such as bit vectors, balanced binary trees, hash tables, linked lists, etc. Additionally, the new representation supports enumeration of the members in O(n) time, making it a competitive choice for relatively sparse sets requiring operations like forall, set-copy, set-union, and set-difference.	user correction - Legacy Corrections
YEAR	1993	INFERENCE
VENUE	ACM Letters on Programming Languages and Systems	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	59--69	INFERENCE
VOLUME	2	INFERENCE
CITATIONS	13 found	ParsCit 1.0