3 citations · 3 across the 2 of their papers we have counts for
4 papers
The Greedy Coin Change Problem
Shreya Gupta, Boyang Huang, Russell Impagliazzo
The Coin Change problem, also known as the Change-Making problem, is a well-studied combinatorial optimization problem, which involves minimizing the number of coins needed to make…
Replicability in High Dimensional Statistics
Max Hopkins, Russell Impagliazzo, Daniel Kane +2
The replicability crisis is a major issue across nearly all areas of empirical science, calling for the formal study of replicability in statistics. Motivated in this context, [Imp…
Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization
Mark Bun, Marco Gaboardi, Max Hopkins +5
The notion of replicable algorithms was introduced in Impagliazzo et al. [STOC '22] to describe randomized algorithms that are stable under the resampling of their inputs. More pre…
An Entropic Proof of Chang's Inequality
Russell Impagliazzo, Cristopher Moore, Alexander Russell
Chang's lemma is a useful tool in additive combinatorics and the analysis of Boolean functions. Here we give an elementary proof using entropy. The constant we obtain is tight, and…