Yuval Emek
where else to find them
what they talk about
where they keep going back
- ITCS2 editions2021–2023
on a stage with
- Fabien Dufoulononce
- Ran Gellesonce
- Shay Kuttenonce
all 4 in the filters
who talks about the same things
- Ran Gelles3 talks
- Amit Levi2 talks
- Yuval Filmus9 talks
- Keren Censor-Hillel2 talks
- Dor Minzer8 talks
- Avishay Tal4 talks
| title | conference | date |
|---|---|---|
| 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… | ||
| Online Paging with a Vanishing Regret | ITCS 2021 | 2021-01-06 |
Online paging with cache size K and universe N over T rounds becomes achievable with predictions: a simulation algorithm SIM algorithm replaces true… | ||
| nothing matches | ||