A Reliable Randomized Algorithm for the Closest-Pair Problem
From MaRDI portal
Recommendations
Cited in
(39)- Optimal Las Vegas reduction from one-way set reconciliation to error correction
- Quantum algorithms for the \(k\)-XOR problem
- A simple randomized O(N N)-time closest-pair algorithm in doubling metrics
- HalftimeHash: modern hashing without 64-bit multipliers or finite fields
- A Linear Time Algorithm for Ordered Partition
- Dynamic closest pairs — A probabilistic approach
- scientific article; zbMATH DE number 794264 (Why is no real title available?)
- Universal Hashing via Integer Arithmetic Without Primes, Revisited
- On the hardness of approximate and exact (bichromatic) maximum inner product
- Pyramid computer solutions of the closest pair problem
- Improved fast integer sorting in linear space
- \texttt{Sample(x)=(a*x<=t)} is a distinguisher with probability \(1/8\)
- Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
- Near-linear time approximation schemes for geometric maximum coverage
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
- Randomized Data Structures for the Dynamic Closest-Pair Problem
- Linear hashing is awesome
- The average performance analysis of a closest‐pair algorithm
- A parallel batch-dynamic data structure for the closest pair problem
- A simple randomized sieve algorithm for the closest-pair problem
- Linear Time Approximation Schemes for Geometric Maximum Coverage
- Sorting in linear time?
- Approximating Boolean functions by OBDDs
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
- Bounds on the OBDD-size of integer multiplication via universal hashing
- scientific article; zbMATH DE number 7250154 (Why is no real title available?)
- Predecessor on the Ultra-Wide Word RAM
- Quicksort, largest bucket, and min-wise hashing with limited independence
- Construct a perfect word hash function in time independent of the size of integers
- Optimal bounds for the predecessor problem and related problems
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds
- Power of \(d\) choices with simple tabulation
- Random projections for Bayesian regression
- Stochastic and deterministic fault detection for randomized gossip algorithms
- The communication complexity of addition
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- Approximate k-closest-pairs in large high-dimensional data sets
- ON ENUMERATING AND SELECTING DISTANCES
This page was built for publication: A Reliable Randomized Algorithm for the Closest-Pair Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366873)
