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
Perfect hashing using sparse matrix packing
M. D. Brain,Alan L. Tharp +1 more
TL;DR: The perfect hashing function described in this article has been used to create minimal perfect hashing functions for unsegmented word sets of up to 5000 words and is a significant improvement in terms of both time and space efficiency.
Posted Content
Near-Linear Time Algorithm for n-fold ILPs via Color Coding
TL;DR: A technique based on Color Coding is introduced, which allows for improving directions of ILPs to be computed in logarithmic time after a single initialization step and leads to the first algorithm for $n$-fold ILPs with a running time that is near-linear in the number of variables.
Journal Article
Lower bounds for dynamic algebraic problems
TL;DR: In this article, the authors considered the problem of computing the worst-case time complexity of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate.
Book ChapterDOI
Static Dictionaries Supporting Rank
Venkatesh Raman,S. Srinivasa Rao +1 more
TL;DR: A static dictionary is a data structure for storing a subset S of a finite universe U so that membership queries can be answered efficiently and the rank of an element if found is found if found.
Proceedings ArticleDOI
Faster deterministic dictionaries
TL;DR: In this paper, the gap between deterministic and randomized algorithms has been closed to O(log n) by a randomized algorithm, where n is the number of elements in the dictionary.
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.