5 citations · 5 across the 2 of their papers we have counts for
4 papers
The Polychromatic Number of Small Subsets of the Integers Modulo
Emelie Curl, John Goldwasser, Joe Sampson +1
If is a subset of an abelian group , the polychromatic number of in is the largest integer so that there is a coloring of the elements of such that every…
Skew throttling
Emelie Curl, Jesse Geneson, Leslie Hogben
Zero forcing is a process that colors the vertices of a graph blue by starting with some vertices blue and applying a color change rule. Throttling minimizes the sum of the number…
Using Markov chains to determine expected propagation time for probabilistic zero forcing
Yu Chan, Emelie Curl, Jesse Geneson +4
Zero forcing is a coloring game played on a graph where each vertex is initially colored blue or white and the goal is to color all the vertices blue by repeated use of a (determin…
The Dual Kaczmarz Algorithm
Anna Aboud, Emelie Curl, Steven N. Harding +2
The Kaczmarz algorithm is an iterative method for solving a system of linear equations. It can be extended so as to reconstruct a vector in a (separable) Hilbert space from the…