bounded independence 1connectivity 1cycle-freeness 1derandomization 1graph algorithms 1random sampling 1
From the 1 of 2 linked papers with an AI index.
2 papers
cs.DS2026
Bounded-Independence Sampling of Edges for Combinatorial Graph Properties
Aaron Putterman, Salil Vadhan, Vadim Zaripov
The paper investigates how bounded‑independence edge sampling can preserve graph properties such as connectivity and cycle‑freeness, and provides explicit derandomization technique…
cs.IT2025
Bivariate Linear Operator Codes
Aaron L. Putterman, Vadim Zaripov
In this work, we present a generalization of the linear operator family of codes that captures more codes that achieve list decoding capacity. Linear operator (LO) codes were intro…