Omri Ben-Eliezer
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2023
all 4 in the filters
on a stage with
- Amit Levionce
- Dan Mikulinceronce
- Elchanan Mosselonce
all 6 in the filters
who talks about the same things
- Amit Levi2 talks
- Yuichi Yoshida4 talks
- Yuval Filmus9 talks
- Dor Minzer8 talks
- Mark Braverman5 talks
- Oded Goldreich4 talks
| title | conference | date |
|---|---|---|
| On the instance optimality of detecting collisions and subgraphs | Workshop on Local Algorithms (WoLA) 2024 | 2024-08-05 |
Characterizes when knowing an unlabeled copy of the input helps: a trichotomy shows very simple targets are O(1) instance optimal, most targets incur a… | ||
| Sublinear algorithms in social networks via core-periphery decomposition | Extroverted Sublinear Algorithms 2024 | 2024-06-17 |
A practical pipeline builds a hierarchical core-periphery decomposition via greedy neighbor-list queries (API-style, rate-limited), producing a sublinearly… | ||
| Adversarially Robust Streaming Algorithms | Sublinear Algorithms Boot Camp 2024 | 2024-05-21 |
Shows that classic linear sketches fail against adaptive streams and gives concrete remedies: maintain multiple black‑box copies and sketch switching based on… | ||
| Is This Correct? Let's Check! | ITCS 2023 | 2023-01-10 |
Model builds knowledge as a preferential attachment tree with hidden truth labels, random errors at rate epsilon, and random checks of ancestor chains of depth… | ||
| Ordered Graph Limits and Their Applications | ITCS 2021 | 2021-01-06 |
The paper defines a new limit object called an orderon (a function on R^2→[0,1] mixing an order coordinate and a variability coordinate), introduces a… | ||
| nothing matches | ||