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
Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
Jianer Chen,Joachim Kneis,Songjian Lu,Daniel Mölle,Stefan Richter,Peter Rossmanith,Sing-Hoi Sze,Fenghui Zhang +7 more
TL;DR: The proposed randomized divide-and-conquer technique can be derandomized to result in significantly improved deterministic algorithms for the problems, and they can be extended to solve other matching and packing problems.
Journal ArticleDOI
On randomization in sequential and distributed algorithms
TL;DR: This survey presents five techniques that have been widely used in the design of randomized algorithms, illustrated using 12 randomized algorithms that span a wide range of applications, including:primality testing, interactive probabilistic proof systems, dining philosophers, and Byzantine agreement.
Patent
Transparent redirection of resource requests
TL;DR: In this article, a plurality of repeater servers form a shared content delivery network (CDN) to serve resources to clients on behalf of plurality of content providers, and a CDN server is identified in the domain associated with the shared CDN to serve the second resource to the client.
Proceedings ArticleDOI
The k-orientability thresholds for Gn, p
TL;DR: The proof involves the analysis of a heuristic algorithm that attempts to find a k-orientation of the random graph that coincides with the threshold at which the (k + 1)-core has average degree 2.
Journal ArticleDOI
Searchable Encryption for Healthcare Clouds: A Survey
Rui Zhang,Rui Xue,Ling Liu +2 more
TL;DR: This survey paper describes the notion of searchable encryption (SE) in the context of healthcare applications and characterize the SE use cases into four scenarios in healthcare, and describes how the existing SE schemes relate to and differ from one another, and point out the connections between the SE techniques and the security and privacy requirements of Healthcare applications and the open research problems.
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.