dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Amir Shpilka (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZohar Shay Karnin, Yuval Rabani, Amir Shpilka: Explicit Dimension Reduction and Its Applications. SIAM J. Comput. 41(1): 219-249 (2012)
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZohar Shay Karnin, Yuval Rabani, Amir Shpilka: Explicit Dimension Reduction and Its Applications. IEEE Conference on Computational Complexity 2011: 262-272
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZohar Shay Karnin, Amir Shpilka: Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in. Combinatorica 31(3): 333-364 (2011)
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich: Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in. STOC 2010: 649-658
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZohar Shay Karnin, Amir Shpilka: Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in. IEEE Conference on Computational Complexity 2009: 274-285
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich: Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in. Electronic Colloquium on Computational Complexity (ECCC) 16: 116 (2009)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZohar Shay Karnin, Yuval Rabani, Amir Shpilka: Explicit Dimension Reduction and Its Applications. Electronic Colloquium on Computational Complexity (ECCC) 16: 121 (2009)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZohar Shay Karnin, Amir Shpilka: Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In. IEEE Conference on Computational Complexity 2008: 280-291
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZohar Shay Karnin, Amir Shpilka: Black Box Polynomial Identity Testing of Depth-3 Arithmetic Circuits with Bounded Top Fan-in. Electronic Colloquium on Computational Complexity (ECCC) 14(042): (2007)

Selection of 9 from 100 records - Amir Shpilka has 37 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page