| TU Berlin |
2023 |
Bounded In-Network Computing for Distributed Machine Learning |
Berlin, Germany |
| INFOCOM |
2023 |
Distributed Demand-aware Network Design using Bounded Square Root of Graphs |
NJ, USA |
| INFOCOM |
2023 |
SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree |
NJ, USA |
| Microsoft |
2022 |
Cerberus: The Power of Choices in Datacenter Topology Design – A Throughput Perspective |
Microsoft, Cambridge, UK. (via Zoom) |
| HUJI |
2022 |
Cerberus: The Power of Choices in Datacenter Topology Design – A Throughput Perspective |
Hebrew University. Jerusalem, Israel. |
| Huawei |
2022 |
Cerberus: The Power of Choices in Datacenter Topology Design – A Throughput Perspective |
Toga Networks, Israel. |
| Dagstuhl |
2022 |
Sejf-Adjusting Networks |
Dagstuhl Seminar 22471, Germany. Keynote talk |
| Google |
2021 |
Cerberus: The Power of Choices in Datacenter Topology Design – A Throughput Perspective |
Google networking seminar, Mountain View, CA. USA. (via Zoom) |
| CNA |
2020 |
De-evolution of Preferential Attachment Trees |
International Conference on Complex Networks and their Applications (Zoom) |
| LATIN |
2020 |
Dynamically Optimal Self-Adjusting Single-Source Tree Networks |
(via Zoom) |
| Huawei |
2019 |
Toward Demand-Aware Networks Vision and Algorithms |
Huawei Vision Forum. London, UK. Invited Talk |
| INFOCOM |
2019 |
Demand-Aware Network Design with Minimal Congestion and Route Lengths |
Paris. France. Best In-session award |
| Mellanox |
2019 |
Toward Demand-Aware Networks: Vision and Algorithms |
Mellanox, Yokneam, Israel. |
| Cambridge |
2019 |
Homophily and the Emergence of a Glass Ceiling Effect in Social Networks |
University of Cambridge, Cambridge, UK. |
| INET |
2019 |
Toward Demand-Aware Networks: Vision and Algorithms |
Israeli Networking Day, Marvell, Petah Tikva, Israel. |
| SIGCOMM |
2019 |
Topic Preview Presentation: Technical Session 10: New Control Plane Operations |
Beijing. China. |
| UW |
2018 |
Data-Aware Network Design: Some Results and Open Questions |
University of Vienna, Vienna, Austria. |
| DIMACS |
2017 |
Demand Aware Network (DAN) Design, Some Results and Open Questions |
DIMACS Workshop on Algorithms for Data Center Networks. Rutgers University, NJ, USA. |
| DISC |
2016 |
Online Balanced Repartitioning |
Paris, France. |
| Wolfram |
2015 |
Teaching Social Network Analysis with Mathematica |
The Wolfram Technology Users Conference. Israel. Invited Talk |
| Microsoft |
2014 |
Homophily and the Emergence of a Glass Ceiling Effect in Social Networks |
Microsoft Research. Boston, MA. USA. |
| Microsoft |
2014 |
Homophily and the Emergence of a Glass Ceiling Effect in Social Networks |
Microsoft Research. Mountain View, CA. USA. |
| Princeton |
2014 |
Homophily and the Emergence of a Glass Ceiling Effect in Social Networks |
Princeton University. Princeton, NJ. USA. |
| Harvard |
2014 |
Homophily and the Emergence of a Glass Ceiling Effect in Social Networks |
Harvard University. Boston, MA. USA. |
| Northeastren |
2014 |
Homophily and the Emergence of a Glass Ceiling Effect in Social Networks |
Barabási Group, Northeastren University. Boston, MA. USA. |
| Google |
2014 |
Axiomatic approach to core-periphery networks: implications to social and distributed computing |
Google. New York, NY. USA. |
| Weizmann |
2014 |
Homophily and the Emergence of a Glass Ceiling Effect in Social Networks |
Weizmann Institute of Science, Israel. |
| BGU |
2014 |
Homophily and the Emergence of a Glass Ceiling Effect in Social Networks |
Ben Gurion University of the Negev, Israel. |
| Google |
2014 |
Homophily and the Emergence of a Glass Ceiling Effect in Social Networks |
Google Research seminar, Tel-Aviv, Israel. |
| ICERM |
2014 |
Elite, Periphery and Symmetry in Social Networks - An Axiomatic Approach |
Stochastic Graph Models Workshop, Providence, RI. USA. |
| TAU |
2013 |
From Caesar to Twitter: On the Elite of Social Networks |
Tel-Aviv University, Israel. |
| Northeastren |
2013 |
From Caesar to Twitter: On the Elite of Social Networks |
Northeastren University, Boston, MA. USA. |
| Dagstuhl |
2013 |
From Caesar to Twitter: On the Elite of Social Networks |
Dagstuhl Seminar 13042, Germany. |
| DISC |
2013 |
Faster Rumor Spreading: Breaking the $\log(n)$ Barrier |
Jerusalem. Israel |
| BGU |
2012 |
The Elite of Social Networks |
Social Networks Seminar. BGU. |
| MPI |
2012 |
Random walks techniques for (wireless) networks |
MPI. Saarbr"{u}cken. Germany. |
| Technion |
2012 |
Self-Adjusting Networks and Distributed Data Structures |
ClubNet seminar, Technion. Israel. |
| Google |
2012 |
From Caesar to Twitter: On the Elite of Social Networks |
Social networks seminar. Google, Mountain view, CA. USA. |
| USC |
2012 |
From Caesar to Twitter: On the Elite of Social Networks |
USC. USA. |
| Google |
2012 |
From Caesar to Twitter: On the Elite of Social Networks |
Google R\&D Seminar, Tel Aviv, Israel. |
| ISCC |
2011 |
PSP: path state protocol for inter-domain routing |
Corfu, Greece |
| ISCC |
2011 |
Geographical Quadtree Routing |
Corfu, Greece |
| INET |
2011 |
Order Optimal Information Spreading Using Algebraic Gossip |
Israeli Networking Seminar 2011. Google, Israel. |
| Freiburg |
2010 |
SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks |
University of Freiburg. Germany. |
| BIU |
2010 |
Tight Bounds for Algebraic Gossip on Graphs |
CS Colloquium, Bar-Ilan University. Israel. |
| Harvard |
2010 |
Random Walks for (Wireless) Networks |
The Harvard Theory of Computation Seminar. Harvad. USA. |
| FIR |
2010 |
New Routing Protocols for Ethernet Transport Network Architecture (ETNA) |
The Israeli Hungarian Workshop on Future Internet Research. Haifa, Israel. |
| DIALM-POMC |
2010 |
Radio Cover Time in Hyper-graphs |
Boston, USA. |
| UCLA |
2009 |
SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks |
Networking group seminar. UCLA. USA. |
| USC |
2009 |
How to Explore a Fast-Changing World |
ANRG group seminar. USC. USA. |
| USC |
2009 |
SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks |
ANRG group seminar, USC. USA. |
| UCI |
2009 |
Random walks techniques for wireless networks |
CS seminar, UC Irvine. USA. |
| Technion |
2009 |
Algebraic Gossip via EXCHANGE: Analytical and Simulation Results |
ClubNet seminar, Technion. Israel. |
| Paderborn |
2009 |
Algebraic Gossip via EXCHANGE: Analytical and Simulation Results |
Seminar on Theoretical Computer Science, University of Paderborn. Germany. |
| Med-Hoc-Net |
2009 |
Random walks techniques for wireless networks |
The 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop. Haifa, Israel Invited Talk |
| INET |
2008 |
How to Explore a Fast-Changing World |
Israeli Networking Seminar 2008. Cisco, Israel |
| BGU |
2008 |
How to Explore a Fast-Changing World |
Random Walks Day. BGU, Israel |
| DIALM-POMC |
2008 |
Distance Graphs: From Random Geometric Graphs to Bernoulli Graphs and Between |
Toronto, Canada |
| BGU |
2007 |
Many Random Walks Are Faster Than One |
CS Colloquium, Ben Gurion University. Israel. |
| Technion |
2007 |
On The Cover Time and Mixing Time of Random Geometric Graphs |
CS Colloquium, Technion. Israel. |
| TAU |
2007 |
Enhancing Random Walks Efficiency |
CS Colloquium, Tel-Aviv University. Israel. |
| HUJI |
2007 |
Many Random Walks Are Faster Than One |
CS/Engineering school Colloquium, Hebrew University. Israel. |
| Workshop |
2007 |
Identifiability of Path-Specific Effects |
International Workshop on the Interface between Statistical Causal Inference and Bayesian Networks, Tokyo, Japan. Invited Talk |
| AISP |
2007 |
Random Walks Techniques in Networking |
Algorithms, Inference, \& Statistical Physics (AISP) workshop. Santa Fe, NM. USA |
| MSWiM |
2006 |
The Power of Choice in Random Walks: An Empirical Study |
Malaga, Spain. Best Paper Award |
| UCLA |
2006 |
Random Walks on Random Wireless Networks |
Networking Group Seminar, UCLA, USA. |
| USC |
2006 |
Random Geometric Graphs: an Algorithmic Perspective |
Autonomous Networks Research Group Seminar, USC, USA. |
| BGU |
2006 |
Random Walks Techniques For Random Wireless networks |
Communication Systems Engineering Seminar, BGU, Israel. |
| ICALP |
2005 |
On The Cover Time of Random Geometric Graphs |
Lisbon, Portugal |
| UCLA |
2005 |
Distance Graphs: From Random Geometric Graphs to Bernoulli Graphs and Between |
Theory Group Seminar, UCLA. USA. |
| IPSN |
2004 |
Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques |
Boston, USA |
| UCLA |
2004 |
Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques |
CENS Seminar, UCLA. USA. |
| BGU |
2003 |
The Sensor Networks Challenge |
CSE Seminar, BGU. Israel. |
| UCLA |
2003 |
Sensor Networks: What does (U)AI got to do with it? |
AI Group Seminar, UCLA. USA |
