Chen Avin

Orcid: 0000-0002-6647-8002

Affiliations:
  • Ben-Gurion University, Beersheba, Israel


According to our database1, Chen Avin authored at least 113 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
SOAR: Minimizing Network Utilization Cost With Bounded In-Network Computing.
IEEE Trans. Netw. Serv. Manag., April, 2024

Integrated Topology and Traffic Engineering for Reconfigurable Datacenter Networks.
CoRR, 2024

2023
Self-adjusting grid networks.
Inf. Comput., June, 2023

Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control.
Proc. ACM Meas. Anal. Comput. Syst., March, 2023

Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing.
Proc. ACM Meas. Anal. Comput. Syst., March, 2023

Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks.
Proc. ACM Meas. Anal. Comput. Syst., March, 2023

Distributed Self-Adjusting Tree Networks.
IEEE Trans. Cloud Comput., 2023

SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree.
Proceedings of the IEEE INFOCOM 2023, 2023

Distributed Demand-aware Network Design using Bounded Square Root of Graphs.
Proceedings of the IEEE INFOCOM 2023, 2023

2022
Push-Down Trees: Optimal Self-Adjusting Complete Trees.
IEEE/ACM Trans. Netw., 2022

Demand-Aware Network Design With Minimal Congestion and Route Lengths.
IEEE/ACM Trans. Netw., 2022

Hotelling games in fault-prone settings.
Theor. Comput. Sci., 2022

Kevin: de Bruijn-based topology with demand-aware links and greedy routing.
CoRR, 2022

Self-Adjusting Ego-Trees Topology for Reconfigurable Datacenter Networks.
CoRR, 2022

CacheNet: Leveraging the principle of locality in reconfigurable network design.
Comput. Networks, 2022

Constrained In-network Computing with Low Congestion in Datacenter Networks.
Proceedings of the IEEE INFOCOM 2022, 2022

Deterministic Self-Adjusting Tree Networks Using Rotor Walks.
Proceedings of the 42nd IEEE International Conference on Distributed Computing Systems, 2022

2021
Cerberus: The Power of Choices in Datacenter Topology Design - A Throughput Perspective.
Proc. ACM Meas. Anal. Comput. Syst., 2021

CacheNet: Leveraging the Principle of Locality in Reconfigurable Network Design.
Proceedings of the IFIP Networking Conference, 2021

SOAR: minimizing network utilization with bounded in-network computing.
Proceedings of the CoNEXT '21: The 17th International Conference on emerging Networking EXperiments and Technologies, Virtual Event, Munich, Germany, December 7, 2021

ReNets: Statically-Optimal Demand-Aware Networks.
Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

ExRec: Experimental Framework for Reconfigurable Networks Based on Off-the-Shelf Hardware.
Proceedings of the ANCS '21: Symposium on Architectures for Networking and Communications Systems, Layfette, IN, USA, December 13, 2021

2020
Dynamic Balanced Graph Partitioning.
SIAM J. Discret. Math., 2020

On the Complexity of Traffic Traces and Implications.
Proc. ACM Meas. Anal. Comput. Syst., 2020

Demand-aware network designs of bounded degree.
Distributed Comput., 2020

Arithmetic Binary Search Trees: Static Optimality in the Matching Model.
CoRR, 2020

Performance Analysis of Demand-Oblivious and Demand-Aware Optical Datacenter Network Designs.
CoRR, 2020

An Online Matching Model for Self-Adjusting ToR-to-ToR Networks.
CoRR, 2020

Dynamically Optimal Self-adjusting Single-Source Tree Networks.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Working Set Theorems for Routing in Self-Adjusting Skip List Networks.
Proceedings of the 39th IEEE Conference on Computer Communications, 2020

De-evolution of Preferential Attachment Trees.
Proceedings of the Complex Networks & Their Applications IX, 2020

2019
Measuring the Complexity of Packet Traces.
CoRR, 2019

ReNets: Toward Statically Optimal Self-Adjusting Networks.
CoRR, 2019

Competitive clustering of stochastic communication patterns on a ring.
Computing, 2019

Brief Announcement: On Self-Adjusting Skip List Networks.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Self-adjusting Linear Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Nap: Network-Aware Data Partitions for Efficient Distributed Processing.
Proceedings of the 18th IEEE International Symposium on Network Computing and Applications, 2019

Majority vote and monopolies in social networks.
Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

Random preferential attachment hypergraph.
Proceedings of the ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining, 2019

2018
Cover time and mixing time of random walks on dynamic graphs.
Random Struct. Algorithms, 2018

<i>rDAN</i>: Toward robust demand-aware network designs.
Inf. Process. Lett., 2018

Breaking the $$\log n$$ log n barrier on rumor spreading.
Distributed Comput., 2018

Fault-Tolerant Hotelling Games.
CoRR, 2018

Toward demand-aware networking: a theory for self-adjusting networks.
Comput. Commun. Rev., 2018

Preferential Attachment as a Unique Equilibrium.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Homophily and Nationality Assortativity Among the Most Cited Researchers' Social Network.
Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

2017
On the power of uniform power: capacity of wireless networks with bounded resources.
Wirel. Networks, 2017

Distributed computing on core-periphery networks: Axiom-based design.
J. Parallel Distributed Comput., 2017

Towards Communication-Aware Robust Topologies.
CoRR, 2017

SINR diagram with interference cancellation.
Ad Hoc Networks, 2017

Brief Announcement: Distributed SplayNets.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Competitive Clustering of Stochastic Communication Patterns on a Ring.
Proceedings of the Networked Systems - 5th International Conference, 2017

Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Assortative Mixing Equilibria in Social Network Games.
Proceedings of the Game Theory for Networks - 7th International EAI Conference, 2017

2016
SplayNet: Towards Locally Self-Adjusting Networks.
IEEE/ACM Trans. Netw., 2016

On social networks of program committees - Structure and effect on paper acceptance fairness.
Soc. Netw. Anal. Min., 2016

Online Balanced Repartitioning.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Information Spreading in Dynamic Networks Under Oblivious Adversaries.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015
Self-adjusting grid networks to minimize expected path length.
Theor. Comput. Sci., 2015

Network Coding Based Information Spreading in Dynamic Networks With Correlated Data.
IEEE J. Sel. Areas Commun., 2015

Random Preferential Attachment Hypergraphs.
CoRR, 2015

Breaking the log n barrier on rumor spreading.
CoRR, 2015

Homophily and the Glass Ceiling Effect in Social Networks.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Core Size and Densification in Preferential Attachment Networks.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Social Network Analysis of Program Committees and Paper Acceptance Fairness.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014
Bounds for algebraic gossip on graphs.
Random Struct. Algorithms, 2014

Testing the irreducibility of nonsquare Perron-Frobenius systems.
Inf. Process. Lett., 2014

Core-Periphery in Networks: An Axiomatic Approach.
CoRR, 2014

Radio cover time in hyper-graphs.
Ad Hoc Networks, 2014

2013
Order optimal information spreading using algebraic gossip.
Distributed Comput., 2013

Simple Destination-Swap Strategies for Adaptive Intra- and Inter-Tenant VM Migration.
CoRR, 2013

Generalized Perron-Frobenius Theorem for Nonsquare Matrices.
CoRR, 2013

Fast randomized algorithm for 2-hops clustering in vehicular ad-hoc networks.
Ad Hoc Networks, 2013

Faster Rumor Spreading: Breaking the logn Barrier.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

OBST: A self-adjusting peer-to-peer overlay based on multiple BSTs.
Proceedings of the 13th IEEE International Conference on Peer-to-Peer Computing, 2013

Locally Self-Adjusting Tree Networks.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

2012
Scalable, hierarchical, Ethernet transport network architecture (HETNA).
Telecommun. Syst., 2012

A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model.
Theor. Comput. Sci., 2012

SINR Diagrams: Convexity and Its Applications in Wireless Networks.
J. ACM, 2012

Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Network coded gossip with correlated data.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Optimal virtual traffic light placement.
Proceedings of the FOMC'12, 2012

2011
Many Random Walks Are Faster Than One.
Comb. Probab. Comput., 2011

Efficient Joint Network-Source Coding for Multiple Terminals with Side Information
CoRR, 2011

On The Elite of Social Networks
CoRR, 2011

Self-Adjusting Networks to Minimize Expected Path Length
CoRR, 2011

Fast randomized algorithm for hierarchical clustering in Vehicular Ad-Hoc Networks.
Proceedings of the 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop, 2011

Efficient distributed source coding for multiple receivers via matrix sparsification.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

PSP: Path state protocol for inter-domain routing.
Proceedings of the 16th IEEE Symposium on Computers and Communications, 2011

Geographical quadtree routing.
Proceedings of the 16th IEEE Symposium on Computers and Communications, 2011

2010
Probabilistic quorum systems in wireless Ad Hoc networks.
ACM Trans. Comput. Syst., 2010

Tight bounds for algebraic gossip on graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks.
Proceedings of the Wireless Sensor Networks, 7th European Conference, 2010

2009
Using Heterogeneity to Enhance Random Walk-based Queries.
J. Signal Process. Syst., 2009

Simple Random Walks on Radio Networks (Simple Random Walks on Hyper-Graphs)
CoRR, 2009

SINR diagrams: towards algorithmically usable SINR models of wireless networks.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

Mastering (Virtual) Networks - A Case Study of Virtualizing Internet Lab.
Proceedings of the CSEDU 2009 - Proceedings of the First International Conference on Computer Supported Education, Lisboa, Portugal, March 23-26, 2009, 2009

A Note on Uniform Power Connectivity in the SINR Model.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs.
Internet Math., 2008

The power of choice in random walks: An empirical study.
Comput. Networks, 2008

Empirical evaluation of querying mechanisms for unstructured wireless sensor networks.
Comput. Commun. Rev., 2008

How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs).
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Distance graphs: from random geometric graphs to Bernoulli graphs and between.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2008

2007
On the cover time and mixing time of random geometric graphs.
Theor. Comput. Sci., 2007

Evolutionary Reputation Games On Social Networks.
Complex Syst., 2007

An upper bound on computing all X-minimal models.
AI Commun., 2007

2005
Identifiability of Path-Specific Effects.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

On the Cover Time of Random Geometric Graphs.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Bounds on the mixing time and partial cover of ad-hoc and sensor networks.
Proceedings of the Wireless Sensor Networks, Second European Workshop, 2005

2004
Efficient and robust query processing in dynamic environments using random walk techniques.
Proceedings of the Third International Symposium on Information Processing in Sensor Networks, 2004

2001
Algorithms for Computing X-Minimal Models.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2001


  Loading...