IEEE INFOCOM

2022

R. Segal, C. Avin, and G. Scalosub. Constrained In-network Computing with Low Congestion in Datacenter Networks

ACM SIGMETRICS

2020

C. Avin, M. Ghobadi, C. Griner, and S. Schmid, On the complexity of traffic traces and implications

Rand. Struc. & Algo.

2018

C. Avin, M. Koucky`, and Z. Lotker, Cover time and mixing time of random walks on dynamic graphs

PloS one

2018

C. Avin, Z. Lotker, D. Peleg, Y.-A. Pignolet, and I. Turkel, Elites in social networks: An axiomatic approach to power balance and price’s square root law

ACM CCR

2018

C. Avin and S. Schmid, [Toward demand-aware networking: A theory for self-adjusting networks[(https://doi.org/10.1145/3310165.3310170)

WWW

2018

C. Avin, A. Cohen, P. Fraigniaud, Z. Lotker, and D. Peleg, Preferential attachment as a unique equilibrium

KDD

2017

C. Avin, Z. Lotker, Y. Nahum, and D. Peleg, Improved degree bounds and full spectrum power laws in preferential attachment networks

ITCS

2015

C. Avin, B. Keller, Z. Lotker, C. Mathieu, D. Peleg, and Y.-A. Pignolet, Homophily and the glass ceiling effect in social # networks

• S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, and Z. Lotker, “Splaynet: Towards locally self-adjusting networks,” IEEE/ACM Transactions on Networking, vol. 24, no. 3, pp. 1421–1433, 2015. [J20]
• C. Avin, Y. Emek, E. Kantor, Z. Lotker, D. Peleg, and L. Roditty, “SINR diagrams: Convexity and its applications in wireless networks,” Journal of the ACM (JACM), vol. 59, no. 4, pp. 1–34, 2012. [J12]
• N. Alon, C. Avin, M. Koucky, G. Kozma, Z. Lotker, and M. R. Tuttle, “Many random walks are faster than one,” Combinatorics, Probability & Computing, 20(4): 481-502, 2011. [J9]