Pages that link to "Item:Q2903519"
From MaRDI portal
The following pages link to Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation (Q2903519):
Displaying 17 items.
- A unified framework for linear dimensionality reduction in L1 (Q310869) (← links)
- Triangle counting in dynamic graph streams (Q334947) (← links)
- Explicit and efficient hash families suffice for cuckoo hashing with a stash (Q487008) (← links)
- A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems (Q2245100) (← links)
- Linear Probing with 5-wise Independence (Q3115862) (← links)
- Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
- Linear Probing with Constant Independence (Q3575161) (← links)
- Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8 (Q4562282) (← links)
- Power of \(d\) choices with simple tabulation (Q5002669) (← links)
- Optimal (Euclidean) Metric Compression (Q5080486) (← links)
- Near-Linear Time Local Polynomial Nonparametric Estimation with Box Kernels (Q5084601) (← links)
- Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. (Q5240430) (← links)
- Tracking the l_2 Norm with Constant Update Time (Q5875453) (← links)
- M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions (Q6083984) (← links)
- T5: Hashing five inputs with three compression calls (Q6107278) (← links)
- Universal Hashing via Integer Arithmetic Without Primes, Revisited (Q6163629) (← links)
- Nearly time-optimal kernelization algorithms for the line-cover problem with big data (Q6586656) (← links)
