Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Universal Hashing via Integer Arithmetic Without Primes, Revisited - MaRDI portal

Universal Hashing via Integer Arithmetic Without Primes, Revisited (Q6163629)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7704722

Language	Label	Description	Also known as
English	Universal Hashing via Integer Arithmetic Without Primes, Revisited	scientific article; zbMATH DE number 7704722

Statements

scholarly article

0 references

Universal Hashing via Integer Arithmetic Without Primes, Revisited (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-98355-4_15

0 references

Martin Dietzfelbinger

0 references

Adventures Between Lower Bounds and Higher Altitudes

0 references

publication date

30 June 2023

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-98355-4_15

0 references

0 references

Consequences of Faster Alignment of Sequences

0 references

Simple Constructions of Almost k-wise Independent Random Variables

0 references

Explicit and efficient hash families suffice for cuckoo hashing with a stash

0 references

Subquadratic algorithms for 3SUM

0 references

A read-once branching program lower bound of Ω(2 <sup>n/4</sup> ) for integer multiplication using universal hashing

0 references

Universal classes of hash functions

0 references

On the power of two-point based sampling

0 references

Universal hashing and k-wise independent random variables via integer arithmetic without primes

0 references

Polynomial hash functions are reliable

0 references

A Reliable Randomized Algorithm for the Closest-Pair Problem

0 references

Dynamic Perfect Hashing: Upper and Lower Bounds

0 references

0 references

Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes

0 references

Almost random graphs with simple hash functions

0 references

Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time

0 references

Deterministic Dictionaries

0 references

Higher Lower Bounds from the 3SUM Conjecture

0 references

A Simple Parallel Algorithm for the Maximal Independent Set Problem

0 references

Pairwise Independence and Derandomization

0 references

The computational complexity of universal hashing

0 references

Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories

0 references

0 references

Pseudorandom generators for space-bounded computation

0 references

0 references

Towards polynomial lower bounds for dynamic problems

0 references

On the <i>k</i> -Independence Required by Linear Probing and Minwise Independence

0 references

0 references

Making deterministic signatures quickly

0 references

Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions

0 references

On Universal Classes of Extremely Random Constant-Time Hash Functions

0 references

0 references

Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation

0 references

Finding, Minimizing, and Counting Weighted Subgraphs

0 references

Space-Efficient Randomized Algorithms for K-SUM

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6163629

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6163629&oldid=37531156"