default search action
BibTeX records: Seri Khoury
@inproceedings{DBLP:conf/podc/BartusekBKMP24, author = {James Bartusek and Thiago Bergamaschi and Seri Khoury and Saachi Mutreja and Orr Paradise}, editor = {Ran Gelles and Dennis Olivetti and Petr Kuznetsov}, title = {On the Communication Complexity of Secure Multi-Party Computation With Aborts}, booktitle = {Proceedings of the 43rd {ACM} Symposium on Principles of Distributed Computing, {PODC} 2024, Nantes, France, June 17-21, 2024}, pages = {480--491}, publisher = {{ACM}}, year = {2024}, url = {https://doi.org/10.1145/3662158.3662815}, doi = {10.1145/3662158.3662815}, timestamp = {Tue, 18 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/podc/BartusekBKMP24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2406-06914, author = {James Bartusek and Thiago Bergamaschi and Seri Khoury and Saachi Mutreja and Orr Paradise}, title = {On the Communication Complexity of Secure Multi-Party Computation With Aborts}, journal = {CoRR}, volume = {abs/2406.06914}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2406.06914}, doi = {10.48550/ARXIV.2406.06914}, eprinttype = {arXiv}, eprint = {2406.06914}, timestamp = {Mon, 08 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2406-06914.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/AbboudKLS23, author = {Amir Abboud and Seri Khoury and Oree Leibowitz and Ron Safier}, editor = {Patricia Bouyer and Srikanth Srinivasan}, title = {Listing 4-Cycles}, booktitle = {43rd {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2023, December 18-20, 2023, {IIIT} Hyderabad, Telangana, India}, series = {LIPIcs}, volume = {284}, pages = {25:1--25:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2023.25}, doi = {10.4230/LIPICS.FSTTCS.2023.25}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/AbboudKLS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AbboudBKZ22, author = {Amir Abboud and Karl Bringmann and Seri Khoury and Or Zamir}, editor = {Stefano Leonardi and Anupam Gupta}, title = {Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond}, booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022}, pages = {1487--1500}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519935.3520066}, doi = {10.1145/3519935.3520066}, timestamp = {Tue, 27 Dec 2022 09:06:31 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AbboudBKZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2204-10465, author = {Amir Abboud and Karl Bringmann and Seri Khoury and Or Zamir}, title = {Hardness of Approximation in {P} via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond}, journal = {CoRR}, volume = {abs/2204.10465}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2204.10465}, doi = {10.48550/ARXIV.2204.10465}, eprinttype = {arXiv}, eprint = {2204.10465}, timestamp = {Mon, 25 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2204-10465.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2211-10022, author = {Amir Abboud and Seri Khoury and Oree Leibowitz and Ron Safier}, title = {Listing 4-Cycles}, journal = {CoRR}, volume = {abs/2211.10022}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2211.10022}, doi = {10.48550/ARXIV.2211.10022}, eprinttype = {arXiv}, eprint = {2211.10022}, timestamp = {Thu, 24 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2211-10022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/AbboudCKP21, author = {Amir Abboud and Keren Censor{-}Hillel and Seri Khoury and Ami Paz}, title = {Smaller Cuts, Higher Lower Bounds}, journal = {{ACM} Trans. Algorithms}, volume = {17}, number = {4}, pages = {30:1--30:40}, year = {2021}, url = {https://doi.org/10.1145/3469834}, doi = {10.1145/3469834}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/AbboudCKP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/DoryFKL21, author = {Michal Dory and Orr Fischer and Seri Khoury and Dean Leitersdorf}, editor = {Avery Miller and Keren Censor{-}Hillel and Janne H. Korhonen}, title = {Constant-Round Spanners and Shortest Paths in Congested Clique and {MPC}}, booktitle = {{PODC} '21: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021}, pages = {223--233}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3465084.3467928}, doi = {10.1145/3465084.3467928}, timestamp = {Mon, 26 Jul 2021 09:04:22 +0200}, biburl = {https://dblp.org/rec/conf/podc/DoryFKL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dc/AbboudCKL20, author = {Amir Abboud and Keren Censor{-}Hillel and Seri Khoury and Christoph Lenzen}, title = {Fooling views: a new lower bound technique for distributed computations under congestion}, journal = {Distributed Comput.}, volume = {33}, number = {6}, pages = {545--559}, year = {2020}, url = {https://doi.org/10.1007/s00446-020-00373-4}, doi = {10.1007/S00446-020-00373-4}, timestamp = {Thu, 24 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dc/AbboudCKL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/KawarabayashiKS20, author = {Ken{-}ichi Kawarabayashi and Seri Khoury and Aaron Schild and Gregory Schwartzman}, editor = {Yuval Emek and Christian Cachin}, title = {Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set}, booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020}, pages = {283--285}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3382734.3405728}, doi = {10.1145/3382734.3405728}, timestamp = {Tue, 04 Aug 2020 16:04:51 +0200}, biburl = {https://dblp.org/rec/conf/podc/KawarabayashiKS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/EfronGK20, author = {Yuval Efron and Ofer Grossman and Seri Khoury}, editor = {Yuval Emek and Christian Cachin}, title = {Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in {CONGEST}}, booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020}, pages = {511--520}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3382734.3405702}, doi = {10.1145/3382734.3405702}, timestamp = {Tue, 04 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/podc/EfronGK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/GrossmanKP20, author = {Ofer Grossman and Seri Khoury and Ami Paz}, editor = {Hagit Attiya}, title = {Improved Hardness of Approximation of Diameter in the {CONGEST} Model}, booktitle = {34th International Symposium on Distributed Computing, {DISC} 2020, October 12-16, 2020, Virtual Conference}, series = {LIPIcs}, volume = {179}, pages = {19:1--19:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.DISC.2020.19}, doi = {10.4230/LIPICS.DISC.2020.19}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/GrossmanKP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/KawarabayashiKS20, author = {Ken{-}ichi Kawarabayashi and Seri Khoury and Aaron Schild and Gregory Schwartzman}, editor = {Hagit Attiya}, title = {Improved Distributed Approximations for Maximum Independent Set}, booktitle = {34th International Symposium on Distributed Computing, {DISC} 2020, October 12-16, 2020, Virtual Conference}, series = {LIPIcs}, volume = {179}, pages = {35:1--35:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.DISC.2020.35}, doi = {10.4230/LIPICS.DISC.2020.35}, timestamp = {Wed, 07 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/KawarabayashiKS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2003-07427, author = {Yuval Efron and Ofer Grossman and Seri Khoury}, title = {Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in {CONGEST}}, journal = {CoRR}, volume = {abs/2003.07427}, year = {2020}, url = {https://arxiv.org/abs/2003.07427}, eprinttype = {arXiv}, eprint = {2003.07427}, timestamp = {Tue, 24 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2003-07427.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1901-01630, author = {Amir Abboud and Keren Censor{-}Hillel and Seri Khoury and Ami Paz}, title = {Smaller Cuts, Higher Lower Bounds}, journal = {CoRR}, volume = {abs/1901.01630}, year = {2019}, url = {http://arxiv.org/abs/1901.01630}, eprinttype = {arXiv}, eprint = {1901.01630}, timestamp = {Thu, 31 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1901-01630.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1906-11524, author = {Ken{-}ichi Kawarabayashi and Seri Khoury and Aaron Schild and Gregory Schwartzman}, title = {Improved Distributed Approximation to Maximum Independent Set}, journal = {CoRR}, volume = {abs/1906.11524}, year = {2019}, url = {http://arxiv.org/abs/1906.11524}, eprinttype = {arXiv}, eprint = {1906.11524}, timestamp = {Mon, 01 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1906-11524.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icst/ZamanskySKF17, author = {Anna Zamansky and Amir Shwartz and Seri Khoury and Eitan Farchi}, title = {A Composition-Based Method for Combinatorial Test Design}, booktitle = {2017 {IEEE} International Conference on Software Testing, Verification and Validation Workshops, {ICST} Workshops 2017, Tokyo, Japan, March 13-17, 2017}, pages = {249--252}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/ICSTW.2017.45}, doi = {10.1109/ICSTW.2017.45}, timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}, biburl = {https://dblp.org/rec/conf/icst/ZamanskySKF17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/Censor-HillelKP17, author = {Keren Censor{-}Hillel and Seri Khoury and Ami Paz}, editor = {Andr{\'{e}}a W. Richa}, title = {Quadratic and Near-Quadratic Lower Bounds for the {CONGEST} Model}, booktitle = {31st International Symposium on Distributed Computing, {DISC} 2017, October 16-20, 2017, Vienna, Austria}, series = {LIPIcs}, volume = {91}, pages = {10:1--10:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.DISC.2017.10}, doi = {10.4230/LIPICS.DISC.2017.10}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/Censor-HillelKP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Censor-HillelKP17, author = {Keren Censor{-}Hillel and Seri Khoury and Ami Paz}, title = {Quadratic and Near-Quadratic Lower Bounds for the {CONGEST} Model}, journal = {CoRR}, volume = {abs/1705.05646}, year = {2017}, url = {http://arxiv.org/abs/1705.05646}, eprinttype = {arXiv}, eprint = {1705.05646}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Censor-HillelKP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1711-01623, author = {Amir Abboud and Keren Censor{-}Hillel and Seri Khoury and Christoph Lenzen}, title = {Fooling Views: {A} New Lower Bound Technique for Distributed Computations under Congestion}, journal = {CoRR}, volume = {abs/1711.01623}, year = {2017}, url = {http://arxiv.org/abs/1711.01623}, eprinttype = {arXiv}, eprint = {1711.01623}, timestamp = {Thu, 24 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1711-01623.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/AbboudCK16, author = {Amir Abboud and Keren Censor{-}Hillel and Seri Khoury}, editor = {Cyril Gavoille and David Ilcinkas}, title = {Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks}, booktitle = {Distributed Computing - 30th International Symposium, {DISC} 2016, Paris, France, September 27-29, 2016. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9888}, pages = {29--42}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53426-7\_3}, doi = {10.1007/978-3-662-53426-7\_3}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/wdag/AbboudCK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AbboudCK16, author = {Amir Abboud and Keren Censor{-}Hillel and Seri Khoury}, title = {Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks}, journal = {CoRR}, volume = {abs/1605.05109}, year = {2016}, url = {http://arxiv.org/abs/1605.05109}, eprinttype = {arXiv}, eprint = {1605.05109}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AbboudCK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.