E. Kelman

activity

20242026

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

Forbidden Intersection Theorems for Matrix Spaces

Esty Kelman, Nathan Lindzey, Ohad Sheinfeld

A family of $m \times n$ matrices $F \subseteq F_{q}^{m \times n}$ is { $(t - 1)$ -intersection-free} if $dim ker (A - B) \neq = t - 1$ for all $A, B \in F$ . A \em…

cs.DS2026

Optimal Testing of Reed-Muller Codes with an Online Adversary

Esty Kelman, Uri Meir, Kai Zhe Zheng

Motivated by applications to property testing in the online-erasure model of Kalemaj, Raskhodnikova, and Varma (ITCS 2022 and Theory of Computing 2023), we define and analyze {\em…

cs.DS2026

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search

Alexandr Andoni, Themistoklis Haris, Esty Kelman +1

We study the Approximate Nearest Neighbor (ANN) problem under a powerful adaptive adversary that controls both the dataset and a sequence of $Q$ queries. Primarily, for the high-di…