Pages that link to "Item:Q4366873"
From MaRDI portal
The following pages link to A Reliable Randomized Algorithm for the Closest-Pair Problem (Q4366873):
Displaying 31 items.
- Random projections for Bayesian regression (Q144017) (← links)
- Explicit and efficient hash families suffice for cuckoo hashing with a stash (Q487008) (← links)
- Stochastic and deterministic fault detection for randomized gossip algorithms (Q518288) (← links)
- The communication complexity of addition (Q519955) (← links)
- Approximate \(k\)-closest-pairs in large high-dimensional data sets (Q814957) (← links)
- HalftimeHash: modern hashing without 64-bit multipliers or finite fields (Q832844) (← links)
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs (Q860816) (← links)
- Approximating Boolean functions by OBDDs (Q867861) (← links)
- Sorting in linear time? (Q1273863) (← links)
- Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH (Q1710687) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- Improved fast integer sorting in linear space (Q1854461) (← links)
- Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
- Construct a perfect word hash function in time independent of the size of integers (Q2404612) (← links)
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← links)
- Bounds on the OBDD-size of integer multiplication via universal hashing (Q2575837) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- A Linear Time Algorithm for Ordered Partition (Q3452555) (← links)
- Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence (Q3452844) (← links)
- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes (Q3599076) (← links)
- Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8 (Q4562282) (← links)
- Linear Hashing Is Awesome (Q4634035) (← links)
- ON ENUMERATING AND SELECTING DISTANCES (Q4682169) (← links)
- (Q5002669) (← links)
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds (Q5096958) (← links)
- (Q5121902) (← links)
- (Q5140838) (← links)
- Optimal Las Vegas reduction from one-way set reconciliation to error correction (Q5964019) (← links)
- Efficient randomized incremental algorithm for the closest pair problem using Leafary trees (Q6064016) (← links)
- Predecessor on the Ultra-Wide Word RAM (Q6492089) (← links)
