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
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
TL;DR: In this article, the authors present two new combinatorial tools for the design of parameterized algorithms, which yield new randomized fixed parameter tractable (FPT) algorithms for Stable $s$t$ Separator, Stable Odd Cycle Transversal and Stable Multicut on general graphs.
Posted Content
String Indexing for Top-$k$ Close Consecutive Occurrences
Barney Jordaan,Philip Bille,Inge Li Gørtz,Max Rishøj Pedersen,Eva Rotenberg,Teresa Anna Steiner +5 more
TL;DR: Two new time-space trade-offs are given for the string indexing for top-$k$ close consecutive occurrences problem (SITCCO), including a new translation of the problem into a line segment intersection problem and a new recursive clustering technique for trees.
6.851 Advanced Data Structures, Spring 2010
Erik D. Demaine,André Schulz +1 more
TL;DR: This lecture briefly discusses extending the authors' orthogonal range query solutions to account for dynamic point sets, and introduces the problem of vertical line stabbing queries, present two solutions, and review an application.
Posted Content
Parameterizing PWM- and Profile-Matching and Knapsack by the feasible-weight solutions count.
TL;DR: Algorithms for profile matching and multichoice knapsack parameterized by the number of solutions with feasible weight run as fast as the best known non-parameterized solutions for these problems.
Proceedings ArticleDOI
Sliding Window String Indexing in Streams
TL;DR: In this paper , the authors studied the streaming sliding window string indexing problem, where the string $S$ arrives as a stream, one character at a time, and the goal is to maintain an index of the last $w$ characters, called the window, for a specified parameter $w$.
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.