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
An efficient digital search algorithm by using a double-array structure
Jun-ichi Aoe,S. Yasutome,T. Sato +2 more
TL;DR: An efficient digital search algorithm is presented by introducing a new data structure, called a double-array, which combines the fast access of a matrix form with the compactness of a list form, and theoretically verified that each worst-case time of insertion and deletion is O(m) and O(e) respectively.
Journal ArticleDOI
Fully-Functional Suffix Trees and Optimal Text Searching in BWT-runs Bounded Space
TL;DR: The Run-Length FM-index as mentioned in this paper uses O(m + occ) space to locate the occ occurrences efficiently within O(r) space (in log logarithmic time each), and reaching optimal time, O( m + occ), within O (r log log w ({\sigma} + n/r)) space, for a text of length n over an alphabet of size σ on a RAM machine with words of w = σ(log n) bits.
Proceedings ArticleDOI
Efficient data access to multi-channel broadcast programs
Wai Gen Yee,Shamkant B. Navathe +1 more
TL;DR: This paper proposes various indexing schemes for a multi-channel broadcast program and demonstrates the effectiveness of their techniques in decreasing response time and tuning time via extensive experiments over a wide range of parameters.
Journal ArticleDOI
Succinct encoding of arbitrary graphs
Arash Farzan,J. Ian Munro +1 more
TL;DR: A lower bound is proved in the cell probe model indicating it is impossible to achieve the information-theory lower bound up to lower order terms unless the graph is either too sparse or too dense.
Journal ArticleDOI
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem
TL;DR: Gutin, Razgon and Kim as mentioned in this paper proposed randomized and deterministic algorithms for deciding whether an input digraph contains a spanning out-tree with at least k internal vertices.
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.