| 2008 |
|---|
| 19 | EE | Zeev Dvir,
Avi Wigderson:
Kakeya Sets, New Mergers and Old Extractors.
FOCS 2008: 625-633 |
| 18 | EE | Zeev Dvir,
Amir Shpilka:
Noisy Interpolating Sets for Low Degree Polynomials.
IEEE Conference on Computational Complexity 2008: 140-148 |
| 17 | EE | Zeev Dvir,
Amir Shpilka:
Towards Dimension Expanders over Finite Fields.
IEEE Conference on Computational Complexity 2008: 304-310 |
| 16 | EE | Zeev Dvir,
Amir Shpilka,
Amir Yehudayoff:
Hardness-randomness tradeoffs for bounded depth arithmetic circuits.
STOC 2008: 741-748 |
| 15 | EE | Zeev Dvir,
Amir Shpilka:
Noisy Interpolating Sets for Low Degree Polynomials.
Electronic Colloquium on Computational Complexity (ECCC) 15(004): (2008) |
| 14 | EE | Zeev Dvir:
Deterministic Extractors for Algebraic Sources.
Electronic Colloquium on Computational Complexity (ECCC) 15(042): (2008) |
| 13 | EE | Zeev Dvir,
Avi Wigderson:
Kakeya sets, new mergers and old extractors.
Electronic Colloquium on Computational Complexity (ECCC) 15(058): (2008) |
| 12 | EE | Zeev Dvir,
Ran Raz:
Analyzing linear mergers.
Random Struct. Algorithms 32(3): 334-345 (2008) |
| 2007 |
|---|
| 11 | EE | Zeev Dvir,
Ariel Gabizon,
Avi Wigderson:
Extractors and Rank Extractors for Polynomial Sources.
FOCS 2007: 52-62 |
| 10 | EE | Zeev Dvir,
Amir Shpilka:
An Improved Analysis of Linear Mergers.
Computational Complexity 16(1): 34-59 (2007) |
| 9 | EE | Zeev Dvir,
Ariel Gabizon,
Avi Wigderson:
Extractors and Rank Extractors for Polynomial Sources.
Electronic Colloquium on Computational Complexity (ECCC) 14(056): (2007) |
| 8 | EE | Zeev Dvir,
Amir Shpilka,
Amir Yehudayoff:
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits.
Electronic Colloquium on Computational Complexity (ECCC) 14(121): (2007) |
| 7 | EE | Zeev Dvir,
Amir Shpilka:
Towards Dimension Expanders Over Finite Fields.
Electronic Colloquium on Computational Complexity (ECCC) 14(122): (2007) |
| 6 | EE | 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 | EE | Zeev Dvir,
Amir Shpilka:
An Improved Analysis of Mergers.
APPROX-RANDOM 2005: 270-281 |
| 4 | EE | Zeev Dvir,
Amir Shpilka:
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits.
STOC 2005: 592-601 |
| 3 | EE | Zeev Dvir,
Ran Raz:
Analyzing Linear Mergers
Electronic Colloquium on Computational Complexity (ECCC)(025): (2005) |
| 2 | EE | 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 | EE | Zeev Dvir,
Amir Shpilka:
An Improved Analysis of Mergers
Electronic Colloquium on Computational Complexity (ECCC)(067): (2005) |
