| 2026 | STOC | Breaking Barriers for Distributed MIS by Faster Degree Reduction. | Seri Khoury, Aaron Schild |
| 2025 | FOCS | Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching. | Seri Khoury, Aaron Schild |
| 2024 | PODC | On the Communication Complexity of Secure Multi-Party Computation With Aborts. | James Bartusek, Thiago Bergamaschi, Seri Khoury, Saachi Mutreja, Orr Paradise |
| 2022 | STOC | Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond. | Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir |
| 2021 | PODC | Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. | Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf |
| 2020 | PODC | Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. | Yuval Efron, Ofer Grossman, Seri Khoury |
| 2020 | PODC | Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set. | Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman |
| 2017 | ICST | A Composition-Based Method for Combinatorial Test Design. | Anna Zamansky, Amir Shwartz, Seri Khoury, Eitan Farchi |