BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Denmark
1 × Latvia
3 × USA
Collaborated with:
Z.Dvir A.Shpilka A.Wigderson J.Bourgain P.Hrubes G.Kol S.Moran M.Braverman A.Rao O.Weinstein G.Malod S.Perifel B.Barak
Talks about:
bound (3) circuit (2) rank (2) multilinear (1) ombinatori (1) tradeoff (1) rectangl (1) geometri (1) compress (1) arithmet (1)

Person: Amir Yehudayoff

DBLP DBLP: Yehudayoff:Amir

Contributed to:

ICALP (1) 20142014
ICALP (1) 20132013
STOC 20122012
STOC 20112011
STOC 20102010
STOC 20082008

Wrote 7 papers:

ICALP-v1-2014-KolMSY #approximate #bound #rank
Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound (GK, SM, AS, AY), pp. 701–712.
ICALP-v1-2013-BravermanRWY
Direct Product via Round-Preserving Compression (MB, AR, OW, AY), pp. 232–243.
STOC-2012-BourgainY
Monotone expansion (JB, AY), pp. 1061–1078.
STOC-2012-DvirMPY #branch #multi #source code
Separating multilinear branching programs and formulas (ZD, GM, SP, AY), pp. 615–624.
STOC-2011-BarakDYW #bound #design #geometry #matrix #rank
Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes (BB, ZD, AY, AW), pp. 519–528.
STOC-2010-HrubesWY #commutative #problem
Non-commutative circuits and the sum-of-squares problem (PH, AW, AY), pp. 667–676.
STOC-2008-DvirSY #bound #trade-off
Hardness-randomness tradeoffs for bounded depth arithmetic circuits (ZD, AS, AY), pp. 741–748.

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.