Ran Gelles

Orcid: 0000-0003-3615-3239

Affiliations:
  • Bar-Ilan University, Ramat-Gan, Israel


According to our database1, Ran Gelles authored at least 49 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Sorting in One and Two Rounds using t-Comparators.
CoRR, 2024

Content-Oblivious Leader Election on Rings.
CoRR, 2024

Brief Announcement: Content-Oblivious Leader Election on Rings.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023
Correction to: Distributed computations in fully-defective networks.
Distributed Comput., December, 2023

Distributed computations in fully-defective networks.
Distributed Comput., December, 2023

Towards Optimal Communication Byzantine Reliable Broadcast under a Message Adversary.
CoRR, 2023

Beeping Shortest Paths via Hypergraph Bipartite Decomposition.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
Efficient Multiparty Interactive Coding - Part II: Non-Oblivious Noise.
IEEE Trans. Inf. Theory, 2022

Optimal Short-Circuit Resilient Formulas.
J. ACM, 2022

Noisy beeping networks.
Inf. Comput., 2022

2021
Efficient Multiparty Interactive Coding - Part I: Oblivious Insertions, Deletions and Substitutions.
IEEE Trans. Inf. Theory, 2021

Multiparty Interactive Coding Over Networks of Intersecting Broadcast Links.
IEEE J. Sel. Areas Inf. Theory, 2021

The Topology of Randomized Symmetry-Breaking Distributed Computing.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Multiparty Interactive Communication with Broadcast Links.
Proceedings of the IEEE Information Theory Workshop, 2021

2020
Efficient Error-Correcting Codes for Sliding Windows.
SIAM J. Discret. Math., 2020

Brief Announcement: Noisy Beeping Networks.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019
Making asynchronous distributed computations robust to noise.
Distributed Comput., 2019

Reliable communication over highly connected noisy networks.
Distributed Comput., 2019

Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Interactive Coding Resilient to an Unknown Number of Erasures.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

2018
Explicit Capacity Approaching Coding for Interactive Communication.
IEEE Trans. Inf. Theory, 2018

Constant-Rate Coding for Multiparty Interactive Communication Is Impossible.
J. ACM, 2018

Secure Two-Party Computation over Unreliable Channels.
IACR Cryptol. ePrint Arch., 2018

Making Asynchronous Distributed Computations Robust to Channel Noise.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017
Coding for Interactive Communication Correcting Insertions and Deletions.
IEEE Trans. Inf. Theory, 2017

Capacity of Interactive Communication over Erasure Channels and Channels with Feedback.
SIAM J. Comput., 2017

Coding for Interactive Communication: A Survey.
Found. Trends Theor. Comput. Sci., 2017

Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks.
Electron. Colloquium Comput. Complex., 2017

2016
Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback.
IEEE Trans. Inf. Theory, 2016

Optimal Resilience for Short-Circuit Noise in Formulas.
Electron. Colloquium Comput. Complex., 2016

Adaptive protocols for interactive communication.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Private Interactive Communication Across an Adversarial Channel.
IEEE Trans. Inf. Theory, 2015

Towards Optimal Deterministic Coding for Interactive Communication.
Electron. Colloquium Comput. Complex., 2015

2014
On Interactive Computation over a Noisy Channel.
PhD thesis, 2014

Efficient Coding for Interactive Communication.
IEEE Trans. Inf. Theory, 2014

How to catch L<sub>2</sub>-heavy-hitters on sliding windows.
Theor. Comput. Sci., 2014

A Little Honesty Goes a Long Way: The Two-Tier Model for Secure Multiparty Computation.
IACR Cryptol. ePrint Arch., 2014

2013
How to Catch <i>L</i> <sub>2</sub>-Heavy-Hitters on Sliding Windows.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
Multiparty Proximity Testing with Dishonest Majority from Equality Testing.
IACR Cryptol. ePrint Arch., 2012

Optimal Coding for Streaming Authentication and Interactive Communication.
Electron. Colloquium Comput. Complex., 2012

On the Security of Interferometric Quantum Key Distribution.
Proceedings of the Theory and Practice of Natural Computing, 2012

Attacks on Fixed Apparatus Quantum Key Distribution Schemes.
Proceedings of the Theory and Practice of Natural Computing, 2012

2011
Security and Composability of Randomness Expansion from Bell Inequalities
CoRR, 2011

Potent Tree Codes and their applications: Coding for Interactive Communication, revisited
CoRR, 2011

Efficient and Explicit Coding for Interactive Communication.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Position-Based Quantum Cryptography: Impossibility and Constructions.
IACR Cryptol. ePrint Arch., 2010

How to Catch L_2-Heavy-Hitters on Sliding Windows
CoRR, 2010

2009
Security of the Bennett-Brassard Quantum Key Distribution Protocol against Collective Attacks.
Algorithms, 2009

2008
Semi-Quantum Key Distribution.
CoRR, 2008


  Loading...