| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Abhishek Bhowmick, Zeev Dvir, Shachar Lovett |
New Lower Bounds for Matching Vector Codes.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Abhishek Bhowmick, Zeev Dvir, Shachar Lovett |
New Lower Bounds for Matching Vector Codes |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, János Kollár, Shachar Lovett |
Variety Evasive Sets |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff |
Restriction access. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Shachar Lovett |
Subspace evasive sets. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff |
Separating multilinear branching programs and formulas. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff |
Separating multilinear branching programs and formulas. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff |
Restriction Access. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Shachar Lovett |
Subspace Evasive Sets. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka |
Tight lower bounds for 2-query LCCs over finite fields. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
Noisy Interpolating Sets for Low-Degree Polynomials. |
Theory of Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
Towards dimension expanders over finite fields. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir |
On Matrix Rigidity and Locally Self-correctable Codes. |
Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Shachar Lovett |
Subspace Evasive Sets |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Avi Wigderson |
Kakeya Sets, New Mergers, and Old Extractors. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin |
Matching Vector Codes. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan |
On Approximating the Entropy of Polynomial Mappings. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Zeev Dvir, Amir Shpilka, Shubhangi Saraf |
Tight Lower Bounds for 2-query LCCs over Finite Fields. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Zeev Dvir, Amir Yehudayoff, Avi Wigderson |
Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin |
Matching Vector Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan |
On Approximating the Entropy of Polynomial Mappings. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Avi Wigderson |
Monotone Expanders: Constructions and Applications. |
Theory of Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Zeev Dvir, Avi Wigderson, Amir Yehudayoff |
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin |
Matching Vector Codes. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir |
On Matrix Rigidity and Locally Self-Correctable Codes. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
complexity, arithmetic circuits, matrices |
| 1 | Zeev Dvir |
From Randomness Extraction to Rotating Needles. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Avi Wigderson |
Monotone expanders - constructions and applications. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff |
Pseudorandomness for Width 2 Branching Programs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir |
On matrix rigidity and locally self-correctable codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Ariel Gabizon, Avi Wigderson |
Extractors And Rank Extractors For Polynomial Sources. |
Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
Derandomization, Extractors |
| 1 | Zeev Dvir |
Guest column: from randomness extraction to rotating needles. |
SIGACT News |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan |
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Polynomial method, Randomness, Extractors |
| 1 | Zeev Dvir |
Extractors for Varieties. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Avi Wigderson |
Kakeya sets, new mergers and old extractors. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir |
Deterministic Extractors for Algebraic Sources. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
Noisy Interpolating Sets for Low Degree Polynomials. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Ran Raz |
Analyzing linear mergers. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Avi Wigderson |
Kakeya Sets, New Mergers and Old Extractors. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
Noisy Interpolating Sets for Low Degree Polynomials. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
Error correcting codes, Polynomial interpolation |
| 1 | Zeev Dvir, Amir Shpilka |
Towards Dimension Expanders over Finite Fields. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
Cayley graphs, expanders, explicit constructions |
| 1 | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
Hardness-randomness tradeoffs for bounded depth arithmetic circuits. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, hardness-randomness tradeoffs, identity testing, lower bounds, arithmetic circuits |
| 1 | Zeev Dvir, Amir Shpilka |
Towards Dimension Expanders Over Finite Fields. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Ariel Gabizon, Avi Wigderson |
Extractors and Rank Extractors for Polynomial Sources. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
An Improved Analysis of Linear Mergers. |
Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
68W20, Subject classification |
| 1 | Zeev Dvir, Amir Shpilka |
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Ariel Gabizon, Avi Wigderson |
Extractors and Rank Extractors for Polynomial Sources. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
An Improved Analysis of Mergers |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
Locally Decodable Codes with 2 queries and Polynomial Identity Testing for depth 3 circuits |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Ran Raz |
Analyzing Linear Mergers |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
An Improved Analysis of Mergers. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
depth 3 circuits, locally decodable codes, polynomial identity testing |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")