2 citations · 4 across the 5 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2023
Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs
Caleb Ju, Serif Yesil, Mengyuan Sun +2
Positive linear programs (LPs) model many graph and operations research problems. One can solve for a -approximation for positive LPs, for any selected , in polylogarithm…
cs.DC2021
Communication lower bounds for nested bilinear algorithms via rank expansion of Kronecker products
Caleb Ju, Yifan Zhang, Edgar Solomonik
We develop lower bounds on communication in the memory hierarchy or between processors for nested bilinear algorithms, such as Strassen's algorithm for matrix multiplication. We bu…