David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
We consider the problem of interleaving sequences of positive and negative numbers in order to maximize the minimum, overall prefixes p of the interleaved sequence, of the sum of the numbers in p. A simple and efficient offline solution is given. We also consider an online version of the problem. Under a cost model suitable for the prefetching application that motivates the problem, a strongly competitive online algorithm is given. These problems abstract two practical problems of scheduling data prefetches in a multiprogrammed or multithreaded computing environment.
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Minghong Fang, Zifan Zhang, et al.
CCS 2024
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997