BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Denmark
6 × USA
Collaborated with:
A.Shpilka S.Lovett A.Yehudayoff S.Saraf A.Wigderson S.Gopi R.M.d.Oliveira A.Bhowmick J.Briët G.Hu G.Malod S.Perifel B.Barak
Talks about:
bound (4) polynomi (3) circuit (2) local (2) depth (2) test (2) code (2) multilinear (1) ombinatori (1) tradeoff (1)

Person: Zeev Dvir

DBLP DBLP: Dvir:Zeev

Contributed to:

STOC 20152015
ICALP (1) 20142014
STOC 20142014
STOC 20132013
STOC 20122012
STOC 20112011
STOC 20082008
STOC 20052005

Wrote 10 papers:

STOC-2015-DvirG #communication
2-Server PIR with Sub-Polynomial Communication (ZD, SG), pp. 577–584.
ICALP-v1-2014-BrietDHS #approximate #bound
Lower Bounds for Approximate LDCs (JB, ZD, GH, SS), pp. 259–270.
ICALP-v1-2014-DvirOS #equivalence #testing
Testing Equivalence of Polynomials under Shifts (ZD, RMdO, AS), pp. 417–428.
STOC-2014-DvirSW #polynomial
Breaking the quadratic barrier for 3-LCC’s over the reals (ZD, SS, AW), pp. 784–793.
STOC-2013-BhowmickDL #bound #product line
New bounds for matching vector families (AB, ZD, SL), pp. 823–832.
STOC-2012-DvirL #set
Subspace evasive sets (ZD, SL), pp. 351–358.
STOC-2012-DvirMPY #branch #multi #source code
Separating multilinear branching programs and formulas (ZD, GM, SP, AY), pp. 615–624.
STOC-2011-BarakDYW #bound #design #geometry #matrix #rank
Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes (BB, ZD, AY, AW), pp. 519–528.
STOC-2008-DvirSY #bound #trade-off
Hardness-randomness tradeoffs for bounded depth arithmetic circuits (ZD, AS, AY), pp. 741–748.
STOC-2005-DvirS #polynomial #query #testing
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits (ZD, AS), pp. 592–601.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.