3 papers
cs.DS2026
Improved Low-Overhead Communication-Efficient String Reconciliation and Edit Distance
Michael T. Goodrich, Gonzalo Navarro, Claire A. To
Suppose two parties, Alice and Bob, hold long character strings, and , respectively, and they are interested in determining how similar and are. {Moreover, they want…
cs.DS2026
Simple Low-Overhead Communication-Efficient String Reconciliation and Edit Distance
Michael T. Goodrich, Gonzalo Navarro, Claire A. To
Suppose two parties, Alice and Bob, hold long character strings, and , respectively, and they are interested in determining how similar and are. {Moreover, they want…
cs.DC2026
Raiders of the Lost Log: Synchronous Parallel In-Place Models and Algorithms
Michael T. Goodrich, Vinesh Sridhar
Embedded systems and Internet of Things (IoT) applications motivate in-place parallel algorithms, which avoid allocating additional shared memory past the input. Work by Gu, Obeya,…