- “Distributed Subgraph Finding: Progress and Challenges”
- Keynote talk, The 48th International Colloquium on Automata, Languages, and Programming (ICALP), July 2021
- “Distributed Optimization And Approximation: How Difficult Can It Be?”
- Keynote talk, The 23rd International Conference on Principles of Distributed Systems (OPODIS), December 2019
- “Three Challenges in Distributed Optimization”
- Invited talk, The 3rd Workshop on Local Algorithms (WOLA), July 2019
- “Locally Fixable Labelings”
- Invited talk, The 9th Bertinoro Workshop on Algorithms and Data Structures (ADS), June 2019
- “A Tale of 3 matrices”
- Invited talk, DIMAP Workshop on Advances in Modern Graph Algorithms, April 2019
- “Distributed Spanner Approximation”
- Invited talk, The 7th French-Israeli Workshop on Foundations of Computer Science (FILFOCS), October 2018
- “Barriers due to Congestion and Two Ways to Deal With Them”
- Keynote talk, The ACM Symposium on Principles of Distributed Computing (PODC), July 2018
- “Distributed Property Testing”
- Invited talk, “18th Haifa Workshop on InterDisciplinary Applications of Graphs, Combinatorics and Algorithms”, May 2018
- Invited talk, “Formal Methods and Fault-Tolerant Distributed Computing: Forging an Alliance”, Dagstuhl Seminar, Germany, May 2018
- “Lower Bounds under Bandwidth Limitations”
- Invited talk, Workshop on Algorithms for Big Data, TAU, November 2017
- “New Lower Bounds for the CONGEST model”
- Invited talk, The 8th Bertinoro Workshop on Algorithms and Data Structures (ADS), Italy, June 2017
- “The Landscape of Lower Bounds for the Congest Model”
- Invited talk, The 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2016), Finland, July 2016
- “Optimal Dynamic Distributed MIS”,
- Invited talk, The 8th Israel CS Theory Day, Open University, December 2015
- Invited talk, “New Perspectives on Distributed Computing Systems”,Workshop in Honor of Barbara Liskov, Weizmann Institute, April 2016
- “Tight Bounds for Vertex Connectivity after Sampling”,
- Invited talk, The 7th Bertinoro Workshop on Algorithms and Data Structures (ADS), Italy, June 2015
- “Are Lock-Free Algorithms Practically Wait-Free?”,
- Invited talk, 5th Annual Henry Taub International TCE Conference, Technion, June 2015
- “Algebraic Methods in the Congested Clique”,
- Invited talk, “Workshop: Towards a Unified Treatment of Dynamic Graphs”, Banff International Research Station (BIRS), Canada,, March 2015
- “Distributed Algorithms as Combinatorial Graph Structures”,
- Invited talk, Workshop on Advances in Distributed Graph Algorithms (ADGA), US, October 2014
- Invited talk, “Nexus of Information and Computation Theories, Distributed Computation and Communication Theme”, The Henri Poincare Institute (IHP), France, February 2016
- “Distributed Connectivity Decomposition”’,
- Invited talk, Randomized Algorithms for Distributed Computing and Networks (RADICON), France, July 2014
- “A New Perspective on Vertex Connectivity”’,
- Invited talk, The 6th Bertinoro Workshop on Algorithms and Data Structures (ADS), Italy, June 2013
- Invited talk, Social Networks Workshop (co-located with The 32nd ACM symposium on Principles of distributed computing (PODC)), Canada, July 2013
- “Connected Dominating Set Packings”’,
- Invited talk, “Workshop: Epidemic Algorithms and Processes: From Theory to Applications”, Schloss Dagstuhl Leibniz Center for Informatics, Germany, January 2013
- “Information Spreading in Distributed Systems”,
- Invited mini-course, The 1st Latin American Theoretical Informatics School (co-located with The 10th Latin American Symposium on Theoretical Informatics (LATIN)), Peru, April 2012
- “Polylogarithmic Snapshots”,
- Invited talk, “Workshop: Probabilistic versus Deterministic Techniques for Shared Memory Computation”, Banff International Research Station (BIRS), Canada, February 2012
- “Lower Bounds for Asynchronous Randomized Consensus”,
- Invited talk, “Workshop: Lower Bounds for Distributed Computing”, Banff International Research Station (BIRS), Canada, January 2009