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
Book ChapterDOI
Deterministic constructions of approximate distance oracles and spanners
TL;DR: The first deterministic linear time algorithm for constructing optimal spanners of weighted graphs is obtained by derandomizing the O(km) expected time algorithm of Baswana and Sen for constructing (2k–1)-spanners of size O(kn) of weighted undirected graphs without incurring any asymptotic loss in the running time or in the size of the spanners produced.
Journal ArticleDOI
Computationally Secure Oblivious Transfer
Moni Naor,Benny Pinkas +1 more
TL;DR: A direct corollary of the 1-out-of-N oblivious transfer protocol is an efficient transformation of any Private Information Retrieval protocol to a Symmetric PIR protocol.
Proceedings ArticleDOI
New data structures for orthogonal range searching
TL;DR: New general techniques for static orthogonal range searching problems in two and higher dimensions are presented and query time O(log n) using space O(n log n) is achieved.
Journal ArticleDOI
Real-time parallel hashing on the GPU
Dan A. Alcantara,Andrei Sharf,Fatemeh Abbasinejad,Shubhabrata Sengupta,Michael Mitzenmacher,John D. Owens,Nina Amenta +6 more
TL;DR: An efficient data-parallel algorithm for building large hash tables of millions of elements in real-time, which considers a classical sparse perfect hashing approach, and cuckoo hashing, which packs elements densely by allowing an element to be stored in one of multiple possible locations.
Journal ArticleDOI
Space Efficient Hash Tables With Worst Case Constant Access Time
TL;DR: This is the first dictionary that has worst case constant access time and expected constant update time, works with (1 + ε)n space, and supports satellite information.
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.