- Sample-efficient learning of mixture models,
*Universität Tübingen Lunch Seminar Theoretical Computer Science*, Tübingen, Germany, 13 July 2017. - VC-dimension of neural networks,
*Simons Institute Industry Day*, Berkeley, 23 March 2017. - The push&pull protocol for rumour spreading,
presented in
*Probability lab seminar*, Montreal, 20 September 2017 (50 minute talk, slides)*RANDOM 2017*, Berkeley, 18 August 2017 (20 minute talk, slides)*The 6th biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM)*, Toronto, 15 June 2017*Microsoft Research Redmond Lunch Theory seminar*, Redmond, 1 March 2017*University of Washington theory seminar*, Seattle, 28 February 2017 (50 minute talk, slides)

- Some highlights of my research,
*Tutte Colloquium*, University of Waterloo, 10 February 2017. - Load balancing by an asynchronous greedy algorithm,
*Innovations in Theoretical Computer Science graduating bits*, Simons Institute, Berkeley, 9 January 2017. - Rumour spreading in the spatial preferential attachment model,
*Banff workshop on random geometric graphs*, Banff Centre, 7 November 2016 (recorded talk, 30 mins), and*CanaDAM 2015*, University of Saskatchewan, 4 June 2015. - Longest paths and diameter in random Apollonian networks,
*UBC Probability seminar*, University of British Columbia, 5 October 2016. - Tight load balancing via randomlized local search,
*Tutte Colloquium*, University of Waterloo, 20 May 2016. - Cops and a fast robber on planar and random graphs (first animation, second animation),
*UBC Discrete Math seminar*, Vancouver, 27 October 2015, and*UVIC Discrete Math seminar*, Victoria, 5 November 2015. - Cops and a fast robber on bounded-degree and random graphs (first animation, second animation),
*SFU Discrete Math seminar*, Burnaby, 13 October 2015. - The push&pull protocol for rumour spreading,
*UBC Discrete Math seminar*, Vancouver, 6 October 2015, and*UVIC CS Theory seminar*, Victoria, 6 November 2015.

Short versions of this talk were presented in*ACM PODC 2015*, Donostia-San Sebastian, 23 July 2015, and*Connections in Discrete Mathematics (a celebration of the work of Ron Graham)*, Simon Fraser University, 18 June 2015.

A poster of this work was presented in the Simons conference on random graph processes, Austin, 11 May 2016.

- Proving logarithmic upper bounds for diameters of random graphs,
*CanaDAM 2015*, University of Saskatchewan, 4 June 2015, and*STAR Workshop on Random Graphs*, Radboud University Nijmegen, 10 April 2015. - Diameter and Rumour Spreading in Real-World Network Models,
*PhD Defence*, University of Waterloo, 2 April 2015. - Bounds for Randomized Rumour Spreading Protocols,
*Mathematics Colloquium*, Dalhousie University, Halifax, 20 November 2014.

A blackboard version of this talk was presented during the*Research Programme on Algorithmic Perspective in Economics and Physics seminar*, Centre de Recerca Matematica, Barcelona, 22 April 2015. - It's a small world for random surfers,
*18th International Workshop on Randomization and Computation (APPROX/RANDOM 2014)*, Barcelona, 6 September 2014. - Randomized Rumour Spreading on Random
*k*-trees,*TRICS Research Group Seminar*, University of Melbourne, 13 May 2014, and*Discrete Maths Research Group Seminar*, Monash University, Melbourne, 5 May 2014. - The diameters of two random graph models,
*16th International Conference on Random Structures and Algorithms (RSA 2013)*, Poznan, 9 August 2013. - On the Longest Paths in Random Apollonian Networks,
*Discrete Maths Research Group Seminar*, Monash University, Melbourne, 20 May 2013. - Height of Random Trees and an Application in Random Apollonian Networks,
*Probability seminar*, Sharif University of Technology, Tehran, 21 January 2013. - On the Longest Path and the Diameter in Random Apollonian Networks, Frontiers in Mathematical Sciences (Conference honouring Siavash Shahshahani), Sharif University of Technology, Tehran, 26 December 2012.
- Active Property Testing of Linear Functions Over the Boolean Hypercube, First IPM Conference on Theoretical Aspects of Computer Science (IPM-TACS 2012), Institute for Research in Pure Sciences, Tehran, 22 December 2012.
- Random Apollonian Networks, Graph Theory Seminar, Ryerson University, Toronto, 28 November 2012.
- On a Dag Partitioning Problem, 9th Workshop on Algorithms and Models for the Web Graph (WAW), Dalhousie University, Halifax, 23 June 2012.
- On the Density of Nearly Regular Graphs with a Good Edge-Labelling, SIAM Conference on Discrete Mathematics, Dalhousie University, Halifax, 19 June 2012.
- Cops and Robber with Fast Robber on Interval Graphs and Chordal Graphs, 1st Graph Searching in Canada (GRASCan) Workshop, Ryerson University, Toronto, 26 May 2012.
- On The Density of Nearly Regular Graphs with a Good Edge-Labelling, Graph Theorey Seminar, Ryerson University, Toronto, 5 April 2012.
- A Randomly Embedded Random Graph is Not a Spanner,
*The 23rd Canadian Conference on Computational Geometry (CCCG 2011)*, University of Toronto, 12 August 2011. - On a Bounded Budget Network Creation Game, Graph Theory Seminar, Department of Combinatorics and Optimization, University of Waterloo, 20 July 2011.
- On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game,
*The 3rd biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM 2011)*, University of Victoria, 1 June 2011. - Cops and Robber Game with a Fast Robber on Expander Graphs and Random Graphs,
*The 19th Ontario Combinatorics Workshop (OCW 2011)*, Ryerson University, 6 May 2011. - The Cops and Robber Game with a Fast Robber, Master’s thesis presentation in the Department of Combinatorics and Optimization, University of Waterloo, 4 March 2011 (LaTeX source).
- Complexity of the H-homomorphism problem: a new approach using the cylindrical construction,
*Advanced Topics in Graph Theory*course, Sharif University of Technology, 3 February 2008. - An Agent that plays Pacman,
*Presentation Methods*course, Sharif University of Technology, 3 December 2007.

- Benefits of depth in neural networks
(based on this paper),
*UBC Machine Learning Theory Reading Group*, 26 September 2016. -
A Superlinearly-Convergent Proximal Newton-Type Method for the Optimization of Finite Sums
(based on this paper),
*UBC Machine Learning Theory Reading Group*, 12 July 2016. -
Two iterative methods for matrix completion
(based on these two papers),
*UBC Machine Learning Theory Reading Group*, 4 April 2016. - Using linear algebra in algorithms; Example 1: maximum flow
(based on this article),
*Sharif CE Winter Seminar*, 31 December 2015. - Using linear algebra in algorithms; Example 2: perfect matching
(based on this article),
*Sharif CE Winter Seminar*, 30 December 2015. - The finite Kakeya problem (based on Chapter 34 of this book),
*Proofs from the Book*seminars, Simon Fraser University, 13 August 2015. - Low-average-stretch spanning trees,
(based on this paper)
*C&O algorithms reading group*, 10 November 2014. - Logarithmic distances in preferential attachment trees (based on Section 11.3 of
these lecture notes),
*Random graphs PhD course*, Monash University, 19 May 2014. - Preferential attachment models: motivation, introduction and degrees of fixed vertices (based on Sections 8.1--8.3 of
these lecture notes),
*Random graphs PhD course*, Monash University, 12 May 2014. -
Quantum query complexity of determining whether a graph is connected
(based on this paper)
*Quantum Information Processing*course, 28 November 2013. - The Query Complexity of Determining the Connectivity of a Graph
(based on this paper,
*C&O algorithms reading group*, University of Waterloo, 18 November 2013. - A network creation game (based on Sections 19.1--19.2 of this book),
*Introduction to game theory course*, 23 October 2013. - Basic Network Creation Games (based on this paper),
*C&O algorithms reading group*, University of Waterloo, 25 September 2013. -
Connection matrices (based on Sections 3.1--3.5 of this paper by Borgs, Chayes, Lovasz, Sos, and Vesztergombi),
*"Graph limits" reading group*, Monash University, 10 May 2013. - Graph Theory in the Information Age,
*"Oral Magazine" of the Department of Mathematics*, Sharif University of Technology, 16 January 2013. - Spencer's "six standard deviations" result and the Beck-Fiala Theorem (based on Chapter 13 of
the Alon-Spencer book),
*Discrepancy reading group*, Sharif University of Technology, 1 January 2013. - The hitting and cover times of random walks on finite graphs using local degree information (based on this paper by Ikeda, Kubo, and Yamashita),
*C&O algorithms reading group*, University of Waterloo, 27 September 2012. - Constructive Discrepancy Minimization by Walking on The Edges (based on this paper by Lovett and Meka),
*C&O algorithms reading group*, University of Waterloo, 19 July 2012. - Small subgraph conditioning,
*Random graphs course*, University of Waterloo, 20 March 2012. - Testing Properties of Directed Graphs: Acyclicity (based on this paper by Bender and Ron),
*C&O algorithms reading group*, University of Waterloo, 16 February 2012. -
Azuma-Hoeffding inequalities for centering sequences with bounded differences (based on this paper),
*"Concentration" reading group*, University of Waterloo, 13 January 2012. - Min-Max Graph Partitioning and Small Set Expansion (based on this paper by Bansal, Feige, Krauthgamer, Makarychev, Nagarajan, Naor, Schwartz),
*C&O algorithms reading group*, University of Waterloo, 9 November 2011. - Concentration inequalities for the fraction of time spent in a subset of vertices during a random walk on an expander graph (based on this paper and Section 3.5 of this book),
*"Concentration" reading group*, University of Waterloo, 4 November 2011. - Concentration inequalities for the sum of
*k*-wise independent random variables (based on Section 3.4 of this book),*"Concentration" reading group*, University of Waterloo, 28 October 2011. - Two applications of the Chernoff-Hoeffding Bounds (based on Chapter 2 of this book),
*"Concentration" reading group*, University of Waterloo, 30 September 2011. - Constructive Algorithms for Discrepancy Minimization (based on this paper by N. Bansal),
*C&O algorithms reading group*, University of Waterloo, 26 July 2011. - Dependent Random Choice (based on this paper by J. Fox and B. Sudakov),
*C&O graph theory seminar*, University of Waterloo, 6 July 2011. - Computing the Independence Number of Intersection Graphs (based on this paper by J. Fox and J. Pach),
*C&O algorithms reading group*, University of Waterloo, 10 May 2011. - Bidimensionality Theory: Two of the Important Results (based on this survey by E. Demaine and M. Hajiaghayi),
*Graph Algorithms*course, University of Waterloo, 30 March 2011. - Faster generation of random spanning trees (based on this paper by J. Kelner and A. Madry),
*Randomized Algorithms*course and*C&O algorithms reading group*, University of Waterloo, 29 March 2011. - On the complexity of 2D discrete fixed point problem (based on this paper by X. Chen and X. Deng),
*Topological Methods in Graph Theory*course, University of Waterloo, 28 February 2011. - New Constructive Aspects of the Lovasz Local Lemma (based on this paper by B. Haeupler, B. Saha, and A. Srinivasan),
*C&O algorithms reading group*, University of Waterloo, 7 December 2010. - The Giant Component of a random graph,
*Advanced Random Graph Theory*reading course, University of Waterloo, 29 July 2010. - Approximating the Number of Perfect Matchings in Bipartite Graphs (mainly based on this paper by M. Jerrum and A. Sinclair),
*Approximation Algorithms*course, University of Waterloo, 6 April 2010 (LaTeX source). - A survey on the Cops and Robber game,
*graduate seminar at the Department of Combinatorics and Optimization*, University of Waterloo, 24 February 2010. (abstract: Cops and Robber is a pursuit-evasion game played on a graph. In this talk I will introduce the game and discuss some of the main results. At the end I will have a quick look at some variants of the game.) - A survey on the Cops and Robber game (in Farsi), Bachelor's thesis presentation, Sharif University of Technology, 13 July 2009.
- k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane (based on this paper by V. Polishchuk and J. Mitchell),
*Institute for Research in Fundamental Sciences (IPM)*, 15 August 2006. - Shortest Inspection-Path Queries in Simple Polygons (based on this paper by C. Knauer and G. Rote),
*Institute for Research in Fundamental Sciences (IPM)*, 27 June 2006. - Touring a Sequence of Polygons (based on this paper by M. Dror, A. Efrat, A. Lubiw, and J. Mitchell),
*Computational Geometry*course, Sharif University of Technology, 22 May 2006. - What is Artificial Intelligence?,
*Complementary English*course, Sharif University of Technology, 25 February 2006.