54 citations · 158 across the 14 of their papers we have counts for
16 papers
Low-Degree Polynomials Extract from Local Sources
Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman +2
We continue a line of work on extracting random bits from weak sources that are generated by simple processes. We focus on the model of locally samplable sources, where each bit in…
Two Approximation Results for Divergence Free Measures
Jesse Goodman, Felipe Hernandez, Daniel Spector
In this paper we prove two approximation results for divergence free measures. The first is a form of an assertion of J. Bourgain and H. Brezis concerning the approximation of sole…
Improved Extractors for Small-Space Sources
Eshan Chattopadhyay, Jesse Goodman
We study the problem of extracting random bits from weak sources that are sampled by algorithms with limited memory. This model of small-space sources was introduced by Kamp, Rao,…
Asymptotic accuracy of the saddlepoint approximation for maximum likelihood estimation
Jesse Goodman
The saddlepoint approximation gives an approximation to the density of a random variable in terms of its moment generating function. When the underlying random variable is itself t…
On the Approximability of Time Disjoint Walks
Alexandre Bayen, Jesse Goodman, Eugene Vinitsky
We introduce the combinatorial optimization problem Time Disjoint Walks (TDW), which has applications in collision-free routing of discrete objects (e.g., autonomous vehicles) over…
Some remarks on boundary operators of Bessel extensions
Jesse Goodman, Daniel Spector
In this paper we study some boundary operators of a class of Bessel-type Littlewood-Paley extensions whose prototype is \[Δ_x u(x,y) +\frac{1-2s}{y} \frac{\partial u}{\partial y}(x…