2 citations · 4 across the 5 of their papers we have counts for
5 papers
Dual Systolic Graphs
Daniel Carmon, Amir Yehudayoff
We define a family of graphs we call dual systolic graphs. This definition comes from graphs that are duals of systolic simplicial complexes. Our main result is a sharp (up to cons…
Replicability and stability in learning
Zachary Chase, Shay Moran, Amir Yehudayoff
Replicability is essential in science as it allows us to validate and verify research findings. Impagliazzo, Lei, Pitassi and Sorrell (`22) recently initiated the study of replicab…
On statistical learning via the lens of compression
Ofir David, Shay Moran, Amir Yehudayoff
This work continues the study of the relationship between sample compression schemes and statistical learning, which has been mostly investigated within the framework of binary cla…
Distributed Construction of Purely Additive Spanners
Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz +1
This paper studies the complexity of distributed construction of purely additive spanners in the CONGEST model. We describe algorithms for building such spanners in several cases.…
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes
Boaz Barak, Zeev Dvir, Avi Wigderson +1
A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at leas…