| 2008 |
|---|
| 13 | EE | Chen Avin:
Distance graphs: from random geometric graphs to Bernoulli graphs and between.
DIALM-POMC 2008: 71-78 |
| 12 | EE | Roy Friedman,
Gabriel Kliot,
Chen Avin:
Probabilistic quorum systems in wireless ad hoc networks.
DSN 2008: 277-286 |
| 11 | EE | 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 |
| 10 | EE | Noga Alon,
Chen Avin,
Michal Koucký,
Gady Kozma,
Zvi Lotker,
Mark R. Tuttle:
Many random walks are faster than one.
SPAA 2008: 119-128 |
| 9 | EE | 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) |
| 8 | EE | Chen Avin,
Bhaskar Krishnamachari:
The power of choice in random walks: An empirical study.
Computer Networks 52(1): 44-60 (2008) |
| 2007 |
|---|
| 7 | EE | Chen Avin,
Rachel Ben-Eliyahu-Zohary:
An upper bound on computing all X-minimal models.
AI Commun. 20(2): 87-92 (2007) |
| 6 | EE | 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 |
|---|
| 5 | EE | Chen Avin,
Bhaskar Krishnamachari:
The power of choice in random walks: an empirical study.
MSWiM 2006: 219-228 |
| 2005 |
|---|
| 4 | EE | Chen Avin,
Gunes Ercal:
On the Cover Time of Random Geometric Graphs.
ICALP 2005: 677-689 |
| 3 | EE | Chen Avin,
Ilya Shpitser,
Judea Pearl:
Identifiability of Path-Specific Effects.
IJCAI 2005: 357-363 |
| 2004 |
|---|
| 2 | EE | Chen Avin,
Carlos Brito:
Efficient and robust query processing in dynamic environments using random walk techniques.
IPSN 2004: 277-286 |
| 2001 |
|---|
| 1 | EE | Chen Avin,
Rachel Ben-Eliyahu-Zohary:
Algorithms for Computing X-Minimal Models.
LPNMR 2001: 322-335 |
