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
Proceedings ArticleDOI
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
TL;DR: An index structure is constructed that occupies only O(n) bits and compares favorably with inverted lists in space and achieves optimal O(m/log n) search time for sufficiently large m = ~(log a+~ n).
Proceedings ArticleDOI
Multilevel adaptive hashing
Andrei Z. Broder,Anna R. Karlin +1 more
TL;DR: According to the analysis, with the Multilevel Hashing Algorithm it is possible to build a dictionary that is able to answer 20 parallel searches among 64,000 entries in less than 5 ps using relatively inexpensive hardware.
Patent
Configurable adaptive global traffic control and management
Paul E. Stolorz,John K. Salmon,Michael S. Warren,Jeffrey G. Koller,Aric Hagberg,Maksim Yevmenkin,Mark Brady,David Pfitzner,Ted Middleton +8 more
TL;DR: In this article, the authors propose a policy-based domain name service, where the domain name server resolves the hostname to at least one address corresponding a server in the subscriber server network based on a policy consideration such as geographic policies, load share policies, overflow policies, and network aware policies.
Journal ArticleDOI
A Reliable Randomized Algorithm for the Closest-Pair Problem
TL;DR: In the course of solving the duplicate-grouping problem, a new universal class of hash functions of independent interest is described, and it is shown that both of the foregoing problems can be solved by randomized algorithms that useO(n) space and finish inO( n) time with probability tending to 1 asngrows to infinity.
Book ChapterDOI
Oblivious Transfer with Adaptive Queries
Moni Naor,Benny Pinkas +1 more
TL;DR: In this article, a two-party oblivious transfer (OT) protocol is proposed, where one party has N values and the other party wants to learn k of them, deciding which ones in an adaptive manner.
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.