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
Circular Pattern Matching with $k$ Mismatches
Panagiotis Charalampopoulos,Tomasz Kociumaka,Solon P. Pissis,Jakub Radoszewski,Wojciech Rytter,Juliusz Straszyński,Tomasz Waleń,Wiktor Zuba +7 more
TL;DR: This paper presents the first non-trivial worst-case upper bounds for thek-CPM problem and shows an O(nk)-time algorithm and an $O(n+\frac{n}{m}\,k^4)$- time algorithm that applies in an extended way a technique that was very recently developed for the problem.
Journal ArticleDOI
Hashing of Databases with the Use of Metric Properties of the Hamming Space
TL;DR: It is shown that computational efforts needed to search for a pattern in databases can be essentially decreased by using the triangle inequality for the Hamming distances between binary vectors.
Journal ArticleDOI
Finding planar regions in a terrain – in practice and with a guarantee
TL;DR: A new approximation algorithm for the problem of computing large connected regions in a triangulated terrain of size n which runs in O(n/∊2) time and—apart from giving a guarantee on the quality of the produced solution—has been implemented and shows good performance on real data sets representing fracture surfaces.
Patent
Shared content delivery infrastructure & method of generating a web page
TL;DR: In this article, a first document is modified to produce a first modified URL, that includes a modified hostname resolvable to a shared content delivery network (CDN) formed by a plurality of repeater servers.
Corrigendum: Explicit Construction of a Small ε -Net for Linear Threshold Functions
Yuval Rabani,Amir Shpilka +1 more
TL;DR: This work gives explicit constructions of ε -nets for linear threshold functions on the binary cube and on the unit sphere and improves upon the well-known construction of dual BCH codes that guarantee only a covering radius of n 2 − c √ n.
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.