Talya Eden
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 2 in the filters
on a stage with
- Haike Xuonce
- Piotr Indykonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| On counting subgraphs and why counting seeds makes more sense (if one thinks about it clearly) | Workshop on Local Algorithms (WoLA) 2024 | 2024-08-05 |
Shows an algorithm that returns a nearly uniform edge under the vertex/degree/neighbor query model and then makes it exactly uniform, using pointwise closeness… | ||
| Embeddings and labeling schemes for A* | ITCS 2022 | 2022-01-31 |
Proves nearly tight tradeoffs between heuristic complexity and A scans: for Lp embeddings with dimension D < N/log N A scans Ω(N) on average; for L∞ or… | ||
| nothing matches | ||