%0 Journal Article
%T FASTSET: A Fast Data Structure for the Representation of Sets of Integers
%J Algorithms | An Open Access Journal from MDPI
%D 2019
%R https://doi.org/10.3390/a12050091
%X 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. View Full-Tex
%U https://www.mdpi.com/1999-4893/12/5/91