An Efficient Representation for Sparse Sets (1993) [20 citations — 4 self]
by
Preston Briggs
,
Linda Torczon
ACM Letters on Programming Languages and Systems
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Briggs93anefficient,
author = {Preston Briggs and Linda Torczon},
title = {An Efficient Representation for Sparse Sets},
journal = {ACM Letters on Programming Languages and Systems},
year = {1993},
volume = {2},
pages = {59--69}
}
author = {Preston Briggs and Linda Torczon},
title = {An Efficient Representation for Sparse Sets},
journal = {ACM Letters on Programming Languages and Systems},
year = {1993},
volume = {2},
pages = {59--69}
}
Years of Citing Articles
Bookmarks
OpenURL
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.
Citations
| 2010 | The Design and Analysis of Computer Algorithms – Aho, Hopcroft, et al. - 1974 |
| 644 | Efficiently computing static single assignment form and the control dependence graph – Cytron, Ferrante, et al. - 1991 |
| 359 | Register allocation & spilling via graph coloring – Chaitin - 1982 |
| 243 | Garbage collection in an uncooperative environment – Boehm, Weiser - 1988 |
| 184 | An efficient method of computing static single assignment form – Cytron, Ferrante, et al. - 1989 |
| 135 | Programming Pearls – Bentley - 1986 |
| 120 | Register allocation via graph coloring – Briggs - 1992 |
| 33 | Register allocation via coloring. Computer Languages – Chaitin, Auslander, et al. - 1981 |
| 19 | Programming by Refinement, as Exemplified by the SETL Representation Sublanguage – Dewar - 1979 |
| 14 | Amortized analysis of algorithms for set union with backtracking – Westbrook, Tarjan - 1989 |
| 9 | Representing sets with constant time equality testing – Yellin - 1990 |
