2 papers
cs.IT2026
Balancing Privacy and Robustness in Coded Computing Under Profiled Workers
Rimpi Borah, J. Harshan, Aaditya Sharma
In distributed computing with untrusted workers, the assignment of evaluation indices plays a critical role in determining both privacy and robustness. In this work, we study how t…
math.NT2017
On algorithms to calculate integer complexity
Katherine Cordwell, Alyssa Epstein, Anand Hemmady +5
We consider a problem first proposed by Mahler and Popken in 1953 and later developed by Coppersmith, Erdős, Guy, Isbell, Selfridge, and others. Let be the complexity of $n…