Journal ArticleDOI
Storing a Sparse Table with 0(1) Worst Case Access Time
Reads0
Chats0
TLDR
A data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time and is easy to implement.Abstract:
A data structure for representing a set of n items from a umverse of m items, which uses space n + o(n) and accommodates membership queries m constant time is described. Both the data structure and the query algorithm are easy to ~mplement.read more
Citations
More filters
Journal ArticleDOI
Faster algorithms for 1-mappability of a sequence
Mai Alzamel,Panagiotis Charalampopoulos,Costas S. Iliopoulos,Solon P. Pissis,Jakub Radoszewski,Wing-Kin Sung +5 more
TL;DR: Two new algorithms that require worst-case time and space for integer alphabets of size if \(m=\varOmega (\log _\sigma n)\) are presented, thus greatly improving the state of the art.
Journal ArticleDOI
Programmed deallocation without dangling reference
Gianna Cioni,Antoni Kreczmar +1 more
TL;DR: On discute ce probleme general de securite/efficacite and on presente une nouvelle approche sure pour the gestion de the memoire, qui presente des proprietes interessantes en termes de cout de calcul.
Journal ArticleDOI
Sparse sets and collapse of complexity classes
TL;DR: A new upward separation technique is applied to prove that for a class of functions F a separation DTIME(F)?NTime(F) can be characterized by the existence of (not only polynomially) sparse sets in certain complexity classes.
Book ChapterDOI
Minimal perfect hashing for large sets of data
TL;DR: A probabilistic algorithm is employed to obtain a separation of legal key values into disjoint subsets so that the cardinality of each subset can be efficiently minimally perfectly hashed.
Posted Content
Lower bounds for predecessor searching in the cell probe model
Pranab Sen,S. Venkatesh +1 more
TL;DR: A strong round elimination lemma for communication complexity that enables a tight lower bound for the predecessor problem and also extends to quantum communication complexity.
References
More filters
Journal ArticleDOI
Should Tables Be Sorted
TL;DR: It is shown that, in a rather general model including al1 the commonly-used schemes, $\lceil $ lg(n+l) $\rceil$ probes to the table are needed in the worst case, provided the key space is sufficiently large.
Journal ArticleDOI
Storing a sparse table
TL;DR: This work proposes a good worst-case method for storing a static table of n entries, each an integer between 0 and N - 1, and analysis shows why a simpler algorithm used for compressing LR parsing tables works so well.
Journal ArticleDOI
Perfect hashing functions: a single probe retrieving method for static sets
TL;DR: A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered, and a rough comparison with ordinary hashing is given which shows that this method can be used conveniently in several practical applications.
Journal ArticleDOI
Reciprocal hashing: a method for generating minimal perfect hashing functions
TL;DR: A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets, and a proof of existence for minimalperfect hash functions of a special type (reciprocal type) is given.