Search the dblp DataBase

Publications of Author

1. Chen Avin, Gunes Ercal
   On the Cover Time of Random Geometric Graphs. [Citation Graph (0, 0)][DBLP]
   ICALP, 2005, pp:677-689 [Conf]
   
2. Chen Avin, Ilya Shpitser, Judea Pearl
   Identifiability of Path-Specific Effects. [Citation Graph (0, 0)][DBLP]
   IJCAI, 2005, pp:357-363 [Conf]
   
3. Chen Avin, Carlos Brito
   Efficient and robust query processing in dynamic environments using random walk techniques. [Citation Graph (0, 0)][DBLP]
   IPSN, 2004, pp:277-286 [Conf]
   
4. Chen Avin, Rachel Ben-Eliyahu-Zohary
   Algorithms for Computing X-Minimal Models. [Citation Graph (0, 0)][DBLP]
   LPNMR, 2001, pp:322-335 [Conf]
   
5. Chen Avin, Bhaskar Krishnamachari
   The power of choice in random walks: an empirical study. [Citation Graph (0, 0)][DBLP]
   MSWiM, 2006, pp:219-228 [Conf]
   
6. Chen Avin, Rachel Ben-Eliyahu-Zohary
   An upper bound on computing all X-minimal models. [Citation Graph (0, 0)][DBLP]
   AI Commun., 2007, v:20, n:2, pp:87-92 [Journal]
   
7. Chen Avin, Gunes Ercal
   On the cover time and mixing time of random geometric graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:1-2, pp:2-22 [Journal]
   
8. 
   A Note on Uniform Power Connectivity in the SINR Model. [Citation Graph (, )][DBLP]
   
   
9. 
   Distance graphs: from random geometric graphs to Bernoulli graphs and between. [Citation Graph (, )][DBLP]
   
   
10. 
    Radio cover time in hyper-graphs. [Citation Graph (, )][DBLP]
    
    
11. 
    Probabilistic quorum systems in wireless ad hoc networks. [Citation Graph (, )][DBLP]
    
    
12. 
    On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources. [Citation Graph (, )][DBLP]
    
    
13. 
    Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks. [Citation Graph (, )][DBLP]
    
    
14. 
    How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). [Citation Graph (, )][DBLP]
    
    
15. 
    SINR diagrams: towards algorithmically usable SINR models of wireless networks. [Citation Graph (, )][DBLP]
    
    
16. 
    Many random walks are faster than one. [Citation Graph (, )][DBLP]
    
    
17. 
    From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks. [Citation Graph (, )][DBLP]
    
    
18. 
    Mastering (Virtual) Networks - A Case Study of Virtualizing Internet Lab. [Citation Graph (, )][DBLP]
    
    
19. 
    Empirical evaluation of querying mechanisms for unstructured wireless sensor networks. [Citation Graph (, )][DBLP]
    
    
20. 
    The power of choice in random walks: An empirical study. [Citation Graph (, )][DBLP]
    
    
21. 
    SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks [Citation Graph (, )][DBLP]
    
    
22. 
    A note on uniform power connectivity in the SINR model [Citation Graph (, )][DBLP]
    
    
23. 
    Simple Random Walks on Radio Networks (Simple Random Walks on Hyper-Graphs) [Citation Graph (, )][DBLP]
    
    
24. 
    Tight Bounds for Algebraic Gossip on Graphs [Citation Graph (, )][DBLP]