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 ArticleDOI
Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications
Esteban Gabory,Njagi Moses Mwaniki,Nadia Pisanti,Solon P. Pissis,Jakub Radoszewski,Michelle J. M. Sweering,Wiktor Zuba +6 more
TL;DR: In this paper , it was shown that the ED string intersection problem is NP-complete for any constant ε > 0, unless the Strong Exponential-Time Hypothesis is false.
Improved deterministic parallel padded sorting
Ka Wong Chong,Edgar A. Ramos +1 more
TL;DR: This work describes an algorithm that, with nk processors in the CRCW PRAM model, sorts the input array with padding o(1) using time O (logkn log*(logkn) + loglogk).
Journal ArticleDOI
Algorithms for Determining the Cyclic Edge Connectivity of Cubic Graphs
TL;DR: By proof, by proof, the value of cyclic edge connectivity of some cubic graphs is directly got such that an algorithm determining the cyclic Edge connectivity of cubic graphs was improved and randomness was added to the algorithm determining cyclic fringe connectivity.
Journal ArticleDOI
String indexing for top-k close consecutive occurrences
TL;DR: In this article , the problem of string indexing for top-k close consecutive occurrences (Sitcco) was studied, where a consecutive occurrence is a pair (i, j ) , i < j , such that P occurs at positions i and j in S and there is no occurrence of P between i and J , and their distance is defined as j − i .
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.