Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Shpilka, Amir - Department of Computer Science, Technion, Israel Institute of Technology
On the Structure of Cubic and Quartic Polynomials Elad Haramaty
The Black-Box Query Complexity of Polynomial Department of Computer Science
Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model
Finding Collisions in Interactive Protocols A Tight Lower Bound on the Round Complexity
Lower Bounds for Matrix Product, in Bounded Depth Circuits with Arbitrary Gates
On the Minimal Fourier Degree of Symmetric Boolean Functions Amir Shpilka
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
Fault Analysis of Stream Ciphers Jonathan J. Hoch and Adi Shamir
Lattice Problems and Norm Embeddings Oded Regev
1,2006.:' ,' coheng@gmail.com
Breaking the ICE -Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
Efficiently Constructible Huge Graphs that Preserve First Order Properties of Random Graphs
Depth-3 Arithmetic Circuits over Fields of Characteristic Zero Amir Shpilka y Avi Wigderson z
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields
On the power of Quantum Proofs Amir Shpilka
On Sums of Locally Testable Affine Invariant Properties Eli Ben-Sasson
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
Why almost all kcolorable graphs are easy to color Amin CojaOghlan # Michael Krivelevich + Dan Vilenchik #
Affine Projections of Symmetric Polynomials Amir Shpilka
On the degree of symmetric functions on the Boolean Amir Shpilka
On the Complexity of Boolean Functions in Different Characteristics
Explicit construction of a small epsilon-net for linear threshold Yuval Rabani
Hardness Amplification Proofs Require Majority Ronen Shaltiel # Emanuele Viola +
Locally Testable Cyclic Codes Laszlo Babai
Arithmetic Circuits: a survey of recent results and open questions
Lower Bounds for Small Depth Arithmetic and Boolean Circuits
Locally Decodable Codes with 2 queries and Polynomial Identity Testing for depth 3 circuits
Lowend uniform hardness vs. randomness tradeoffs for AM
Symmetric LDPC codes are not necessarily locally testable Eli Ben-Sasson
Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in
Improved Polynomial Identity Testing for Read-Once Formulas Amir Shpilka
Read-Once Polynomial Identity Testing Amir Shpilka
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
Testing Fourier dimensionality and sparsity Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio,
Noisy Interpolating Sets for Low Degree Polynomials Amir Shpilka
Towards Dimension Expanders Over Finite Fields Department of Computer Science
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
An Improved Analysis of Linear Mergers Amir Shpilka
Deterministic Polynomial Identity Testing in Non Commutative Models
On -Biased Generators in NC0 Elchanan Mossel
Metric Embeddings with Relaxed Guarantees Ittai Abraham
All Natural NPC Problems Have Average-Case Complete Versions Noam Livne
Unconditional Pseudorandom Generators for Low Degree Polynomials
Optimal testing of multivariate polynomials over small prime fields Elad Haramaty
LowerStretch Spanning Trees Michael Elkin #
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
Lower Bounds for Matrix Product Amir Shpilka
Read-once Polynomial Identity Testing I. Volkovich
Learning Restricted Models of Arithmetic Circuits Adam R. Klivans
Tight lower bounds for 2-query LCCs over finite fields Arnab Bhattacharyya
Explicit Dimension Reduction and Its Applications Zohar S. Karnin
Constructions of low-degree and error-correcting -biased generators
Constructions of lowdegree and errorcorrecting #biased Amir Shpilka
On the Degree of Univariate Polynomials Over the Integers Amir Shpilka
Derandomizing Homomorphism Testing in General Groups Amir Shpilka
On the Benfits of Adaptivity in Property Testing of Dense Graphs Department of EE Systems
New constructions of WOM codes using the Wozencraft Amir Shpilka
On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing