Linear hashing with _ guarantees and two-sided Kakeya bounds
From MaRDI portal
Publication:6566468
Cites work
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1301967 (Why is no real title available?)
- scientific article; zbMATH DE number 1303711 (Why is no real title available?)
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Computational Complexity
- Extensions to the method of multiplicities, with applications to Kakeya sets and mergers
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Furstenberg sets and Furstenberg schemes over finite fields
- Furstenberg sets in finite fields: explaining and improving the Ellenberg-Erman proof
- Kakeya sets, new mergers, and old extractors
- Kakeya-type sets in finite vector spaces
- Leftover Hash Lemma, Revisited
- Linear hash functions
- Mitigating Dictionary Attacks on Password-Protected Local Storage
- New bounds on the density of lattice coverings
- On the arithmetic Kakeya conjecture of Katz and Tao
- On the size of Kakeya sets in finite fields
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- Sharp density bounds on the finite field Kakeya problem
- Simple proofs for Furstenberg sets over finite fields
- The Kakeya set and maximal conjectures for algebraic varieties over finite fields
- Universal classes of hash functions
This page was built for publication: Linear hashing with \(\ell_\infty\) guarantees and two-sided Kakeya bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566468)
