Document - Compressed static functions with applications

2013

Conference article Restricted

Compressed static functions with applications

Belazzougui D., Venturini R.

Compressed Data Structures DATA STRUCTURES

Given a set of integer keys from a bounded universe along with associated data, the dictionary problem asks to answer two queries: membership and retrieval. Membership has to tell whether a given element is in the dictionary or not; Retrieval has to return the data associated with the searched key. In this paper we provide time and space optimal solutions for three well-established relaxations of this basic problem: (Compressed) Static functions, Approximate membership and Relative membership.

Source: 24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 229–240, New orleans, Louisiana, USA, 5 gennaio 2013

Back to previous page

Cite as

BibTeX entry

@inproceedings{oai:it.cnr:prodotti:277560,
	title = {Compressed static functions with applications},
	author = {Belazzougui D. and Venturini R.},
	booktitle = {24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 229–240, New orleans, Louisiana, USA, 5 gennaio 2013},
	year = {2013}
}