Amir Yehudayoff

From MaRDI portal
Revision as of 14:46, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:251887

Available identifiers

zbMath Open yehudayoff.amirMaRDI QIDQ251887

List of research outcomes





PublicationDate of PublicationType
A lower bound for essential covers of the cube2024-09-19Paper
On Blocky Ranks Of Matrices2024-04-21Paper
Random walks on regular trees can not be slowed down2024-04-10Paper
Learnability can be independent of set theory (invited paper)2023-11-14Paper
A theory of universal learning2023-11-14Paper
Shadows of Newton polytopes2023-10-23Paper
The discrepancy of greater-than2023-09-15Paper
Sharp isoperimetric inequalities for affine quermassintegrals2023-07-31Paper
Shadows of newton polytopes2023-07-12Paper
Dual Systolic Graphs2023-04-11Paper
Replicability and stability in learning2023-04-07Paper
On the perceptron's compression2022-12-16Paper
On symmetry and initialization for neural networks2022-10-13Paper
Explicit exponential lower bounds for exact hyperplane covers2022-08-24Paper
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits2022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50889832022-07-18Paper
On the Communication Complexity of Key-Agreement Protocols.2022-07-18Paper
Anticoncentration and the Exact Gap-Hamming Problem2022-05-10Paper
An isoperimetric inequality for Hamming balls and local expansion in hypercubes2022-02-01Paper
Anti-concentration and the Exact Gap-Hamming Problem2022-01-04Paper
Tight bounds on the Fourier growth of bounded functions on the hypercube2021-07-13Paper
Pointer chasing via triangular discrimination2021-06-15Paper
A lower bound for essential covers of the cube2021-05-28Paper
https://portal.mardi4nfdi.de/entity/Q58576092021-04-01Paper
Slicing the hypercube is not easy2021-02-10Paper
On weak \(\epsilon\)-nets and the Radon number2021-01-29Paper
An Elementary Exposition of Pisier's Inequality2020-09-22Paper
Communication Complexity2020-02-04Paper
Separating monotone VP and VNP2020-01-30Paper
On the covariance-Hessian relation in evolution strategies2019-11-22Paper
Approximate nonnegative rank is equivalent to the smooth rectangle bound2019-06-20Paper
Learners that Use Little Information2019-02-06Paper
Anti-concentration in most directions2018-11-15Paper
Distributed construction of purely additive spanners2018-08-16Paper
Sample Compression Schemes for VC Classes2018-08-02Paper
Distributed construction of purely additive spanners2018-06-01Paper
Sign rank versus Vapnik-Chervonenkis dimension2018-04-06Paper
Teaching and Compressing for Low VC-Dimension2018-02-26Paper
https://portal.mardi4nfdi.de/entity/Q46018242018-01-24Paper
https://portal.mardi4nfdi.de/entity/Q45982292017-12-19Paper
An elementary exposition of topological overlap in the plane2017-10-10Paper
Internal Compression of Protocols to Entropy2017-08-31Paper
On the Statistical Learning Ability of Evolution Strategies2017-06-13Paper
Direct sum fails for zero error average communication2017-05-19Paper
Fooling Pairs in Randomized Communication Complexity2016-12-01Paper
Direct sum fails for zero-error average communication2016-11-29Paper
On statistical learning via the lens of compression2016-10-11Paper
Geometric stability via information theory2016-10-10Paper
Restriction access2016-10-07Paper
Population recovery and partial identification2016-03-09Paper
A note on average-case sorting2016-03-02Paper
Sign rank versus VC dimension2015-03-26Paper
Containing internal diffusion limited aggregation2014-09-22Paper
Grounded Lipschitz functions on trees are typically flat2014-09-22Paper
Pseudorandom Generators for Regular Branching Programs2014-09-18Paper
Non-commutative circuits and the sum-of-squares problem2014-08-13Paper
Fractional Sylvester–Gallai theorems2014-07-25Paper
Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound2014-07-01Paper
Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes2014-06-05Paper
Separating multilinear branching programs and formulas2014-05-13Paper
Monotone expansion2014-05-13Paper
https://portal.mardi4nfdi.de/entity/Q54145982014-05-06Paper
Direct Product via Round-Preserving Compression2013-08-06Paper
Lipschitz Functions on Expanders are Typically Flat2013-07-26Paper
Expansion in SL\(_2(\mathbb R)\) and monotone expanders2013-07-04Paper
An Asymptotic Bound on the Composition Number of Integer Sums of Squares Formulas2013-03-07Paper
Affine extractors over prime fields2011-12-20Paper
Homogeneous formulas and symmetric polynomials2011-11-30Paper
Loop-erased random walk and Poisson kernel on planar graphs2011-10-10Paper
The maximal probability that k‐wise independent bits are all 12011-08-09Paper
Non-commutative circuits and the sum-of-squares problem2011-06-27Paper
https://portal.mardi4nfdi.de/entity/Q30028332011-05-24Paper
Players' Effects Under Limited Independence2011-04-27Paper
Entropy of random walk range2011-03-10Paper
Lower bounds and separations for constant depth multilinear circuits2011-02-18Paper
Arithmetic Circuits: A survey of recent results and open questions2011-01-24Paper
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors2011-01-18Paper
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits2010-09-06Paper
Monotone separations for constant degree polynomials2010-09-02Paper
\(t\)-wise independence with local dependencies2010-04-19Paper
Balancing syntactically multilinear arithmetic circuits2010-03-15Paper
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits2009-08-20Paper
https://portal.mardi4nfdi.de/entity/Q53020992009-01-05Paper
The Player's Effect2008-05-04Paper
Random graph-homomorphisms and logarithmic degree2007-11-23Paper

Research outcomes over time

This page was built for person: Amir Yehudayoff