default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRan Gelles
Person information
- affiliation: Bar-Ilan University, Ramat-Gan, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j24]Pierre Fraigniaud, Ran Gelles
, Zvi Lotker:
The topology of randomized symmetry-breaking distributed computing. J. Appl. Comput. Topol. 8(4): 909-940 (2024)- [c35]Eden Fargion, Ran Gelles, Meghal Gupta:
Interactive Coding with Unbounded Noise. APPROX/RANDOM 2024: 43:1-43:16 - [c34]Manuj Mukherjee, Ran Gelles:
Information Exchange is Harder with Noise at Source. ISIT 2024: 3285-3290 - [c33]Manuj Mukherjee, Ran Gelles:
Computation in Server-Assisted Noisy Networks. ISIT 2024: 3297-3301 - [c32]Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin:
Brief Announcement: Content-Oblivious Leader Election on Rings. PODC 2024: 549-552 - [c31]Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin:
Content-Oblivious Leader Election on Rings. DISC 2024: 26:1-26:20 - [c30]Ran Gelles, Zvi Lotker, Frederik Mallmann-Trenn:
Sorting in One and Two Rounds Using t-Comparators. DISC 2024: 27:1-27:20 - [c29]Timothé Albouy, Davide Frey, Ran Gelles, Carmit Hazay, Michel Raynal, Elad Michael Schiller, François Taïani, Vassilis Zikas:
Brief Announcement: Towards Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary. DISC 2024: 41:1-41:7 - [e1]Ran Gelles, Dennis Olivetti, Petr Kuznetsov:
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, PODC 2024, Nantes, France, June 17-21, 2024. ACM 2024 [contents] - [i34]Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin:
Content-Oblivious Leader Election on Rings. CoRR abs/2405.03646 (2024) - [i33]Ran Gelles, Zvi Lotker, Frederik Mallmann-Trenn:
Sorting in One and Two Rounds using t-Comparators. CoRR abs/2405.12678 (2024) - [i32]Eden Fargion, Ran Gelles, Meghal Gupta:
Interactive Coding with Unbounded Noise. CoRR abs/2407.09463 (2024) - 2023
- [j23]Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela:
Distributed computations in fully-defective networks. Distributed Comput. 36(4): 501-528 (2023) - [j22]Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela:
Correction to: Distributed computations in fully-defective networks. Distributed Comput. 36(4): 529 (2023) - [c28]Fabien Dufoulon, Yuval Emek, Ran Gelles:
Beeping Shortest Paths via Hypergraph Bipartite Decomposition. ITCS 2023: 45:1-45:24 - [i31]Timothé Albouy, Davide Frey, Ran Gelles, Carmit Hazay, Michel Raynal, Elad Michael Schiller, François Taïani, Vassilis Zikas:
Towards Optimal Communication Byzantine Reliable Broadcast under a Message Adversary. CoRR abs/2312.16253 (2023) - 2022
- [j21]Yagel Ashkenazi, Ran Gelles, Amir Leshem:
Noisy beeping networks. Inf. Comput. 289(Part): 104925 (2022) - [j20]Mark Braverman, Klim Efremenko, Ran Gelles, Michael A. Yitayew:
Optimal Short-Circuit Resilient Formulas. J. ACM 69(4): 26:1-26:37 (2022) - [j19]Ran Gelles, Yael Tauman Kalai, Govind Ramnarayan:
Efficient Multiparty Interactive Coding - Part II: Non-Oblivious Noise. IEEE Trans. Inf. Theory 68(7): 4723-4749 (2022) - [c27]Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela:
Distributed Computations in Fully-Defective Networks. PODC 2022: 141-150 - [i30]Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela:
Distributed Computations in Fully-Defective Networks. CoRR abs/2205.11148 (2022) - [i29]Fabien Dufoulon, Yuval Emek, Ran Gelles:
Beeping Shortest Paths via Hypergraph Bipartite Decomposition. CoRR abs/2210.06882 (2022) - 2021
- [j18]Manuj Mukherjee, Ran Gelles:
Multiparty Interactive Coding Over Networks of Intersecting Broadcast Links. IEEE J. Sel. Areas Inf. Theory 2(4): 1078-1092 (2021) - [j17]Ran Gelles, Yael Tauman Kalai, Govind Ramnarayan:
Efficient Multiparty Interactive Coding - Part I: Oblivious Insertions, Deletions and Substitutions. IEEE Trans. Inf. Theory 67(6): 3411-3437 (2021) - [c26]Manuj Mukherjee, Ran Gelles:
Multiparty Interactive Communication with Broadcast Links. ITW 2021: 1-6 - [c25]Pierre Fraigniaud, Ran Gelles, Zvi Lotker:
The Topology of Randomized Symmetry-Breaking Distributed Computing. PODC 2021: 415-425 - [i28]Manuj Mukherjee, Ran Gelles:
Multiparty Interactive Coding over Networks of Intersecting Broadcast Links. CoRR abs/2105.01506 (2021) - [i27]Pierre Fraigniaud, Ran Gelles, Zvi Lotker:
The Topology of Randomized Symmetry-Breaking Distributed Computing. CoRR abs/2105.11713 (2021) - 2020
- [j16]Ran Gelles, Rafail Ostrovsky, Alan Roytman:
Efficient Error-Correcting Codes for Sliding Windows. SIAM J. Discret. Math. 34(1): 904-937 (2020) - [c24]Yagel Ashkenazi, Ran Gelles, Amir Leshem:
Brief Announcement: Noisy Beeping Networks. PODC 2020: 458-460
2010 – 2019
- 2019
- [j15]Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler:
Making asynchronous distributed computations robust to noise. Distributed Comput. 32(5): 405-421 (2019) - [j14]Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Reliable communication over highly connected noisy networks. Distributed Comput. 32(6): 505-515 (2019) - [j13]Ran Gelles, Yael Tauman Kalai:
Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks. IEEE Trans. Inf. Theory 65(6): 3812-3829 (2019) - [c23]Mark Braverman, Klim Efremenko, Ran Gelles, Michael A. Yitayew:
Optimal Short-Circuit Resilient Formulas. CCC 2019: 10:1-10:22 - [c22]Ran Gelles, Siddharth Iyer:
Interactive Coding Resilient to an Unknown Number of Erasures. OPODIS 2019: 13:1-13:16 - [c21]Ran Gelles, Yael Tauman Kalai, Govind Ramnarayan:
Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions. PODC 2019: 137-146 - [i26]Ran Gelles, Yael Tauman Kalai, Govind Ramnarayan:
Efficient Multiparty Interactive Coding for Insertions, Deletions and Substitutions. CoRR abs/1901.09863 (2019) - [i25]Yagel Ashkenazi, Ran Gelles, Amir Leshem:
Noisy Beeping Networks. CoRR abs/1909.06811 (2019) - 2018
- [j12]Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Constant-Rate Coding for Multiparty Interactive Communication Is Impossible. J. ACM 65(1): 4:1-4:41 (2018) - [j11]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Explicit Capacity Approaching Coding for Interactive Communication. IEEE Trans. Inf. Theory 64(10): 6546-6560 (2018) - [c20]Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler:
Making Asynchronous Distributed Computations Robust to Channel Noise. ITCS 2018: 50:1-50:20 - [c19]Ran Gelles, Anat Paskin-Cherniavsky, Vassilis Zikas:
Secure Two-Party Computation over Unreliable Channels. SCN 2018: 445-463 - [i24]Mark Braverman, Klim Efremenko, Ran Gelles, Michael A. Yitayew:
Optimal Short-Circuit Resilient Formulas. CoRR abs/1807.05014 (2018) - [i23]Ran Gelles, Siddharth Iyer:
Interactive coding resilient to an unknown number of erasures. CoRR abs/1811.02527 (2018) - [i22]Ran Gelles, Anat Paskin-Cherniavsky, Vassilis Zikas:
Secure Two-Party Computation over Unreliable Channels. IACR Cryptol. ePrint Arch. 2018: 506 (2018) - 2017
- [j10]Ran Gelles:
Coding for Interactive Communication: A Survey. Found. Trends Theor. Comput. Sci. 13(1-2): 1-157 (2017) - [j9]Ran Gelles, Bernhard Haeupler:
Capacity of Interactive Communication over Erasure Channels and Channels with Feedback. SIAM J. Comput. 46(4): 1449-1472 (2017) - [j8]Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky:
Coding for Interactive Communication Correcting Insertions and Deletions. IEEE Trans. Inf. Theory 63(10): 6256-6270 (2017) - [c18]Ran Gelles, Yael Tauman Kalai:
Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks. ITCS 2017: 21:1-21:13 - [i21]Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler:
Making Asynchronous Distributed Computations Robust to Noise. CoRR abs/1702.07403 (2017) - [i20]Ran Gelles, Yael Tauman Kalai:
Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j7]Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback. IEEE Trans. Inf. Theory 62(8): 4575-4588 (2016) - [c17]Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky:
Coding for Interactive Communication Correcting Insertions and Deletions. ICALP 2016: 61:1-61:14 - [c16]Shweta Agrawal, Ran Gelles, Amit Sahai:
Adaptive protocols for interactive communication. ISIT 2016: 595-599 - [c15]Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Reliable Communication over Highly Connected Noisy Networks. PODC 2016: 165-173 - [c14]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Towards Optimal Deterministic Coding for Interactive Communication. SODA 2016: 1922-1936 - [c13]Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Constant-rate coding for multiparty interactive communication is impossible. STOC 2016: 999-1010 - [i19]Mark Braverman, Ran Gelles, Michael A. Yitayew:
Optimal Resilience for Short-Circuit Noise in Formulas. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j6]Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman:
Optimal Coding for Streaming Authentication and Interactive Communication. IEEE Trans. Inf. Theory 61(1): 133-145 (2015) - [j5]Ran Gelles, Amit Sahai, Akshay Wadia:
Private Interactive Communication Across an Adversarial Channel. IEEE Trans. Inf. Theory 61(12): 6860-6875 (2015) - [c12]Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback. ITCS 2015: 11-20 - [c11]Ran Gelles, Bernhard Haeupler:
Capacity of Interactive Communication over Erasure Channels and Channels with Feedback. SODA 2015: 1296-1311 - [c10]Juan A. Garay, Ran Gelles, David S. Johnson, Aggelos Kiayias, Moti Yung:
A Little Honesty Goes a Long Way - The Two-Tier Model for Secure Multiparty Computation. TCC (1) 2015: 134-158 - [i18]Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback. CoRR abs/1501.00624 (2015) - [i17]Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky:
Coding for interactive communication correcting insertions and deletions. CoRR abs/1508.00514 (2015) - [i16]Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Reliable Communication over Highly Connected Noisy Networks. Electron. Colloquium Comput. Complex. TR15 (2015) - [i15]Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Constant-rate coding for multiparty interactive communication is impossible. Electron. Colloquium Comput. Complex. TR15 (2015) - [i14]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Towards Optimal Deterministic Coding for Interactive Communication. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [b1]Ran Gelles:
On Interactive Computation over a Noisy Channel. University of California, Los Angeles, USA, 2014 - [j4]Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner:
Position-Based Quantum Cryptography: Impossibility and Constructions. SIAM J. Comput. 43(1): 150-178 (2014) - [j3]Vladimir Braverman, Ran Gelles, Rafail Ostrovsky:
How to catch L2-heavy-hitters on sliding windows. Theor. Comput. Sci. 554: 82-94 (2014) - [j2]Ran Gelles, Ankur Moitra, Amit Sahai:
Efficient Coding for Interactive Communication. IEEE Trans. Inf. Theory 60(3): 1899-1913 (2014) - [c9]Ran Gelles, Amit Sahai, Akshay Wadia:
Private interactive communication across an adversarial channel. ITCS 2014: 135-144 - [c8]Ran Gelles, Rafail Ostrovsky, Alan Roytman:
Efficient Error-Correcting Codes for Sliding Windows. SOFSEM 2014: 258-268 - [i13]Juan A. Garay, Ran Gelles, David S. Johnson, Aggelos Kiayias, Moti Yung:
A Little Honesty Goes a Long Way: The Two-Tier Model for Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2014: 209 (2014) - 2013
- [c7]Vladimir Braverman, Ran Gelles, Rafail Ostrovsky:
How to Catch L 2-Heavy-Hitters on Sliding Windows. COCOON 2013: 638-650 - [c6]Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman:
Optimal Coding for Streaming Authentication and Interactive Communication. CRYPTO (2) 2013: 258-276 - [i12]Michel Boyer, Ran Gelles, Tal Mor:
Attacks on Fixed Apparatus Quantum Key Distribution Schemes. CoRR abs/1312.0979 (2013) - [i11]Shweta Agrawal, Ran Gelles, Amit Sahai:
Adaptive Protocols for Interactive Communication. CoRR abs/1312.4182 (2013) - [i10]Ran Gelles, Amit Sahai, Akshay Wadia:
Private Interactive Communication Across an Adversarial Channel. IACR Cryptol. ePrint Arch. 2013: 259 (2013) - 2012
- [c5]Ran Gelles, Rafail Ostrovsky, Kina Winoto:
Multiparty Proximity Testing with Dishonest Majority from Equality Testing. ICALP (2) 2012: 537-548 - [c4]Michel Boyer, Ran Gelles, Tal Mor:
Attacks on Fixed Apparatus Quantum Key Distribution Schemes. TPNC 2012: 97-107 - [c3]Ran Gelles, Tal Mor:
On the Security of Interferometric Quantum Key Distribution. TPNC 2012: 133-146 - [i9]Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman:
Optimal Coding for Streaming Authentication and Interactive Communication. Electron. Colloquium Comput. Complex. TR12 (2012) - [i8]Ran Gelles, Rafail Ostrovsky, Kina Winoto:
Multiparty Proximity Testing with Dishonest Majority from Equality Testing. IACR Cryptol. ePrint Arch. 2012: 378 (2012) - 2011
- [c2]Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner:
Position-Based Quantum Cryptography: Impossibility and Constructions. CRYPTO 2011: 429-446 - [c1]Ran Gelles, Ankur Moitra, Amit Sahai:
Efficient and Explicit Coding for Interactive Communication. FOCS 2011: 768-777 - [i7]Ran Gelles, Amit Sahai:
Potent Tree Codes and their applications: Coding for Interactive Communication, revisited. CoRR abs/1104.0739 (2011) - [i6]Ran Gelles, Tal Mor:
On the Security of Interferometric Quantum Key Distribution. CoRR abs/1110.6573 (2011) - [i5]Serge Fehr, Ran Gelles, Christian Schaffner:
Security and Composability of Randomness Expansion from Bell Inequalities. CoRR abs/1111.6052 (2011) - 2010
- [i4]Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner:
Position-Based Quantum Cryptography: Impossibility and Constructions. CoRR abs/1009.2490 (2010) - [i3]Vladimir Braverman, Ran Gelles, Rafail Ostrovsky:
How to Catch L_2-Heavy-Hitters on Sliding Windows. CoRR abs/1012.3130 (2010) - [i2]Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner:
Position-Based Quantum Cryptography: Impossibility and Constructions. IACR Cryptol. ePrint Arch. 2010: 275 (2010)
2000 – 2009
- 2009
- [j1]Michel Boyer, Ran Gelles, Tal Mor:
Security of the Bennett-Brassard Quantum Key Distribution Protocol against Collective Attacks. Algorithms 2(2): 790-807 (2009) - 2008
- [i1]Michel Boyer, Ran Gelles, Dan Kenigsberg, Tal Mor:
Semi-Quantum Key Distribution. CoRR abs/0812.4835 (2008)
Coauthor Index
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-10-25 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
