Publication | Date of Publication | Type |
---|
Random walks on regular trees can not be slowed down | 2024-04-10 | Paper |
Learnability can be independent of set theory (invited paper) | 2023-11-14 | Paper |
A theory of universal learning | 2023-11-14 | Paper |
Shadows of Newton polytopes | 2023-10-23 | Paper |
The discrepancy of greater-than | 2023-09-15 | Paper |
Sharp isoperimetric inequalities for affine quermassintegrals | 2023-07-31 | Paper |
Shadows of newton polytopes | 2023-07-12 | Paper |
Dual Systolic Graphs | 2023-04-11 | Paper |
Replicability and stability in learning | 2023-04-07 | Paper |
On the perceptron's compression | 2022-12-16 | Paper |
On symmetry and initialization for neural networks | 2022-10-13 | Paper |
Explicit exponential lower bounds for exact hyperplane covers | 2022-08-24 | Paper |
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits | 2022-07-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q5088983 | 2022-07-18 | Paper |
On the Communication Complexity of Key-Agreement Protocols. | 2022-07-18 | Paper |
Anticoncentration and the Exact Gap-Hamming Problem | 2022-05-10 | Paper |
An isoperimetric inequality for Hamming balls and local expansion in hypercubes | 2022-02-01 | Paper |
Anti-concentration and the Exact Gap-Hamming Problem | 2022-01-04 | Paper |
Tight bounds on the Fourier growth of bounded functions on the hypercube | 2021-07-13 | Paper |
Pointer chasing via triangular discrimination | 2021-06-15 | Paper |
A lower bound for essential covers of the cube | 2021-05-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q5857609 | 2021-04-01 | Paper |
Slicing the hypercube is not easy | 2021-02-10 | Paper |
On weak \(\epsilon\)-nets and the Radon number | 2021-01-29 | Paper |
An Elementary Exposition of Pisier's Inequality | 2020-09-22 | Paper |
Communication Complexity | 2020-02-04 | Paper |
Separating monotone VP and VNP | 2020-01-30 | Paper |
On the covariance-Hessian relation in evolution strategies | 2019-11-22 | Paper |
Approximate nonnegative rank is equivalent to the smooth rectangle bound | 2019-06-20 | Paper |
Learners that Use Little Information | 2019-02-06 | Paper |
Anti-concentration in most directions | 2018-11-15 | Paper |
Distributed construction of purely additive spanners | 2018-08-16 | Paper |
Sample Compression Schemes for VC Classes | 2018-08-02 | Paper |
Distributed construction of purely additive spanners | 2018-06-01 | Paper |
Sign rank versus Vapnik-Chervonenkis dimension | 2018-04-06 | Paper |
Teaching and Compressing for Low VC-Dimension | 2018-02-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q4601824 | 2018-01-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q4598229 | 2017-12-19 | Paper |
An elementary exposition of topological overlap in the plane | 2017-10-10 | Paper |
Internal Compression of Protocols to Entropy | 2017-08-31 | Paper |
On the Statistical Learning Ability of Evolution Strategies | 2017-06-13 | Paper |
Direct sum fails for zero error average communication | 2017-05-19 | Paper |
Fooling Pairs in Randomized Communication Complexity | 2016-12-01 | Paper |
Direct sum fails for zero-error average communication | 2016-11-29 | Paper |
On statistical learning via the lens of compression | 2016-10-11 | Paper |
Geometric stability via information theory | 2016-10-10 | Paper |
Restriction access | 2016-10-07 | Paper |
Population recovery and partial identification | 2016-03-09 | Paper |
A note on average-case sorting | 2016-03-02 | Paper |
Sign rank versus VC dimension | 2015-03-26 | Paper |
Containing internal diffusion limited aggregation | 2014-09-22 | Paper |
Grounded Lipschitz functions on trees are typically flat | 2014-09-22 | Paper |
Pseudorandom Generators for Regular Branching Programs | 2014-09-18 | Paper |
Non-commutative circuits and the sum-of-squares problem | 2014-08-13 | Paper |
Fractional Sylvester–Gallai theorems | 2014-07-25 | Paper |
Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound | 2014-07-01 | Paper |
Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes | 2014-06-05 | Paper |
Separating multilinear branching programs and formulas | 2014-05-13 | Paper |
Monotone expansion | 2014-05-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q5414598 | 2014-05-06 | Paper |
Direct Product via Round-Preserving Compression | 2013-08-06 | Paper |
Lipschitz Functions on Expanders are Typically Flat | 2013-07-26 | Paper |
Expansion in SL\(_2(\mathbb R)\) and monotone expanders | 2013-07-04 | Paper |
An Asymptotic Bound on the Composition Number of Integer Sums of Squares Formulas | 2013-03-07 | Paper |
Affine extractors over prime fields | 2011-12-20 | Paper |
Homogeneous formulas and symmetric polynomials | 2011-11-30 | Paper |
Loop-erased random walk and Poisson kernel on planar graphs | 2011-10-10 | Paper |
The maximal probability that k‐wise independent bits are all 1 | 2011-08-09 | Paper |
Non-commutative circuits and the sum-of-squares problem | 2011-06-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q3002833 | 2011-05-24 | Paper |
Players' Effects Under Limited Independence | 2011-04-27 | Paper |
Entropy of random walk range | 2011-03-10 | Paper |
Lower bounds and separations for constant depth multilinear circuits | 2011-02-18 | Paper |
Arithmetic Circuits: A survey of recent results and open questions | 2011-01-24 | Paper |
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors | 2011-01-18 | Paper |
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits | 2010-09-06 | Paper |
Monotone separations for constant degree polynomials | 2010-09-02 | Paper |
\(t\)-wise independence with local dependencies | 2010-04-19 | Paper |
Balancing syntactically multilinear arithmetic circuits | 2010-03-15 | Paper |
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits | 2009-08-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q5302099 | 2009-01-05 | Paper |
The Player's Effect | 2008-05-04 | Paper |
Random graph-homomorphisms and logarithmic degree | 2007-11-23 | Paper |