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
Dissertation
Efficient, transparent, and comprehensive runtime code manipulation
TL;DR: D DynamoRIO is presented, a fully-implemented runtime code manipulation system that supports code transformations on any part of a program, while it executes, with zero to thirty percent time and memory overhead on both Windows and Linux.
Proceedings ArticleDOI
Splitters and near-optimal derandomization
TL;DR: A fairly general method for finding deterministic constructions obeying k-restrictions, which yields structures of size not much larger than the probabilistic bound and imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal /spl Sigma/II/Spl Sigma/ threshold formulae.
Journal ArticleDOI
Succinct Representation of Balanced Parentheses and Static Trees
J. Ian Munro,Venkatesh Raman +1 more
TL;DR: This work considers the implementation of abstract data types for the static objects: binary tree, rooted ordered tree, and a balanced sequence of parentheses to produce a succinct representation of planar graphs in which one can test adjacency in constant time.
Journal ArticleDOI
The string B-tree: a new data structure for string search in external memory and its applications
Paolo Ferragina,Roberto Grossi +1 more
TL;DR: This work introduces a new text-indexing data structure, the String B-Tree, that can be seen as a link between some traditional external-memory and string-matching data structures that is made more effective by adding extra pointers to speed up search and update operations.
Proceedings ArticleDOI
Dynamic perfect hashing: upper and lower bounds
Martin Dietzfelbinger,Anna R. Karlin,Kurt Mehlhorn,F.M. auf der Heide,Hans Rohnert,Robert E. Tarjan +5 more
TL;DR: In this article, a randomized algorithm with O(1) worst-case time for lookup and O( 1) amortized expected time for insertion and deletion was given for the dictionary problem.
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.