Seri Khoury

28 papers A* 6A 5Journal 15Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Constant-round spanners and shortest paths in congested clique and MPC.
Distributed Comput.
Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf
2025 J jnl
Breaking Barriers for Distributed MIS by Faster Degree Reduction.
CoRR
Seri Khoury, Aaron Schild
2025 A conf
On the Randomized Locality of Matching Problems in Regular Graphs.
DISC
Seri Khoury, Manish Purohit, Aaron Schild, Joshua R. Wang
2025 J jnl
On the Randomized Locality of Matching Problems in Regular Graphs.
CoRR
Seri Khoury, Manish Purohit, Aaron Schild, Joshua R. Wang
2025 A* conf
Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching.
FOCS
Seri Khoury, Aaron Schild
2025 J jnl
Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching.
CoRR
Seri Khoury, Aaron Schild
2024 A* conf
On the Communication Complexity of Secure Multi-Party Computation With Aborts.
PODC
James Bartusek, Thiago Bergamaschi, Seri Khoury, Saachi Mutreja, Orr Paradise
2024 J jnl
On the Communication Complexity of Secure Multi-Party Computation With Aborts.
CoRR
James Bartusek, Thiago Bergamaschi, Seri Khoury, Saachi Mutreja, Orr Paradise
2023 — conf
Listing 4-Cycles.
FSTTCS
Amir Abboud, Seri Khoury, Oree Leibowitz, Ron Safier
2022 J jnl
Hardness of Approximation in P via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond.
CoRR
Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir
2022 A* conf
Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond.
STOC
Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir
2022 J jnl
Listing 4-Cycles.
CoRR
Amir Abboud, Seri Khoury, Oree Leibowitz, Ron Safier
2021 A* conf
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC.
PODC
Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf
2021 J jnl
Smaller Cuts, Higher Lower Bounds.
ACM Trans. Algorithms
Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz
2020 A* conf
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST.
PODC
Yuval Efron, Ofer Grossman, Seri Khoury
2020 J jnl
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST.
CoRR
Yuval Efron, Ofer Grossman, Seri Khoury
2020 A* conf
Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set.
PODC
Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman
2020 J jnl
Fooling views: a new lower bound technique for distributed computations under congestion.
Distributed Comput.
Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen
2020 A conf
Improved Distributed Approximations for Maximum Independent Set.
DISC
Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman
2020 A conf
Improved Hardness of Approximation of Diameter in the CONGEST Model.
DISC
Ofer Grossman, Seri Khoury, Ami Paz
2019 J jnl
Improved Distributed Approximation to Maximum Independent Set.
CoRR
Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman
2019 J jnl
Smaller Cuts, Higher Lower Bounds.
CoRR
Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz
2017 — conf
A Composition-Based Method for Combinatorial Test Design.
ICST Workshops
Anna Zamansky, Amir Shwartz, Seri Khoury, Eitan Farchi
2017 J jnl
Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion.
CoRR
Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen
2017 A conf
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model.
DISC
Keren Censor-Hillel, Seri Khoury, Ami Paz
2017 J jnl
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model.
CoRR
Keren Censor-Hillel, Seri Khoury, Ami Paz
2016 A conf
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks.
DISC
Amir Abboud, Keren Censor-Hillel, Seri Khoury
2016 J jnl
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks.
CoRR
Amir Abboud, Keren Censor-Hillel, Seri Khoury