Fabien Dufoulon
where else to find them
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
- Ran Gellesonce
- Yuval Emekonce
who talks about the same things
one talk is not yet a subject
| 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… | ||
| nothing matches | ||