Seri Khoury

Orcid: 0000-0002-7491-5866

According to our database1, Seri Khoury authored at least 14 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Communication Complexity of Secure Multi-Party Computation With Aborts.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023
Listing 4-Cycles.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022
Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Smaller Cuts, Higher Lower Bounds.
ACM Trans. Algorithms, 2021

Constant-Round Spanners and Shortest Paths in Congested Clique and MPC.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020
Fooling views: a new lower bound technique for distributed computations under congestion.
Distributed Comput., 2020

Improved Distributed Approximations for Maximum Independent Set.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Improved Hardness of Approximation of Diameter in the CONGEST Model.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019
Improved Distributed Approximation to Maximum Independent Set.
CoRR, 2019

2017
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

A Composition-Based Method for Combinatorial Test Design.
Proceedings of the 2017 IEEE International Conference on Software Testing, 2017

2016
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks.
Proceedings of the Distributed Computing - 30th International Symposium, 2016


  Loading...