Linear hashing with _ guarantees and two-sided Kakeya bounds
From MaRDI portal
Publication:6566468
DOI10.46298/THEORETICS.24.8MaRDI QIDQ6566468FDOQ6566468
Authors: Manik Dhar, Zeev Dvir 
Publication date: 3 July 2024
Published in: TheoretiCS (Search for Journal in Brave)
Cites Work
- Universal classes of hash functions
- Title not available (Why is that?)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- Title not available (Why is that?)
- Computational Complexity
- On the size of Kakeya sets in finite fields
- The Kakeya set and maximal conjectures for algebraic varieties over finite fields
- Title not available (Why is that?)
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Furstenberg sets and Furstenberg schemes over finite fields
- Title not available (Why is that?)
- Kakeya-type sets in finite vector spaces
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- Leftover Hash Lemma, Revisited
- Kakeya sets, new mergers, and old extractors
- Linear hash functions
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Sharp density bounds on the finite field Kakeya problem
- On the arithmetic Kakeya conjecture of Katz and Tao
- New bounds on the density of lattice coverings
- Mitigating Dictionary Attacks on Password-Protected Local Storage
- Furstenberg sets in finite fields: explaining and improving the Ellenberg-Erman proof
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)
