![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Seri Khoury
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
- [j2]Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz
:
Smaller Cuts, Higher Lower Bounds. ACM Trans. Algorithms 17(4): 30:1-30:40 (2021) - 2020
- [j1]Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen:
Fooling views: a new lower bound technique for distributed computations under congestion. Distributed Comput. 33(6): 545-559 (2020)
Conference and Workshop Papers
- 2024
- [c11]James Bartusek
, Thiago Bergamaschi
, Seri Khoury
, Saachi Mutreja
, Orr Paradise
:
On the Communication Complexity of Secure Multi-Party Computation With Aborts. PODC 2024: 480-491 - 2023
- [c10]Amir Abboud, Seri Khoury, Oree Leibowitz, Ron Safier:
Listing 4-Cycles. FSTTCS 2023: 25:1-25:16 - 2022
- [c9]Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir:
Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond. STOC 2022: 1487-1500 - 2021
- [c8]Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf:
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. PODC 2021: 223-233 - 2020
- [c7]Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman:
Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set. PODC 2020: 283-285 - [c6]Yuval Efron, Ofer Grossman, Seri Khoury:
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. PODC 2020: 511-520 - [c5]Ofer Grossman, Seri Khoury, Ami Paz
:
Improved Hardness of Approximation of Diameter in the CONGEST Model. DISC 2020: 19:1-19:16 - [c4]Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman:
Improved Distributed Approximations for Maximum Independent Set. DISC 2020: 35:1-35:16 - 2017
- [c3]Anna Zamansky, Amir Shwartz, Seri Khoury, Eitan Farchi:
A Composition-Based Method for Combinatorial Test Design. ICST Workshops 2017: 249-252 - [c2]Keren Censor-Hillel, Seri Khoury, Ami Paz
:
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. DISC 2017: 10:1-10:16 - 2016
- [c1]Amir Abboud, Keren Censor-Hillel, Seri Khoury:
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. DISC 2016: 29-42
Informal and Other Publications
- 2024
- [i9]James Bartusek, Thiago Bergamaschi, Seri Khoury, Saachi Mutreja, Orr Paradise:
On the Communication Complexity of Secure Multi-Party Computation With Aborts. CoRR abs/2406.06914 (2024) - 2022
- [i8]Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir:
Hardness of Approximation in P via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond. CoRR abs/2204.10465 (2022) - [i7]Amir Abboud, Seri Khoury, Oree Leibowitz, Ron Safier:
Listing 4-Cycles. CoRR abs/2211.10022 (2022) - 2020
- [i6]Yuval Efron, Ofer Grossman, Seri Khoury:
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. CoRR abs/2003.07427 (2020) - 2019
- [i5]Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz:
Smaller Cuts, Higher Lower Bounds. CoRR abs/1901.01630 (2019) - [i4]Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman:
Improved Distributed Approximation to Maximum Independent Set. CoRR abs/1906.11524 (2019) - 2017
- [i3]Keren Censor-Hillel, Seri Khoury, Ami Paz:
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. CoRR abs/1705.05646 (2017) - [i2]Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen:
Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion. CoRR abs/1711.01623 (2017) - 2016
- [i1]Amir Abboud, Keren Censor-Hillel, Seri Khoury:
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. CoRR abs/1605.05109 (2016)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint