210 citations · 238 across the 24 of their papers we have counts for
8 papers · 1 filter
On the number of rich lines in truly high dimensional sets
Zeev Dvir, Sivakanth Gopi
We prove a new upper bound on the number of -rich lines (lines with at least points) in a `truly' -dimensional configuration of points .…
Sylvester-Gallai for Arrangements of Subspaces
Zeev Dvir, Guangda Hu
In this work we study arrangements of -dimensional subspaces . Our main result shows that, if every pair of subspaces is cont…
2-Server PIR with sub-polynomial communication
Zeev Dvir, Sivakanth Gopi
A 2-server Private Information Retrieval (PIR) scheme allows a user to retrieve the th bit of an -bit database replicated among two servers (which do not communicate) while n…
A quantitative variant of the multi-colored Motzkin-Rabin theorem
Zeev Dvir, Christian Tessier-Lavigne
We prove a quantitative version of the multi-colored Motzkin-Rabin theorem in the spirit of [BDWY12]: Let be disjoint sets of points (of `color…
Factors of Sparse Polynomials are Sparse
Zeev Dvir, Rafael Mendes de Oliveira
This paper was removed due to an error in the proof (Claim 4.12 as stated is not true). The authors would like to thank Ilya Volkovich for pointing out a counterexample to this pap…
Lower Bounds for Approximate LDC
Jop Briët, Zeev Dvir, Guangda Hu +1
We study an approximate version of -query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A -query -a…