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
1 × France
2 × Greece
8 × USA
Collaborated with:
I.Volkovich Z.Dvir A.Wigderson M.A.Forbes A.Yehudayoff E.Haramaty Y.Rabani R.Raz E.Abbe R.M.d.Oliveira R.Saptharishi G.Kol S.Moran Z.S.Karnin P.Mukhopadhyay P.Gopalan R.O'Donnell R.A.Servedio K.Wimmer
Talks about:
test (8) polynomi (5) circuit (5) ident (5) depth (5) bound (5) multilinear (2) arithmet (2) equival (2) random (2)

Person: Amir Shpilka

DBLP DBLP: Shpilka:Amir

Contributed to:

STOC 20152015
ICALP (1) 20142014
STOC 20142014
STOC 20122012
ICALP (1) 20102010
STOC 20102010
ICALP (1) 20092009
STOC 20092009
STOC 20082008
STOC 20072007
STOC 20052005
STOC 20042004
STOC 20012001

Wrote 16 papers:

STOC-2015-AbbeSW #fault #random
Reed-Muller Codes for Random Erasures and Errors (EA, AS, AW), pp. 297–306.
ICALP-v1-2014-DvirOS #equivalence #testing
Testing Equivalence of Polynomials under Shifts (ZD, RMdO, AS), pp. 417–428.
ICALP-v1-2014-KolMSY #approximate #bound #rank
Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound (GK, SM, AS, AY), pp. 701–712.
STOC-2014-ForbesSS #algebra #branch #multi #order #set #source code
Hitting sets for multilinear read-once algebraic branching programs, in any order (MAF, RS, AS), pp. 867–875.
STOC-2012-ForbesS #on the #rank #testing
On identity testing of tensors, low-rank recovery and compressed sensing (MAF, AS), pp. 163–172.
ICALP-v1-2010-ShpilkaV #on the #polynomial #testing
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors (AS, IV), pp. 408–419.
STOC-2010-HaramatyS #on the #polynomial
On the structure of cubic and quartic polynomials (EH, AS), pp. 331–340.
STOC-2010-KarninMSV #bound #multi #testing
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in (ZSK, PM, AS, IV), pp. 649–658.
ICALP-v1-2009-GopalanOSSW #fourier #testing
Testing Fourier Dimensionality and Sparsity (PG, RO, RAS, AS, KW), pp. 500–512.
STOC-2009-RabaniS #linear
Explicit construction of a small epsilon-net for linear threshold functions (YR, AS), pp. 649–658.
STOC-2008-DvirSY #bound #trade-off
Hardness-randomness tradeoffs for bounded depth arithmetic circuits (ZD, AS, AY), pp. 741–748.
STOC-2008-ShpilkaV #polynomial #testing
Read-once polynomial identity testing (AS, IV), pp. 507–516.
STOC-2007-Shpilka #multi
Interpolation of depth-3 arithmetic circuits with two multiplication gates (AS), pp. 284–293.
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.
STOC-2004-ShpilkaW #morphism #testing
Derandomizing homomorphism testing in general groups (AS, AW), pp. 427–435.
STOC-2001-RazS #bound #matrix
Lower bounds for matrix product, in bounded depth circuits with arbitrary gates (RR, AS), pp. 409–418.

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.