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 Article
Very Large Cliques are Easy to Detect
TL;DR: In this article, it was shown that the presence of an $(n-k)$-clique in an n-vertex graph can be detected by a monotone circuit with O(n 2 log n) gates.
Dissertation
Index-Based Search Techniques for Visualization and Data Analysis Algorithms on Many-Core Systems
Proceedings ArticleDOI
Reconciling similar sets
TL;DR: This work develops new encoding and decoding algorithms to address the complexities arising from allowing multiple difference blocks in sets whose symmetric difference consists of many blocks, each composed of elements that are within a given Hamming distance.
Posted Content
Finding heaviest H-subgraphs in real weighted graphs, with applications
TL;DR: The main results are new strongly polynomial algorithms for the MAX H-subgraph problem, and efficient algorithms for several related problems that are faster than any previously existing algorithms.
Journal ArticleDOI
A layered searchable encryption scheme with functional components independent of encryption methods.
TL;DR: A layered searchable encryption (LSE) scheme is proposed, which provides compatibility, flexibility, and security for various settings and functionalities, and two representative and novel constructions for ranked keyword query and range query are proposed.
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.