Results 191 to 200 of about 643,283 (231)

On the program size of perfect and universal hash functions

23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), 1982
We address the question of program size of of perfect and universal hash functions. We prove matching upper and lower bounds (up to constant factors) on program size. Furthermore, we show that minimum or nearly minimum size programs can be found efficiently.
openaire   +1 more source

Simplified Tight Bounds for Monotone Minimal Perfect Hashing

Annual Symposium on Combinatorial Pattern Matching
Given an increasing sequence of integers $x_1,\ldots,x_n$ from a universe $\{0,\ldots,u-1\}$, the monotone minimal perfect hash function (MMPHF) for this sequence is a data structure that answers the following rank queries: $rank(x) = i$ if $x = x_i ...
Dmitry Kosolobov
semanticscholar   +1 more source

Reciprocal hashing

Communications of the ACM, 1981
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. A proof of existence for minimal perfect hash functions of a special type (reciprocal type) is given.
openaire   +2 more sources

Design Strategies for Minimal Perfect Hash Functions

2007
A minimal perfect hash function h for a set S ⊆ U of size n is a function h:U → {0,. . ., n-1} that is one-to-one on S. The complexity measures of interest are storage space for h, evaluation time (which should be constant), and construction time. The talk gives an overview of several recent randomized constructions of minimal perfect hash functions ...
openaire   +2 more sources

A scheme for constructing ordered minimal perfect hashing functions

Information Sciences, 1986
This paper describes a method to be used for the organization and retrieving data. Jaeschke proposed the function h(k) = [C(Dk + E)] mod n, where n is the size of a given key set, for constructing minimal perfect hashing functions. We propose another minimal perfect hashing scheme based upon number theory, with the function h(k) = [CT(k)] mod n.
openaire   +2 more sources

Construct a perfect word hash function in time independent of the size of integers

Information Processing Letters, 2017
Yijie Han
semanticscholar   +1 more source

Sexual health among adolescent and young adult cancer survivors: A scoping review from the Children's Oncology Group Adolescent and Young Adult Oncology Discipline Committee

Ca-A Cancer Journal for Clinicians, 2021
Brooke Cherven, Sharon L Bober, Kristin Bingen   +2 more
exaly  

Minimal Perfect Hash Functions

2014
P. Boldi, S. Vigna
openaire   +1 more source

A chaos-based keyed hash function based on fixed point representation

Cluster Computing, 2018
J. Teh, K. Tan, Moatsum Alawida
semanticscholar   +1 more source

A systematic review of rehabilitation and exercise recommendations in oncology guidelines

Ca-A Cancer Journal for Clinicians, 2021
Kathleen Doyle Lyons, Nicole L Stout, Daniel Santa Mina   +2 more
exaly