On this page... (hide)

My DBLP publication (probably most updated)

Some Papers and Statistics from ACM

Journals

  1. 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): 728-733 (2014)
  2. Chen Avin, Yuval Lando, Zvi Lotker. Radio cover time in hyper-graphs. Ad Hoc Networks 12: 278-290 (2014)
  3. Michael Borokhovich, Chen Avin, Zvi Lotker. Bounds for algebraic gossip on graphs. Random Struct. Algorithms 45(2): 185-217 (2014)
  4. Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker. Order optimal information spreading using algebraic gossip. Distributed Computing 26(2): 99-117 (2013)
  5. Efi Dror, Chen Avin, Zvi Lotker. Fast Randomized Algorithm for 2-Hops Clustering in Vehicular Ad-Hoc Networks. Ad Hoc Networks 11(7): 2002–2015, 2013.
  6. Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, and Liam Roditty. SINR Diagrams: Convexity and its Applications in Wireless Networks. Journal of the ACM 59(4): 18 (2012).
  7. Chen Avin, Zvi Lotker, Francesco Pasquale, and Yvonne-Anne Pignolet. A note on uniform power connectivity in the sinr model. Theor. Comput. Sci.. 453: 2–13 (2012).
  8. Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle. Many Random Walks Are Faster Than One. Combinatorics, Probability & Computing 20(4): 481-502 (2011)
  9. Roy Friedman, Gabriel Kliot and Chen Avin. Probabilistic Quorum Systems in Wireless Ad Hoc Networks. ACM Transactions on Computer Systems, 28(3):1–50. 2010.
  10. Eliav Menachi, Chen Avin and Ran Giladi. Scalable, Hierarchical, Ethernet Transport Network Architecture (HETNA). Telecommunication Systems, 49(3): 299-312 (2012).
  11. Chen Avin. Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs. Internet Mathematics, 5(3):195–210, 2008.
  12. Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari. Using heterogeneity to enhance random walk-based queries. Journal of Signal Processing Systems, 57(3):401–414, 2009.
  13. Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash Sridharan, Marco Zuniga, Jung-Hyun Jun, Chen Avin, and Bhaskar Krishnamachari. Empirical evaluation of querying mechanisms for unstructured wireless sensor networks. SIGCOMM Comput. Commun. Rev., 38(3):17–26, 2008.
  14. Chen Avin and Bhaskar Krishnamachari. The Power of Choice in Random Walks: An Empirical Study. Computer Networks, 52(1):44–60, 2008. pdf.
  15. Chen Avin and Gunes Ercal. On The Cover Time and Mixing Time of Random Geometric Graphs. Theor. Comput. Sci., 380(1-2):2–22, 2007.pdf.
  16. Chen Avin and David Dayan-Rosenman. Evolutionary Reputation Games on Social Networks. Complex Systems, 17:259–277, 2007. pdf.
  17. Chen Avin and Rachel Ben-Eliyahu-Zohary. An Upper Bound For Computing all X-minimal Models. AI Communications, 20(2):87–92, 2007



Conferences

  1. Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg. Distributed Computing on Core-Periphery Networks: Axiom-Based Design. ICALP (2) 2014: 399-410
  2. Chen Avin, Bernhard Haeupler, Zvi Lotker, Christian Scheideler, Stefan Schmid. Locally Self-Adjusting Tree Networks. IPDPS 2013: 395-406
  3. Chen Avin, Michael Borokhovich, Stefan Schmid. OBST: A self-adjusting peer-to-peer overlay based on multiple BSTs. P2P 2013: 1-5
  4. Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker. Self-adjusting Grid Networks to Minimize Expected Path Length. SIROCCO 2013: 36-54
  5. Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg. Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications. SODA 2013: 478-497
  6. Chen Avin, Robert Elsässer. Faster Rumor Spreading: Breaking the logn Barrier. DISC 2013: 209-223
  7. Chen Avin, Michael Borokhovich, Yoram Haddad, Zvi Lotker. Optimal virtual traffic light placement. FOMC 2012: 6
  8. Bernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Médard. Network coded gossip with correlated data. ISIT 2012: 2616-2620
  9. Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg. SINR diagram with interference cancellation. SODA 2012: 502-515
  10. Stefan Schmid, Chen Avin, Christian Scheideler, Bernhard Haeupler, Zvi Lotker. Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. DISC 2012: 439-440
  11. Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker. Order Optimal Information Spreading Using Algebraic Gossip. PODC-11. pp 363-372.
  12. Chen Avin, Michael Borokhovich, Asaf Cohen, Zvi Lotker. Effcient Distributed Source Coding for Multiple Receivers Via Matrix Sparsification. n Proceedings, IEEE International Symposium on Information Theory (ISIT). 2011.
  13. Chen Avin, Ran Giladi, Dotan Guy. PSP: path state protocol for inter-domain routing. IEEE ISCC-11. pp 287-293. Best paper runners' up.
  14. Chen Avin, Yaniv Dvory, Ran Giladi. Geographical Quadtree Routing. IEEE ISCC-11. pp 302-308.
  15. Chen Avin, Yuval Lando, Zvi Lotker. Radio cover time in hyper-graphs. DIALM-POMC, pp 3–12, ACM 2010
  16. Michael Borokhovich, Chen Avin, Zvi Lotker . Tight Bounds for Algebraic Gossip on Graphs. In Proceedings, IEEE International Symposium on Information Theory (ISIT), pp 1758–1762, 2010. pdf.
  17. Marco Zuniga, Chen Avin, Manfred Hauswirth. Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks. EWSN 2010: 49-64. pdf
  18. Chen Avin, Ran Giladi, Nissan Lev-Tov, Zvi Lotker. From Trees to DAGs:Improving the Performance of Bridged Ethernet Networks. Globecom 2009: 1-6. pdf.
  19. Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet. On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources. ESA 2009: 373-384.
  20. Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne-Anne Pignolet. A note on uniform power connectivity in the SINR model. ALGOSENSORS 2009: 116-127. pdf.
  21. Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg and Liam Roditty. SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks. PODC 2009: 200-209. pdf.
  22. Michael Borokhovich, Arik Goldfeld and Chen Avin. MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab. In International Conference on Computer Supported Education, CSEDU (2) 2009: 250-257. pdf
  23. Chen Avin. Distance graphs: from random geometric graphs to bernoulli graphs and between. In Michael Segal and Alexander Kesselman, editors, DIALM-POMC-08, pages 71–78. ACM, 2008.
  24. Chen Avin, Michal Koucky and Zvi Lotker. How to Explore a Fast-Changing World. (On the cover time of dynamic graphs). ICALP-08, Automata, Languages and Programming, pages 121–132, 2008. pdf.
  25. Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle. Many Random Walks Are Faster Than One. SPAA-08, ACM Symposium on Parallel Algorithms and Architectures, pages 119–128, 2008. pdf.
  26. Roy Friedman, Gabriel Kliot, and Chen Avin. Probabilistic Quorum Systems in Wireless Ad Hoc Networks. DCN-08. IEEE International Conference on Dependable Systems and Networks, pages 277–286, 2008. pdf.
  27. Chen Avin and Bhaskar Krishnamachari. The Power of Choice in Random Walks: An Empirical Study. MSWIM-06. ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pages 239–246, 2006. Best Paper Award. pdf.
  28. Chen Avin. Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs. In Workshop on Combinatorial and Algorithmic Aspects of Networking, 2005. CAAN-05. pdf.
  29. Chen Avin and Ilya Shpitser and Judea Pearl. Identifiability of Path-Specific Effects. IJCAI-05. International Joint Conference on Artificial Intelligence , pages 357–363. 2005. pdf. TR.
  30. Chen Avin and Gunes Ercal. On The Cover Time of Random Geometric Graphs. ICALP-05. Automata, Languages and Programming, pages 677–689, 2005. pdf. CSD-TR 040050.
  31. Chen Avin and Gunes Ercal. Bounds on the Mixing Time and Partial Cover of Ad-Hoc and Sensor Networks. EWSN-05. European Workshop on Wireless Sensor Networks, pages 1–1, 2005. pdf. CSD-TR 040028.
  32. Chen Avin and Carlos Brito. Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques. IPSN-04. IEEE/ACM International Symposium on Information Processing in Sensor Networks, pages 396-404, 2004. pdf.
  33. Chen Avin and Rachel Ben-Eliyahu Zohary. Algorithms for Computing X-Minimal Models. LPNMR-01. International Conference on Logic Programming and Nonmonotonic Reasoning, pages 322 - 335, 2001. pdf.

Under Review

Journals

  • Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet. On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources. 2010.
  • Bernhard Haeupler, Asaf Cohen, Chen Avin, and Muriel M´edard. Network Coding Based Information Spreading in Dynamic Networks with Correlated Data. Submitted to IEEE JSAC Special Issue on Network Coding.
  • Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker, Christian Scheideler, and Stefan Schmid. Self-Adjusting Distributed Datastructures. Submitted to IEEE/ACM Transactions on Networking
  • Chen Avin, Michael Borokhovich, Haeupler Bernhard, Zvi Lotker. Self-Adjusting Grid Networks to Minimize Expected Path Length. Submitted to: Theoretical Computer Science

Last updated October 2014