This page contains some talks that I gave over the last few years (there is also one in Hebrew)
-
On distance approximation for graph properties
Joint work with Nimrod Fiat, given (virtually) at the Simons institute, Berkeley, 2020 -
On the Benefits of Bounded Arboricity for Sublinear Counting and Sampling
Based on joint works with Talya Eden, C. Seshadhri and Will Rosenbaum,
NY Theory Day, NYU, 2019 -
Fast, cheap, but in control: Sublinear-time algorithms for approximate computations
The New York Colloquium on Algorithms and Complexity, CUNY, 2019 -
2,(3),…,k: From approximating the number of edges to approximating the number of k-cliques
(with a sublinear number of queries)
Based on joint works with Talya Eden and C. Seshadhri , Columbia U., 2019 -
On quality vs. efficiency and the benefits of random choice
In Hebrew, given at the seminar of the TAU undergraduate excellence program, 2018. -
Testing bounded arboricity
Joint work with Talya Eden and Reut Levi, Technion, 2018 -
From dense to sparse and back again: On testing graph properties (and some properties of Oded)
Given as part of the celebration of Oded Goldreich's 60th birthday, Weizmann Institute, 2017 -
On local partition oracles and their applications
Given as part of a celebration at BGU for Shafi Goldwasser who received an honorary PhD, 2017