 | 2012 |
|---|
| 55 |       | Zeev Dvir,
Anup Rao,
Avi Wigderson,
Amir Yehudayoff:
Restriction access.
ITCS 2012: 19-33 |
| 54 | | Zeev Dvir,
Shachar Lovett:
Subspace evasive sets.
STOC 2012: 351-358 |
| 53 | | Zeev Dvir,
Guillaume Malod,
Sylvain Perifel,
Amir Yehudayoff:
Separating multilinear branching programs and formulas.
STOC 2012: 615-624 |
| 52 | | Zeev Dvir,
János Kollár,
Shachar Lovett:
Variety Evasive Sets
CoRR abs/1203.4532: (2012) |
| 51 | | Abhishek Bhowmick,
Zeev Dvir,
Shachar Lovett:
New Lower Bounds for Matching Vector Codes
CoRR abs/1204.1367: (2012) |
| 50 | | Abhishek Bhowmick,
Zeev Dvir,
Shachar Lovett:
New Lower Bounds for Matching Vector Codes.
Electronic Colloquium on Computational Complexity (ECCC) 19: 34 (2012) |
| 2011 |
|---|
| 49 | | Arnab Bhattacharyya,
Zeev Dvir,
Amir Shpilka,
Shubhangi Saraf:
Tight Lower Bounds for 2-query LCCs over Finite Fields.
FOCS 2011: 638-647 |
| 48 | | Zeev Dvir,
Dan Gutfreund,
Guy N. Rothblum,
Salil P. Vadhan:
On Approximating the Entropy of Polynomial Mappings.
ICS 2011: 460-475 |
| 47 | | Boaz Barak,
Zeev Dvir,
Amir Yehudayoff,
Avi Wigderson:
Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes.
STOC 2011: 519-528 |
| 46 | | Zeev Dvir,
Shachar Lovett:
Subspace Evasive Sets
CoRR abs/1110.5696: (2011) |
| 45 | | Zeev Dvir,
Amir Shpilka:
Towards dimension expanders over finite fields.
Combinatorica 31(3): 305-320 (2011) |
| 44 | | Zeev Dvir:
On Matrix Rigidity and Locally Self-correctable Codes.
Computational Complexity 20(2): 367-388 (2011) |
| 43 | | Zeev Dvir,
Guillaume Malod,
Sylvain Perifel,
Amir Yehudayoff:
Separating multilinear branching programs and formulas.
Electronic Colloquium on Computational Complexity (ECCC) 18: 134 (2011) |
| 42 | | Zeev Dvir,
Shachar Lovett:
Subspace Evasive Sets.
Electronic Colloquium on Computational Complexity (ECCC) 18: 139 (2011) |
| 41 | | Zeev Dvir,
Anup Rao,
Avi Wigderson,
Amir Yehudayoff:
Restriction Access.
Electronic Colloquium on Computational Complexity (ECCC) 18: 160 (2011) |
| 40 | | Arnab Bhattacharyya,
Zeev Dvir,
Shubhangi Saraf,
Amir Shpilka:
Tight lower bounds for 2-query LCCs over finite fields.
Electronic Colloquium on Computational Complexity (ECCC) 18: 54 (2011) |
| 39 | | Zeev Dvir,
Avi Wigderson:
Kakeya Sets, New Mergers, and Old Extractors.
SIAM J. Comput. 40(3): 778-792 (2011) |
| 38 | | Zeev Dvir,
Parikshit Gopalan,
Sergey Yekhanin:
Matching Vector Codes.
SIAM J. Comput. 40(4): 1154-1178 (2011) |
| 37 | | Zeev Dvir,
Amir Shpilka:
Noisy Interpolating Sets for Low-Degree Polynomials.
Theory of Computing 7(1): 1-18 (2011) |
| 2010 |
|---|
| 36 | | Zeev Dvir,
Parikshit Gopalan,
Sergey Yekhanin:
Matching Vector Codes.
FOCS 2010: 705-714 |
| 35 | | Zeev Dvir:
On Matrix Rigidity and Locally Self-Correctable Codes.
IEEE Conference on Computational Complexity 2010: 291-298 |
| 34 | | Boaz Barak,
Zeev Dvir,
Avi Wigderson,
Amir Yehudayoff:
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes
CoRR abs/1009.4375: (2010) |
| 33 | | Zeev Dvir,
Parikshit Gopalan,
Sergey Yekhanin:
Matching Vector Codes.
Electronic Colloquium on Computational Complexity (ECCC) 17: 12 (2010) |
| 32 | | Boaz Barak,
Zeev Dvir,
Avi Wigderson,
Amir Yehudayoff:
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes.
Electronic Colloquium on Computational Complexity (ECCC) 17: 149 (2010) |
| 31 | | Zeev Dvir,
Dan Gutfreund,
Guy N. Rothblum,
Salil P. Vadhan:
On Approximating the Entropy of Polynomial Mappings.
Electronic Colloquium on Computational Complexity (ECCC) 17: 160 (2010) |
| 30 | | Zeev Dvir,
Avi Wigderson:
Monotone Expanders: Constructions and Applications.
Theory of Computing 6(1): 291-308 (2010) |
| 2009 |
|---|
| 29 | | Zeev Dvir,
Swastik Kopparty,
Shubhangi Saraf,
Madhu Sudan:
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers.
FOCS 2009: 181-190 |
| 28 | | Zeev Dvir:
Extractors for Varieties.
IEEE Conference on Computational Complexity 2009: 102-113 |
| 27 | | Zeev Dvir,
Ariel Gabizon,
Avi Wigderson:
Extractors And Rank Extractors For Polynomial Sources.
Computational Complexity 18(1): 1-58 (2009) |
| 26 | | Zeev Dvir:
On matrix rigidity and locally self-correctable codes.
Electronic Colloquium on Computational Complexity (ECCC) 16: 134 (2009) |
| 25 | | Zeev Dvir,
Avi Wigderson:
Monotone expanders - constructions and applications.
Electronic Colloquium on Computational Complexity (ECCC) 16: 135 (2009) |
| 24 | | Zeev Dvir,
Swastik Kopparty,
Shubhangi Saraf,
Madhu Sudan:
Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Mergers.
Electronic Colloquium on Computational Complexity (ECCC) 16: 4 (2009) |
| 23 | | Andrej Bogdanov,
Zeev Dvir,
Elad Verbin,
Amir Yehudayoff:
Pseudorandomness for Width 2 Branching Programs.
Electronic Colloquium on Computational Complexity (ECCC) 16: 70 (2009) |
| 22 | | Zeev Dvir:
From Randomness Extraction to Rotating Needles.
Electronic Colloquium on Computational Complexity (ECCC) 16: 77 (2009) |
| 21 | | Zeev Dvir,
Amir Shpilka,
Amir Yehudayoff:
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits.
SIAM J. Comput. 39(4): 1279-1293 (2009) |
| 20 | | Zeev Dvir:
Guest column: from randomness extraction to rotating needles.
SIGACT News 40(4): 46-61 (2009) |
| 2008 |
|---|
| 19 | | Zeev Dvir,
Avi Wigderson:
Kakeya Sets, New Mergers and Old Extractors.
FOCS 2008: 625-633 |
| 18 | | Zeev Dvir,
Amir Shpilka:
Noisy Interpolating Sets for Low Degree Polynomials.
IEEE Conference on Computational Complexity 2008: 140-148 |
| 17 | | Zeev Dvir,
Amir Shpilka:
Towards Dimension Expanders over Finite Fields.
IEEE Conference on Computational Complexity 2008: 304-310 |
| 16 | | Zeev Dvir,
Amir Shpilka,
Amir Yehudayoff:
Hardness-randomness tradeoffs for bounded depth arithmetic circuits.
STOC 2008: 741-748 |
| 15 | | Zeev Dvir,
Amir Shpilka:
Noisy Interpolating Sets for Low Degree Polynomials.
Electronic Colloquium on Computational Complexity (ECCC) 15(004): (2008) |
| 14 | | Zeev Dvir:
Deterministic Extractors for Algebraic Sources.
Electronic Colloquium on Computational Complexity (ECCC) 15(042): (2008) |
| 13 | | Zeev Dvir,
Avi Wigderson:
Kakeya sets, new mergers and old extractors.
Electronic Colloquium on Computational Complexity (ECCC) 15(058): (2008) |
| 12 | | Zeev Dvir,
Ran Raz:
Analyzing linear mergers.
Random Struct. Algorithms 32(3): 334-345 (2008) |
| 2007 |
|---|
| 11 | | Zeev Dvir,
Ariel Gabizon,
Avi Wigderson:
Extractors and Rank Extractors for Polynomial Sources.
FOCS 2007: 52-62 |
| 10 | | Zeev Dvir,
Amir Shpilka:
An Improved Analysis of Linear Mergers.
Computational Complexity 16(1): 34-59 (2007) |
| 9 | | Zeev Dvir,
Ariel Gabizon,
Avi Wigderson:
Extractors and Rank Extractors for Polynomial Sources.
Electronic Colloquium on Computational Complexity (ECCC) 14(056): (2007) |
| 8 | | Zeev Dvir,
Amir Shpilka,
Amir Yehudayoff:
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits.
Electronic Colloquium on Computational Complexity (ECCC) 14(121): (2007) |
| 7 | | Zeev Dvir,
Amir Shpilka:
Towards Dimension Expanders Over Finite Fields.
Electronic Colloquium on Computational Complexity (ECCC) 14(122): (2007) |
| 6 | | Zeev Dvir,
Amir Shpilka:
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits.
SIAM J. Comput. 36(5): 1404-1434 (2007) |
| 2005 |
|---|
| 5 | | Zeev Dvir,
Amir Shpilka:
An Improved Analysis of Mergers.
APPROX-RANDOM 2005: 270-281 |
| 4 | | Zeev Dvir,
Amir Shpilka:
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits.
STOC 2005: 592-601 |
| 3 | | Zeev Dvir,
Ran Raz:
Analyzing Linear Mergers
Electronic Colloquium on Computational Complexity (ECCC)(025): (2005) |
| 2 | | Zeev Dvir,
Amir Shpilka:
Locally Decodable Codes with 2 queries and Polynomial Identity Testing for depth 3 circuits
Electronic Colloquium on Computational Complexity (ECCC)(044): (2005) |
| 1 | | Zeev Dvir,
Amir Shpilka:
An Improved Analysis of Mergers
Electronic Colloquium on Computational Complexity (ECCC)(067): (2005) |
Data released under the ODC-BY 1.0 license — See also our legal information page