Shay Solomon
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2022
on a stage with
- Hung Leonce
- Lazar Milenkoviconce
- Noam Solomononce
all 6 in the filters
who talks about the same things
- Keren Censor-Hillel2 talks
- Rotem Oshman4 talks
- Yuval Filmus9 talks
- Dor Minzer8 talks
- Amin Saberi6 talks
- Gal Yona4 talks
| title | conference | date |
|---|---|---|
| Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems | ITCS 2022 | 2022-01-31 |
Deterministic distributed algorithms implement dynamic symmetry-breaking with near-optimal message costs: Delta+1 coloring and maximal matching use O(m^{1/2})… | ||
| Dynamic Matching Algorithms Under Vertex Updates | ITCS 2022 | 2022-01-31 |
Maintains maximal matchings under vertex insertions and deletions with a concrete tradeoff: a simple bipartite algorithm (one side fixed) is irrevocable and… | ||
| A Generalized Matching Reconfiguration Problem | ITCS 2021 | 2021-01-06 |
Shows a linear-time procedure that reconfigures any unweighted source matching into any target matching while keeping intermediate matchings within one of the… | ||
| nothing matches | ||