Publications (8)
Testing Sumsets is Hard
Xi Chen, Shivam Nadimpalli, Tim Randolph +2
A subset of the Boolean hypercube is a sumset if for some . Sumsets are central objects of study in add…
Subset Sum in Time
Xi Chen, Yaonan Jin, Tim Randolph +1
A major goal in the area of exact exponential algorithms is to give an algorithm for the (worst-case) -input Subset Sum problem that runs in time for some const…
Stability radius and internal versus external stability in Banach spaces: an evolution semigroup approach
Stephen Clark, Yuri Latushkin, Stephen J. Montgomery-Smith +1
In this paper the theory of evolution semigroups is developed and used to provide a framework to study the stability of general linear control systems. These include time-varying s…
Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
Tim Randolph, Karol WÄgrzycki
We study the parameterized complexity of algorithmic problems whose input is an integer set in terms of the doubling constant , a fundamental measure of addit…
CoMMiT: Co-informed inference of microbiome-metabolome interactions via transfer learning
Leiyue Li, Chenglong Ye, Tim Randolph +5
Recent multi-omic microbiome studies enable integrative analysis of microbes and metabolites, uncovering their associations with various host conditions. Such analyses require mult…
Average-Case Subset Balancing Problems
Xi Chen, Yaonan Jin, Tim Randolph +1
Given a set of input integers, the Equal Subset Sum problem asks us to find two distinct subsets with the same sum. In this paper we present an algorithm that runs in time $O^*…