2 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…