Estimating the Arboricity in Sublinear Time
Algorithms and Theory Seminar | Boston University, October 2021
Workshop on Algorithms for Large Data Sets (WALDO) | Online, August 2021
Sampling Multiple Edges Efficiently
RANDOM Conference | Online, August 2021
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time
RANDOM Conference | Online, August 2021
Sampling k-Cliques Almost Uniformly in Sublinear Time
Theory Seminar | Hebrew University, June 2020
Workshop on Local Algorithms | Online, June 2020
Workshop on Learning and Testing in High Dimensions | Simons Institute, December 2020
Theory Seminar | Columbia University, December 2020
Faster Approximation of k-Cliques in Bounded Arboricity Graphs
Theory Seminar | Rutgers University, November 2020
Theory Seminar | Harvard University, October 2020
WOLA Workshop | Online, June 2020
SODA Conference | Salt Lake City, January 2020
Arboricity Captures the Complexity of Sampling Edges
TCS Women Spotlight Workshop | STOC, June 2020
Algorithms and Complexity Seminar | MIT, November 2019
Theory Seminar | Northeastern University, October 2019
ICALP | Patras University, July 2019.
Workshop on Local Algorithms | ETH Zurich, July 2019.
Testing Bounded Arboricity
Workshop on Local Algorithms | MIT Cambridge, June 2018.
Theory Seminar | Ben Gurion University, November 2018
Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection.
ICALP | Warsaw, July 2017
On Approximating the Number of k-Cliques in Sublinear Time
Sublinear Time Algorithms Conference | MIT Cambridge, June 2018.
Highlights of Algorithms conference | TU Berlin, June 2017.
Theory Seminar | Technion, June 2017.
Algorithms seminar | Tel Aviv University, May 2017.
Approximately Counting Triangles in Sublinear Time
FOCS | Berkeley, October 2015
Theory seminar | Tel Aviv University, February 2015.
Theory reading group | Columbia University, November 2015.
Discrete Algorithms Seminar | CUNY graduate center, November 2015.