Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. - Amir Abboud; Keren Censor-Hillel; Seri Khoury (DISC, 2016)

A Composition-Based Method for Combinatorial Test Design. - Anna Zamansky; Amir Shwartz; Seri Khoury; Eitan Farchi (ICST Workshops, 2017)

Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. - Keren Censor-Hillel; Seri Khoury; Ami Paz (DISC, 2017)

Improved Distributed Approximation to Maximum Independent Set. - Ken-ichi Kawarabayashi; Seri Khoury; Aaron Schild; Gregory Schwartzman (CoRR, 2019)

Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. - Yuval Efron; Ofer Grossman; Seri Khoury (PODC, 2020)

Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set. - Ken-ichi Kawarabayashi; Seri Khoury; Aaron Schild; Gregory Schwartzman (PODC, 2020)

Improved Hardness of Approximation of Diameter in the CONGEST Model. - Ofer Grossman; Seri Khoury; Ami Paz (DISC, 2020)

Improved Distributed Approximations for Maximum Independent Set. - Ken-ichi Kawarabayashi; Seri Khoury; Aaron Schild; Gregory Schwartzman (DISC, 2020)

Fooling views: a new lower bound technique for distributed computations under congestion. - Amir Abboud; Keren Censor-Hillel; Seri Khoury; Christoph Lenzen 001 (Distributed Comput., 2020)

Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. - Michal Dory; Orr Fischer; Seri Khoury; Dean Leitersdorf (PODC, 2021)

Smaller Cuts, Higher Lower Bounds. - Amir Abboud; Keren Censor-Hillel; Seri Khoury; Ami Paz (ACM Trans. Algorithms, 2021)

Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond. - Amir Abboud; Karl Bringmann; Seri Khoury; Or Zamir (STOC, 2022)

Listing 4-Cycles. - Amir Abboud; Seri Khoury; Oree Leibowitz; Ron Safier (FSTTCS, 2023)

On the Communication Complexity of Secure Multi-Party Computation With Aborts. - James Bartusek; Thiago Bergamaschi; Seri Khoury; Saachi Mutreja; Orr Paradise (PODC, 2024)

Breaking Barriers for Distributed MIS by Faster Degree Reduction. - Seri Khoury; Aaron Schild (CoRR, 2025)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching. - Seri Khoury; Aaron Schild (CoRR, 2025)