The following pages link to Amir Yehudayoff (Q251887):
Displaying 50 items.
- Population recovery and partial identification (Q255358) (← links)
- Direct sum fails for zero-error average communication (Q343859) (← links)
- Expansion in SL\(_2(\mathbb R)\) and monotone expanders (Q352121) (← links)
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors (Q619913) (← links)
- Lower bounds and separations for constant depth multilinear circuits (Q626617) (← links)
- Entropy of random walk range (Q629789) (← links)
- Homogeneous formulas and symmetric polynomials (Q649096) (← links)
- Affine extractors over prime fields (Q653998) (← links)
- Loop-erased random walk and Poisson kernel on planar graphs (Q717878) (← links)
- Containing internal diffusion limited aggregation (Q743018) (← links)
- Grounded Lipschitz functions on trees are typically flat (Q743023) (← links)
- \(t\)-wise independence with local dependencies (Q963369) (← links)
- Monotone separations for constant degree polynomials (Q990088) (← links)
- On the covariance-Hessian relation in evolution strategies (Q2007723) (← links)
- An isoperimetric inequality for Hamming balls and local expansion in hypercubes (Q2073309) (← links)
- On symmetry and initialization for neural networks (Q2081638) (← links)
- On the perceptron's compression (Q2106618) (← links)
- Explicit exponential lower bounds for exact hyperplane covers (Q2166321) (← links)
- On weak \(\epsilon\)-nets and the Radon number (Q2223615) (← links)
- Balancing syntactically multilinear arithmetic circuits (Q2269004) (← links)
- An elementary exposition of topological overlap in the plane (Q2408206) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- Random graph-homomorphisms and logarithmic degree (Q2461995) (← links)
- Restriction access (Q2826041) (← links)
- Geometric stability via information theory (Q2826226) (← links)
- Fooling Pairs in Randomized Communication Complexity (Q2835016) (← links)
- Lipschitz Functions on Expanders are Typically Flat (Q2841490) (← links)
- Direct sum fails for zero error average communication (Q2988905) (← links)
- (Q3002833) (← links)
- Arithmetic Circuits: A survey of recent results and open questions (Q3069052) (← links)
- Players' Effects Under Limited Independence (Q3169075) (← links)
- Sample Compression Schemes for VC Classes (Q3177793) (← links)
- Pseudorandom Generators for Regular Branching Programs (Q3190691) (← links)
- A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits (Q3395047) (← links)
- Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits (Q3586180) (← links)
- (Q4598229) (← links)
- (Q4601824) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- Learners that Use Little Information (Q4617590) (← links)
- An Asymptotic Bound on the Composition Number of Integer Sums of Squares Formulas (Q4908896) (← links)
- Pointer chasing via triangular discrimination (Q4993101) (← links)
- Anticoncentration and the Exact Gap-Hamming Problem (Q5074948) (← links)
- (Q5088983) (← links)
- On the Communication Complexity of Key-Agreement Protocols. (Q5090417) (← links)
- Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits (Q5091231) (← links)
- Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound (Q5167784) (← links)
- Fractional Sylvester–Gallai theorems (Q5170981) (← links)
- The maximal probability that <i>k</i>‐wise independent bits are all 1 (Q5198667) (← links)
- Separating monotone VP and VNP (Q5212783) (← links)
