3 papers
cs.DC2025
On the Randomized Locality of Matching Problems in Regular Graphs
Seri Khoury, Manish Purohit, Aaron Schild +1
The main goal in distributed symmetry-breaking is to understand the locality of problems; i.e., the radius of the neighborhood that a node needs to explore in order to arrive at it…
cs.DC2025
Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
Seri Khoury, Aaron Schild
In this work, we present an lower bound for Maximal Matching (MM) in -ary trees against randomized algorithms. By a folklore reduct…
cs.CR2024
On the Communication Complexity of Secure Multi-Party Computation With Aborts
James Bartusek, Thiago Bergamaschi, Seri Khoury +2
A central goal of cryptography is Secure Multi-party Computation (MPC), where parties desire to compute a function of their joint inputs without letting any party learn about t…