| 2026 | PODC | A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput. | Matthias Bentert, Chen Avin, Stefan Schmid |
| 2025 | OPODIS | Demand-Aware Small-World Networks on Clustered Demands. | Chen Avin, Robert Elssser, Aleksander Figiel, Darya Melnyk, Stefan Schmid |
| 2024 | OPODIS | Hash & Adjust: Competitive Demand-Aware Consistent Hashing. | Arash Pourdamghani, Chen Avin, Robert Sama, Maryam Shiran, Stefan Schmid |
| 2023 | INFOCOM | Distributed Demand-aware Network Design using Bounded Square Root of Graphs. | Or Peres, Chen Avin |
| 2023 | INFOCOM | SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree. | Arash Pourdamghani, Chen Avin, Robert Sama, Stefan Schmid |
| 2023 | SIGMETRICS | Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. | Vamsi Addanki, Chen Avin, Stefan Schmid |
| 2023 | SIGMETRICS | Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing. | Itamar Gozlan, Chen Avin, Gil Einziger, Gabriel Scalosub |
| 2023 | SIGMETRICS | Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control. | Johannes Zerwas, Csaba Gyrgyi, Andreas Blenk, Stefan Schmid, Chen Avin |
| 2022 | ICDCS | Deterministic Self-Adjusting Tree Networks Using Rotor Walks. | Chen Avin, Marcin Bienkowski, Iosif Salem, Robert Sama, Stefan Schmid, Pawel Schmidt |
| 2022 | INFOCOM | Constrained In-network Computing with Low Congestion in Datacenter Networks. | Raz Segal, Chen Avin, Gabriel Scalosub |
| 2022 | SIGMETRICS | Cerberus: The Power of Choices in Datacenter Topology Design - A Throughput Perspective. | Chen Griner, Johannes Zerwas, Andreas Blenk, Manya Ghobadi, Stefan Schmid, Chen Avin |
| 2021 | CoNEXT | SOAR: minimizing network utilization with bounded in-network computing. | Raz Segal, Chen Avin, Gabriel Scalosub |
| 2021 | Networking | CacheNet: Leveraging the Principle of Locality in Reconfigurable Network Design. | Chen Griner, Chen Avin |
| 2020 | INFOCOM | Working Set Theorems for Routing in Self-Adjusting Skip List Networks. | Chen Avin, Iosif Salem, Stefan Schmid |
| 2020 | LATIN | Dynamically Optimal Self-adjusting Single-Source Tree Networks. | Chen Avin, Kaushik Mondal, Stefan Schmid |
| 2020 | SIGMETRICS | On the Complexity of Traffic Traces and Implications. | Chen Avin, Manya Ghobadi, Chen Griner, Stefan Schmid |
| 2019 | ICDCN | Majority vote and monopolies in social networks. | Chen Avin, Zvi Lotker, Assaf Mizrachi, David Peleg |
| 2019 | INFOCOM | Demand-Aware Network Design with Minimal Congestion and Route Lengths. | Chen Avin, Kaushik Mondal, Stefan Schmid |
| 2019 | INFOCOM | Distributed Self-Adjusting Tree Networks. | Bruna Soares Peres, Otvio Augusto de Oliviera Souza, Olga Goussevskaia, Chen Avin, Stefan Schmid |
| 2019 | NCA | Nap: Network-Aware Data Partitions for Efficient Distributed Processing. | Or Raz, Chen Avin, Stefan Schmid |
| 2019 | SIROCCO | Self-adjusting Linear Networks. | Chen Avin, Ingo van Duijn, Stefan Schmid |
| 2019 | SSS | Self-adjusting Linear Networks. | Chen Avin, Ingo van Duijn, Stefan Schmid |
| 2018 | WWW | Preferential Attachment as a Unique Equilibrium. | Chen Avin, Avi Cohen, Pierre Fraigniaud, Zvi Lotker, David Peleg |
| 2017 | KDD | Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks. | Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg |
| 2015 | ICALP | Core Size and Densification in Preferential Attachment Networks. | Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg |
| 2014 | ICALP | Distributed Computing on Core-Periphery Networks: Axiom-Based Design. | Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg |
| 2013 | SODA | Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications. | Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg |
| 2013 | SIROCCO | Self-adjusting Grid Networks to Minimize Expected Path Length. | Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker |
| 2012 | ISIT | Network coded gossip with correlated data. | Bernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Mdard |
| 2012 | SODA | SINR diagram with interference cancellation. | Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg |
| 2011 | ISCC | Geographical quadtree routing. | Chen Avin, Yaniv Dvory, Ran Giladi |
| 2011 | ISCC | PSP: Path state protocol for inter-domain routing. | Chen Avin, Ran Giladi, Dotan Guy |
| 2011 | ISIT | Efficient distributed source coding for multiple receivers via matrix sparsification. | Chen Avin, Michael Borokhovich, Asaf Cohen, Zvi Lotker |
| 2011 | PODC | Order optimal information spreading using algebraic gossip. | Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker |
| 2010 | EWSN | Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks. | Marco Zuniga, Chen Avin, Manfred Hauswirth |
| 2010 | ISIT | Tight bounds for algebraic gossip on graphs. | Michael Borokhovich, Chen Avin, Zvi Lotker |
| 2009 | Algosensors | A Note on Uniform Power Connectivity in the SINR Model. | Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne-Anne Pignolet |
| 2009 | CSEDU | Mastering (Virtual) Networks - A Case Study of Virtualizing Internet Lab. | Chen Avin, Michael Borokhovich, Arik Goldfeld |
| 2009 | ESA | On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources. | Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet |
| 2009 | GLOBECOM | From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks. | Chen Avin, Ran Giladi, Nissan Lev-Tov, Zvi Lotker |
| 2009 | PODC | SINR diagrams: towards algorithmically usable SINR models of wireless networks. | Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty |
| 2008 | DSN | Probabilistic quorum systems in wireless ad hoc networks. | Roy Friedman, Gabriel Kliot, Chen Avin |
| 2008 | ICALP | How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). | Chen Avin, Michal Kouck, Zvi Lotker |
| 2008 | SPAA | Many random walks are faster than one. | Noga Alon, Chen Avin, Michal Kouck, Gady Kozma, Zvi Lotker, Mark R. Tuttle |
| 2006 | MSWIM | The power of choice in random walks: an empirical study. | Chen Avin, Bhaskar Krishnamachari |
| 2005 | EWSN | Bounds on the mixing time and partial cover of ad-hoc and sensor networks. | Chen Avin, Gunes Ercal |
| 2005 | ICALP | On the Cover Time of Random Geometric Graphs. | Chen Avin, Gunes Ercal |
| 2005 | IJCAI | Identifiability of Path-Specific Effects. | Chen Avin, Ilya Shpitser, Judea Pearl |
| 2001 | LPNMR | Algorithms for Computing X-Minimal Models. | Chen Avin, Rachel Ben-Eliyahu-Zohary |