Rotem Oshman
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
- ITCS2 editions2022–2023
on a stage with
all 7 in the filters
who talks about the same things
- François Le Gall4 talks
- Keren Censor-Hillel2 talks
- Oded Goldreich4 talks
- Uri Meir2 talks
- Yuval Filmus9 talks
- Toniann Pitassi5 talks
| title | conference | date |
|---|---|---|
| Resilience of 3-Majority Dynamics to Non-Uniform Schedulers | ITCS 2023 | 2023-01-10 |
Defines a p-epsilon scheduler that lets an adversary pick, each round, a distribution over triplets within Lp distance ε of uniform and shows precise… | ||
| Quantum Distributed Algorithms for Detection of Cliques | ITCS 2022 | 2022-01-31 |
Takes any classical distributed listing routine and converts it into a faster quantum detection routine by running nested Grover searches over carefully… | ||
| Distributed Interactive Proofs | Interactive Complexity 2018 | 2018-10-15 |
Shows that MAM protocol verifies graph symmetry in O(log n) bits per node by having the prover commit a permutation and a rooted spanning tree, then nodes… | ||
| Information Complexity for Multi-Party NIH Communication | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Proves that k‑party number‑in‑hand disjointness on n coordinates has an Ω(n log k) communication lower bound under shared blackboard by first applying a… | ||
| nothing matches | ||