![]() | ![]() |
| 2012 | ||
|---|---|---|
| 42 | Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg: SINR diagram with interference cancellation. SODA 2012: 502-515 | |
| 41 | Bernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Médard: Network Coded Gossip with Correlated Data CoRR abs/1202.1801: (2012) | |
| 40 | Eliav Menachi, Chen Avin, Ran Giladi: Scalable, hierarchical, Ethernet transport network architecture (HETNA). Telecommunication Systems 49(3): 299-312 (2012) | |
| 2011 | ||
| 39 | Chen Avin, Ran Giladi, Dotan Guy: PSP: Path state protocol for inter-domain routing. ISCC 2011: 287-293 | |
| 38 | Chen Avin, Yaniv Dvory, Ran Giladi: Geographical quadtree routing. ISCC 2011: 302-308 | |
| 37 | Chen Avin, Michael Borokhovich, Asaf Cohen, Zvi Lotker: Efficient distributed source coding for multiple receivers via matrix sparsification. ISIT 2011: 2045-2049 | |
| 36 | Efi Dror, Chen Avin, Zvi Lotker: Fast randomized algorithm for hierarchical clustering in Vehicular Ad-Hoc Networks. Med-Hoc-Net 2011: 1-8 | |
| 35 | Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker: Order optimal information spreading using algebraic gossip. PODC 2011: 363-372 | |
| 34 | Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker: Order Optimal Information Spreading Using Algebraic Gossip CoRR abs/1101.4372: (2011) | |
| 33 | Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker: Self-Adjusting Networks to Minimize Expected Path Length CoRR abs/1110.0196: (2011) | |
| 32 | Chen Avin, Zvi Lotker, Yvonne Anne Pignolet: On The Elite of Social Networks CoRR abs/1111.3374: (2011) | |
| 31 | Chen Avin, Michael Borokhovich, Asaf Cohen, Zvi Lotker: Efficient Joint Network-Source Coding for Multiple Terminals with Side Information CoRR abs/1111.5735: (2011) | |
| 30 | 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) | |
| 2010 | ||
| 29 | Chen Avin, Yuval Lando, Zvi Lotker: Radio cover time in hyper-graphs. DIALM-PODC 2010: 3-12 | |
| 28 | Marco Zuniga, Chen Avin, Manfred Hauswirth: Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks. EWSN 2010: 49-64 | |
| 27 | Michael Borokhovich, Chen Avin, Zvi Lotker: Tight bounds for algebraic gossip on graphs. ISIT 2010: 1758-1762 | |
| 26 | Roy Friedman, Gabriel Kliot, Chen Avin: Probabilistic quorum systems in wireless Ad Hoc networks. ACM Trans. Comput. Syst. 28(3): (2010) | |
| 25 | Michael Borokhovich, Chen Avin, Zvi Lotker: Tight Bounds for Algebraic Gossip on Graphs CoRR abs/1001.3265: (2010) | |
| 2009 | ||
| 24 | Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne Anne Pignolet: A Note on Uniform Power Connectivity in the SINR Model. ALGOSENSORS 2009: 116-127 | |
| 23 | Chen Avin, Michael Borokhovich, Arik Goldfeld: Mastering (Virtual) Networks - A Case Study of Virtualizing Internet Lab. CSEDU (2) 2009: 250-257 | |
| 22 | Chen Avin, Zvi Lotker, Yvonne Anne Pignolet: On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources. ESA 2009: 373-384 | |
| 21 | Chen Avin, Ran Giladi, Nissan Lev-Tov, Zvi Lotker: From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks. GLOBECOM 2009: 1-6 | |
| 20 | Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty: SINR diagrams: towards algorithmically usable SINR models of wireless networks. PODC 2009: 200-209 | |
| 19 | Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne Anne Pignolet: A note on uniform power connectivity in the SINR model CoRR abs/0906.2311: (2009) | |
| 18 | Chen Avin, Yuval Lando, Zvi Lotker: Simple Random Walks on Radio Networks (Simple Random Walks on Hyper-Graphs) CoRR abs/0907.1678: (2009) | |
| 17 | Marco Zuniga, Chen Avin, Bhaskar Krishnamachari: Using Heterogeneity to Enhance Random Walk-based Queries. Signal Processing Systems 57(3): 401-414 (2009) | |
| 2008 | ||
| 16 | Chen Avin: Distance graphs: from random geometric graphs to Bernoulli graphs and between. DIALM-POMC 2008: 71-78 | |
| 15 | Roy Friedman, Gabriel Kliot, Chen Avin: Probabilistic quorum systems in wireless ad hoc networks. DSN 2008: 277-286 | |
| 14 | Chen Avin, Michal Koucký, Zvi Lotker: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). ICALP (1) 2008: 121-132 | |
| 13 | Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle: Many random walks are faster than one. SPAA 2008: 119-128 | |
| 12 | Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty: SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks CoRR abs/0811.3284: (2008) | |
| 11 | Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash Sridharan, Marco Zuniga, Jung-Hyun Jun, Chen Avin, Bhaskar Krishnamachari: Empirical evaluation of querying mechanisms for unstructured wireless sensor networks. Computer Communication Review 38(3): 17-26 (2008) | |
| 10 | Chen Avin, Bhaskar Krishnamachari: The power of choice in random walks: An empirical study. Computer Networks 52(1): 44-60 (2008) | |
| 9 | Chen Avin: Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs. Internet Mathematics 5(3): 195-210 (2008) | |
| 2007 | ||
| 8 | Chen Avin, Rachel Ben-Eliyahu-Zohary: An upper bound on computing all X-minimal models. AI Commun. 20(2): 87-92 (2007) | |
| 7 | Chen Avin, Gunes Ercal: On the cover time and mixing time of random geometric graphs. Theor. Comput. Sci. 380(1-2): 2-22 (2007) | |
| 2006 | ||
| 6 | Chen Avin, Bhaskar Krishnamachari: The power of choice in random walks: an empirical study. MSWiM 2006: 219-228 | |
| 2005 | ||
| 5 | Chen Avin, Gunes Ercal: Bounds on the mixing time and partial cover of ad-hoc and sensor networks. EWSN 2005: 1-12 | |
| 4 | Chen Avin, Gunes Ercal: On the Cover Time of Random Geometric Graphs. ICALP 2005: 677-689 | |
| 3 | Chen Avin, Ilya Shpitser, Judea Pearl: Identifiability of Path-Specific Effects. IJCAI 2005: 357-363 | |
| 2004 | ||
| 2 | Chen Avin, Carlos Brito: Efficient and robust query processing in dynamic environments using random walk techniques. IPSN 2004: 277-286 | |
| 2001 | ||
| 1 | Chen Avin, Rachel Ben-Eliyahu-Zohary: Algorithms for Computing X-Minimal Models. LPNMR 2001: 322-335 | |
Colors in the list of coauthors
Last update Sat May 26 04:23:17 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page