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
Reconstructing Graphs from Connected Triples
Paul R. Bastide,Linda Cook,Jeff D. A. Erickson,Carla Groenland,Marc van Kreveld,Isja Mannens,Jordi L. Vermeulen +6 more
TL;DR: In this paper , the authors introduce a new model of indeterminacy in graphs, where instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph.
Posted Content
Privacy-Preserving Search for a Similar Genomic Makeup in the Cloud
TL;DR: Wang et al. as mentioned in this paper proposed a hierarchical index structure to index each hospital's dataset with low memory requirements and developed a novel privacy-preserving index merging mechanism that generates a common search index from individual indices of each hospital to significantly improve the search efficiency.
Journal ArticleDOI
Hide and Mine in Strings: Hardness, Algorithms, and Experiments
Giulia Bernardini,Alessio Conte,Garance Gourdel,Roberto Grossi,Grigorios Loukides,Nadia Pisanti,Solon P. Pissis,Giulia Punzi,Leen Stougie,Michelle J. M. Sweering +9 more
TL;DR: This work initiates a study on the fundamental relation between data sanitization and frequent pattern mining in the context of sequential (string) data, and proposes integer linear programming formulations for these variants and algorithms to solve them, which work in polynomial time under realistic assumptions on the input parameters.
Posted Content
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP
TL;DR: In this article, the authors studied the problem of finding an improving $k$-move in bounded degree graphs, presenting new algorithms and conditional lower bounds, and showed that the aforementioned ETH lower bound also holds for graphs of maximum degree three, but that in bounded-degree graphs the best improving$k-move can be found in time O(n−23k/135+o(k)})$.
Strategies for Static Tables
TL;DR: This chapter presents three alternatives for structuring static tables—those tables in which the collection of keys remains unchanged and inWhich the FIND operation is optimized.
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.