Ran Gelles
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
- Fabien Dufoulononce
- Yuval Emekonce
who talks about the same things
- Yuval Emek2 talks
- Gillat Kol5 talks
- Ran Raz6 talks
- Bernhard Haeupler2 talks
- Amit Levi2 talks
- Klim Efremenko5 talks
| title | conference | date |
|---|---|---|
| Signal, if you can’t (for the damage) | Advances in the Theory of Error-Correcting Codes | 2024-04-08 |
Claim: arbitrary noiseless protocols are simulatable by pure signaling when every link’s content is destroyed, provided the network is 2-edge connected… | ||
| Beeping Shortest Paths via Hypergraph Bipartite Decomposition | ITCS 2023 | 2023-01-10 |
Distributed beeping networks compute single and multiple shortest paths with concrete bounds: a single-path algorithm runs in O(D log log n + log^3 n) rounds… | ||
| Tutorial on List Decodable Coding Schemes and Interactive Communication in Networks (Part 2 of 2) | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Survey of multiparty interactive coding gives concrete conversions and limits: a randomized-BSC synchronous compiler yields a resilient protocol that uses O(t… | ||
| nothing matches | ||