Results 1 - 10
of
664
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
, 2003
"... An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vec ..."
Abstract
-
Cited by 534 (8 self)
- Add to MetaCart
. In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and do not use asymmetric cryptographic
Similarity estimation techniques from rounding algorithms
- In Proc. of 34th STOC
, 2002
"... A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads ..."
Abstract
-
Cited by 449 (6 self)
- Add to MetaCart
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads
Cuckoo hashing
- JOURNAL OF ALGORITHMS
, 2001
"... We present a simple dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738–761, 1994). The space usage is similar to that ..."
Abstract
-
Cited by 202 (7 self)
- Add to MetaCart
We present a simple dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738–761, 1994). The space usage is similar
A Perfect Hash Function Generator
"... gperf is a "software-tool generating-tool" designed to automate the generation of perfect hash functions. This paper describes the features, algorithms, and object-oriented design and implementation strategies incorporated in gperf.Italso presents the results from an empirical comparison ..."
Abstract
-
Cited by 56 (34 self)
- Add to MetaCart
gperf is a "software-tool generating-tool" designed to automate the generation of perfect hash functions. This paper describes the features, algorithms, and object-oriented design and implementation strategies incorporated in gperf.Italso presents the results from an empirical comparison
Perfectly One-Way Probabilistic Hash Functions
"... Probabilistic hash functions that hide all partial information on their input were recently introduced. This new cryptographic primitive can be regarded as a function that offers "perfect one-wayness", in the following sense: Having access to the function value on some input is equ ..."
Abstract
-
Cited by 86 (10 self)
- Add to MetaCart
Probabilistic hash functions that hide all partial information on their input were recently introduced. This new cryptographic primitive can be regarded as a function that offers "perfect one-wayness", in the following sense: Having access to the function value on some input
Order preserving minimal perfect hash functions and information retrieval
- ACM TRANSACTIONS ON INFORMATION SYSTEMS
, 1991
"... Rapid access to information is essential for a wide variety of retrieval systems and applications. Hashing has long been used when the fastest possible direct search is desired, but is generally not appropriate when sequential or range searches are also required. This paper describes a hashing metho ..."
Abstract
-
Cited by 35 (2 self)
- Add to MetaCart
method, developed for collections that are relatively static, that supports both direct and sequential access. Indeed, the algorithm described gives hash functions that are optimal in terms of time and hash table space utilization, and that preserve any a priori ordering desired. Furthermore
External perfect hashing for very large key sets
, 2008
"... A perfect hash function (PHF) h: S → [0, m − 1] for a key set S ⊆ U of size n, where m ≥ n and U is a key universe, is an injective function that maps the keys of S to unique values. A minimal perfect hash function (MPHF) is a PHF with m = n, the smallest possible range. Minimal perfect hash functio ..."
Abstract
-
Cited by 19 (4 self)
- Add to MetaCart
A perfect hash function (PHF) h: S → [0, m − 1] for a key set S ⊆ U of size n, where m ≥ n and U is a key universe, is an injective function that maps the keys of S to unique values. A minimal perfect hash function (MPHF) is a PHF with m = n, the smallest possible range. Minimal perfect hash
A faster algorithm for constructing minimal perfect hash functions
- In Proceedings of the Fifteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Data Structures
, 1992
"... Our previous research on one-probe access to large collec-tions of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this prob-lem. Here, a new algorithm is described for quickly finding minimal perfect hash functions whose specification space is v ..."
Abstract
-
Cited by 22 (1 self)
- Add to MetaCart
Our previous research on one-probe access to large collec-tions of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this prob-lem. Here, a new algorithm is described for quickly finding minimal perfect hash functions whose specification space
An Optimal Algorithm for Generating Minimal Perfect Hash Functions,”
- Information Processing Letters,
, 1992
"... Abstract Czech, Z.J., G. Havas and B.S. Majewski, An optimal algorithm for generating minimal perfect hash functions, Information Processing Letters 43 (1992) 257-264. A new algorithm for generating order preserving minimal perfect hash functions is presented. The algorithm is probabilistic, involv ..."
Abstract
-
Cited by 51 (1 self)
- Add to MetaCart
Abstract Czech, Z.J., G. Havas and B.S. Majewski, An optimal algorithm for generating minimal perfect hash functions, Information Processing Letters 43 (1992) 257-264. A new algorithm for generating order preserving minimal perfect hash functions is presented. The algorithm is probabilistic
FINDING MINIMAL PERFECT HASH
, 1986
"... A heurisitic is given for finding minimal perfect hash functions without extensive searching. The procedure is to construct a set of graph (or hypergraph) models for the dictionary, then choose one of the models for use in constructing the minimal perfect hashing function. The construction of this f ..."
Abstract
- Add to MetaCart
A heurisitic is given for finding minimal perfect hash functions without extensive searching. The procedure is to construct a set of graph (or hypergraph) models for the dictionary, then choose one of the models for use in constructing the minimal perfect hashing function. The construction
Results 1 - 10
of
664