Prof. Chen Avin

School of Electrical and
Computer Enginnering

Ben Gurion University
of the Negev

Selected Publications

IEEE/ACM ToN
(Infocom-19)		 2022 C. Avin, K. Mondal, and S. Schmid,
Demand-aware network design with minimal congestion and route length
ACM SIGMETRICS 2022 C. Griner, J. Zerwas, A. Blenk, M. Ghobadi, S. Schmid, and C. Avin,
Cerberus: The power of choices in datacenter topology design-a throughput perspective
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. & Alg.
(ICALP-08)		 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
WWW 2018 C. Avin, A. Cohen, P. Fraigniaud, Z. Lotker, and D. Peleg,
Preferential attachment as a unique equilibrium
ACM KDD 2017 C. Avin, Z. Lotker, Y. Nahum, and D. Peleg,
Improved degree bounds and full spectrum power laws in preferential attachment networks
JPDC
(ICALP-15)		 2017 C. Avin, M. Borokhovich, Z. Lotker, and D. Peleg,
Distributed computing on core–periphery networks: Axiom-based design
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
IEEE/ACM ToN 2015 S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, and Z. Lotker,
Splaynet: Towards locally self-adjusting networks
J. of ACM
(PODC-08)		 2012 C. Avin, Y. Emek, E. Kantor, Z. Lotker, D. Peleg, and L. Roditty,
SINR diagrams: Convexity and its applications in wireless networks
Comb. Prob. & Comp.
(SPAA-08)		 2011 N. Alon, C. Avin, M. Koucky, G. Kozma, Z. Lotker, and M. R. Tuttle,
Many random walks are faster than one
Theo. Compu. Sci.
(ICALP-05)		 2011 C. Avin and G. Ercal,
On the cover time and mixing time of random geometric graphs
IJCAI 2005 C. Avin, I. Shpitser, and J. Pearl,
Identifiability of path specific effects

Full publication list

Most updated: Google Scholar, DBLP.

  1. R. Segal, C. Avin and G. Scalosub, “SOAR: Minimizing Network Utilization Cost With Bounded In-Network Computing,” in IEEE Transactions on Network and Service Management. 2023 [J40]
  2. Itamar Gozlan, Chen Avin, Gil Einziger, Gabriel Scalosub. “Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing, “ accepted to Sigmetrics 2023, 2023. [C73]
  3. Vamsi Addanki, Chen Avin, Stefan Schmid. Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. accepted to Sigmetrics 2023, 2023. [C72]
  4. Johannes Zerwas, Csaba Gy{"o}rgyi, Andreas Blenk, Stefan Schmid, Chen Avin. “Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control,” accepted to Sigmetrics 2023, 2023. [C71]
  5. Or Peres, Chen Avin. “Distributed Demand-aware Network Design using Bounded Square Root of Graphs,” accepted to INFOCOM 2023, 2023. [C70]
  6. Arash Pourdamghani, Chen Avin, Robert Sama, Stefan Schmid. “SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree,” accepted to INFOCOM 2023, 2023. [C69]
  7. Chen Avin, Marcin Bienkowski, Iosif Salem, Robert Sama, Stefan Schmid, Pawel Schmidt. “Deterministic Self-Adjusting Tree Networks Using Rotor Walks,” in ICDCS 2022: 67-77. 2022. [C68]
  8. C. Avin, K. Mondal, and S. Schmid, “Push-Down Trees: Optimal Self-Adjusting Complete Trees,” IEEE/ACM Transactions on Networking, 2022. [J37]
  9. C. Avin, K. Mondal, and S. Schmid, “Demand-aware network design with minimal congestion and route lengths,” IEEE/ACM Transactions on Networking, 2022. [J36]
  10. R. Segal, C. Avin, and G. Scalosub. “Constrained In-network Computing with Low Congestion in Datacenter Networks”. in IEEE Conference on Computer Communications (INFOCOM), pp. 1639-1648, 2022. [C67]
  11. C. Griner, S. Schmid, and C. Avin, “Cachenet: Leveraging the principle of locality in reconfigurable network design,” Computer Networks, vol. 204, p. 108648, 2022 [J35]
  12. C. Avin, A. Cohen, Z. Lotker, and D. Peleg, “Hotelling games in fault-prone settings,” Theoretical Computer Science, 2022. [J34]
  13. C. Griner, J. Zerwas, A. Blenk, M. Ghobadi, S. Schmid, and C. Avin, “Cerberus: The power of choices in datacenter topology design-a throughput perspective,” Proceedings of the ACM on Measurement and Analysis of Computing Systems (Sigmetrics), vol. 5, no. 3, pp. 1–33, 2021. [C66]
  14. J. Zerwas, C. Avin, S. Schmid, and A. Blenk, “Exrec: Experimental framework for reconfigurable networks based on off-the-shelf hardware,” in Proceedings of the Symposium on Architectures for Networking and Communications Systems (ANCS), pp. 66–72, 2021. [C65]
  15. R. Segal, C. Avin, and G. Scalosub, “SOAR: minimizing network utilization with bounded in-network computing,” in Proceedings of the 17th International Conference on emerging Networking EXperiments and Technologies (CoNext), pp. 16–29, 2021. [C64]
  16. C. Griner, and C. Avin, “Cachenet: Leveraging the principle of locality in reconfigurable network design,” In IFIP Networking, pp 1–3. 2021. [C63]
  17. C. Avin and S. Schmid, “Renets: Statically-optimal demand-aware networks,” in Symposium on Algorithmic Principles of Computer Systems (APOCS), pp. 25–39, 2021. [C62]
  18. C. Avin and Y. Lotker, “De-evolution of preferential attachment trees,” in International Conference on Complex Networks and Their Applications, pp. 508–519. 2021. [C61]
  19. B. Peres, O. A. de Oliveira Souza, O. Goussevskaya, C. Avin, and S. Schmid, “Distributed self-adjusting tree networks,” IEEE Transactions on Cloud Computing, 2021. [J39]
  20. C. Avin, H. Daltrophe, B. Keller, Z. Lotker, C. Mathieu, D. Peleg, and Y.-A. Pignolet, “Mixed preferential attachment model: Homophily and minorities in social networks,” Physica A: Statistical Mechanics and its Applications, vol. 555, p. 124723, 2020. [J33]
  21. C. Avin, M. Ghobadi, C. Griner, and S. Schmid, “On the complexity of traffic traces and implications,” Proceedings of the ACM on Measurement and Analysis of Computing Systems (Sigmetrics), vol. 4, no. 1, pp. 1–29, 2020. [C60]
  22. C. Avin, M. Bienkowski, A. Loukas, M. Pacut, and S. Schmid, “Dynamic balanced graph partitioning,” SIAM Journal on Discrete Mathematics, vol. 34, no. 3, pp. 1791–1812, 2020. [J32]
  23. C. Avin, K. Mondal, and S. Schmid, “Demand-aware network designs of bounded degree,” Distributed Computing, vol. 33, no. 3, pp. 311–325, 2020. [J31]
  24. C. Avin, K. Mondal, and S. Schmid, “Dynamically optimal self-adjusting single-source tree networks,” in Latin American Symposium on Theoretical Informatics (LATIN), pp. 143–154. 2020. [C59]
  25. C. Avin, I. Salem, and S. Schmid, “Working set theorems for routing in self-adjusting skip list networks,” in IEEE Conference on Computer Communications (INFOCOM), pp. 2175–2184, 2020. [C58]
  26. C. Avin, K. Mondal, and S. Schmid, “Demand-aware network design with minimal congestion and route lengths,” In IEEE Conference on Computer Communications (INFOCOM), pp. 1351–1359, 2019. [C57]
  27. B. Peres, O. A. de Oliveira Souza, O. Goussevskaya, C. Avin, and S. Schmid, “Distributed self-adjusting tree networks,” in IEEE Conference on Computer Communications (INFOCOM), pp. 145–153, 2019. [C56]
  28. C. Avin, L. Cohen, M. Parham, and S. Schmid, “Competitive clustering of stochastic communication patterns on a ring,” Computing, vol. 101, no. 9, pp. 1369–1390, 2019. [J30]
  29. C. Avin, Z. Lotker, Y. Nahum, and D. Peleg, “Random preferential attachment hypergraph,” in Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 398–405, 2019. [C55]
  30. O. Raz, C. Avin, and S. Schmid, “Nap: network-aware data partitions for efficient distributed processing,” in 2019 IEEE 18th international symposium on network computing and applications (NCA), pp. 1–9, IEEE, 2019. [C54]
  31. C. Avin, I. v. Duijn, and S. Schmid, “Self-adjusting linear networks,” in International Symposium on Stabilizing, Safety, and Security of Distributed Systems (SSS), pp. 368–382, 2019. [C53]
  32. C. Avin, Z. Lotker, A. Mizrachi, and D. Peleg, “Majority vote and monopolies in social networks,” in Proceedings of the 20th International Conference on Distributed Computing and Networking (ICDCN), pp. 342– 351, 2019. [C52]
  33. C. Avin, I. Salem, and S. Schmid, “Brief Announcement: On Self-Adjusting Skip List Networks”, In International Symposium on Distributed Computing (DISC), pp. 35:1-35:3, 2019. [C51]
  34. C. Avin, A. Cohen, Z. Lotker, and D. Peleg, “Fault-tolerant hotelling games,” in Game Theory for Networking Applications, pp. 133–142, 2019.
  35. C. Avin, I. v. Duijn, and S. Schmid, “Brief Announcement: Self-adjusting linear networks,” in International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 368–382, 2019. [C50]
  36. C. Avin, M. Koucky`, and Z. Lotker, “Cover time and mixing time of random walks on dynamic graphs,” Random Structures & Algorithms, vol. 52, no. 4, pp. 576–596, 2018. [J29]
  37. C. Avin, A. Hercules, A. Loukas, and S. Schmid, “rDAN: Toward robust demand-aware network designs,” Information Processing Letters, vol. 133, pp. 5–9, 2018. [J28]
  38. 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,” PloS one, vol. 13, no. 10, p. e0205820, 2018. [J27]
  39. C. Avin and S. Schmid, “Toward demand-aware networking: A theory for self-adjusting networks,” ACM SIGCOMM Computer Communication Review (CCR), vol. 48, no. 5, pp. 31–40, 2018. [J26]
  40. C. Avin and R. Elsasser, “Breaking the logn barrier on rumor spreading,” Distributed Computing, vol. 31, no. 6, pp. 503–513, 2018. [J25]
  41. C. Avin, A. Cohen, P. Fraigniaud, Z. Lotker, and D. Peleg, “Preferential attachment as a unique equilibrium,” in Proceedings of the 2018 World Wide Web Conference (WWW), pp. 559–568, 2018. [C49]
  42. M. Vaanunu and C. Avin, “Homophily and nationality assortativity among the most cited researchers’ social network,” in 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 584–586, IEEE, 2018. [C48]
  43. C. Avin, K. Mondal, and S. Schmid, “Demand-aware network designs of bounded degree,” in International Symposium on Distributed Computing (DISC), pp. 5:1–5:16, 2017. [C47]
  44. B. Peres, O. Goussevskaia, S. Schmid, and C. Avin, “Brief announcement: Concurrent Self-Adjusting Distributed Tree Networks,” in International Symposium on Distributed Computing (DISC), pp. 58:1–58:3, 2017. [C46]
  45. C. Avin, Z. Lotker, Y. Nahum, and D. Peleg, “Improved degree bounds and full spectrum power laws in preferential attachment networks,” in Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 45–53, 2017. [C45]
  46. C. Avin, H. Daltrophe, Z. Lotker, and D. Peleg, “Assortative mixing equilibria in social network games,” in International Conference on Game Theory for Networks, pp. 29–39, Springer, Cham, 2017. [C44]
  47. C. Avin, L. Cohen, and S. Schmid, “Competitive Clustering of Stochastic Communication Patterns on the Ring,” In NETYS, pp. 231–247. 2017. [C43]
  48. C. Avin, M. Borokhovich, Z. Lotker, and D. Peleg, “Distributed computing on core–periphery networks: Axiom-based design,” Journal of Parallel and Distributed Computing, vol. 99, pp. 51–67, 2017. [J24]
  49. C. Avin, Z. Lotker, Y. Nahum, and D. Peleg, “Modeling and analysis of glass ceiling and power inequality in bi-populated societies,” in International Conference and School on Network Science, pp. 61–73, 2017. [C42]
  50. C. Avin, Z. Lotker, D. Peleg, Y.-A. Pignolet, and I. Turkel, “Core-Periphery in networks: an axiomatic approach,” in International Conference and School on Network Science, pp. 75–87, Springer, Cham, 2017. [C41]
  51. C. Avin, A. Cohen, Y. Haddad, E. Kantor, Z. Lotker, M. Parter, and D. Peleg, “SINR diagram with interference cancellation,” Ad Hoc Networks, vol. 54, pp. 1–16, 2017. [J23]
  52. C. Avin, Z. Lotker, F. Pasquale, and Y.-A. Pignolet, “On the power of uniform power: Capacity of wireless networks with bounded resources,” Wireless Networks. 23(8): 2319–2333. 2017. [J22]
  53. J. Augustine, C. Avin, M. Liaee, G. Pandurangan, and R. Rajaraman, “Information spreading in dynamic networks under oblivious adversaries,” in International Symposium on Distributed Computing (DISC), pp. 399–413, 2016. [C40]
  54. C. Avin, A. Loukas, M. Pacut, and S. Schmid, “Online balanced repartitioning,” in International Symposium on Distributed Computing (DISC), pp. 243–256, 2016. [C39]
  55. C. Avin, Z. Lotker, D. Peleg, and I. Turkel, “On social networks of program committees,” Social Network Analysis and Mining, vol. 6, no. 1, pp. 1–20, 2016. [J21]
  56. C. Avin, Z. Lotker, D. Peleg, and I. Turkel, “Social network analysis of program committees and paper acceptance fairness,” in Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 488–495, 2015. [C38]
  57. C. Avin, Z. Lotker, Y. Nahum, and D. Peleg, “Core size and densification in preferential attachment networks,” in International Colloquium on Automata, Languages, and Programming (ICALP), pp. 492–503, 2015. [C37]
  58. C. Avin, B. Keller, Z. Lotker, C. Mathieu, D. Peleg, and Y.-A. Pignolet, “Homophily and the glass ceiling effect in social networks,” in Proceedings of the 2015 conference on innovations in theoretical computer science (ITCS), pp. 41–50, 2015. [C36]
  59. 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]
  60. A. Cohen, B. Haeupler, C. Avin, and M. M ́edard, “Network coding based information spreading in dynamic networks with correlated data,” IEEE Journal on Selected Areas in Communications, vol. 33, no. 2, pp. 213–224, 2015. [J19]
  61. C. Avin, M. Borokhovich, Z. Lotker, and D. Peleg, “Distributed computing on core–periphery networks: Axiom-based design,” in International Colloquium on Automata, Languages, and Programming (ICALP), pp. 399–410. 2015. [C35]
  62. C. Avin, M. Borokhovich, B. Haeupler, and Z. Lotker, “Self-adjusting grid networks to minimize expected path length,” Theor. Comput. Sci.. 584: 91–102 2015. [J18]
  63. C. Avin, M. Borokhovich, Y. Haddad, E. Kantor, Z. Lotker, M. Parter, and D. Peleg, “Testing the irreducibility of nonsquare perron–frobenius systems,” Information Processing Letters, vol. 114, no. 12, pp. 728–733, 2014. [J17]
  64. C. Avin, Y. Lando, and Z. Lotker, “Radio cover time in hyper-graphs,” Ad Hoc Networks, vol. 12, pp. 278–290, 2014. [J16]
  65. M. Borokhovich, C. Avin, and Z. Lotker, “Bounds for algebraic gossip on graphs,” Random Structures & Algorithms, vol. 45, no. 2, pp. 185–217, 2014. [J15]
  66. C. Avin, M. Borokhovich, Z. Lotker, and D. Peleg, “Brief announcement: Distributed mst in core-periphery networks,” in 27th International Symposium on Distributed Computing (DISC), pp. 553– 554, 2013.
  67. C. Avin, O. Dunay, and S. Schmid, “Strategies for traffic-aware VM migration,” in Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing, pp. 305–306, 2013. [C34]
  68. C. Avin and R. Els ̈asser, “Faster rumor spreading: Breaking the log n barrier,” in International Symposium on Distributed Computing (DISC), pp. 209–223, 2013. [C33]
  69. C. Avin, M. Borokhovich, B. Haeupler, and Z. Lotker, “Self-adjusting grid networks to minimize expected path length,” in International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 36–54, 2013. [C32]
  70. C. Avin, M. Borokhovich, and S. Schmid, “Obst: A self-adjusting peer-to-peer overlay based on multiple bsts,” in IEEE P2P 2013, pp. 1–5, IEEE, 2013. [C31]
  71. C. Avin, M. Borokhovich, K. Censor-Hillel, and Z. Lotker, “Order optimal information spreading using algebraic gossip,” Distributed Computing, 26(2):99–117, 2013. [J14]
  72. C. Avin, B. Haeupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally self-adjusting tree networks,” in 2013 IEEE 27th International Symposium on Parallel and Distributed Processing (IPDPS), pp. 395–406, IEEE, 2013. [C30]
  73. C. Avin, M. Borokhovich, Y. Haddad, E. Kantor, Z. Lotker, M. Parter, and D. Peleg, “Generalized perron–frobenius theorem for multiple choice matrices, and applications,” in Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms (SODA), pp. 478–497, 2013. [C29]
  74. E. Dror, C. Avin, and Z. Lotker, “Fast randomized algorithm for 2-hops clustering in vehicular ad-hoc networks,” Ad Hoc Networks, vol. 11, no. 7, pp. 2002–2015, 2013. [J13]
  75. 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]
  76. C. Avin, Z. Lotker, F. Pasquale, and Y.-A. Pignolet, “A note on uniform power connectivity in the physical signal to interference plus noise (sinr) model,” Theoretical Computer Science, vol. 453, pp. 2– 13, 2012. [J11]
  77. S. Schmid, C. Avin, C. Scheideler, B. Haeupler, and Z. Lotker, “Brief announcement: splaynets,” in International Symposium on Distributed Computing (DISC), pp. 439–440, 2012. [C28]
  78. C. Avin, M. Borokhovich, Y. Haddad, and Z. Lotker, “Optimal virtual traffic light placement,” in Proceedings of the 8th international workshop on foundations of mobile computing, pp. 1–10, 2012. [C27]
  79. B. Haeupler, A. Cohen, C. Avin, and M. M ́edard, “Network coded gossip with correlated data,” in 2012 IEEE International Symposium on Information Theory (ISIT), pp. 2616–2620, IEEE, 2012. [C26]
  80. C. Avin, A. Cohen, Y. Haddad, E. Kantor, Z. Lotker, M. Parter, and D. Peleg, “SINR diagram with interference cancellation,” in Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 502–515, 2012. [C25]
  81. E. Menachi, C. Avin, and R. Giladi, “Scalable, hierarchical, ethernet transport network architecture (hetna),” Telecommunication Systems, vol. 49, no. 3, pp. 299–312, 2012. [J10]
  82. E. Dror, C. Avin, and Z. Lotker, “Fast randomized algorithm for hierarchical clustering in vehicular ad-hoc networks,” in 2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop, pp. 1–8, IEEE, 2011. [C24]
  83. C. Avin, Y. Dvory, and R. Giladi, “Geographical quadtree routing,” in Computers and Communications (ISCC), 2011 IEEE Symposium on, pp. 302–308, 2011. [C23]
  84. C. Avin, R. Giladi, and D. Guy, “Psp: Path state protocol for inter-domain routing,” in Computers and Communications (ISCC), 2011 IEEE Symposium on, pp. 287–293, 2011. [C22]
  85. C. Avin, M. Borokhovich, A. Cohen, and Z. Lotker, “Efficient distributed source coding for multiple receivers via matrix sparsification,” in 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2045–2049, IEEE, 2011. [C21]
  86. C. Avin, M. Borokhovich, K. Censor-Hillel, and Z. Lotker, “Order optimal information spreading using algebraic gossip,” in Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (PODC), pp. 363–372, 2011. [C20]
  87. C. Avin, Y. Lando, and Z. Lotker, “Radio cover time in hyper-graphs,” in Proceedings of the 6th international workshop on foundations of mobile computing, pp. 3–12, 2010. [C19]
  88. M. Borokhovich, C. Avin, and Z. Lotker, “Tight bounds for algebraic gossip on graphs,” in 2010 IEEE International Symposium on Information Theory (ISIT), pp. 1758–1762, IEEE, 2010. [C18]
  89. M. Zuniga, C. Avin, and M. Hauswirth, “Querying dynamic wireless sensor networks with non-revisiting random walks,” in European Conference on Wireless Sensor Networks (EWSN), pp. 49–64, 2010. [C17]
  90. C. Avin, R. Giladi, N. Lev-Tov, and Z. Lotker, “From trees to dags: improving the performance of bridged ethernet networks,” in IEEE Global Telecommunications Conference (GLOBECOM), pp. 1–6, 2009. [C16]
  91. C. Avin, Z. Lotker, and Y.-A. Pignolet, “On the power of uniform power: Capacity of wireless networks with bounded resources,” in European Symposium on Algorithms (ESA), pp. 373–384, 2009. [C15]
  92. 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]
  93. C. Avin, Y. Emek, E. Kantor, Z. Lotker, D. Peleg, and L. Roditty, “SINR diagrams: Towards algorithmically usable sinr models of wireless networks,” in Proceedings of the 28th ACM symposium on Principles of distributed computing (PODC), pp. 200–209, 2009. [C14]
  94. R. Friedman, G. Kliot, and C. Avin, “Probabilistic quorum systems in wireless ad hoc networks,” ACM Transactions on Computer Systems (TOCS), vol. 28, no. 3, pp. 1–50, 2008. [J8]
  95. M. Zuniga, C. Avin, and B. Krishnamachari, “Using heterogeneity to enhance random walk-based queries,” Journal of Signal Processing Systems, vol. 57, no. 3, pp. 401–414, 2009. [J7]
  96. C. Avin, Z. Lotker, F. Pasquale, and Y.-A. Pignolet, “A note on uniform power connectivity in the sinr model,” in International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, pp. 116–127, 2009. [C13]
  97. C. Avin, M. Borokhovich, and A. Goldfeld, “Mastering (virtual) networks,” in CSEDU 2009 - Proceedings of the First International Conference on Computer Supported Education, pp. 250–257, 2009. [C12]
  98. C. Avin, “Distance graphs: From random geometric graphs to bernoulli graphs and between,” in Proceedings of the fifth international workshop on Foundations of mobile computing, pp. 71–78, 2008. [C11]
  99. R. Friedman, G. Kliot, and C. Avin, “Probabilistic quorum systems in wireless ad hoc networks,” IN IEEE International Conference on Dependable Systems and Networks (DSN), pp 277–286, 2008. [C10]
  100. N. Alon, C. Avin, M. Koucky, G. Kozma, Z. Lotker, and M. R. Tuttle, “Many random walks are faster than one,” in Proceedings of the twentieth annual symposium on parallelism in algorithms and architectures (SPAA), pp. 119–128, 2008. [C9]
  101. C. Avin, M. Koucky`, and Z. Lotker, “How to explore a fast-changing world (cover time of a simple random walk on evolving graphs),” in International Colloquium on Automata, Languages, and Programming (ICALP), pp. 121–132, 2008. [C8]
  102. C. Avin, “Fast and efficient restricted delaunay triangulation in random geometric graphs,” Internet Mathematics, vol. 5, no. 3, pp. 195–210, 2008. [J6]
  103. C. Avin and B. Krishnamachari, “The power of choice in random walks: An empirical study,” Computer Networks, 52(1):44–60, 2008. [J5]
  104. J. Ahn, S. Kapadia, S. Pattem, A. Sridharan, M. Zuniga, J.-H. Jun, C. Avin, and B. Krishnamachari, “Empirical evaluation of querying mechanisms for unstructured wireless sensor networks,” ACM SIGCOMM Computer Communication Review (CCR), vol. 38, no. 3, pp. 17–26, 2008. [J4]
  105. C. Avin and D. Dayan-Rosenman, “Evolutionary reputation games on social networks,” Complex Systems, vol. 17, no. 3, pp. 259–278, 2007. [J3]
  106. C. Avin and G. Ercal, “On the cover time and mixing time of random geometric graphs,” Theoretical Computer Science, vol. 380, no. 1-2, pp. 2–22, 2007. [J2]
  107. C. Avin and R. Ben-Eliyahu-Zohary, “An upper bound on computing all x-minimal models,” AI Communications, vol. 20, no. 2, pp. 87–92, 2007. [J1]
  108. C. Avin and B. Krishnamachari, “The power of choice in random walks: An empirical study,” in Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems, pp. 219–228, 2006. [C7]
  109. C. Avin and G. Ercal, “On the cover time of random geometric graphs,” in International Colloquium on Automata, Languages, and Programming (ICALP), pp. 677–689, 2005. [C6]
  110. C. Avin, I. Shpitser, and J. Pearl, “Identifiability of path specific effects,” In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), vol. 357, p. 363, 2005. [C5]
  111. C. Avin . “Fast and efficient restricted delaunay triangulation in random geometric graphs,” In Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN-05), 2005. [C4]
  112. C. Avin and G. Ercal, “Bounds on the mixing time and partial cover of ad-hoc and sensor networks,” in the IEEE Second European Workshop on Wireless Sensor Networks (EWSN), pp. 1–12, 2005. [C3]
  113. C. Avin and C. Brito, “Efficient and robust query processing in dynamic environments using random walk techniques,” in Proceedings of the 3rd international symposium on Information processing in sensor networks (ISPN), pp. 277–286, 2004. [C2]
  114. C. Avin and R. B.-E. Zohary, “Algorithms for computing x-minimal models,” in International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 322–335, 2001. [C1]

Publications by topics

[Self-Adjusting Netwroks][Distributed Computing][Random Walks][Social Networks][Wireless Netwroks][Netwroking][Dynamic networks][In-netwrok computing][Information Theory][AI]

Self-Adjusting Netwroks

  • Vamsi Addanki, Chen Avin, Stefan Schmid. Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. accepted to Sigmetrics 2023, 2023. [C72]
  • Johannes Zerwas, Csaba Gy{"o}rgyi, Andreas Blenk, Stefan Schmid, Chen Avin. “Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control,” accepted to Sigmetrics 2023, 2023. [C71]
  • Or Peres, Chen Avin. “Distributed Demand-aware Network Design using Bounded Square Root of Graphs.,” accepted to INFOCOM 2023, 2023. [C70]
  • Arash Pourdamghani, Chen Avin, Robert Sama, Stefan Schmid. “SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree,” accepted to INFOCOM 2023, 2023. [C69]
  • Chen Avin, Marcin Bienkowski, Iosif Salem, Robert Sama, Stefan Schmid, Pawel Schmidt. “Deterministic Self-Adjusting Tree Networks Using Rotor Walks,” in ICDCS 2022: 67-77. 2022. [C68]
  • C. Avin, K. Mondal, and S. Schmid, “Push-Down Trees: Optimal Self-Adjusting Complete Trees,” IEEE/ACM Transactions on Networking, 2022. [J37]
  • C. Avin, K. Mondal, and S. Schmid, “Demand-aware network design with minimal congestion and route lengths,” IEEE/ACM Transactions on Networking, 2022. [J36]
  • C. Griner, S. Schmid, and C. Avin, “Cachenet: Leveraging the principle of locality in reconfigurable network design,” Computer Networks, vol. 204, p. 108648, 2022 [J35]
  • C. Griner, J. Zerwas, A. Blenk, M. Ghobadi, S. Schmid, and C. Avin, “Cerberus: The power of choices in datacenter topology design-a throughput perspective,” Proceedings of the ACM on Measurement and Analysis of Computing Systems (Sigmetrics), vol. 5, no. 3, pp. 1–33, 2021. [C66]
  • J. Zerwas, C. Avin, S. Schmid, and A. Blenk, “Exrec: Experimental framework for reconfigurable networks based on off-the-shelf hardware,” in Proceedings of the Symposium on Architectures for Networking and Communications Systems (ANCS), pp. 66–72, 2021. [C65]
  • C. Griner, and C. Avin, “Cachenet: Leveraging the principle of locality in reconfigurable network design,” In IFIP Networking, pp 1–3. 2021. [C63]
  • C. Avin and S. Schmid, “Renets: Statically-optimal demand-aware networks,” in Symposium on Algorithmic Principles of Computer Systems (APOCS), pp. 25–39, 2021. [C62]
  • B. Peres, O. A. de Oliveira Souza, O. Goussevskaya, C. Avin, and S. Schmid, “Distributed self-adjusting tree networks,” IEEE Transactions on Cloud Computing, 2021. [J39]
  • C. Avin, M. Ghobadi, C. Griner, and S. Schmid, “On the complexity of traffic traces and implications,” Proceedings of the ACM on Measurement and Analysis of Computing Systems (Sigmetrics), vol. 4, no. 1, pp. 1–29, 2020. [C60]
  • C. Avin, M. Bienkowski, A. Loukas, M. Pacut, and S. Schmid, “Dynamic balanced graph partitioning,” SIAM Journal on Discrete Mathematics, vol. 34, no. 3, pp. 1791–1812, 2020. [J32]
  • C. Avin, K. Mondal, and S. Schmid, “Demand-aware network designs of bounded degree,” Distributed Computing, vol. 33, no. 3, pp. 311–325, 2020. [J31]
  • C. Avin, K. Mondal, and S. Schmid, “Dynamically optimal self-adjusting single-source tree networks,” in Latin American Symposium on Theoretical Informatics (LATIN), pp. 143–154. 2020. [C59]
  • C. Avin, I. Salem, and S. Schmid, “Working set theorems for routing in self-adjusting skip list networks,” in IEEE Conference on Computer Communications (INFOCOM), pp. 2175–2184, 2020. [C58]
  • C. Avin, K. Mondal, and S. Schmid, “Demand-aware network design with minimal congestion and route lengths,” In IEEE Conference on Computer Communications (INFOCOM), pp. 1351–1359, 2019. [C57]
  • B. Peres, O. A. de Oliveira Souza, O. Goussevskaya, C. Avin, and S. Schmid, “Distributed self-adjusting tree networks,” in IEEE Conference on Computer Communications (INFOCOM), pp. 145–153, 2019. [C56]
  • C. Avin, L. Cohen, M. Parham, and S. Schmid, “Competitive clustering of stochastic communication patterns on a ring,” Computing, vol. 101, no. 9, pp. 1369–1390, 2019. [J30]
  • O. Raz, C. Avin, and S. Schmid, “Nap: network-aware data partitions for efficient distributed processing,” in 2019 IEEE 18th international symposium on network computing and applications (NCA), pp. 1–9, IEEE, 2019. [C54]
  • C. Avin, I. v. Duijn, and S. Schmid, “Self-adjusting linear networks,” in International Symposium on Stabilizing, Safety, and Security of Distributed Systems (SSS), pp. 368–382, 2019. [C53]
  • C. Avin, I. Salem, and S. Schmid, “Brief Announcement: On Self-Adjusting Skip List Networks”, In International Symposium on Distributed Computing (DISC), pp. 35:1-35:3, 2019. [C51]
  • C. Avin, I. v. Duijn, and S. Schmid, “Brief Announcement: Self-adjusting linear networks,” in International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 368–382, 2019. [C50]
  • C. Avin, A. Hercules, A. Loukas, and S. Schmid, “rDAN: Toward robust demand-aware network designs,” Information Processing Letters, vol. 133, pp. 5–9, 2018. [J28]
  • C. Avin and S. Schmid, “Toward demand-aware networking: A theory for self-adjusting networks,” ACM SIGCOMM Computer Communication Review (CCR), vol. 48, no. 5, pp. 31–40, 2018. [J26]
  • C. Avin, K. Mondal, and S. Schmid, “Demand-aware network designs of bounded degree,” in International Symposium on Distributed Computing (DISC), pp. 5:1–5:16, 2017. [C47]
  • B. Peres, O. Goussevskaia, S. Schmid, and C. Avin, “Brief announcement: Concurrent Self-Adjusting Distributed Tree Networks,” in International Symposium on Distributed Computing (DISC), pp. 58:1–58:3, 2017. [C46]
  • C. Avin, L. Cohen, and S. Schmid, “Competitive Clustering of Stochastic Communication Patterns on the Ring,” In NETYS, pp. 231–247. 2017. [C43]
  • C. Avin, A. Loukas, M. Pacut, and S. Schmid, “Online balanced repartitioning,” in International Symposium on Distributed Computing (DISC), pp. 243–256, 2016. [C39]
  • 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, M. Borokhovich, B. Haeupler, and Z. Lotker, “Self-adjusting grid networks to minimize expected path length,” Theor. Comput. Sci.. 584: 91–102 2015. [J18]
  • C. Avin, O. Dunay, and S. Schmid, “Strategies for traffic-aware VM migration,” in Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing, pp. 305–306, 2013. [C34]
  • C. Avin, M. Borokhovich, B. Haeupler, and Z. Lotker, “Self-adjusting grid networks to minimize expected path length,” in International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 36–54, 2013. [C32]
  • C. Avin, M. Borokhovich, and S. Schmid, “Obst: A self-adjusting peer-to-peer overlay based on multiple bsts,” in IEEE P2P 2013, pp. 1–5, IEEE, 2013. [C31]
  • C. Avin, B. Haeupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally self-adjusting tree networks,” in 2013 IEEE 27th International Symposium on Parallel and Distributed Processing (IPDPS), pp. 395–406, IEEE, 2013. [C30]
  • S. Schmid, C. Avin, C. Scheideler, B. Haeupler, and Z. Lotker, “Brief announcement: splaynets,” in International Symposium on Distributed Computing (DISC), pp. 439–440, 2012. [C28]

Distributed Computing

  • Or Peres, Chen Avin. “Distributed Demand-aware Network Design using Bounded Square Root of Graphs.,” accepted to INFOCOM 2023, 2023.
  • B. Peres, O. A. de Oliveira Souza, O. Goussevskaya, C. Avin, and S. Schmid, “Distributed self-adjusting tree networks,” IEEE Transactions on Cloud Computing, 2021. [J39]
  • B. Peres, O. A. de Oliveira Souza, O. Goussevskaya, C. Avin, and S. Schmid, “Distributed self-adjusting tree networks,” in IEEE Conference on Computer Communications (INFOCOM), pp. 145–153, 2019. [C56]
  • C. Avin, I. Salem, and S. Schmid, “Brief Announcement: On Self-Adjusting Skip List Networks”, In International Symposium on Distributed Computing (DISC), pp. 35:1-35:3, 2019. [C51]
  • C. Avin and R. Elsasser, “Breaking the logn barrier on rumor spreading,” Distributed Computing, vol. 31, no. 6, pp. 503–513, 2018. [J25]
  • C. Avin, M. Borokhovich, Z. Lotker, and D. Peleg, “Distributed computing on core–periphery networks: Axiom-based design,” Journal of Parallel and Distributed Computing, vol. 99, pp. 51–67, 2017. [J24]
  • C. Avin, M. Borokhovich, Z. Lotker, and D. Peleg, “Distributed computing on core–periphery networks: Axiom-based design,” in International Colloquium on Automata, Languages, and Programming (ICALP), pp. 399–410. 2015. [C35]
  • M. Borokhovich, C. Avin, and Z. Lotker, “Bounds for algebraic gossip on graphs,” Random Structures & Algorithms, vol. 45, no. 2, pp. 185–217, 2014. [J15]
  • C. Avin, M. Borokhovich, Z. Lotker, and D. Peleg, “Brief announcement: Distributed mst in core-periphery networks,” in 27th International Symposium on Distributed Computing (DISC), pp. 553– 554, 2013.
  • C. Avin and R. Elsasser, “Faster rumor spreading: Breaking the log n barrier,” in International Symposium on Distributed Computing (DISC), pp. 209–223, 2013. [C33]
  • C. Avin, M. Borokhovich, K. Censor-Hillel, and Z. Lotker, “Order optimal information spreading using algebraic gossip,” in Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (PODC), pp. 363–372, 2011. [C20]

Random Walks

  • C. Avin, M. Koucky`, and Z. Lotker, “Cover time and mixing time of random walks on dynamic graphs,” Random Structures & Algorithms, vol. 52, no. 4, pp. 576–596, 2018. [J29]
  • C. Avin, Y. Lando, and Z. Lotker, “Radio cover time in hyper-graphs,” Ad Hoc Networks, vol. 12, pp. 278–290, 2014. [J16]
  • C. Avin, Y. Lando, and Z. Lotker, “Radio cover time in hyper-graphs,” in Proceedings of the 6th international workshop on foundations of mobile computing, pp. 3–12, 2010. [C19]
  • M. Zuniga, C. Avin, and M. Hauswirth, “Querying dynamic wireless sensor networks with non-revisiting random walks,” in European Conference on Wireless Sensor Networks (EWSN), pp. 49–64, 2010. [C17]
  • 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]
  • R. Friedman, G. Kliot, and C. Avin, “Probabilistic quorum systems in wireless ad hoc networks,” ACM Transactions on Computer Systems (TOCS), vol. 28, no. 3, pp. 1–50, 2008. [J8]
  • M. Zuniga, C. Avin, and B. Krishnamachari, “Using heterogeneity to enhance random walk-based queries,” Journal of Signal Processing Systems, vol. 57, no. 3, pp. 401–414, 2009. [J7]
  • R. Friedman, G. Kliot, and C. Avin, “Probabilistic quorum systems in wireless ad hoc networks,” IN IEEE International Conference on Dependable Systems and Networks (DSN), pp 277–286, 2008. [C10]
  • N. Alon, C. Avin, M. Koucky, G. Kozma, Z. Lotker, and M. R. Tuttle, “Many random walks are faster than one,” in Proceedings of the twentieth annual symposium on parallelism in algorithms and architectures (SPAA), pp. 119–128, 2008. [C9]
  • C. Avin, M. Koucky`, and Z. Lotker, “How to explore a fast-changing world (cover time of a simple random walk on evolving graphs),” in International Colloquium on Automata, Languages, and Programming (ICALP), pp. 121–132, 2008. [C8]
  • C. Avin and B. Krishnamachari, “The power of choice in random walks: An empirical study,” Computer Networks, 52(1):44–60, 2008. [J5]
  • J. Ahn, S. Kapadia, S. Pattem, A. Sridharan, M. Zuniga, J.-H. Jun, C. Avin, and B. Krishnamachari, “Empirical evaluation of querying mechanisms for unstructured wireless sensor networks,” ACM SIGCOMM Computer Communication Review (CCR), vol. 38, no. 3, pp. 17–26, 2008. [J4]
  • C. Avin and G. Ercal, “On the cover time and mixing time of random geometric graphs,” Theoretical Computer Science, vol. 380, no. 1-2, pp. 2–22, 2007. [J2]
  • C. Avin and B. Krishnamachari, “The power of choice in random walks: An empirical study,” in Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems, pp. 219–228, 2006. [C7]
  • C. Avin and G. Ercal, “On the cover time of random geometric graphs,” in International Colloquium on Automata, Languages, and Programming (ICALP), pp. 677–689, 2005. [C6]
  • C. Avin and G. Ercal, “Bounds on the mixing time and partial cover of ad-hoc and sensor networks,” in the IEEE Second European Workshop on Wireless Sensor Networks (EWSN), pp. 1–12, 2005. [C3]
  • C. Avin and C. Brito, “Efficient and robust query processing in dynamic environments using random walk techniques,” in Proceedings of the 3rd international symposium on Information processing in sensor networks (ISPN), pp. 277–286, 2004. [C2]

Social Networks

  • C. Avin, A. Cohen, Z. Lotker, and D. Peleg, “Hotelling games in fault-prone settings,” Theoretical Computer Science, 2022. [J34]
  • C. Avin and Y. Lotker, “De-evolution of preferential attachment trees,” in International Conference on Complex Networks and Their Applications, pp. 508–519. 2021. [C61]
  • C. Avin, H. Daltrophe, B. Keller, Z. Lotker, C. Mathieu, D. Peleg, and Y.-A. Pignolet, “Mixed preferential attachment model: Homophily and minorities in social networks,” Physica A: Statistical Mechanics and its Applications, vol. 555, p. 124723, 2020. [J33]
  • C. Avin, Z. Lotker, Y. Nahum, and D. Peleg, “Random preferential attachment hypergraph,” in Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 398–405, 2019. [C55]
  • C. Avin, Z. Lotker, A. Mizrachi, and D. Peleg, “Majority vote and monopolies in social networks,” in Proceedings of the 20th International Conference on Distributed Computing and Networking (ICDCN), pp. 342– 351, 2019. [C52]
  • C. Avin, A. Cohen, Z. Lotker, and D. Peleg, “Fault-tolerant hotelling games,” in Game Theory for Networking Applications, pp. 133–142, 2019.
  • 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,” PloS one, vol. 13, no. 10, p. e0205820, 2018. [J27]
  • C. Avin, A. Cohen, P. Fraigniaud, Z. Lotker, and D. Peleg, “Preferential attachment as a unique equilibrium,” in Proceedings of the 2018 World Wide Web Conference (WWW), pp. 559–568, 2018. [C49]
  • M. Vaanunu and C. Avin, “Homophily and nationality assortativity among the most cited researchers’ social network,” in 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 584–586, IEEE, 2018. [C48]
  • C. Avin, Z. Lotker, Y. Nahum, and D. Peleg, “Improved degree bounds and full spectrum power laws in preferential attachment networks,” in Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 45–53, 2017. [C45]
  • C. Avin, H. Daltrophe, Z. Lotker, and D. Peleg, “Assortative mixing equilibria in social network games,” in International Conference on Game Theory for Networks, pp. 29–39, Springer, Cham, 2017. [C44]
  • C. Avin, Z. Lotker, Y. Nahum, and D. Peleg, “Modeling and analysis of glass ceiling and power inequality in bi-populated societies,” in International Conference and School on Network Science, pp. 61–73, 2017. [C42]
  • C. Avin, Z. Lotker, D. Peleg, Y.-A. Pignolet, and I. Turkel, “Core-Periphery in networks: an axiomatic approach,” in International Conference and School on Network Science, pp. 75–87, Springer, Cham, 2017. [C41]
  • J. Augustine, C. Avin, M. Liaee, G. Pandurangan, and R. Rajaraman, “Information spreading in dynamic networks under oblivious adversaries,” in International Symposium on Distributed Computing (DISC), pp. 399–413, 2016. [C40]
  • C. Avin, Z. Lotker, D. Peleg, and I. Turkel, “On social networks of program committees,” Social Network Analysis and Mining, vol. 6, no. 1, pp. 1–20, 2016. [J21]
  • C. Avin, Z. Lotker, D. Peleg, and I. Turkel, “Social network analysis of program committees and paper acceptance fairness,” in Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 488–495, 2015. [C38]
  • C. Avin, Z. Lotker, Y. Nahum, and D. Peleg, “Core size and densification in preferential attachment networks,” in International Colloquium on Automata, Languages, and Programming (ICALP), pp. 492–503, 2015. [C37]
  • C. Avin, B. Keller, Z. Lotker, C. Mathieu, D. Peleg, and Y.-A. Pignolet, “Homophily and the glass ceiling effect in social networks,” in Proceedings of the 2015 conference on innovations in theoretical computer science (ITCS), pp. 41–50, 2015. [C36]
  • C. Avin and D. Dayan-Rosenman, “Evolutionary reputation games on social networks,” Complex Systems, vol. 17, no. 3, pp. 259–278, 2007. [J3]

Wireless Netwroks

  • C. Avin, A. Cohen, Y. Haddad, E. Kantor, Z. Lotker, M. Parter, and D. Peleg, “SINR diagram with interference cancellation,” Ad Hoc Networks, vol. 54, pp. 1–16, 2017. [J23]
  • C. Avin, Z. Lotker, F. Pasquale, and Y.-A. Pignolet, “On the power of uniform power: Capacity of wireless networks with bounded resources,” Wireless Networks. 23(8): 2319–2333. 2017. [J22]
  • A. Cohen, B. Haeupler, C. Avin, and M. M ́edard, “Network coding based information spreading in dynamic networks with correlated data,” IEEE Journal on Selected Areas in Communications, vol. 33, no. 2, pp. 213–224, 2015. [J19]
  • C. Avin, M. Borokhovich, Y. Haddad, E. Kantor, Z. Lotker, M. Parter, and D. Peleg, “Testing the irreducibility of nonsquare perron–frobenius systems,” Information Processing Letters, vol. 114, no. 12, pp. 728–733, 2014. [J17]
  • C. Avin, Y. Lando, and Z. Lotker, “Radio cover time in hyper-graphs,” Ad Hoc Networks, vol. 12, pp. 278–290, 2014. [J16]
  • C. Avin, M. Borokhovich, Y. Haddad, E. Kantor, Z. Lotker, M. Parter, and D. Peleg, “Generalized perron–frobenius theorem for multiple choice matrices, and applications,” in Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms (SODA), pp. 478–497, 2013. [C29]
  • E. Dror, C. Avin, and Z. Lotker, “Fast randomized algorithm for 2-hops clustering in vehicular ad-hoc networks,” Ad Hoc Networks, vol. 11, no. 7, pp. 2002–2015, 2013. [J13]
  • 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]
  • C. Avin, Z. Lotker, F. Pasquale, and Y.-A. Pignolet, “A note on uniform power connectivity in the physical signal to interference plus noise (sinr) model,” Theoretical Computer Science, vol. 453, pp. 2– 13, 2012. [J11]
  • C. Avin, M. Borokhovich, Y. Haddad, and Z. Lotker, “Optimal virtual traffic light placement,” in Proceedings of the 8th international workshop on foundations of mobile computing, pp. 1–10, 2012. [C27]
  • B. Haeupler, A. Cohen, C. Avin, and M. M ́edard, “Network coded gossip with correlated data,” in 2012 IEEE International Symposium on Information Theory (ISIT), pp. 2616–2620, IEEE, 2012. [C26]
  • C. Avin, A. Cohen, Y. Haddad, E. Kantor, Z. Lotker, M. Parter, and D. Peleg, “SINR diagram with interference cancellation,” in Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 502–515, 2012. [C25]
  • E. Dror, C. Avin, and Z. Lotker, “Fast randomized algorithm for hierarchical clustering in vehicular ad-hoc networks,” in 2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop, pp. 1–8, IEEE, 2011. [C24]
  • M. Zuniga, C. Avin, and M. Hauswirth, “Querying dynamic wireless sensor networks with non-revisiting random walks,” in European Conference on Wireless Sensor Networks (EWSN), pp. 49–64, 2010. [C17]
  • C. Avin, Z. Lotker, and Y.-A. Pignolet, “On the power of uniform power: Capacity of wireless networks with bounded resources,” in European Symposium on Algorithms (ESA), pp. 373–384, 2009. [C15]
  • C. Avin, Y. Emek, E. Kantor, Z. Lotker, D. Peleg, and L. Roditty, “SINR diagrams: Towards algorithmically usable sinr models of wireless networks,” in Proceedings of the 28th ACM symposium on Principles of distributed computing (PODC), pp. 200–209, 2009. [C14]
  • R. Friedman, G. Kliot, and C. Avin, “Probabilistic quorum systems in wireless ad hoc networks,” ACM Transactions on Computer Systems (TOCS), vol. 28, no. 3, pp. 1–50, 2008. [J8]
  • M. Zuniga, C. Avin, and B. Krishnamachari, “Using heterogeneity to enhance random walk-based queries,” Journal of Signal Processing Systems, vol. 57, no. 3, pp. 401–414, 2009. [J7]
  • C. Avin, Z. Lotker, F. Pasquale, and Y.-A. Pignolet, “A note on uniform power connectivity in the sinr model,” in International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, pp. 116–127, 2009. [C13]
  • C. Avin, “Distance graphs: From random geometric graphs to bernoulli graphs and between,” in Proceedings of the fifth international workshop on Foundations of mobile computing, pp. 71–78, 2008. [C11]
  • R. Friedman, G. Kliot, and C. Avin, “Probabilistic quorum systems in wireless ad hoc networks,” IN IEEE International Conference on Dependable Systems and Networks (DSN), pp 277–286, 2008. [C10]
  • C. Avin, “Fast and efficient restricted delaunay triangulation in random geometric graphs,” Internet Mathematics, vol. 5, no. 3, pp. 195–210, 2008. [J6]
  • J. Ahn, S. Kapadia, S. Pattem, A. Sridharan, M. Zuniga, J.-H. Jun, C. Avin, and B. Krishnamachari, “Empirical evaluation of querying mechanisms for unstructured wireless sensor networks,” ACM SIGCOMM Computer Communication Review (CCR), vol. 38, no. 3, pp. 17–26, 2008. [J4]
  • C. Avin . “Fast and efficient restricted delaunay triangulation in random geometric graphs,” In Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN-05), 2005. [C4]
  • C. Avin and G. Ercal, “Bounds on the mixing time and partial cover of ad-hoc and sensor networks,” in the IEEE Second European Workshop on Wireless Sensor Networks (EWSN), pp. 1–12, 2005. [C3]
  • C. Avin and C. Brito, “Efficient and robust query processing in dynamic environments using random walk techniques,” in Proceedings of the 3rd international symposium on Information processing in sensor networks (ISPN), pp. 277–286, 2004. [C2]

Netwroking

  • Itamar Gozlan, Chen Avin, Gil Einziger, Gabriel Scalosub. “Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing, “ accepted to Sigmetrics 2023, 2023. [C73]
  • E. Menachi, C. Avin, and R. Giladi, “Scalable, hierarchical, ethernet transport network architecture (hetna),” Telecommunication Systems, vol. 49, no. 3, pp. 299–312, 2012. [J10]
  • C. Avin, Y. Dvory, and R. Giladi, “Geographical quadtree routing,” in Computers and Communications (ISCC), 2011 IEEE Symposium on, pp. 302–308, 2011. [C23]
  • C. Avin, R. Giladi, and D. Guy, “Psp: Path state protocol for inter-domain routing,” in Computers and Communications (ISCC), 2011 IEEE Symposium on, pp. 287–293, 2011. [C22]
  • C. Avin, R. Giladi, N. Lev-Tov, and Z. Lotker, “From trees to dags: improving the performance of bridged ethernet networks,” in IEEE Global Telecommunications Conference (GLOBECOM), pp. 1–6, 2009. [C16]
  • C. Avin, M. Borokhovich, and A. Goldfeld, “Mastering (virtual) networks,” in CSEDU 2009 - Proceedings of the First International Conference on Computer Supported Education, pp. 250–257, 2009. [C12]

Dynamic networks

  • C. Avin, M. Koucky`, and Z. Lotker, “Cover time and mixing time of random walks on dynamic graphs,” Random Structures & Algorithms, vol. 52, no. 4, pp. 576–596, 2018. [J29]
  • J. Augustine, C. Avin, M. Liaee, G. Pandurangan, and R. Rajaraman, “Information spreading in dynamic networks under oblivious adversaries,” in International Symposium on Distributed Computing (DISC), pp. 399–413, 2016. [C40]
  • A. Cohen, B. Haeupler, C. Avin, and M. M ́edard, “Network coding based information spreading in dynamic networks with correlated data,” IEEE Journal on Selected Areas in Communications, vol. 33, no. 2, pp. 213–224, 2015. [J19]
  • B. Haeupler, A. Cohen, C. Avin, and M. M ́edard, “Network coded gossip with correlated data,” in 2012 IEEE International Symposium on Information Theory (ISIT), pp. 2616–2620, IEEE, 2012. [C26]
  • C. Avin, M. Koucky`, and Z. Lotker, “How to explore a fast-changing world (cover time of a simple random walk on evolving graphs),” in International Colloquium on Automata, Languages, and Programming (ICALP), pp. 121–132, 2008. [C8]
  • C. Avin and C. Brito, “Efficient and robust query processing in dynamic environments using random walk techniques,” in Proceedings of the 3rd international symposium on Information processing in sensor networks (ISPN), pp. 277–286, 2004. [C2]

In-netwrok computing

  • R. Segal, C. Avin and G. Scalosub, “SOAR: Minimizing Network Utilization Cost With Bounded In-Network Computing,” in IEEE Transactions on Network and Service Management. 2023
  • Itamar Gozlan, Chen Avin, Gil Einziger, Gabriel Scalosub. “Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing, “ accepted to Sigmetrics 2023, 2023. [C73]
  • R. Segal, C. Avin, and G. Scalosub. “Constrained In-network Computing with Low Congestion in Datacenter Networks”. in IEEE Conference on Computer Communications (INFOCOM), pp. 1639-1648, 2022. [C67]
  • R. Segal, C. Avin, and G. Scalosub, “SOAR: minimizing network utilization with bounded in-network computing,” in Proceedings of the 17th International Conference on emerging Networking EXperiments and Technologies (CoNext), pp. 16–29, 2021. [C64]

Information Theory

  • C. Avin, M. Ghobadi, C. Griner, and S. Schmid, “On the complexity of traffic traces and implications,” Proceedings of the ACM on Measurement and Analysis of Computing Systems (Sigmetrics), vol. 4, no. 1, pp. 1–29, 2020. [C60]
  • A. Cohen, B. Haeupler, C. Avin, and M. M ́edard, “Network coding based information spreading in dynamic networks with correlated data,” IEEE Journal on Selected Areas in Communications, vol. 33, no. 2, pp. 213–224, 2015. [J19]
  • M. Borokhovich, C. Avin, and Z. Lotker, “Bounds for algebraic gossip on graphs,” Random Structures & Algorithms, vol. 45, no. 2, pp. 185–217, 2014. [J15]
  • C. Avin, M. Borokhovich, K. Censor-Hillel, and Z. Lotker, “Order optimal information spreading using algebraic gossip,” Distributed Computing, 26(2):99–117, 2013. [J14]
  • B. Haeupler, A. Cohen, C. Avin, and M. M ́edard, “Network coded gossip with correlated data,” in 2012 IEEE International Symposium on Information Theory (ISIT), pp. 2616–2620, IEEE, 2012. [C26]
  • C. Avin, M. Borokhovich, A. Cohen, and Z. Lotker, “Efficient distributed source coding for multiple receivers via matrix sparsification,” in 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2045–2049, IEEE, 2011. [C21]
  • C. Avin, M. Borokhovich, K. Censor-Hillel, and Z. Lotker, “Order optimal information spreading using algebraic gossip,” in Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (PODC), pp. 363–372, 2011. [C20]
  • M. Borokhovich, C. Avin, and Z. Lotker, “Tight bounds for algebraic gossip on graphs,” in 2010 IEEE International Symposium on Information Theory (ISIT), pp. 1758–1762, IEEE, 2010. [C18]

AI

  • C. Avin and R. Ben-Eliyahu-Zohary, “An upper bound on computing all x-minimal models,” AI Communications, vol. 20, no. 2, pp. 87–92, 2007. [J1]
  • C. Avin, I. Shpitser, and J. Pearl, “Identifiability of path specific effects,” In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), vol. 357, p. 363, 2005. [C5]
  • C. Avin and R. B.-E. Zohary, “Algorithms for computing x-minimal models,” in International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 322–335, 2001. [C1]

Publications by type

[Journals][Conferences]

Journals

  • R. Segal, C. Avin and G. Scalosub, “SOAR: Minimizing Network Utilization Cost With Bounded In-Network Computing,” in IEEE Transactions on Network and Service Management. 2023 [J40]
  • B. Peres, O. A. de Oliveira Souza, O. Goussevskaya, C. Avin, and S. Schmid, “Distributed self-adjusting tree networks,” IEEE Transactions on Cloud Computing, 2021. [J39]
  • Chen Avin, Ingo van Duijn, Maciej Pacut, Stefan SchmidPI. “Self-adjusting Linear Networks”. Inf. Comput. 292: 105038 (2023). 2023. [J37]
  • C. Avin, K. Mondal, and S. Schmid, “Push-Down Trees: Optimal Self-Adjusting Complete Trees,” IEEE/ACM Transactions on Networking, 2022. [J37]
  • C. Avin, K. Mondal, and S. Schmid, “Demand-aware network design with minimal congestion and route lengths,” IEEE/ACM Transactions on Networking, 2022. [J36]
  • C. Griner, S. Schmid, and C. Avin, “Cachenet: Leveraging the principle of locality in reconfigurable network design,” Computer Networks, vol. 204, p. 108648, 2022 [J35]
  • C. Avin, A. Cohen, Z. Lotker, and D. Peleg, “Hotelling games in fault-prone settings,” Theoretical Computer Science, 2022. [J34]
  • C. Avin, H. Daltrophe, B. Keller, Z. Lotker, C. Mathieu, D. Peleg, and Y.-A. Pignolet, “Mixed preferential attachment model: Homophily and minorities in social networks,” Physica A: Statistical Mechanics and its Applications, vol. 555, p. 124723, 2020. [J33]
  • C. Avin, M. Bienkowski, A. Loukas, M. Pacut, and S. Schmid, “Dynamic balanced graph partitioning,” SIAM Journal on Discrete Mathematics, vol. 34, no. 3, pp. 1791–1812, 2020. [J32]
  • C. Avin, K. Mondal, and S. Schmid, “Demand-aware network designs of bounded degree,” Distributed Computing, vol. 33, no. 3, pp. 311–325, 2020. [J31]
  • C. Avin, L. Cohen, M. Parham, and S. Schmid, “Competitive clustering of stochastic communication patterns on a ring,” Computing, vol. 101, no. 9, pp. 1369–1390, 2019. [J30]
  • C. Avin, M. Koucky`, and Z. Lotker, “Cover time and mixing time of random walks on dynamic graphs,” Random Structures & Algorithms, vol. 52, no. 4, pp. 576–596, 2018. [J29]
  • C. Avin, A. Hercules, A. Loukas, and S. Schmid, “rDAN: Toward robust demand-aware network designs,” Information Processing Letters, vol. 133, pp. 5–9, 2018. [J28]
  • 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,” PloS one, vol. 13, no. 10, p. e0205820, 2018. [J27]
  • C. Avin and S. Schmid, “Toward demand-aware networking: A theory for self-adjusting networks,” ACM SIGCOMM Computer Communication Review (CCR), vol. 48, no. 5, pp. 31–40, 2018. [J26]
  • C. Avin and R. Elsasser, “Breaking the logn barrier on rumor spreading,” Distributed Computing, vol. 31, no. 6, pp. 503–513, 2018. [J25]
  • C. Avin, M. Borokhovich, Z. Lotker, and D. Peleg, “Distributed computing on core–periphery networks: Axiom-based design,” Journal of Parallel and Distributed Computing, vol. 99, pp. 51–67, 2017. [J24]
  • C. Avin, A. Cohen, Y. Haddad, E. Kantor, Z. Lotker, M. Parter, and D. Peleg, “SINR diagram with interference cancellation,” Ad Hoc Networks, vol. 54, pp. 1–16, 2017. [J23]
  • C. Avin, Z. Lotker, F. Pasquale, and Y.-A. Pignolet, “On the power of uniform power: Capacity of wireless networks with bounded resources,” Wireless Networks. 23(8): 2319–2333. 2017. [J22]
  • C. Avin, Z. Lotker, D. Peleg, and I. Turkel, “On social networks of program committees,” Social Network Analysis and Mining, vol. 6, no. 1, pp. 1–20, 2016. [J21]
  • 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]
  • A. Cohen, B. Haeupler, C. Avin, and M. M ́edard, “Network coding based information spreading in dynamic networks with correlated data,” IEEE Journal on Selected Areas in Communications, vol. 33, no. 2, pp. 213–224, 2015. [J19]
  • C. Avin, M. Borokhovich, B. Haeupler, and Z. Lotker, “Self-adjusting grid networks to minimize expected path length,” Theor. Comput. Sci.. 584: 91–102 2015. [J18]
  • C. Avin, M. Borokhovich, Y. Haddad, E. Kantor, Z. Lotker, M. Parter, and D. Peleg, “Testing the irreducibility of nonsquare perron–frobenius systems,” Information Processing Letters, vol. 114, no. 12, pp. 728–733, 2014. [J17]
  • C. Avin, Y. Lando, and Z. Lotker, “Radio cover time in hyper-graphs,” Ad Hoc Networks, vol. 12, pp. 278–290, 2014. [J16]
  • M. Borokhovich, C. Avin, and Z. Lotker, “Bounds for algebraic gossip on graphs,” Random Structures & Algorithms, vol. 45, no. 2, pp. 185–217, 2014. [J15]
  • C. Avin, M. Borokhovich, K. Censor-Hillel, and Z. Lotker, “Order optimal information spreading using algebraic gossip,” Distributed Computing, 26(2):99–117, 2013. [J14]
  • E. Dror, C. Avin, and Z. Lotker, “Fast randomized algorithm for 2-hops clustering in vehicular ad-hoc networks,” Ad Hoc Networks, vol. 11, no. 7, pp. 2002–2015, 2013. [J13]
  • 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]
  • C. Avin, Z. Lotker, F. Pasquale, and Y.-A. Pignolet, “A note on uniform power connectivity in the physical signal to interference plus noise (sinr) model,” Theoretical Computer Science, vol. 453, pp. 2– 13, 2012. [J11]
  • E. Menachi, C. Avin, and R. Giladi, “Scalable, hierarchical, ethernet transport network architecture (hetna),” Telecommunication Systems, vol. 49, no. 3, pp. 299–312, 2012. [J10]
  • 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]
  • R. Friedman, G. Kliot, and C. Avin, “Probabilistic quorum systems in wireless ad hoc networks,” ACM Transactions on Computer Systems (TOCS), vol. 28, no. 3, pp. 1–50, 2008. [J8]
  • M. Zuniga, C. Avin, and B. Krishnamachari, “Using heterogeneity to enhance random walk-based queries,” Journal of Signal Processing Systems, vol. 57, no. 3, pp. 401–414, 2009. [J7]
  • C. Avin, “Fast and efficient restricted delaunay triangulation in random geometric graphs,” Internet Mathematics, vol. 5, no. 3, pp. 195–210, 2008. [J6]
  • C. Avin and B. Krishnamachari, “The power of choice in random walks: An empirical study,” Computer Networks, 52(1):44–60, 2008. [J5]
  • J. Ahn, S. Kapadia, S. Pattem, A. Sridharan, M. Zuniga, J.-H. Jun, C. Avin, and B. Krishnamachari, “Empirical evaluation of querying mechanisms for unstructured wireless sensor networks,” ACM SIGCOMM Computer Communication Review (CCR), vol. 38, no. 3, pp. 17–26, 2008. [J4]
  • C. Avin and D. Dayan-Rosenman, “Evolutionary reputation games on social networks,” Complex Systems, vol. 17, no. 3, pp. 259–278, 2007. [J3]
  • C. Avin and G. Ercal, “On the cover time and mixing time of random geometric graphs,” Theoretical Computer Science, vol. 380, no. 1-2, pp. 2–22, 2007. [J2]
  • C. Avin and R. Ben-Eliyahu-Zohary, “An upper bound on computing all x-minimal models,” AI Communications, vol. 20, no. 2, pp. 87–92, 2007. [J1]

Conferences

  • Itamar Gozlan, Chen Avin, Gil Einziger, Gabriel Scalosub. “Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing, “ accepted to Sigmetrics 2023, 2023. [C73]
  • Vamsi Addanki, Chen Avin, Stefan Schmid. Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. accepted to Sigmetrics 2023, 2023. [C72]
  • Johannes Zerwas, Csaba Gy{"o}rgyi, Andreas Blenk, Stefan Schmid, Chen Avin. “Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control,” accepted to Sigmetrics 2023, 2023. [C71]
  • Or Peres, Chen Avin. “Distributed Demand-aware Network Design using Bounded Square Root of Graphs.,” accepted to INFOCOM 2023, 2023. [C70]
  • Arash Pourdamghani, Chen Avin, Robert Sama, Stefan Schmid. “SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree,” accepted to INFOCOM 2023, 2023. [C69]
  • Chen Avin, Marcin Bienkowski, Iosif Salem, Robert Sama, Stefan Schmid, Pawel Schmidt. “Deterministic Self-Adjusting Tree Networks Using Rotor Walks,” in ICDCS 2022: 67-77. 2022. [C68]
  • R. Segal, C. Avin, and G. Scalosub. “Constrained In-network Computing with Low Congestion in Datacenter Networks”. in IEEE Conference on Computer Communications (INFOCOM), pp. 1639-1648, 2022. [C67]
  • C. Griner, J. Zerwas, A. Blenk, M. Ghobadi, S. Schmid, and C. Avin, “Cerberus: The power of choices in datacenter topology design-a throughput perspective,” Proceedings of the ACM on Measurement and Analysis of Computing Systems (Sigmetrics), vol. 5, no. 3, pp. 1–33, 2021. [C66]
  • J. Zerwas, C. Avin, S. Schmid, and A. Blenk, “Exrec: Experimental framework for reconfigurable networks based on off-the-shelf hardware,” in Proceedings of the Symposium on Architectures for Networking and Communications Systems (ANCS), pp. 66–72, 2021. [C65]
  • R. Segal, C. Avin, and G. Scalosub, “SOAR: minimizing network utilization with bounded in-network computing,” in Proceedings of the 17th International Conference on emerging Networking EXperiments and Technologies (CoNext), pp. 16–29, 2021. [C64]
  • C. Griner, and C. Avin, “Cachenet: Leveraging the principle of locality in reconfigurable network design,” In IFIP Networking, pp 1–3. 2021. [C63]
  • C. Avin and S. Schmid, “Renets: Statically-optimal demand-aware networks,” in Symposium on Algorithmic Principles of Computer Systems (APOCS), pp. 25–39, 2021. [C62]
  • C. Avin and Y. Lotker, “De-evolution of preferential attachment trees,” in International Conference on Complex Networks and Their Applications, pp. 508–519. 2021. [C61]
  • C. Avin, M. Ghobadi, C. Griner, and S. Schmid, “On the complexity of traffic traces and implications,” Proceedings of the ACM on Measurement and Analysis of Computing Systems (Sigmetrics), vol. 4, no. 1, pp. 1–29, 2020. [C60]
  • C. Avin, K. Mondal, and S. Schmid, “Dynamically optimal self-adjusting single-source tree networks,” in Latin American Symposium on Theoretical Informatics (LATIN), pp. 143–154. 2020. [C59]
  • C. Avin, I. Salem, and S. Schmid, “Working set theorems for routing in self-adjusting skip list networks,” in IEEE Conference on Computer Communications (INFOCOM), pp. 2175–2184, 2020. [C58]
  • C. Avin, K. Mondal, and S. Schmid, “Demand-aware network design with minimal congestion and route lengths,” In IEEE Conference on Computer Communications (INFOCOM), pp. 1351–1359, 2019. [C57]
  • B. Peres, O. A. de Oliveira Souza, O. Goussevskaya, C. Avin, and S. Schmid, “Distributed self-adjusting tree networks,” in IEEE Conference on Computer Communications (INFOCOM), pp. 145–153, 2019. [C56]
  • C. Avin, Z. Lotker, Y. Nahum, and D. Peleg, “Random preferential attachment hypergraph,” in Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 398–405, 2019. [C55]
  • O. Raz, C. Avin, and S. Schmid, “Nap: network-aware data partitions for efficient distributed processing,” in 2019 IEEE 18th international symposium on network computing and applications (NCA), pp. 1–9, IEEE, 2019. [C54]
  • C. Avin, I. v. Duijn, and S. Schmid, “Self-adjusting linear networks,” in International Symposium on Stabilizing, Safety, and Security of Distributed Systems (SSS), pp. 368–382, 2019. [C53]
  • C. Avin, Z. Lotker, A. Mizrachi, and D. Peleg, “Majority vote and monopolies in social networks,” in Proceedings of the 20th International Conference on Distributed Computing and Networking (ICDCN), pp. 342– 351, 2019. [C52]
  • C. Avin, I. Salem, and S. Schmid, “Brief Announcement: On Self-Adjusting Skip List Networks”, In International Symposium on Distributed Computing (DISC), pp. 35:1-35:3, 2019. [C51]
  • C. Avin, A. Cohen, Z. Lotker, and D. Peleg, “Fault-tolerant hotelling games,” in Game Theory for Networking Applications, pp. 133–142, 2019.
  • C. Avin, I. v. Duijn, and S. Schmid, “Brief Announcement: Self-adjusting linear networks,” in International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 368–382, 2019. [C50]
  • C. Avin, A. Cohen, P. Fraigniaud, Z. Lotker, and D. Peleg, “Preferential attachment as a unique equilibrium,” in Proceedings of the 2018 World Wide Web Conference (WWW), pp. 559–568, 2018. [C49]
  • M. Vaanunu and C. Avin, “Homophily and nationality assortativity among the most cited researchers’ social network,” in 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 584–586, IEEE, 2018. [C48]
  • C. Avin, K. Mondal, and S. Schmid, “Demand-aware network designs of bounded degree,” in International Symposium on Distributed Computing (DISC), pp. 5:1–5:16, 2017. [C47]
  • B. Peres, O. Goussevskaia, S. Schmid, and C. Avin, “Brief announcement: Concurrent Self-Adjusting Distributed Tree Networks,” in International Symposium on Distributed Computing (DISC), pp. 58:1–58:3, 2017. [C46]
  • C. Avin, Z. Lotker, Y. Nahum, and D. Peleg, “Improved degree bounds and full spectrum power laws in preferential attachment networks,” in Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 45–53, 2017. [C45]
  • C. Avin, H. Daltrophe, Z. Lotker, and D. Peleg, “Assortative mixing equilibria in social network games,” in International Conference on Game Theory for Networks, pp. 29–39, Springer, Cham, 2017. [C44]
  • C. Avin, L. Cohen, and S. Schmid, “Competitive Clustering of Stochastic Communication Patterns on the Ring,” In NETYS, pp. 231–247. 2017. [C43]
  • C. Avin, Z. Lotker, Y. Nahum, and D. Peleg, “Modeling and analysis of glass ceiling and power inequality in bi-populated societies,” in International Conference and School on Network Science, pp. 61–73, 2017. [C42]
  • C. Avin, Z. Lotker, D. Peleg, Y.-A. Pignolet, and I. Turkel, “Core-Periphery in networks: an axiomatic approach,” in International Conference and School on Network Science, pp. 75–87, Springer, Cham, 2017. [C41]
  • J. Augustine, C. Avin, M. Liaee, G. Pandurangan, and R. Rajaraman, “Information spreading in dynamic networks under oblivious adversaries,” in International Symposium on Distributed Computing (DISC), pp. 399–413, 2016. [C40]
  • C. Avin, A. Loukas, M. Pacut, and S. Schmid, “Online balanced repartitioning,” in International Symposium on Distributed Computing (DISC), pp. 243–256, 2016. [C39]
  • C. Avin, Z. Lotker, D. Peleg, and I. Turkel, “Social network analysis of program committees and paper acceptance fairness,” in Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 488–495, 2015. [C38]
  • C. Avin, Z. Lotker, Y. Nahum, and D. Peleg, “Core size and densification in preferential attachment networks,” in International Colloquium on Automata, Languages, and Programming (ICALP), pp. 492–503, 2015. [C37]
  • C. Avin, B. Keller, Z. Lotker, C. Mathieu, D. Peleg, and Y.-A. Pignolet, “Homophily and the glass ceiling effect in social networks,” in Proceedings of the 2015 conference on innovations in theoretical computer science (ITCS), pp. 41–50, 2015. [C36]
  • C. Avin, M. Borokhovich, Z. Lotker, and D. Peleg, “Distributed computing on core–periphery networks: Axiom-based design,” in International Colloquium on Automata, Languages, and Programming (ICALP), pp. 399–410. 2015. [C35]
  • C. Avin, M. Borokhovich, Z. Lotker, and D. Peleg, “Brief announcement: Distributed mst in core-periphery networks,” in 27th International Symposium on Distributed Computing (DISC), pp. 553– 554, 2013.
  • C. Avin, O. Dunay, and S. Schmid, “Strategies for traffic-aware VM migration,” in Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing, pp. 305–306, 2013. [C34]
  • C. Avin and R. Els ̈asser, “Faster rumor spreading: Breaking the log n barrier,” in International Symposium on Distributed Computing (DISC), pp. 209–223, 2013. [C33]
  • C. Avin, M. Borokhovich, B. Haeupler, and Z. Lotker, “Self-adjusting grid networks to minimize expected path length,” in International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 36–54, 2013. [C32]
  • C. Avin, M. Borokhovich, and S. Schmid, “Obst: A self-adjusting peer-to-peer overlay based on multiple bsts,” in IEEE P2P 2013, pp. 1–5, IEEE, 2013. [C31]
  • C. Avin, B. Haeupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally self-adjusting tree networks,” in 2013 IEEE 27th International Symposium on Parallel and Distributed Processing (IPDPS), pp. 395–406, IEEE, 2013. [C30]
  • C. Avin, M. Borokhovich, Y. Haddad, E. Kantor, Z. Lotker, M. Parter, and D. Peleg, “Generalized perron–frobenius theorem for multiple choice matrices, and applications,” in Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms (SODA), pp. 478–497, 2013. [C29]
  • S. Schmid, C. Avin, C. Scheideler, B. Haeupler, and Z. Lotker, “Brief announcement: splaynets,” in International Symposium on Distributed Computing (DISC), pp. 439–440, 2012. [C28]
  • C. Avin, M. Borokhovich, Y. Haddad, and Z. Lotker, “Optimal virtual traffic light placement,” in Proceedings of the 8th international workshop on foundations of mobile computing, pp. 1–10, 2012. [C27]
  • B. Haeupler, A. Cohen, C. Avin, and M. M ́edard, “Network coded gossip with correlated data,” in 2012 IEEE International Symposium on Information Theory (ISIT), pp. 2616–2620, IEEE, 2012. [C26]
  • C. Avin, A. Cohen, Y. Haddad, E. Kantor, Z. Lotker, M. Parter, and D. Peleg, “SINR diagram with interference cancellation,” in Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 502–515, 2012. [C25]
  • E. Dror, C. Avin, and Z. Lotker, “Fast randomized algorithm for hierarchical clustering in vehicular ad-hoc networks,” in 2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop, pp. 1–8, IEEE, 2011. [C24]
  • C. Avin, Y. Dvory, and R. Giladi, “Geographical quadtree routing,” in Computers and Communications (ISCC), 2011 IEEE Symposium on, pp. 302–308, 2011. [C23]
  • C. Avin, R. Giladi, and D. Guy, “Psp: Path state protocol for inter-domain routing,” in Computers and Communications (ISCC), 2011 IEEE Symposium on, pp. 287–293, 2011. [C22]
  • C. Avin, M. Borokhovich, A. Cohen, and Z. Lotker, “Efficient distributed source coding for multiple receivers via matrix sparsification,” in 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2045–2049, IEEE, 2011. [C21]
  • C. Avin, M. Borokhovich, K. Censor-Hillel, and Z. Lotker, “Order optimal information spreading using algebraic gossip,” in Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (PODC), pp. 363–372, 2011. [C20]
  • C. Avin, Y. Lando, and Z. Lotker, “Radio cover time in hyper-graphs,” in Proceedings of the 6th international workshop on foundations of mobile computing, pp. 3–12, 2010. [C19]
  • M. Borokhovich, C. Avin, and Z. Lotker, “Tight bounds for algebraic gossip on graphs,” in 2010 IEEE International Symposium on Information Theory (ISIT), pp. 1758–1762, IEEE, 2010. [C18]
  • M. Zuniga, C. Avin, and M. Hauswirth, “Querying dynamic wireless sensor networks with non-revisiting random walks,” in European Conference on Wireless Sensor Networks (EWSN), pp. 49–64, 2010. [C17]
  • C. Avin, R. Giladi, N. Lev-Tov, and Z. Lotker, “From trees to dags: improving the performance of bridged ethernet networks,” in IEEE Global Telecommunications Conference (GLOBECOM), pp. 1–6, 2009. [C16]
  • C. Avin, Z. Lotker, and Y.-A. Pignolet, “On the power of uniform power: Capacity of wireless networks with bounded resources,” in European Symposium on Algorithms (ESA), pp. 373–384, 2009. [C15]
  • C. Avin, Y. Emek, E. Kantor, Z. Lotker, D. Peleg, and L. Roditty, “SINR diagrams: Towards algorithmically usable sinr models of wireless networks,” in Proceedings of the 28th ACM symposium on Principles of distributed computing (PODC), pp. 200–209, 2009. [C14]
  • C. Avin, Z. Lotker, F. Pasquale, and Y.-A. Pignolet, “A note on uniform power connectivity in the sinr model,” in International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, pp. 116–127, 2009. [C13]
  • C. Avin, M. Borokhovich, and A. Goldfeld, “Mastering (virtual) networks,” in CSEDU 2009 - Proceedings of the First International Conference on Computer Supported Education, pp. 250–257, 2009. [C12]
  • C. Avin, “Distance graphs: From random geometric graphs to bernoulli graphs and between,” in Proceedings of the fifth international workshop on Foundations of mobile computing, pp. 71–78, 2008. [C11]
  • R. Friedman, G. Kliot, and C. Avin, “Probabilistic quorum systems in wireless ad hoc networks,” IN IEEE International Conference on Dependable Systems and Networks (DSN), pp 277–286, 2008. [C10]
  • N. Alon, C. Avin, M. Koucky, G. Kozma, Z. Lotker, and M. R. Tuttle, “Many random walks are faster than one,” in Proceedings of the twentieth annual symposium on parallelism in algorithms and architectures (SPAA), pp. 119–128, 2008. [C9]
  • C. Avin, M. Koucky`, and Z. Lotker, “How to explore a fast-changing world (cover time of a simple random walk on evolving graphs),” in International Colloquium on Automata, Languages, and Programming (ICALP), pp. 121–132, 2008. [C8]
  • C. Avin and B. Krishnamachari, “The power of choice in random walks: An empirical study,” in Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems, pp. 219–228, 2006. [C7]
  • C. Avin and G. Ercal, “On the cover time of random geometric graphs,” in International Colloquium on Automata, Languages, and Programming (ICALP), pp. 677–689, 2005. [C6]
  • C. Avin, I. Shpitser, and J. Pearl, “Identifiability of path specific effects,” In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), vol. 357, p. 363, 2005. [C5]
  • C. Avin . “Fast and efficient restricted delaunay triangulation in random geometric graphs,” In Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN-05), 2005. [C4]
  • C. Avin and G. Ercal, “Bounds on the mixing time and partial cover of ad-hoc and sensor networks,” in the IEEE Second European Workshop on Wireless Sensor Networks (EWSN), pp. 1–12, 2005. [C3]
  • C. Avin and C. Brito, “Efficient and robust query processing in dynamic environments using random walk techniques,” in Proceedings of the 3rd international symposium on Information processing in sensor networks (ISPN), pp. 277–286, 2004. [C2]
  • C. Avin and R. B.-E. Zohary, “Algorithms for computing x-minimal models,” in International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 322–335, 2001. [C1]