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
Low-contention data structures
TL;DR: For a large class of algorithms, it is shown that for a wide range of data structure problems, achieving contention even within a polylogarithmic factor of optimal requires a cell-probe complexity of @W(loglogn).
Journal ArticleDOI
An Optimal Multiple-Class Encoding Scheme for a Graph of Bounded Hadwiger Number
TL;DR: In this article , the authors proposed an F-opt encoding scheme for a family F of an infinite number of classes such that UF comprises all graphs of bounded Hadwiger numbers.
Journal ArticleDOI
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms
TL;DR: An application of this yields an FPT algorithm for finding exact weight k nontrivial automorphisms in d-hypergraphs, d as second fixed parameter.
Posted Content
Minimal unique palindromic substrings after single-character substitution
Mitsuru Funakoshi,Takuya Mieno +1 more
TL;DR: In this paper, the problem of updating the set of MUPSs when a character in the input string is substituted by another character was studied, and an algorithm that uses O(n) time and space for preprocessing was presented.
Proceedings ArticleDOI
Combinatorial source encoding and perfect hashing
TL;DR: This work presents an encoding which is optimal by both first and second characteristics, its precomputing time is polynomial in dictionary size, and in that sense the problem is settled completely.
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.