Journal ArticleOPEN ACCESS

FASTSET: A fast data structure for the representation of sets of integers

Algorithms (2019) 12(5)
DOI: 10.3390/a12050091
2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We describe a simple data structure for storing subsets of [0, . . ., N - 1], with N a given integer, which has optimal time performance for all the main set operations, whereas previous data structures are non-optimal for at least one such operation. We report on the comparison of a Java implementation of our structure with other structures of the standard Java Collections.

Author supplied keywords

Cite

CITATION STYLE

APA

Lancia, G., & Dalpasso, M. (2019). FASTSET: A fast data structure for the representation of sets of integers. Algorithms, 12(5). https://doi.org/10.3390/a12050091

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free