Min-wise independent permutations
From MaRDI portal
Recommendations
Cites work
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Fredman–Komlós bounds and information theory
- scientific article; zbMATH DE number 1615265 (Why is no real title available?)
- scientific article; zbMATH DE number 432749 (Why is no real title available?)
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3523640 (Why is no real title available?)
- scientific article; zbMATH DE number 1305436 (Why is no real title available?)
- scientific article; zbMATH DE number 1559562 (Why is no real title available?)
- scientific article; zbMATH DE number 1559581 (Why is no real title available?)
- scientific article; zbMATH DE number 1775418 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Pairwise independence and derandomization.
- Randomized geometric algorithms and pseudorandom generators
- Simple Constructions of Almost k-wise Independent Random Variables
- Universal classes of hash functions
Cited in
(52)- Optimality in external memory hashing
- Sketching information divergences
- Min-wise independent groups
- Probabilistic frequent subtrees for efficient graph classification and retrieval
- min-wise independent linear permutations
- Improving MinHash via the containment index with applications to metagenomic analysis
- Anchor-based self-ensembling for semi-supervised deep pairwise hashing
- Train tracks with gaps: applying the probabilistic method to trains
- Simple multi-party set reconciliation
- Locality sensitive hashing with extended differential privacy
- Incremental design-space model checking via reusable reachable state approximations
- FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams
- How should we solve search problems privately?
- Counting distinct items over update streams
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- The complexity of LSH feasibility
- On the minimum number of completely 3-scrambling permutations
- Growth of the perfect sequence covering array number
- scientific article; zbMATH DE number 1615265 (Why is no real title available?)
- Frequent-itemset mining using locality-sensitive hashing
- Low discrepancy sets yield approximate min-wise independent permutation families
- Disjoint bases in a polymatroid
- A sketch algorithm for estimating two-way and multi-way associations
- Quicksort, largest bucket, and min-wise hashing with limited independence
- Perturbed Identity Matrices Have High Rank: Proof and Applications
- Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
- Succinct representations of permutations and functions
- scientific article; zbMATH DE number 1538179 (Why is no real title available?)
- scientific article; zbMATH DE number 1775418 (Why is no real title available?)
- On the Distortion of Locality Sensitive Hashing
- The distortion of locality sensitive hashing
- Streaming techniques and data aggregation in networks of tiny artefacts
- MULTIPLE TRANSITIVITY AND MIN-WISE INDEPENDENCE IN PERMUTATION GROUPS
- scientific article; zbMATH DE number 1563190 (Why is no real title available?)
- scientific article; zbMATH DE number 1418262 (Why is no real title available?)
- scientific article; zbMATH DE number 1418263 (Why is no real title available?)
- scientific article; zbMATH DE number 1445297 (Why is no real title available?)
- scientific article; zbMATH DE number 1445298 (Why is no real title available?)
- Fingerprints for highly similar streams
- Min-Wise Independent Families with Respect to any Linear Order
- On (ε,k)‐min‐wise independent permutations
- Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
- scientific article; zbMATH DE number 2187718 (Why is no real title available?)
- LSH-preserving functions and their applications
- Concentration for limited independence via inequalities for the elementary symmetric polynomials
- A nearly linear size \(4\)-min-wise independent permutation family by finite geometries
- Independent set and matching permutations
- A fast output-sensitive algorithm for Boolean matrix multiplication
- Explicit and near-optimal construction of t-rankwise independent permutations
- How to catch \(L_2\)-heavy-hitters on sliding windows
- A derandomization using min-wise independent permutations
- Spatially-decaying aggregation over a network
This page was built for publication: Min-wise independent permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1577016)
