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
Posted Content
Efficient Approximate Distance Oracles for Vertex-Labeled Planar Graphs.
Itay Laish,Shay Mozes +1 more
TL;DR: This paper presents three different dynamic approximate vertex-labeled distance oracles for planar graphs, all with polylogarithmic query and update times, and nearly linear space requirements.
Proceedings ArticleDOI
Extensible perfect hashing
TL;DR: This dissertation aims to provide a history of web exceptionalism from 1989 to 2002, a period chosen in order to explore its roots as well as specific cases up to and including the year in which descriptions of “Web 2.0” began to circulate.
DissertationDOI
Geometric algorithms for object placement and planarity in a terrain
TL;DR: It is shown for a given epsilon > 0 how random-sampling and bucketing techniques can be used to develop a near-linear-time Monte Carlo algorithm that computes a placement of C containing at least (1 -epsilon)k* points of S with high probability.
Posted Content
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles
TL;DR: In this paper, the authors considered a general variant of the knapsack problem in which both the pattern and the text are uncertain, and proposed algorithms for the consensus problem parameterized by the number of strings that match one of the sequences.
Posted Content
String Sanitization Under Edit Distance: Improved and Generalized
TL;DR: The main results can be summarized as follows: an $\mathcal{O}(n^2\log^2k)$-time algorithm to solve ETFS, a generalization of ETFS in which the elements of $\Mathcal{S}$ can have arbitrary lengths, and an AETFS, ageneralization of Exxon Mobil's EMMD, which is a generalizations of ExxonMobil's EMT, which can be solved in less time.
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.