Chen Avin

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 81

Top Venues

CoRR

INFOCOM

Proc. ACM Meas. Anal. Comput. Syst.

DISC

Publications

Chen Griner, Chen Avin
Integrated Topology and Traffic Engineering for Reconfigurable Datacenter Networks. CoRR (2024)
Chen Griner, Chen Avin, Gil Einziger
Beyond matchings: Dynamic multi-hop topology for demand-aware datacenters. Comput. Networks 240 (2024)
Johannes Zerwas, Chen Griner, Stefan Schmid, Chen Avin
D3: An Adaptive Reconfigurable Datacenter Network. CoRR (2024)
Vamsi Addanki, Chen Avin, Stefan Schmid
Understanding the Throughput Bounds of Reconfigurable Datacenter Networks. CoRR (2024)
Raz Segal, Chen Avin, Gabriel Scalosub
SOAR: Minimizing Network Utilization Cost With Bounded In-Network Computing. IEEE Trans. Netw. Serv. Manag. 21 (2) (2024)
Arash Pourdamghani, Chen Avin, Robert Sama, Stefan Schmid
SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree. CoRR (2023)
Johannes Zerwas, Csaba Györgyi, Andreas Blenk, Stefan Schmid, Chen Avin
Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control. SIGMETRICS (Abstracts) (2023)
Itamar Gozlan, Chen Avin, Gil Einziger, Gabriel Scalosub
Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing. SIGMETRICS (Abstracts) (2023)
Chen Avin, Ingo van Duijn, Maciej Pacut, Stefan Schmid
Self-adjusting grid networks. Inf. Comput. 292 (2023)
Vamsi Addanki, Chen Avin, Stefan Schmid
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. SIGMETRICS (Abstracts) (2023)
Johannes Zerwas, Csaba Györgyi, Andreas Blenk, Stefan Schmid, Chen Avin
Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control. Proc. ACM Meas. Anal. Comput. Syst. 7 (1) (2023)
Bruna Soares Peres, Otavio Augusto de Oliveira Souza, Olga Goussevskaia, Chen Avin, Stefan Schmid
Distributed Self-Adjusting Tree Networks. IEEE Trans. Cloud Comput. 11 (1) (2023)
Vamsi Addanki, Chen Avin, Stefan Schmid
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. Proc. ACM Meas. Anal. Comput. Syst. 7 (1) (2023)
Itamar Gozlan, Chen Avin, Gil Einziger, Gabriel Scalosub
Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing. Proc. ACM Meas. Anal. Comput. Syst. 7 (1) (2023)
Arash Pourdamghani, Chen Avin, Robert Sama, Stefan Schmid
SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree. INFOCOM (2023)
Or Peres, Chen Avin
Distributed Demand-aware Network Design using Bounded Square Root of Graphs. INFOCOM (2023)
Chen Avin, Avi Cohen, Zvi Lotker, David Peleg
Hotelling games in fault-prone settings. Theor. Comput. Sci. 922 (2022)
Vamsi Addanki, Chen Avin, Stefan Schmid
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. CoRR (2022)
Chen Griner, Stefan Schmid, Chen Avin
CacheNet: Leveraging the principle of locality in reconfigurable network design. Comput. Networks 204 (2022)
Chen Avin, Kaushik Mondal, Stefan Schmid
Push-Down Trees: Optimal Self-Adjusting Complete Trees. IEEE/ACM Trans. Netw. 30 (6) (2022)
Johannes Zerwas, Csaba Györgyi, Andreas Blenk, Stefan Schmid, Chen Avin
Kevin: de Bruijn-based topology with demand-aware links and greedy routing. CoRR (2022)
Raz Segal, Chen Avin, Gabriel Scalosub
Constrained In-network Computing with Low Congestion in Datacenter Networks. INFOCOM (2022)
Chen Avin, Marcin Bienkowski, Iosif Salem, Robert Sama, Stefan Schmid, Pawel Schmidt
Deterministic Self-Adjusting Tree Networks Using Rotor Walks. ICDCS (2022)
Raz Segal, Chen Avin, Gabriel Scalosub
Constrained In-network Computing with Low Congestion in Datacenter Networks. CoRR (2022)
Chen Avin, Kaushik Mondal, Stefan Schmid
Demand-Aware Network Design With Minimal Congestion and Route Lengths. IEEE/ACM Trans. Netw. 30 (4) (2022)
Chen Griner, Gil Einziger, Chen Avin
Self-Adjusting Ego-Trees Topology for Reconfigurable Datacenter Networks. CoRR (2022)
Chen Avin, Marcin Bienkowski, Iosif Salem, Robert Sama, Stefan Schmid, Pawel Schmidt
Deterministic Self-Adjusting Tree Networks Using Rotor Walks. CoRR (2022)
Chen Griner, Johannes Zerwas, Andreas Blenk, Manya Ghobadi, Stefan Schmid, Chen Avin
Cerberus: The Power of Choices in Datacenter Topology Design - A Throughput Perspective. SIGMETRICS (Abstracts) (2022)
Raz Segal, Chen Avin, Gabriel Scalosub
SOAR: Minimizing Network Utilization with Bounded In-network Computing. CoRR (2021)
Chen Avin, Stefan Schmid
ReNets: Statically-Optimal Demand-Aware Networks. APOCS (2021)
Raz Segal, Chen Avin, Gabriel Scalosub
SOAR: minimizing network utilization with bounded in-network computing. CoNEXT (2021)
Johannes Zerwas, Chen Avin, Stefan Schmid, Andreas Blenk
ExRec: Experimental Framework for Reconfigurable Networks Based on Off-the-Shelf Hardware. ANCS (2021)
Chen Griner, Johannes Zerwas, Andreas Blenk, Manya Ghobadi, Stefan Schmid, Chen Avin
Cerberus: The Power of Choices in Datacenter Topology Design - A Throughput Perspective. Proc. ACM Meas. Anal. Comput. Syst. 5 (3) (2021)
Chen Griner, Chen Avin
CacheNet: Leveraging the Principle of Locality in Reconfigurable Network Design. Networking (2021)
Chen Avin, Marcin Bienkowski, Andreas Loukas, Maciej Pacut, Stefan Schmid
Dynamic Balanced Graph Partitioning. SIAM J. Discret. Math. 34 (3) (2020)
Chen Avin, Chen Griner, Iosif Salem, Stefan Schmid
An Online Matching Model for Self-Adjusting ToR-to-ToR Networks. CoRR (2020)
Chen Avin, Manya Ghobadi, Chen Griner, Stefan Schmid
On the Complexity of Traffic Traces and Implications. Proc. ACM Meas. Anal. Comput. Syst. 4 (1) (2020)
Chen Avin, Kaushik Mondal, Stefan Schmid
Dynamically Optimal Self-adjusting Single-Source Tree Networks. LATIN (2020)
Chen Avin, Kaushik Mondal, Stefan Schmid
Demand-aware network designs of bounded degree. Distributed Comput. 33 (3-4) (2020)
Chen Avin
Arithmetic Binary Search Trees: Static Optimality in the Matching Model. CoRR (2020)
Chen Avin, Yuri Lotker
De-evolution of Preferential Attachment Trees. COMPLEX NETWORKS (2) (2020)
Chen Avin, Manya Ghobadi, Chen Griner, Stefan Schmid
On the Complexity of Traffic Traces and Implications. SIGMETRICS (Abstracts) (2020)
Chen Avin, Iosif Salem, Stefan Schmid
Working Set Theorems for Routing in Self-Adjusting Skip List Networks. INFOCOM (2020)
Chen Griner, Johannes Zerwas, Andreas Blenk, Manya Ghobadi, Stefan Schmid, Chen Avin
Performance Analysis of Demand-Oblivious and Demand-Aware Optical Datacenter Network Designs. CoRR (2020)
Chen Avin, Louis Cohen, Mahmoud Parham, Stefan Schmid
Competitive clustering of stochastic communication patterns on a ring. Computing 101 (9) (2019)
Bruna Soares Peres, Otavio Augusto de Oliveira Souza, Olga Goussevskaia, Chen Avin, Stefan Schmid
Distributed Self-Adjusting Tree Networks. INFOCOM (2019)
Chen Avin, Iosif Salem, Stefan Schmid
Brief Announcement: On Self-Adjusting Skip List Networks. DISC (2019)
Chen Avin, Manya Ghobadi, Chen Griner, Stefan Schmid
Measuring the Complexity of Packet Traces. CoRR (2019)
Chen Avin, Ingo van Duijn, Stefan Schmid
Self-Adjusting Linear Networks. CoRR (2019)
Or Raz, Chen Avin, Stefan Schmid
Nap: Network-Aware Data Partitions for Efficient Distributed Processing. NCA (2019)
Chen Avin, Zvi Lotker, Assaf Mizrachi, David Peleg
Majority vote and monopolies in social networks. ICDCN (2019)
Chen Avin, Kaushik Mondal, Stefan Schmid
Demand-Aware Network Design with Minimal Congestion and Route Lengths. INFOCOM (2019)
Chen Avin, Ingo van Duijn, Stefan Schmid
Self-adjusting Linear Networks. SSS (2019)
Chen Avin, Ingo van Duijn, Stefan Schmid
Self-adjusting Linear Networks. SIROCCO (2019)
Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg
Random preferential attachment hypergraph. ASONAM (2019)
Chen Avin, Stefan Schmid
ReNets: Toward Statically Optimal Self-Adjusting Networks. CoRR (2019)
Chen Avin, Robert Elsässer
Breaking the $$\log n$$ log n barrier on rumor spreading. Distributed Comput. 31 (6) (2018)
Chen Avin, Avi Cohen, Zvi Lotker, David Peleg
Fault-Tolerant Hotelling Games. CoRR (2018)
Chen Avin, Stefan Schmid
Toward Demand-Aware Networking: A Theory for Self-Adjusting Networks. CoRR (2018)
Chen Avin, Stefan Schmid
Toward demand-aware networking: a theory for self-adjusting networks. Comput. Commun. Rev. 48 (5) (2018)
Chen Avin, Kaushik Mondal, Stefan Schmid
Push-Down Trees: Optimal Self-Adjusting Complete Trees. CoRR (2018)
Chen Avin, Michal Koucký, Zvi Lotker
Cover time and mixing time of random walks on dynamic graphs. Random Struct. Algorithms 52 (4) (2018)
Michal Vaanunu, Chen Avin
Homophily and Nationality Assortativity Among the Most Cited Researchers' Social Network. ASONAM (2018)
Chen Avin, Avi Cohen, Pierre Fraigniaud, Zvi Lotker, David Peleg
Preferential Attachment as a Unique Equilibrium. WWW (2018)
Chen Avin, Alexandr Hercules, Andreas Loukas, Stefan Schmid
: Toward robust demand-aware network designs. Inf. Process. Lett. 133 (2018)
Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet
On the power of uniform power: capacity of wireless networks with bounded resources. Wirel. Networks 23 (8) (2017)
Chen Avin, Kaushik Mondal, Stefan Schmid
Demand-Aware Network Designs of Bounded Degree. DISC (2017)
Chen Avin, Hadassa Daltrophe, Zvi Lotker, David Peleg
Assortative Mixing Equilibria in Social Network Games. CoRR (2017)
Chen Avin, Hadassa Daltrophe, Zvi Lotker, David Peleg
Assortative Mixing Equilibria in Social Network Games. GAMENETS (2017)
Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg
Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks. KDD (2017)
Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg
Distributed computing on core-periphery networks: Axiom-based design. J. Parallel Distributed Comput. 99 (2017)
Chen Avin, Louis Cohen, Stefan Schmid
Competitive Clustering of Stochastic Communication Patterns on a Ring. NETYS (2017)
Bruna Soares Peres, Olga Goussevskaia, Stefan Schmid, Chen Avin
Brief Announcement: Distributed SplayNets. DISC (2017)
Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
SINR diagram with interference cancellation. Ad Hoc Networks 54 (2017)
Chen Avin, Kaushik Mondal, Stefan Schmid
Demand-Aware Network Designs of Bounded Degree. CoRR (2017)
Chen Avin, Alexandr Hercules, Andreas Loukas, Stefan Schmid
Towards Communication-Aware Robust Topologies. CoRR (2017)
John Augustine, Chen Avin, Mehraneh Liaee, Gopal Pandurangan, Rajmohan Rajaraman
Information Spreading in Dynamic Networks under Oblivious Adversaries. CoRR (2016)
Stefan Schmid, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker
SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Trans. Netw. 24 (3) (2016)
John Augustine, Chen Avin, Mehraneh Liaee, Gopal Pandurangan, Rajmohan Rajaraman
Information Spreading in Dynamic Networks Under Oblivious Adversaries. DISC (2016)
Chen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid
Online Balanced Repartitioning. DISC (2016)
Chen Avin, Zvi Lotker, David Peleg, Itzik Turkel
On social networks of program committees - Structure and effect on paper acceptance fairness. Soc. Netw. Anal. Min. 6 (1) (2016)
Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker
Self-adjusting grid networks to minimize expected path length. Theor. Comput. Sci. 584 (2015)
Chen Avin, Zvi Lotker, David Peleg, Itzik Turkel
Social Network Analysis of Program Committees and Paper Acceptance Fairness. ASONAM (2015)
Chen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid
Online Balanced Repartitioning. CoRR (2015)
Asaf Cohen, Bernhard Haeupler, Chen Avin, Muriel Médard
Network Coding Based Information Spreading in Dynamic Networks With Correlated Data. IEEE J. Sel. Areas Commun. 33 (2) (2015)
Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg
Core Size and Densification in Preferential Attachment Networks. ICALP (2) (2015)
Chen Avin, Robert Elsässer
Breaking the log n barrier on rumor spreading. CoRR (2015)
Chen Avin, Zvi Lotker, David Peleg
Random Preferential Attachment Hypergraphs. CoRR (2015)
Chen Avin, Barbara Keller, Zvi Lotker, Claire Mathieu, David Peleg, Yvonne-Anne Pignolet
Homophily and the Glass Ceiling Effect in Social Networks. ITCS (2015)
Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg
Distributed Computing on Core-Periphery Networks: Axiom-Based Design. ICALP (2) (2014)
Chen Avin, Yuval Lando, Zvi Lotker
Radio cover time in hyper-graphs. Ad Hoc Networks 12 (2014)
Chen Avin, Zvi Lotker, David Peleg, Yvonne-Anne Pignolet, Itzik Turkel
Core-Periphery in Networks: An Axiomatic Approach. CoRR (2014)
Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
Testing the irreducibility of nonsquare Perron-Frobenius systems. Inf. Process. Lett. 114 (12) (2014)
Michael Borokhovich, Chen Avin, Zvi Lotker
Bounds for algebraic gossip on graphs. Random Struct. Algorithms 45 (2) (2014)
Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg
Distributed Computing on Core-Periphery Networks: Axiom-based Design. CoRR (2014)
Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker
Self-adjusting Grid Networks to Minimize Expected Path Length. SIROCCO (2013)
Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
Generalized Perron-Frobenius Theorem for Nonsquare Matrices. CoRR (2013)
Chen Avin, Bernhard Haeupler, Zvi Lotker, Christian Scheideler, Stefan Schmid
Locally Self-Adjusting Tree Networks. IPDPS (2013)
Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker
Order optimal information spreading using algebraic gossip. Distributed Comput. 26 (2) (2013)
Chen Avin, Robert Elsässer
Faster Rumor Spreading: Breaking the logn Barrier. DISC (2013)

Chen Avin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Chen Avin