72 citations · 250 across the 57 of their papers we have counts for
3 papers · 1 filter
Lattices Without a Big Constant and With Noise
Steven J. Gortler, Louis Theran
We show how Frieze's analysis of subset sum solving using lattices can be done with out any large constants and without flipping. We apply the variant without the large constant to…
Rigid components in fixed-lattice and cone frameworks
Matthew Berardi, Brent Heeringa, Justin Malestein +1
We study the fundamental algorithmic rigidity problems for generic frameworks periodic with respect to a fixed lattice or a finite-order rotation in the plane. For fixed-lattice fr…
Searching in Dynamic Tree-Like Partial Orders
Brent Heeringa, Marius Catalin Iordan, Louis Theran
We give the first data structure for the problem of maintaining a dynamic set of n elements drawn from a partially ordered universe described by a tree. We define the Line-Leaf Tre…