פרופ'/ח' אמיר שפילקה

פרופ'/ח' אמיר שפילקה

יצירת קשר
דף בית:
http://www.cs.technion.ac.il/~shpilka
דואר אלקטרוני:
shpilka[at]cs.technion.ac.il
משרד:
521
טלפון:
4907
שעות קבלה:
Sunday, 9:30-10:30
תחומי עניין במחקר
תיאוריה של מדעי המחשב: סיבוכיות חישובים ובמיוחד סיבוכיות של מעגלים אריתמטים; קשרים בין התורה של קודים מתקני שגיאות לבעיות בסיבוכיות של חישובים; בעיות אלגבריות במדעי המחשב; בעיות דה-רנדומיזציה.
פרסומים נבחרים
  • L{\'a}szl{\'o} Babai, Amir Shpilka and Daniel Stefankovic.
    Locally testable cyclic codes.
    IEEE Transactions on Information Theory, 51(8):2849-2858, 2005 [bibtex]
  • Zeev Dvir and Amir Shpilka.
    Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits.
    In Proceedings of the 37th Annual STOC, 592-601, 2005 [bibtex]
  • Zeev Dvir and Amir Shpilka.
    An improved analysis of mergers.
    In Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, LNCS, 3624:270-281, 2005 [bibtex]
  • Adam Klivans and Amir Shpilka.
    Learning Arithmetic Circuits.
    In 16th Annual Conference on Learning Theory, 463-476, 2003 [bibtex]
  • Elchanan Mossel, Amir Shpilka and Luca Trevisan.
    On $\epsilon$-biased generators in $NC^0$.
    In 44th Annual FOCS, 136-145, 2003 [bibtex]
  • Ran Raz and Amir Shpilka.
    Lower bounds for matrix product, in bounded depth circuits with arbitrary gates.
    SIAM J. on Computing, 32(2):488-513, 2003 [bibtex]
  • Ran Raz and Amir Shpilka.
    Deterministic Polynomial Identity Testing in Non Commutative Models.
    J. of Computational Complexity, 14(1):1-19, 2005 [bibtex]
  • Ran Raz and Amir Shpilka.
    On the Power of Quantum Proofs.
    In 19th Annual IEEE Conference on Computational Complexity, 260-274, 2004 [bibtex]
  • Amir Shpilka.
    Affine projections of symmetric polynomials.
    J. of Computers and System Sciences, 65(4):639-659, 2002 [bibtex]
  • Amir Shpilka.
    Lower Bounds for Matrix Product.
    SIAM J. on Computing, 32(5):1185-1200, 2003 [bibtex]
  • Amir Shpilka and Avi Wigderson.
    Depth-3 Arithmetic Circuits over Fields of Characteristic Zero.
    Computational Complexity, 10(1):1-27, 2001 [bibtex]
  • Amir Shpilka and Avi Wigderson.
    Derandomizing homomorphism testing in general groups.
    In Proceedings of the 36th Annual STOC, 427-435, 2004 [bibtex]
[bibtex errors]