Polynomial hash functions are reliable (Q5204320): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal classes of hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of two-point based sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Perfect Hashing: Upper and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two results on tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a set of almost deterministic k-independent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity theory of efficient parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4162697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to emulate shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hash functions and their use in authentication and set equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Should Tables Be Sorted? / rank
 
Normal rank

Latest revision as of 04:01, 21 July 2024

scientific article; zbMATH DE number 7139634
Language Label Description Also known as
English
Polynomial hash functions are reliable
scientific article; zbMATH DE number 7139634

    Statements

    Polynomial hash functions are reliable (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 December 2019
    0 references
    hash function
    0 references
    finite field
    0 references
    program size
    0 references
    universal class
    0 references
    high-degree polynomial
    0 references

    Identifiers