The following pages link to Zeev Dvir (Q347125):
Displaying 50 items.
- Affine extractors over large fields with exponential error (Q347127) (← links)
- Variety evasive sets (Q475333) (← links)
- (Q519965) (redirect page) (← links)
- Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. (Q519967) (← links)
- Extractors and rank extractors for polynomial sources (Q626610) (← links)
- On matrix rigidity and locally self-correctable codes (Q645122) (← links)
- Towards dimension expanders over finite fields (Q654002) (← links)
- Sylvester-Gallai for arrangements of subspaces (Q728498) (← links)
- A Sauer-Shelah-Perles lemma for sumsets (Q1627216) (← links)
- Extractors for varieties (Q1926108) (← links)
- A Sauer-Shelah-Perles lemma for lattices (Q2209889) (← links)
- A quantitative variant of the multi-colored Motzkin-Rabin theorem (Q2256582) (← links)
- On the number of ordinary lines determined by sets in complex space (Q2415380) (← links)
- An improved analysis of linear mergers (Q2472428) (← links)
- Restriction access (Q2826041) (← links)
- Matching-Vector Families and LDCs over Large Modulo (Q2851882) (← links)
- Incidence Theorems and Their Applications (Q2871574) (← links)
- SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY (Q2879416) (← links)
- IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM (Q2879417) (← links)
- 2-Server PIR with Sub-Polynomial Communication (Q2941552) (← links)
- (Q3002825) (← links)
- (Q3002826) (← links)
- On the size of Kakeya sets in finite fields (Q3058273) (← links)
- Kakeya Sets, New Mergers, and Old Extractors (Q3093623) (← links)
- Matching Vector Codes (Q3096097) (← links)
- Analyzing linear mergers (Q3503607) (← links)
- Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits (Q3581452) (← links)
- Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits (Q3586180) (← links)
- On the number of ordinary lines determined by sets in complex space (Q4580087) (← links)
- (Q4591373) (← links)
- Outlaw distributions and locally decodable codes (Q4638069) (← links)
- (Q5028497) (← links)
- Proof of the Kakeya set conjecture over rings of integers modulo square-free N (Q5048441) (← links)
- Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5090407) (← links)
- Fourier and circulant matrices are not rigid (Q5091768) (← links)
- Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5112250) (← links)
- Lower Bounds for Approximate LDCs (Q5167747) (← links)
- Testing Equivalence of Polynomials under Shifts (Q5167761) (← links)
- Fractional Sylvester–Gallai theorems (Q5170981) (← links)
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers (Q5171174) (← links)
- New Bounds for Matching Vector Families (Q5173250) (← links)
- Matrix rigidity and the Croot-Lev-Pach lemma (Q5204826) (← links)
- (Q5204830) (← links)
- Static data structure lower bounds imply rigidity (Q5212837) (← links)
- Breaking the quadratic barrier for 3-LCC's over the reals (Q5259614) (← links)
- (Q5302099) (← links)
- Sylvester-Gallai for Arrangements of Subspaces (Q5368674) (← links)
- On the number of rich lines in truly high dimensional sets (Q5368714) (← links)
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers (Q5408768) (← links)
- Subspace evasive sets (Q5415486) (← links)
