## Main.Publications History

Hide minor edits - Show changes to output

October 14, 2014, at 10:22 AM
by

- Changed lines 84-85 from:

to:

\\

\\

\\

October 14, 2014, at 10:20 AM
by

- Added lines 84-85:

October 14, 2014, at 10:20 AM
by

- Changed line 260 from:

%right% Last updated April 2010

to:

%right% Last updated October 2014

October 14, 2014, at 10:19 AM
by

- Changed lines 30-31 from:

%black% Fast Randomized Algorithm for 2-Hops Clustering in

Vehicular Ad-Hoc Networks.\

Vehicular Ad-Hoc Networks.\

to:

%black% Fast Randomized Algorithm for 2-Hops Clustering in Vehicular Ad-Hoc Networks.\

Added lines 87-130:

# %item value=33% Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg.\

%black% Distributed Computing on Core-Periphery Networks: Axiom-Based Design.\

%% ICALP (2) 2014: 399-410

# %item value=32% Chen Avin, Bernhard Haeupler, Zvi Lotker, Christian Scheideler, Stefan Schmid.\

%black% Locally Self-Adjusting Tree Networks.\

%% IPDPS 2013: 395-406

# %item value=31% Chen Avin, Michael Borokhovich, Stefan Schmid.\

%black% OBST: A self-adjusting peer-to-peer overlay based on multiple BSTs.\

%% P2P 2013: 1-5

# %item value=30% Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker.\

%black% Self-adjusting Grid Networks to Minimize Expected Path Length.\

%% SIROCCO 2013: 36-54

# %item value=29% Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg.\

%black% Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications.\

%% SODA 2013: 478-497

# %item value=28% Chen Avin, Robert Elsδsser.\

%black% Faster Rumor Spreading: Breaking the logn Barrier.\

%% DISC 2013: 209-223

# %item value=27% Chen Avin, Michael Borokhovich, Yoram Haddad, Zvi Lotker.\

%black% Optimal virtual traffic light placement.\

%% FOMC 2012: 6

# %item value=26% Bernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Mιdard.\

%black% Network coded gossip with correlated data.\

%% ISIT 2012: 2616-2620

# %item value=25% Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg.\

%black% SINR diagram with interference cancellation.\

%% SODA 2012: 502-515

# %item value=24% Stefan Schmid, Chen Avin, Christian Scheideler, Bernhard Haeupler, Zvi Lotker.\

%black% Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.\

%% DISC 2012: 439-440

%black% Distributed Computing on Core-Periphery Networks: Axiom-Based Design.\

%% ICALP (2) 2014: 399-410

# %item value=32% Chen Avin, Bernhard Haeupler, Zvi Lotker, Christian Scheideler, Stefan Schmid.\

%black% Locally Self-Adjusting Tree Networks.\

%% IPDPS 2013: 395-406

# %item value=31% Chen Avin, Michael Borokhovich, Stefan Schmid.\

%black% OBST: A self-adjusting peer-to-peer overlay based on multiple BSTs.\

%% P2P 2013: 1-5

# %item value=30% Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker.\

%black% Self-adjusting Grid Networks to Minimize Expected Path Length.\

%% SIROCCO 2013: 36-54

# %item value=29% Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg.\

%black% Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications.\

%% SODA 2013: 478-497

# %item value=28% Chen Avin, Robert Elsδsser.\

%black% Faster Rumor Spreading: Breaking the logn Barrier.\

%% DISC 2013: 209-223

# %item value=27% Chen Avin, Michael Borokhovich, Yoram Haddad, Zvi Lotker.\

%black% Optimal virtual traffic light placement.\

%% FOMC 2012: 6

# %item value=26% Bernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Mιdard.\

%black% Network coded gossip with correlated data.\

%% ISIT 2012: 2616-2620

# %item value=25% Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg.\

%black% SINR diagram with interference cancellation.\

%% SODA 2012: 502-515

# %item value=24% Stefan Schmid, Chen Avin, Christian Scheideler, Bernhard Haeupler, Zvi Lotker.\

%black% Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.\

%% DISC 2012: 439-440

October 13, 2014, at 08:51 AM
by

- October 13, 2014, at 08:49 AM
by

- Changed lines 199-211 from:

* Michael Borokhovich, Chen Avin and Zvi lotker. \

%black% Tight Bounds for Algebraic Gossip on Graphs.\

%% 2010.

* Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne-Anne Pignolet. \

%black% A note on uniform power connectivity in the SINR model.\

%black% Tight Bounds for Algebraic Gossip on Graphs.\

%% 2010.

* Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne-Anne Pignolet. \

%black% A note on uniform power connectivity in the SINR model.\

to:

* Bernhard Haeupler, Asaf Cohen, Chen Avin, and Muriel M΄edard. \

%black% 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.\

%black% Self-Adjusting Distributed Datastructures.\

%% Submitted to IEEE/ACM Transactions on Networking

* Chen Avin, Michael Borokhovich, Haeupler Bernhard, Zvi Lotker.\

%black% Self-Adjusting Grid Networks to Minimize Expected Path Length.\

%% Submitted to: Theoretical Computer Science

%black% 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.\

%black% Self-Adjusting Distributed Datastructures.\

%% Submitted to IEEE/ACM Transactions on Networking

* Chen Avin, Michael Borokhovich, Haeupler Bernhard, Zvi Lotker.\

%black% Self-Adjusting Grid Networks to Minimize Expected Path Length.\

%% Submitted to: Theoretical Computer Science

October 13, 2014, at 08:44 AM
by

- Changed lines 13-33 from:

to:

# %item value=17% Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg.\

%black% Testing the irreducibility of nonsquare Perron-Frobenius systems.\

%% Inf. Process. Lett. 114(12): 728-733 (2014)

# %item value=16% Chen Avin, Yuval Lando, Zvi Lotker.\

%black% Radio cover time in hyper-graphs.\

%% Ad Hoc Networks 12: 278-290 (2014)

# %item value=15% Michael Borokhovich, Chen Avin, Zvi Lotker.\

%black% Bounds for algebraic gossip on graphs. Random Struct.\

%% Algorithms 45(2): 185-217 (2014)

# %item value=13% Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker.\

%black% Order optimal information spreading using algebraic gossip.\

%% Distributed Computing 26(2): 99-117 (2013)

# %item value=13% Eﬁ Dror, Chen Avin, Zvi Lotker.\

%black% Fast Randomized Algorithm for 2-Hops Clustering in

Vehicular Ad-Hoc Networks.\

%% Ad Hoc Networks 11(7): 20022015, 2013.

%black% Testing the irreducibility of nonsquare Perron-Frobenius systems.\

%% Inf. Process. Lett. 114(12): 728-733 (2014)

# %item value=16% Chen Avin, Yuval Lando, Zvi Lotker.\

%black% Radio cover time in hyper-graphs.\

%% Ad Hoc Networks 12: 278-290 (2014)

# %item value=15% Michael Borokhovich, Chen Avin, Zvi Lotker.\

%black% Bounds for algebraic gossip on graphs. Random Struct.\

%% Algorithms 45(2): 185-217 (2014)

# %item value=13% Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker.\

%black% Order optimal information spreading using algebraic gossip.\

%% Distributed Computing 26(2): 99-117 (2013)

# %item value=13% Eﬁ Dror, Chen Avin, Zvi Lotker.\

%black% Fast Randomized Algorithm for 2-Hops Clustering in

Vehicular Ad-Hoc Networks.\

%% Ad Hoc Networks 11(7): 20022015, 2013.

October 13, 2014, at 08:37 AM
by

- Changed line 10 from:

(:includeurl http://www.bgu.ac.il/~avin/acm_pubs.html height=1100px border=0:)

to:

(:includeurl http://www.bgu.ac.il/~avin/acm_pubs.html height=1350px border=0:)

Added lines 13-21:

# %item value=12% Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, and Liam Roditty.\

%black% SINR Diagrams: Convexity and its Applications in Wireless Networks.\

%% Journal of the ACM 59(4): 18 (2012).

# %item value=11% Chen Avin, Zvi Lotker, Francesco Pasquale, and Yvonne-Anne Pignolet. \

%black% A note on uniform power connectivity in the sinr model.\

%% Theor. Comput. Sci.. 453: 213 (2012).

Changed lines 32-33 from:

%% To appear in Telecommunication Systems.

to:

%% Telecommunication Systems, 49(3): 299-312 (2012).

September 09, 2013, at 03:49 PM
by

- Added lines 2-4:

----

Deleted lines 6-9:

! Papers and Statistics from ACM

(:includeurl http://www.bgu.ac.il/~avin/acm_pubs.html height=1100px border=0:)

! Journals

Added lines 8-12:

! Some Papers and Statistics from ACM

(:includeurl http://www.bgu.ac.il/~avin/acm_pubs.html height=1100px border=0:)

! Journals

----

September 09, 2013, at 03:38 PM
by

- Added lines 2-4:

! [[http://www.dblp.org/search/index.php#query=author:chen_avin | My DBLP publication (probably most updated)]]

April 22, 2012, at 04:58 PM
by

- Changed line 3 from:

(:includeurl http://www.bgu.ac.il/~avin/acm_pubs.html height=1050px border=0:)

to:

(:includeurl http://www.bgu.ac.il/~avin/acm_pubs.html height=1100px border=0:)

October 19, 2011, at 06:33 PM
by

- Added lines 2-3:

! Papers and Statistics from ACM

(:includeurl http://www.bgu.ac.il/~avin/acm_pubs.html height=1050px border=0:)

(:includeurl http://www.bgu.ac.il/~avin/acm_pubs.html height=1050px border=0:)

October 18, 2011, at 10:33 PM
by

- Changed line 2 from:

!Statistics and Download from ACM

to:

! Journals

Deleted lines 3-7:

(:includeurl http://dl.acm.org/authorize?437592 :)

(:includeurl http://dl.acm.org/authorizestats?437592 :)

! Journals

----

(:includeurl http://dl.acm.org/authorizestats?437592 :)

! Journals

----

October 18, 2011, at 10:32 PM
by

- Changed line 2 from:

! Journals

to:

!Statistics and Download from ACM

Added lines 4-8:

(:includeurl http://dl.acm.org/authorize?437592 :)

(:includeurl http://dl.acm.org/authorizestats?437592 :)

! Journals

----

(:includeurl http://dl.acm.org/authorizestats?437592 :)

! Journals

----

September 12, 2011, at 02:05 PM
by

- Changed line 50 from:

# %item value=21% Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker. \

to:

# %item value=23% Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker. \

Changed lines 54-55 from:

# %item value=20% Chen Avin, Michael Borokhovich, Asaf Cohen, Zvi Lotker. \

%black% Eﬃcient Distributed Source Coding for Multiple Receivers Via Matrix Sparsiﬁcation. \

%black% Eﬃcient Distributed Source Coding for Multiple Receivers Via Matrix Sparsiﬁcation. \

to:

# %item value=22% Chen Avin, Michael Borokhovich, Asaf Cohen, Zvi Lotker. \

%black% Effcient Distributed Source Coding for Multiple Receivers Via Matrix Sparsiﬁcation. \

%black% Effcient Distributed Source Coding for Multiple Receivers Via Matrix Sparsiﬁcation. \

Changed line 58 from:

# %item value=20% Chen Avin, Ran Giladi, Dotan Guy. \

to:

# %item value=21% Chen Avin, Ran Giladi, Dotan Guy. \

Changed line 62 from:

# %item value=19% Chen Avin, Yaniv Dvory, Ran Giladi. \

to:

# %item value=20% Chen Avin, Yaniv Dvory, Ran Giladi. \

Added lines 66-69:

# %item value=19% Chen Avin, Yuval Lando, Zvi Lotker. \

%black% Radio cover time in hyper-graphs. \

%% DIALM-POMC, pp 312, ACM 2010

%black% Radio cover time in hyper-graphs. \

%% DIALM-POMC, pp 312, ACM 2010

Deleted lines 156-159:

* Chen Avin.\

%black% Distance Graphs: From Random Geometric Graphs to Erdös-Rényi Graphs.\

%% 2009.

%black% Distance Graphs: From Random Geometric Graphs to Erdös-Rényi Graphs.\

%% 2009.

Deleted lines 160-167:

* Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle.\

%black% Many Random Walks Are Faster Than One.\

%% 2010

* Chen Avin, Ran Giladi, Nissan Lev-Tov, Zvi Lotker. \

%black% From Trees to DAGs:Improving the Performance of Bridged Ethernet Networks.\

%% 2010.

%black% Many Random Walks Are Faster Than One.\

%% 2010

* Chen Avin, Ran Giladi, Nissan Lev-Tov, Zvi Lotker. \

%black% From Trees to DAGs:Improving the Performance of Bridged Ethernet Networks.\

%% 2010.

Changed lines 165-182 from:

!! Conferences

* Chen Avin, Yuval Lando, and Zvi Lotker.\

%black% Simple Random Walks on Radio Networks.\

%% 2010.

* Chen Avin, Yaniv Dvory, and Ran Giladi.\

%black% Geographical Quadtree Routing.\

%% 2010.

* Chen Avin, Yuval Lando, and Zvi Lotker.\

%black% Simple Random Walks on Radio Networks.\

%% 2010.

* Chen Avin, Yaniv Dvory, and Ran Giladi.\

%black% Geographical Quadtree Routing.\

%% 2010.

to:

* Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne-Anne Pignolet. \

%black% A note on uniform power connectivity in the SINR model.\

%black% A note on uniform power connectivity in the SINR model.\

September 12, 2011, at 11:56 AM
by

- Added lines 4-7:

# %item value=10% Noga Alon, Chen Avin, Michal Kouckύ, Gady Kozma, Zvi Lotker, Mark R. Tuttle. \

%black% Many Random Walks Are Faster Than One. \

%% Combinatorics, Probability & Computing 20(4): 481-502 (2011)

%black% Many Random Walks Are Faster Than One. \

%% Combinatorics, Probability & Computing 20(4): 481-502 (2011)

Changed lines 10-11 from:

%% To appear in the ACM Transactions on Computer Systems.

to:

%% ACM Transactions on Computer Systems, 28(3):150. 2010.

Added lines 49-65:

# %item value=21% Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker. \

%black% Order Optimal Information Spreading Using Algebraic Gossip. \

%% PODC-11. pp 363-372.

# %item value=20% Chen Avin, Michael Borokhovich, Asaf Cohen, Zvi Lotker. \

%black% Eﬃcient Distributed Source Coding for Multiple Receivers Via Matrix Sparsiﬁcation. \

%% n Proceedings, IEEE International Symposium on Information Theory (ISIT). 2011.

# %item value=20% Chen Avin, Ran Giladi, Dotan Guy. \

%black% PSP: path state protocol for inter-domain routing. \

%% IEEE ISCC-11. pp 287-293. '''Best paper runners' up'''.

# %item value=19% Chen Avin, Yaniv Dvory, Ran Giladi. \

%black% Geographical Quadtree Routing.\

%% IEEE ISCC-11. pp 302-308.

Changed lines 68-69 from:

%% ISIT 2010. [[http://arxiv.org/abs/1001.3265 | pdf]].

to:

%% In Proceedings, IEEE International Symposium on Information Theory (ISIT), pp 17581762, 2010. [[http://arxiv.org/abs/1001.3265 | pdf]].

April 25, 2010, at 10:26 PM
by

- Added lines 148-151:

* Michael Borokhovich, Chen Avin and Zvi lotker. \

%black% Tight Bounds for Algebraic Gossip on Graphs.\

%% 2010.

%black% Tight Bounds for Algebraic Gossip on Graphs.\

%% 2010.

Changed lines 161-172 from:

* Michael Borokhovich, Chen Avin and Zvi lotker. \

%black% Tight Bounds for Algebraic Gossip on Graphs.\

%% 2010.

%black% Tight Bounds for Algebraic Gossip on Graphs.\

%% 2010.

to:

April 25, 2010, at 09:38 PM
by

- Changed lines 14-15 from:

%% To appear in Journal of Internet Mathematics.

to:

%% Internet Mathematics, 5(3):195210, 2008.

April 07, 2010, at 09:59 AM
by

- Added lines 45-48:

# %item value=18% Michael Borokhovich, Chen Avin, Zvi Lotker .\

%black% Tight Bounds for Algebraic Gossip on Graphs. \

%% ISIT 2010. [[http://arxiv.org/abs/1001.3265 | pdf]].

%black% Tight Bounds for Algebraic Gossip on Graphs. \

%% ISIT 2010. [[http://arxiv.org/abs/1001.3265 | pdf]].

April 01, 2010, at 10:47 AM
by

- Added lines 4-11:

# %item value=9% Roy Friedman, Gabriel Kliot and Chen Avin. \

%black% Probabilistic Quorum Systems in Wireless Ad Hoc Networks. \

%% To appear in the ACM Transactions on Computer Systems.

# %item value=8% Eliav Menachi, Chen Avin and Ran Giladi. \

%black% Scalable, Hierarchical, Ethernet Transport Network Architecture (HETNA). \

%% To appear in Telecommunication Systems.

%black% Probabilistic Quorum Systems in Wireless Ad Hoc Networks. \

%% To appear in the ACM Transactions on Computer Systems.

# %item value=8% Eliav Menachi, Chen Avin and Ran Giladi. \

%black% Scalable, Hierarchical, Ethernet Transport Network Architecture (HETNA). \

%% To appear in Telecommunication Systems.

Changed lines 27-28 from:

pdf.

to:

[[http://www.bgu.ac.il/~avin/papers/prw_cn.pdf | pdf]].

Changed lines 32-33 from:

[[http://www.bgu.ac.il/~avin/papers/gnr.pdf | pdf.]]

to:

[[http://www.bgu.ac.il/~avin/papers/gnr.pdf | pdf]].

Changed lines 50-51 from:

%% Globecom 2009. [[http://www.bgu.ac.il/~avin/papers/globe_cr.pdf | pdf]].

to:

%% Globecom 2009: 1-6. [[http://www.bgu.ac.il/~avin/papers/globe_cr.pdf | pdf]].

Added line 127:

!! Journals

Added lines 131-144:

* Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet. \

%black% On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources.\

%% 2010.

* Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle.\

%black% Many Random Walks Are Faster Than One.\

%% 2010

* Chen Avin, Ran Giladi, Nissan Lev-Tov, Zvi Lotker. \

%black% From Trees to DAGs:Improving the Performance of Bridged Ethernet Networks.\

%% 2010.

!! Conferences

Changed lines 147-157 from:

%% 2009.

* Roy Friedman, Gabriel Kliot and Chen Avin.\

%black% Probabilistic Quorum Systems in Wireless Ad Hoc Networks.\

%% 2009.

%right% Last updated July 2009

* Roy Friedman, Gabriel Kliot and Chen Avin.\

%black% Probabilistic Quorum Systems in Wireless Ad Hoc Networks.\

%% 2009.

%right% Last updated July 2009

to:

%% 2010.

* Chen Avin, Yaniv Dvory, and Ran Giladi.\

%black% Geographical Quadtree Routing.\

%% 2010.

* Michael Borokhovich, Chen Avin and Zvi lotker. \

%black% Tight Bounds for Algebraic Gossip on Graphs.\

%% 2010.

%right% Last updated April 2010

* Chen Avin, Yaniv Dvory, and Ran Giladi.\

%black% Geographical Quadtree Routing.\

%% 2010.

* Michael Borokhovich, Chen Avin and Zvi lotker. \

%black% Tight Bounds for Algebraic Gossip on Graphs.\

%% 2010.

%right% Last updated April 2010

February 21, 2010, at 10:30 AM
by

- Changed lines 37-39 from:

# %item value=17% Marco Zuniga, Chen Avin, Manfred Hauswirth. Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks. EWSN 2010: 49-64. [[http://www.bgu.ac.il/~avin/papers/EWSN10_CR.pdf | pdf]]

to:

# %item value=17% Marco Zuniga, Chen Avin, Manfred Hauswirth.\

%black% Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks.\

%% EWSN 2010: 49-64. [[http://www.bgu.ac.il/~avin/papers/EWSN10_CR.pdf | pdf]]

%black% Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks.\

%% EWSN 2010: 49-64. [[http://www.bgu.ac.il/~avin/papers/EWSN10_CR.pdf | pdf]]

February 21, 2010, at 10:28 AM
by

- Changed line 37 from:

# %item value=17% Marco Zuniga, Chen Avin, Manfred Hauswirth. Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks. EWSN 2010: 49-64. [[http://www.bgu.ac.il/~avin/papers/ewsn10_cr.pdf | pdf]]

to:

# %item value=17% Marco Zuniga, Chen Avin, Manfred Hauswirth. Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks. EWSN 2010: 49-64. [[http://www.bgu.ac.il/~avin/papers/EWSN10_CR.pdf | pdf]]

February 21, 2010, at 10:27 AM
by

- Added line 37:

# %item value=17% Marco Zuniga, Chen Avin, Manfred Hauswirth. Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks. EWSN 2010: 49-64. [[http://www.bgu.ac.il/~avin/papers/ewsn10_cr.pdf | pdf]]

Changed lines 40-41 from:

%% To appear in Globecom 2009. [[http://www.bgu.ac.il/~avin/papers/globe_cr.pdf | pdf]].

to:

%% Globecom 2009. [[http://www.bgu.ac.il/~avin/papers/globe_cr.pdf | pdf]].

Changed lines 44-45 from:

%% To appear in ESA 2009.

to:

%% ESA 2009: 373-384.

Changed lines 48-49 from:

%% To appear in Algosensors 2009. [[http://arxiv.org/abs/0906.2311 | pdf]].

to:

%% ALGOSENSORS 2009: 116-127. [[http://arxiv.org/abs/0906.2311 | pdf]].

Changed lines 52-54 from:

%% To Appear in PODC 2009. [[http://arxiv.org/pdf/0811.3284 | pdf]].

to:

%% PODC 2009: 200-209. [[http://arxiv.org/pdf/0811.3284 | pdf]].

Changed lines 56-57 from:

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab. %% In CSEDU 2009 - International Conference on Computer Supported Education. March, 2009. [[http://www.bgu.ac.il/~avin/papers/CSEDU09_CR.pdf | pdf]]

to:

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab. %% In International Conference on Computer Supported Education, CSEDU (2) 2009: 250-257. [[http://www.bgu.ac.il/~avin/papers/CSEDU09_CR.pdf | pdf]]

January 22, 2010, at 11:20 AM
by

- Changed lines 39-40 from:

%% To appear in Globecom 2009. [[http://www.bgu.ac.il/~avin/papers/globe.pdf | pdf]].

to:

%% To appear in Globecom 2009. [[http://www.bgu.ac.il/~avin/papers/globe_cr.pdf | pdf]].

September 24, 2009, at 09:44 AM
by

- Changed lines 10-11 from:

%% Journal of Signal Processing Systems, 2008.

to:

%% Journal of Signal Processing Systems, 57(3):401414, 2009.

July 15, 2009, at 09:59 PM
by

- Changed lines 4-8 from:

# %item value=7% Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari.\

to:

# %item value=7% Chen Avin.\

%black% Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs.\

%% To appear in Journal of Internet Mathematics.

# %item value=6% Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari.\

%black% Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs.\

%% To appear in Journal of Internet Mathematics.

# %item value=6% Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari.\

Changed line 12 from:

# %item value=6% Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash Sridharan, Marco Zuniga, Jung-Hyun Jun, Chen Avin, and Bhaskar Krishnamachari.\

to:

# %item value=5% Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash Sridharan, Marco Zuniga, Jung-Hyun Jun, Chen Avin, and Bhaskar Krishnamachari.\

Changed line 16 from:

# %item value=5% Chen Avin and Bhaskar Krishnamachari.\

to:

# %item value=4% Chen Avin and Bhaskar Krishnamachari.\

Deleted lines 20-23:

# %item value=4% Chen Avin.\

%black% Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs.\

%% To appear in Journal of Internet Mathematics.

%black% Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs.\

%% To appear in Journal of Internet Mathematics.

July 05, 2009, at 08:43 AM
by

- Changed lines 117-118 from:

%black% Distance Graphs: From Random Geometric Graphs to

Erdös-Rényi Graphs.\

Erdös-Rényi Graphs.\

to:

%black% Distance Graphs: From Random Geometric Graphs to Erdös-Rényi Graphs.\

July 05, 2009, at 08:43 AM
by

- Changed line 116 from:

# Chen Avin.\

to:

* Chen Avin.\

Changed line 120 from:

# Chen Avin, Yuval Lando, and Zvi Lotker.\

to:

* Chen Avin, Yuval Lando, and Zvi Lotker.\

Changed line 123 from:

# Roy Friedman, Gabriel Kliot and Chen Avin.\

to:

* Roy Friedman, Gabriel Kliot and Chen Avin.\

July 05, 2009, at 08:42 AM
by

- Changed line 116 from:

# Chen Avin.\

to:

# Chen Avin.\

Changed line 120 from:

# Chen Avin, Yuval Lando, and Zvi Lotker.\

to:

# Chen Avin, Yuval Lando, and Zvi Lotker.\

Changed line 123 from:

# Roy Friedman, Gabriel Kliot and Chen Avin.\

to:

# Roy Friedman, Gabriel Kliot and Chen Avin.\

July 05, 2009, at 08:41 AM
by

- Deleted line 119:

Deleted line 122:

July 05, 2009, at 08:40 AM
by

- Changed lines 116-123 from:

# Chen Avin, Nissan Lev-tov and Zvi Lotker.\

%black% Orient: A New Architecture for Bridged Ethernet Networks.\

%% 2008.

%right% Last updated November 2008

%black% Orient: A New Architecture for Bridged Ethernet Networks.\

%% 2008.

%right% Last updated November 2008

to:

# Chen Avin.\

%black% Distance Graphs: From Random Geometric Graphs to

Erdös-Rényi Graphs.\

%% 2009.

# Chen Avin, Yuval Lando, and Zvi Lotker.\

%black% Simple Random Walks on Radio Networks.\

%% 2009.

# Roy Friedman, Gabriel Kliot and Chen Avin.\

%black% Probabilistic Quorum Systems in Wireless Ad Hoc Networks.\

%% 2009.

%right% Last updated July 2009

%black% Distance Graphs: From Random Geometric Graphs to

Erdös-Rényi Graphs.\

%% 2009.

# Chen Avin, Yuval Lando, and Zvi Lotker.\

%black% Simple Random Walks on Radio Networks.\

%% 2009.

# Roy Friedman, Gabriel Kliot and Chen Avin.\

%black% Probabilistic Quorum Systems in Wireless Ad Hoc Networks.\

%% 2009.

%right% Last updated July 2009

July 05, 2009, at 08:32 AM
by

- Changed line 38 from:

%black% [[From Trees to DAGs:Improving the Performance of Bridged Ethernet Networks]].\

to:

%black% From Trees to DAGs:Improving the Performance of Bridged Ethernet Networks.\

July 05, 2009, at 08:26 AM
by

- Changed line 38 from:

%black% "From Trees to DAGs:Improving the Performance of Bridged Ethernet Networks".\

to:

%black% [[From Trees to DAGs:Improving the Performance of Bridged Ethernet Networks]].\

July 05, 2009, at 08:25 AM
by

- Changed line 38 from:

%black% 'From Trees to DAGs:Improving the Performance of Bridged Ethernet Networks'.\

to:

%black% "From Trees to DAGs:Improving the Performance of Bridged Ethernet Networks".\

July 05, 2009, at 08:24 AM
by

- Changed line 38 from:

%black% From Trees to DAGs:Improving the Performance of Bridged Ethernet Networks.\

to:

%black% 'From Trees to DAGs:Improving the Performance of Bridged Ethernet Networks'.\

July 05, 2009, at 08:20 AM
by

- Changed line 38 from:

%black% From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks.\

to:

%black% From Trees to DAGs:Improving the Performance of Bridged Ethernet Networks.\

July 05, 2009, at 08:20 AM
by

- Changed lines 38-40 from:

%black From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks.\

To appear in Globecom 2009. [[http://www.bgu.ac.il/~avin/papers/globe.pdf | pdf]].

To appear in Globecom 2009. [[http://www.bgu.ac.il/~avin/papers/globe.pdf | pdf]].

to:

%black% From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks.\

%% To appear in Globecom 2009. [[http://www.bgu.ac.il/~avin/papers/globe.pdf | pdf]].

%% To appear in Globecom 2009. [[http://www.bgu.ac.il/~avin/papers/globe.pdf | pdf]].

Changed lines 42-44 from:

%black On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources.\

To appear in ESA 2009.

To appear in ESA 2009.

to:

%black% On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources.\

%% To appear in ESA 2009.

%% To appear in ESA 2009.

Changed lines 46-48 from:

%black A note on uniform power connectivity in the SINR model.\

To appear in Algosensors 2009. [[http://arxiv.org/abs/0906.2311 | pdf]].

To appear in Algosensors 2009. [[http://arxiv.org/abs/0906.2311 | pdf]].

to:

%black% A note on uniform power connectivity in the SINR model.\

%% To appear in Algosensors 2009. [[http://arxiv.org/abs/0906.2311 | pdf]].

%% To appear in Algosensors 2009. [[http://arxiv.org/abs/0906.2311 | pdf]].

July 05, 2009, at 08:18 AM
by

- Added lines 37-48:

# %item value=16% Chen Avin, Ran Giladi, Nissan Lev-Tov, Zvi Lotker. \

%black From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks.\

To appear in Globecom 2009. [[http://www.bgu.ac.il/~avin/papers/globe.pdf | pdf]].

# %item value=15% Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet. \

%black On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources.\

To appear in ESA 2009.

# %item value=14% Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne-Anne Pignolet. \

%black A note on uniform power connectivity in the SINR model.\

To appear in Algosensors 2009. [[http://arxiv.org/abs/0906.2311 | pdf]].

%black From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks.\

To appear in Globecom 2009. [[http://www.bgu.ac.il/~avin/papers/globe.pdf | pdf]].

# %item value=15% Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet. \

%black On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources.\

To appear in ESA 2009.

# %item value=14% Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne-Anne Pignolet. \

%black A note on uniform power connectivity in the SINR model.\

To appear in Algosensors 2009. [[http://arxiv.org/abs/0906.2311 | pdf]].

May 09, 2009, at 10:29 AM
by

- Changed line 37 from:

# Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg and Liam Roditty.\

to:

# %item value=13% Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg and Liam Roditty.\

May 09, 2009, at 10:28 AM
by

- Changed line 4 from:

# Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari.\

to:

# %item value=7% Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari.\

Changed line 8 from:

# Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash Sridharan, Marco Zuniga, Jung-Hyun Jun, Chen Avin, and Bhaskar Krishnamachari.\

to:

# %item value=6% Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash Sridharan, Marco Zuniga, Jung-Hyun Jun, Chen Avin, and Bhaskar Krishnamachari.\

Changed line 12 from:

# Chen Avin and Bhaskar Krishnamachari.\

to:

# %item value=5% Chen Avin and Bhaskar Krishnamachari.\

Changed line 17 from:

# Chen Avin.\

to:

# %item value=4% Chen Avin.\

Changed line 21 from:

# Chen Avin and Gunes Ercal.\

to:

# %item value=3% Chen Avin and Gunes Ercal.\

Changed lines 37-42 from:

# Michael Borokhovich, Arik Goldfeld and Chen Avin.\

to:

# Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg and Liam Roditty.\

%black% SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks.\

%% To Appear in PODC 2009. [[http://arxiv.org/pdf/0811.3284 | pdf]].

# %item value=12% Michael Borokhovich, Arik Goldfeld and Chen Avin.\

%black% SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks.\

%% To Appear in PODC 2009. [[http://arxiv.org/pdf/0811.3284 | pdf]].

# %item value=12% Michael Borokhovich, Arik Goldfeld and Chen Avin.\

Changed line 45 from:

# Chen Avin.\

to:

# %item value=11% Chen Avin.\

Changed line 49 from:

# Chen Avin, Michal Koucky and Zvi Lotker.\

to:

# %item value=10% Chen Avin, Michal Koucky and Zvi Lotker.\

Changed line 54 from:

# Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle.\

to:

# %item value=9% Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle.\

Changed line 59 from:

# Roy Friedman, Gabriel Kliot, and Chen Avin.\

to:

# %item value=8% Roy Friedman, Gabriel Kliot, and Chen Avin.\

Changed line 64 from:

# Chen Avin and Bhaskar Krishnamachari.\

to:

# %item value=7% Chen Avin and Bhaskar Krishnamachari.\

Changed line 69 from:

# Chen Avin.\

to:

# %item value=6% Chen Avin.\

Changed line 74 from:

# Chen Avin and Ilya Shpitser and Judea Pearl.\

to:

# %item value=5% Chen Avin and Ilya Shpitser and Judea Pearl.\

Changed line 80 from:

# Chen Avin and Gunes Ercal.\

to:

# %item value=4% Chen Avin and Gunes Ercal.\

Changed line 86 from:

# Chen Avin and Gunes Ercal.\

to:

# %item value=3% Chen Avin and Gunes Ercal.\

Changed line 92 from:

# Chen Avin and Carlos Brito.\

to:

# %item value=2% Chen Avin and Carlos Brito.\

Changed line 97 from:

# Chen Avin and Rachel Ben-Eliyahu Zohary.\

to:

# %item value=1% Chen Avin and Rachel Ben-Eliyahu Zohary.\

Changed lines 108-114 from:

# Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg and Liam Roditty.\

%black% SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks.\

%%2008. [[http://arxiv.org/pdf/0811.3284 | pdf]].

%black% SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks.\

%%2008. [[http://arxiv.org/pdf/0811.3284 | pdf]].

to:

May 09, 2009, at 10:24 AM
by

- Changed line 26 from:

# Chen Avin and David Dayan-Rosenman.\

to:

# %item value=2% Chen Avin and David Dayan-Rosenman.\

Changed line 31 from:

# Chen Avin and Rachel Ben-Eliyahu-Zohary.\

to:

# %item value=1% Chen Avin and Rachel Ben-Eliyahu-Zohary.\

April 12, 2009, at 09:59 AM
by

- Changed lines 38-39 from:

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab. %% In CSEDU 2009 - International Conference on Computer Supported Education.

March, 2009. [[http://www.bgu.ac.il/~avin/papers/CSEDU09_CR.pdf | pdf]]

March, 2009. [[http://www.bgu.ac.il/~avin/papers/CSEDU09_CR.pdf | pdf]]

to:

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab. %% In CSEDU 2009 - International Conference on Computer Supported Education. March, 2009. [[http://www.bgu.ac.il/~avin/papers/CSEDU09_CR.pdf | pdf]]

April 12, 2009, at 09:58 AM
by

- Deleted line 39:

April 03, 2009, at 11:10 AM
by

- Changed lines 38-40 from:

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab. %% In CSEDU 2009 - International Conference on Computer Supported Education\

April, 2009. [[http://www.bgu.ac.il/~avin/papers/CSEDU09_CR.pdf | pdf]]

April, 2009. [[http://www.bgu.ac.il/~avin/papers/CSEDU09_CR.pdf | pdf]]

to:

March, 2009. [[http://www.bgu.ac.il/~avin/papers/CSEDU09_CR.pdf | pdf]]

April 03, 2009, at 11:09 AM
by

- Added lines 37-40:

# Michael Borokhovich, Arik Goldfeld and Chen Avin.\

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab. %% In CSEDU 2009 - International Conference on Computer Supported Education\

April, 2009. [[http://www.bgu.ac.il/~avin/papers/CSEDU09_CR.pdf | pdf]]

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab. %% In CSEDU 2009 - International Conference on Computer Supported Education\

April, 2009. [[http://www.bgu.ac.il/~avin/papers/CSEDU09_CR.pdf | pdf]]

Changed lines 108-113 from:

# Michael Borokhovich, Arik Goldfeld and Chen Avin.\

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab.\

%% 2008. [[http://www.bgu.ac.il/~avin/papers/CSEDU09.pdf | pdf]]

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab.\

%% 2008. [[http://www.bgu.ac.il/~avin/papers/CSEDU09.pdf | pdf]]

to:

December 12, 2008, at 08:15 AM
by

- Changed lines 97-99 from:

%black% Orient: A New Architecture for Bridged Ethernet Networks.\ %%

2008

2008

to:

%black% Orient: A New Architecture for Bridged Ethernet Networks.\

%% 2008.

%% 2008.

Changed lines 101-103 from:

%black% SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks.\%%

2008. [[http://arxiv.org/pdf/0811.3284 | pdf]].

2008. [[http://arxiv.org/pdf/0811.3284 | pdf]].

to:

%black% SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks.\

%%2008. [[http://arxiv.org/pdf/0811.3284 | pdf]].

%%2008. [[http://arxiv.org/pdf/0811.3284 | pdf]].

Changed lines 105-109 from:

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab.\ %%

2008. [[http://www.bgu.ac.il/~avin/papers/CSEDU09.pdf | pdf]]

2008. [[http://www.bgu.ac.il/~avin/papers/CSEDU09.pdf | pdf]]

to:

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab.\

%% 2008. [[http://www.bgu.ac.il/~avin/papers/CSEDU09.pdf | pdf]]

%% 2008. [[http://www.bgu.ac.il/~avin/papers/CSEDU09.pdf | pdf]]

December 12, 2008, at 08:14 AM
by

- Changed line 97 from:

%black% Orient: A New Architecture for Bridged Ethernet Networks.\

to:

%black% Orient: A New Architecture for Bridged Ethernet Networks.\ %%

Changed line 101 from:

%black% SINR Diagrams: Towards Algorithmically Usable SINR Models ofWireless Networks.\

to:

%black% SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks.\%%

Changed line 105 from:

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab.\

to:

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab.\ %%

December 12, 2008, at 08:13 AM
by

- Changed lines 104-105 from:

to:

# Michael Borokhovich, Arik Goldfeld and Chen Avin.\

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab.\

2008. [[http://www.bgu.ac.il/~avin/papers/CSEDU09.pdf | pdf]]

%black% MASTERING (VIRTUAL) NETWORKS: A Case Study of Virtualizing Internet Lab.\

2008. [[http://www.bgu.ac.il/~avin/papers/CSEDU09.pdf | pdf]]

December 05, 2008, at 06:34 PM
by

- Added line 1:

(:*toc:)

November 20, 2008, at 11:07 AM
by

- Changed lines 101-104 from:

2008. [http://arxiv.org/pdf/0811.3284 | pdf].

to:

2008. [[http://arxiv.org/pdf/0811.3284 | pdf]].

November 20, 2008, at 11:06 AM
by

- Changed lines 101-104 from:

2008. [http://arxiv.org/pdf/0811.3284 pdf].

to:

2008. [http://arxiv.org/pdf/0811.3284 | pdf].

November 20, 2008, at 11:06 AM
by

- Changed lines 101-104 from:

2008.

to:

2008. [http://arxiv.org/pdf/0811.3284 pdf].

November 18, 2008, at 06:30 AM
by

- Changed lines 100-101 from:

%black% SINR Diagrams:

Towards Algorithmically Usable SINR Models ofWireless Networks.\

Towards Algorithmically Usable SINR Models ofWireless Networks.\

to:

%black% SINR Diagrams: Towards Algorithmically Usable SINR Models ofWireless Networks.\

November 18, 2008, at 06:29 AM
by

- Changed lines 99-100 from:

to:

# Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg and Liam Roditty.\

%black% SINR Diagrams:

Towards Algorithmically Usable SINR Models ofWireless Networks.\

2008.

%black% SINR Diagrams:

Towards Algorithmically Usable SINR Models ofWireless Networks.\

2008.

November 18, 2008, at 06:28 AM
by

- Changed lines 95-97 from:

to:

# Chen Avin, Nissan Lev-tov and Zvi Lotker.\

%black% Orient: A New Architecture for Bridged Ethernet Networks.\

2008

%black% Orient: A New Architecture for Bridged Ethernet Networks.\

2008

November 18, 2008, at 06:26 AM
by

- Changed lines 28-29 from:

[[http://www.bgu.ac.il/~avin/papers/reciprocity_cs.pdf pdf]].

to:

[[http://www.bgu.ac.il/~avin/papers/reciprocity_cs.pdf | pdf]].

Changed lines 42-43 from:

%% ICALP-08, Automata, Languages and Programming, pages 121132, 2008. pdf.

to:

%% ICALP-08, Automata, Languages and Programming, pages 121132, 2008.\

[[http://www.bgu.ac.il/~avin/papers/dynamic.pdf | pdf]].

[[http://www.bgu.ac.il/~avin/papers/dynamic.pdf | pdf]].

Changed lines 47-48 from:

%% SPAA-08, ACM Symposium on Parallel Algorithms and Architectures, pages 119128, 2008. pdf.

to:

%% SPAA-08, ACM Symposium on Parallel Algorithms and Architectures, pages 119128, 2008.\

[[http://www.bgu.ac.il/~avin/papers/many_rw.pdf | pdf]].

[[http://www.bgu.ac.il/~avin/papers/many_rw.pdf | pdf]].

Changed lines 52-53 from:

%% DCN-08. IEEE International Conference on Dependable Systems and Networks, pages 277286, 2008. pdf.

to:

%% DCN-08. IEEE International Conference on Dependable Systems and Networks, pages 277286, 2008.\

[[http://www.bgu.ac.il/~avin/papers/PQR_DSN.pdf | pdf]].

[[http://www.bgu.ac.il/~avin/papers/PQR_DSN.pdf | pdf]].

Changed lines 58-59 from:

pdf.

to:

[[http://www.bgu.ac.il/~avin/papers/MSWiM06-CR.pdf | pdf]].

Changed lines 63-64 from:

pdf.

to:

[[http://www.bgu.ac.il/~avin/papers/delaunay.pdf | pdf]].

Changed lines 68-69 from:

pdf. TR.

to:

[[http://www.bgu.ac.il/~avin/papers/886.pdf | pdf]].\

[[http://ftp.cs.ucla.edu/pub/stat_ser/r321-L.pdf | TR]].

[[http://ftp.cs.ucla.edu/pub/stat_ser/r321-L.pdf | TR]].

Changed lines 74-75 from:

pdf. CSD-TR 040050.

to:

[[http://www.bgu.ac.il/~avin/papers/ICALP05.pdf | pdf]].\

[[http://www.bgu.ac.il/~avin/papers/delaunay.pdf | CSD-TR 040050]].

[[http://www.bgu.ac.il/~avin/papers/delaunay.pdf | CSD-TR 040050]].

Changed lines 80-81 from:

pdf. CSD-TR 040028.

to:

[[http://www.bgu.ac.il/~avin/papers/bounds.pdf | pdf]].\

[[http://www.bgu.ac.il/~avin/papers/delaunay.pdf | CSD-TR 040028]].

[[http://www.bgu.ac.il/~avin/papers/delaunay.pdf | CSD-TR 040028]].

Changed lines 86-87 from:

pdf.

to:

[[ http://www.bgu.ac.il/~avin/papers/efficient.pdf | pdf]].

Changed lines 91-92 from:

pdf.

to:

[[http://www.bgu.ac.il/~avin/papers/xmin01.pdf | pdf]].

Changed lines 94-98 from:

----

to:

----

%right% Last updated November 2008

%right% Last updated November 2008

November 18, 2008, at 06:20 AM
by

- Changed lines 27-28 from:

%% Complex Systems, 17:259277, 2007. pdf.

to:

%% Complex Systems, 17:259277, 2007.\

[[http://www.bgu.ac.il/~avin/papers/reciprocity_cs.pdf pdf]].

[[http://www.bgu.ac.il/~avin/papers/reciprocity_cs.pdf pdf]].

November 18, 2008, at 06:18 AM
by

- Changed line 53 from:

%% MSWIiM-06. ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pages 239246, 2006. '''Best Paper Award'''.\

to:

%% MSWIM-06. ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pages 239246, 2006. '''Best Paper Award'''.\

November 18, 2008, at 06:18 AM
by

- Changed line 53 from:

%% MSWiM06. MSWIM-06 ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pages 239246, 2006. '''Best Paper Award'''.\

to:

%% MSWIiM-06. ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pages 239246, 2006. '''Best Paper Award'''.\

November 18, 2008, at 06:17 AM
by

- Changed line 53 from:

%% MSWiM06. MSWiM ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pages 239246, 2006. '''Best Paper Award'''.\

to:

%% MSWiM06. MSWIM-06 ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pages 239246, 2006. '''Best Paper Award'''.\

November 18, 2008, at 06:16 AM
by

- Changed line 53 from:

%% MSWiM06. ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pages 239246, 2006. '''Best Paper Award'''.\

to:

%% MSWiM06. MSWiM ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pages 239246, 2006. '''Best Paper Award'''.\

November 18, 2008, at 06:16 AM
by

- Changed line 53 from:

%% MSWiM-06. ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pages 239246, 2006. '''Best Paper Award'''.\

to:

%% MSWiM06. ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pages 239246, 2006. '''Best Paper Award'''.\

November 18, 2008, at 06:14 AM
by

- Changed line 53 from:

$$ MSWiM-06. ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pages 239246, 2006. '''Best Paper Award'''.\

to:

%% MSWiM-06. ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pages 239246, 2006. '''Best Paper Award'''.\

Changed line 78 from:

IPSN-04. IEEE/ACM International Symposium on Information Processing in Sensor Networks, pages 396-404, 2004.\

to:

%% IPSN-04. IEEE/ACM International Symposium on Information Processing in Sensor Networks, pages 396-404, 2004.\

November 18, 2008, at 06:13 AM
by

- Changed lines 51-64 from:

# Chen Avin and Bhaskar Krishnamachari, The Power of Choice in Random Walks: An Empirical Study. The 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, (MSWiM), Malaga, Spain, October 2006. [Best Paper Award]. pdf.

# 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.

# Chen Avin and Ilya Shpitser and Judea Pearl. Identifiability of Path-Specific Effects. In Proceedings, Nineteenth International Joint Conference on Artificial Intelligence IJCAI-05, pp 357363. 2005. pdf. TR.

# Chen Avin and Gunes Ercal. On The Cover Time of Random Geometric Graphs. In Proceedings. Automata, Languages and Programming, 32nd International Colloquium, ICALP-05, pages 677689, 2005. pdf. CSD-TR 040050.

# Chen Avin and Gunes Ercal. Bounds on the Mixing Time and Partial Cover of Ad-Hoc and Sensor Networks. Second European Workshop on Wireless Sensor Networks (EWSN) Istanbul, Turkey, January 31 - February 2, 2005. pdf. CSD-TR 040028.

# Chen Avin and Carlos Brito. Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques. In Proceedings of the Third IEEE/ACM International Symposium on Information Processing in Sensor Networks (IPSN 2004), pp. 396-404, Berkeley, California, April 26-27, 2004. pdf.

# Chen Avin and Rachel Ben-Eliyahu Zohary. Algorithms for Computing X-Minimal Models. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '01). pp 322 - 335. 2001. pdf.

# 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.

# Chen Avin and Ilya Shpitser and Judea Pearl. Identifiability of Path-Specific Effects. In Proceedings, Nineteenth International Joint Conference on Artificial Intelligence IJCAI-05, pp 357363. 2005. pdf. TR.

# Chen Avin and Gunes Ercal. On The Cover Time of Random Geometric Graphs. In Proceedings. Automata, Languages and Programming, 32nd International Colloquium, ICALP-05, pages 677689, 2005. pdf. CSD-TR 040050.

# Chen Avin and Gunes Ercal. Bounds on the Mixing Time and Partial Cover of Ad-Hoc and Sensor Networks. Second European Workshop on Wireless Sensor Networks (EWSN) Istanbul, Turkey, January 31 - February 2, 2005. pdf. CSD-TR 040028.

# Chen Avin and Carlos Brito. Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques. In Proceedings of the Third IEEE/ACM International Symposium on Information Processing in Sensor Networks (IPSN 2004), pp. 396-404, Berkeley, California, April 26-27, 2004. pdf.

# Chen Avin and Rachel Ben-Eliyahu Zohary. Algorithms for Computing X-Minimal Models. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '01). pp 322 - 335. 2001. pdf.

to:

# Chen Avin and Bhaskar Krishnamachari.\

%black% 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 239246, 2006. '''Best Paper Award'''.\

pdf.

# Chen Avin.\

%black% Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs.\

%% In Workshop on Combinatorial and Algorithmic Aspects of Networking, 2005. CAAN-05.\

pdf.

# Chen Avin and Ilya Shpitser and Judea Pearl.\

%black% Identifiability of Path-Specific Effects.\

%% IJCAI-05. International Joint Conference on Artificial Intelligence , pages 357363. 2005.\

pdf. TR.

# Chen Avin and Gunes Ercal.\

%black% On The Cover Time of Random Geometric Graphs.\

%% ICALP-05. Automata, Languages and Programming, pages 677689, 2005.\

pdf. CSD-TR 040050.

# Chen Avin and Gunes Ercal.\

%black% Bounds on the Mixing Time and Partial Cover of Ad-Hoc and Sensor Networks.\

%% EWSN-05. European Workshop on Wireless Sensor Networks, pages 11, 2005.\

pdf. CSD-TR 040028.

# Chen Avin and Carlos Brito.\

%black% 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.

# Chen Avin and Rachel Ben-Eliyahu Zohary.\

%black% Algorithms for Computing X-Minimal Models.\

%% LPNMR-01. International Conference on Logic Programming and Nonmonotonic Reasoning, pages 322 - 335, 2001.\

pdf.

%black% 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 239246, 2006. '''Best Paper Award'''.\

pdf.

# Chen Avin.\

%black% Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs.\

%% In Workshop on Combinatorial and Algorithmic Aspects of Networking, 2005. CAAN-05.\

pdf.

# Chen Avin and Ilya Shpitser and Judea Pearl.\

%black% Identifiability of Path-Specific Effects.\

%% IJCAI-05. International Joint Conference on Artificial Intelligence , pages 357363. 2005.\

pdf. TR.

# Chen Avin and Gunes Ercal.\

%black% On The Cover Time of Random Geometric Graphs.\

%% ICALP-05. Automata, Languages and Programming, pages 677689, 2005.\

pdf. CSD-TR 040050.

# Chen Avin and Gunes Ercal.\

%black% Bounds on the Mixing Time and Partial Cover of Ad-Hoc and Sensor Networks.\

%% EWSN-05. European Workshop on Wireless Sensor Networks, pages 11, 2005.\

pdf. CSD-TR 040028.

# Chen Avin and Carlos Brito.\

%black% 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.

# Chen Avin and Rachel Ben-Eliyahu Zohary.\

%black% Algorithms for Computing X-Minimal Models.\

%% LPNMR-01. International Conference on Logic Programming and Nonmonotonic Reasoning, pages 322 - 335, 2001.\

pdf.

Changed lines 87-90 from:

----

# Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari. Using Heterogeneity to Enhance Random Walk-based Queries. USC Computer Engineering Technical Report CENG-2006-8, August 2006.

# Chen Avin. Distance Graphs: From Random Geometric Graphs to Bernoulli Graphs and Between. CSD-TR 060011

# Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari. Using Heterogeneity to Enhance Random Walk-based Queries. USC Computer Engineering Technical Report CENG-2006-8, August 2006.

# Chen Avin. Distance Graphs: From Random Geometric Graphs to Bernoulli Graphs and Between. CSD-TR 060011

to:

----

November 17, 2008, at 09:10 PM
by

- Changed lines 45-47 from:

%% SPAA-08, ACM Symposium on Parallel Algorithms

and Architectures, pages 119128, 2008. pdf.

and Architectures, pages 119128, 2008. pdf.

to:

%% SPAA-08, ACM Symposium on Parallel Algorithms and Architectures, pages 119128, 2008. pdf.

November 17, 2008, at 09:09 PM
by

- Changed lines 14-16 from:

pdf. \

bibtex.

bibtex.

to:

pdf.

Changed lines 23-25 from:

[[http://www.bgu.ac.il/~avin/papers/gnr.pdf | pdf.]] \

bibtex.

bibtex.

to:

[[http://www.bgu.ac.il/~avin/papers/gnr.pdf | pdf.]]

Changed lines 40-46 from:

How to Explore a Fast-Changing World. (On the cover time of dynamic graphs).\

ICALP-08: to appear in the 35th International Colloquium on Automata, Languages and Programming. Reykjavik, Iceland, July , 2008. pdf.

# Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle. Many Random Walks Are Faster Than One. SPAA-08: to appear in the 20th ACM Symposium on Parallelism in Algorithms and Architectures. Munich, Germany, June , 2008. pdf.

# Roy Friedman, Gabriel Kliot, and Chen Avin. Probabilistic Quorum Systems in Wireless Ad Hoc Networks. DSN-DCCS 2008: to appear in the 38th IEEE International Conference on Dependable Systems and Networks, Anchorage, Alaska, June 2008. pdf.

ICALP-08: to appear in the 35th International Colloquium on Automata, Languages and Programming. Reykjavik, Iceland, July , 2008. pdf.

# Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle. Many Random Walks Are Faster Than One. SPAA-08: to appear in the 20th ACM Symposium on Parallelism in Algorithms and Architectures. Munich, Germany, June , 2008. pdf.

# Roy Friedman, Gabriel Kliot, and Chen Avin. Probabilistic Quorum Systems in Wireless Ad Hoc Networks. DSN-DCCS 2008: to appear in the 38th IEEE International Conference on Dependable Systems and Networks, Anchorage, Alaska, June 2008. pdf.

to:

%black% How to Explore a Fast-Changing World. (On the cover time of dynamic graphs).\

%% ICALP-08, Automata, Languages and Programming, pages 121132, 2008. pdf.

# Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle.\

%black% Many Random Walks Are Faster Than One.\

%% SPAA-08, ACM Symposium on Parallel Algorithms

and Architectures, pages 119128, 2008. pdf.

# Roy Friedman, Gabriel Kliot, and Chen Avin.\

%black% Probabilistic Quorum Systems in Wireless Ad Hoc Networks.\

%% DCN-08. IEEE International Conference on Dependable Systems and Networks, pages 277286, 2008. pdf.

%% ICALP-08, Automata, Languages and Programming, pages 121132, 2008. pdf.

# Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle.\

%black% Many Random Walks Are Faster Than One.\

%% SPAA-08, ACM Symposium on Parallel Algorithms

and Architectures, pages 119128, 2008. pdf.

# Roy Friedman, Gabriel Kliot, and Chen Avin.\

%black% Probabilistic Quorum Systems in Wireless Ad Hoc Networks.\

%% DCN-08. IEEE International Conference on Dependable Systems and Networks, pages 277286, 2008. pdf.

November 17, 2008, at 09:03 PM
by

- Changed lines 3-4 from:

# Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari.\ %black% Using heterogeneity to enhance random walk-based queries.\

to:

# Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari.\

%black% Using heterogeneity to enhance random walk-based queries.\

%black% Using heterogeneity to enhance random walk-based queries.\

Changed lines 39-41 from:

%% In Michael Segal and Alexander Kesselman, editors,

DIALM-POMC-08, pages 7178. ACM, 2008.

DIALM-POMC-08, pages 7178. ACM, 2008.

to:

%% In Michael Segal and Alexander Kesselman, editors, DIALM-POMC-08, pages 7178. ACM, 2008.

November 17, 2008, at 09:02 PM
by

- Added lines 3-9:

# Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari.\ %black% Using heterogeneity to enhance random walk-based queries.\

%% Journal of Signal Processing Systems, 2008.

# Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash Sridharan, Marco Zuniga, Jung-Hyun Jun, Chen Avin, and Bhaskar Krishnamachari.\

%black% Empirical evaluation of querying mechanisms for unstructured wireless sensor networks.\

%% SIGCOMM Comput. Commun. Rev., 38(3):1726, 2008.

%% Journal of Signal Processing Systems, 2008.

# Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash Sridharan, Marco Zuniga, Jung-Hyun Jun, Chen Avin, and Bhaskar Krishnamachari.\

%black% Empirical evaluation of querying mechanisms for unstructured wireless sensor networks.\

%% SIGCOMM Comput. Commun. Rev., 38(3):1726, 2008.

Added lines 36-40:

# Chen Avin.\

%black% Distance graphs: from random geometric graphs to bernoulli graphs and between.\

%% In Michael Segal and Alexander Kesselman, editors,

DIALM-POMC-08, pages 7178. ACM, 2008.

%black% Distance graphs: from random geometric graphs to bernoulli graphs and between.\

%% In Michael Segal and Alexander Kesselman, editors,

DIALM-POMC-08, pages 7178. ACM, 2008.

November 17, 2008, at 08:54 PM
by

- Deleted line 0:

(:toc:)

November 17, 2008, at 08:53 PM
by

- Added line 1:

(:toc:)

Changed lines 30-31 from:

# Chen Avin, Michal Koucky and Zvi Lotker. How to Explore a Fast-Changing World. (On the cover time of dynamic graphs). ICALP-08: to appear in the 35th International Colloquium on Automata, Languages and Programming. Reykjavik, Iceland, July , 2008. pdf.

to:

# Chen Avin, Michal Koucky and Zvi Lotker.\

How to Explore a Fast-Changing World. (On the cover time of dynamic graphs).\

ICALP-08: to appear in the 35th International Colloquium on Automata, Languages and Programming. Reykjavik, Iceland, July , 2008. pdf.

How to Explore a Fast-Changing World. (On the cover time of dynamic graphs).\

ICALP-08: to appear in the 35th International Colloquium on Automata, Languages and Programming. Reykjavik, Iceland, July , 2008. pdf.

November 17, 2008, at 09:02 AM
by

- Changed lines 25-26 from:

AI Communications, 20(2):8792, 2007

to:

%% AI Communications, 20(2):8792, 2007

November 17, 2008, at 09:02 AM
by

- Changed line 4 from:

%blue% The Power of Choice in Random Walks: An Empirical Study.\

to:

%black% The Power of Choice in Random Walks: An Empirical Study.\

Changed line 10 from:

%blue% Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs.\

to:

%black% Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs.\

Changed line 14 from:

%blue% On The Cover Time and Mixing Time of Random Geometric Graphs.\

to:

%black% On The Cover Time and Mixing Time of Random Geometric Graphs.\

Changed line 20 from:

%blue% Evolutionary Reputation Games on Social Networks.\

to:

%black% Evolutionary Reputation Games on Social Networks.\

Changed line 24 from:

%blue% An Upper Bound For Computing all X-minimal Models.\

to:

%black% An Upper Bound For Computing all X-minimal Models.\

November 17, 2008, at 09:01 AM
by

- Changed lines 21-22 from:

Complex Systems, 17:259277, 2007. pdf.

to:

%% Complex Systems, 17:259277, 2007. pdf.

November 17, 2008, at 09:01 AM
by

- Changed lines 17-18 from:

bibtex

to:

bibtex.

November 17, 2008, at 09:00 AM
by

- Changed line 16 from:

[[http://www.bgu.ac.il/~avin/papers/gnr.pdf | pdf.]]

to:

[[http://www.bgu.ac.il/~avin/papers/gnr.pdf | pdf.]] \

November 17, 2008, at 09:00 AM
by

- Changed line 16 from:

[[http://www.bgu.ac.il/~avin/papers/gnr.pdf | pdf.]]\

to:

[[http://www.bgu.ac.il/~avin/papers/gnr.pdf | pdf.]]

November 17, 2008, at 08:59 AM
by

- Changed line 16 from:

[http://www.bgu.ac.il/~avin/papers/gnr.pdf | pdf.]\

to:

[[http://www.bgu.ac.il/~avin/papers/gnr.pdf | pdf.]]\

November 17, 2008, at 08:59 AM
by

- Changed line 16 from:

[http://www.bgu.ac.il/~avin/papers/gnr.pdf pdf.]\

to:

[http://www.bgu.ac.il/~avin/papers/gnr.pdf | pdf.]\

November 17, 2008, at 08:58 AM
by

- Changed lines 9-16 from:

# Chen Avin. Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs. To appear in Journal of Internet Mathematics.

# Chen Avin and Gunes Ercal. On The Cover Time and Mixing Time of Random Geometric Graphs. Theor. Comput. Sci., 380(1-2):222, 2007. pdf.

# Chen Avin and David Dayan-Rosenman. Evolutionary Reputation Games on Social Networks. Complex Systems, 17:259277, 2007. pdf.

# Chen Avin and Rachel Ben-Eliyahu-Zohary. An Upper Bound For Computing all X-minimal Models. AI Communications, 20(2):8792, 2007

# Chen Avin and Gunes Ercal. On The Cover Time and Mixing Time of Random Geometric Graphs. Theor. Comput. Sci., 380(1-2):222, 2007. pdf.

# Chen Avin and David Dayan-Rosenman. Evolutionary Reputation Games on Social Networks. Complex Systems, 17:259277, 2007. pdf.

# Chen Avin and Rachel Ben-Eliyahu-Zohary. An Upper Bound For Computing all X-minimal Models. AI Communications, 20(2):8792, 2007

to:

# Chen Avin.\

%blue% Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs.\

%% To appear in Journal of Internet Mathematics.

# Chen Avin and Gunes Ercal.\

%blue% On The Cover Time and Mixing Time of Random Geometric Graphs.\

%% Theor. Comput. Sci., 380(1-2):222, 2007.\

[http://www.bgu.ac.il/~avin/papers/gnr.pdf pdf.]\

bibtex

# Chen Avin and David Dayan-Rosenman.\

%blue% Evolutionary Reputation Games on Social Networks.\

Complex Systems, 17:259277, 2007. pdf.

# Chen Avin and Rachel Ben-Eliyahu-Zohary.\

%blue% An Upper Bound For Computing all X-minimal Models.\

AI Communications, 20(2):8792, 2007

%blue% Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs.\

%% To appear in Journal of Internet Mathematics.

# Chen Avin and Gunes Ercal.\

%blue% On The Cover Time and Mixing Time of Random Geometric Graphs.\

%% Theor. Comput. Sci., 380(1-2):222, 2007.\

[http://www.bgu.ac.il/~avin/papers/gnr.pdf pdf.]\

bibtex

# Chen Avin and David Dayan-Rosenman.\

%blue% Evolutionary Reputation Games on Social Networks.\

Complex Systems, 17:259277, 2007. pdf.

# Chen Avin and Rachel Ben-Eliyahu-Zohary.\

%blue% An Upper Bound For Computing all X-minimal Models.\

AI Communications, 20(2):8792, 2007

November 17, 2008, at 08:40 AM
by

- Changed lines 7-8 from:

bibtex. \\

to:

bibtex.

November 17, 2008, at 08:40 AM
by

- Changed lines 7-8 from:

bibtex. \

to:

bibtex. \\

November 17, 2008, at 08:39 AM
by

- Changed lines 4-8 from:

%blue% The Power of Choice in Random Walks: An Empirical Study.

%% Computer Networks, 52(1):4460, 2008.

pdf.

bibtex.

%% Computer Networks, 52(1):4460, 2008.

pdf.

bibtex.

to:

%blue% The Power of Choice in Random Walks: An Empirical Study.\

%% Computer Networks, 52(1):4460, 2008. \

pdf. \

bibtex. \

%% Computer Networks, 52(1):4460, 2008. \

pdf. \

bibtex. \

November 17, 2008, at 08:39 AM
by

- Changed line 3 from:

# Chen Avin and Bhaskar Krishnamachari.

to:

# Chen Avin and Bhaskar Krishnamachari.\

November 17, 2008, at 08:39 AM
by

- November 17, 2008, at 08:38 AM
by

- Changed lines 3-4 from:

# Chen Avin and Bhaskar Krishnamachari. %blue% The Power of Choice in Random Walks: An Empirical Study. %% Computer Networks, 52(1):4460, 2008.

to:

# Chen Avin and Bhaskar Krishnamachari.

%blue% The Power of Choice in Random Walks: An Empirical Study.

%% Computer Networks, 52(1):4460, 2008.

pdf.

bibtex.

%blue% The Power of Choice in Random Walks: An Empirical Study.

%% Computer Networks, 52(1):4460, 2008.

pdf.

bibtex.

November 17, 2008, at 08:37 AM
by

- Changed lines 3-4 from:

# Chen Avin and Bhaskar Krishnamachari. %blue% The Power of Choice in Random Walks: An Empirical Study. %black% Computer Networks, 52(1):4460, 2008.

to:

# Chen Avin and Bhaskar Krishnamachari. %blue% The Power of Choice in Random Walks: An Empirical Study. %% Computer Networks, 52(1):4460, 2008.

November 17, 2008, at 08:36 AM
by

- Changed lines 3-4 from:

# Chen Avin and Bhaskar Krishnamachari, The Power of Choice in Random Walks: An Empirical Study. Computer Networks, 52(1):4460, 2008.

to:

# Chen Avin and Bhaskar Krishnamachari. %blue% The Power of Choice in Random Walks: An Empirical Study. %black% Computer Networks, 52(1):4460, 2008.

November 17, 2008, at 08:23 AM
by

- Changed lines 2-4 from:

to:

----

Changed line 14 from:

to:

----

Added line 36:

----

November 17, 2008, at 08:22 AM
by

- Added lines 3-4:

November 17, 2008, at 08:22 AM
by

- Added line 2:

Added line 14:

November 17, 2008, at 08:21 AM
by

- Changed lines 2-36 from:

Chen Avin and Bhaskar Krishnamachari, The Power of Choice in Random Walks: An Empirical Study. Computer Networks, 52(1):4460, 2008.

Chen Avin. Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs. To appear in Journal of Internet Mathematics.

Chen Avin and Gunes Ercal. On The Cover Time and Mixing Time of Random Geometric Graphs. Theor. Comput. Sci., 380(1-2):222, 2007. pdf.

Chen Avin and David Dayan-Rosenman. Evolutionary Reputation Games on Social Networks. Complex Systems, 17:259277, 2007. pdf.

Chen Avin and Rachel Ben-Eliyahu-Zohary. An Upper Bound For Computing all X-minimal Models. AI Communications, 20(2):8792, 2007

Conferences

Chen Avin, Michal Koucky and Zvi Lotker. How to Explore a Fast-Changing World. (On the cover time of dynamic graphs). ICALP-08: to appear in the 35th International Colloquium on Automata, Languages and Programming. Reykjavik, Iceland, July , 2008. pdf.

Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle. Many Random Walks Are Faster Than One. SPAA-08: to appear in the 20th ACM Symposium on Parallelism in Algorithms and Architectures. Munich, Germany, June , 2008. pdf.

Roy Friedman, Gabriel Kliot, and Chen Avin. Probabilistic Quorum Systems in Wireless Ad Hoc Networks. DSN-DCCS 2008: to appear in the 38th IEEE International Conference on Dependable Systems and Networks, Anchorage, Alaska, June 2008. pdf.

Chen Avin and Bhaskar Krishnamachari, The Power of Choice in Random Walks: An Empirical Study. The 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, (MSWiM), Malaga, Spain, October 2006. [Best Paper Award]. pdf.

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.

Chen Avin and Ilya Shpitser and Judea Pearl. Identifiability of Path-Specific Effects. In Proceedings, Nineteenth International Joint Conference on Artificial Intelligence IJCAI-05, pp 357363. 2005. pdf. TR.

Chen Avin and Gunes Ercal. On The Cover Time of Random Geometric Graphs. In Proceedings. Automata, Languages and Programming, 32nd International Colloquium, ICALP-05, pages 677689, 2005. pdf. CSD-TR 040050.

Chen Avin and Gunes Ercal. Bounds on the Mixing Time and Partial Cover of Ad-Hoc and Sensor Networks. Second European Workshop on Wireless Sensor Networks (EWSN) Istanbul, Turkey, January 31 - February 2, 2005. pdf. CSD-TR 040028.

Chen Avin and Carlos Brito. Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques. In Proceedings of the Third IEEE/ACM International Symposium on Information Processing in Sensor Networks (IPSN 2004), pp. 396-404, Berkeley, California, April 26-27, 2004. pdf.

Chen Avin and Rachel Ben-Eliyahu Zohary. Algorithms for Computing X-Minimal Models. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '01). pp 322 - 335. 2001. pdf.

Under Review

Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari. Using Heterogeneity to Enhance Random Walk-based Queries. USC Computer Engineering Technical Report CENG-2006-8, August 2006.

Chen Avin. Distance Graphs: From Random Geometric Graphs to Bernoulli Graphs and Between. CSD-TR 060011

Chen Avin. Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs. To appear in Journal of Internet Mathematics.

Chen Avin and Gunes Ercal. On The Cover Time and Mixing Time of Random Geometric Graphs. Theor. Comput. Sci., 380(1-2):222, 2007. pdf.

Chen Avin and David Dayan-Rosenman. Evolutionary Reputation Games on Social Networks. Complex Systems, 17:259277, 2007. pdf.

Chen Avin and Rachel Ben-Eliyahu-Zohary. An Upper Bound For Computing all X-minimal Models. AI Communications, 20(2):8792, 2007

Conferences

Chen Avin, Michal Koucky and Zvi Lotker. How to Explore a Fast-Changing World. (On the cover time of dynamic graphs). ICALP-08: to appear in the 35th International Colloquium on Automata, Languages and Programming. Reykjavik, Iceland, July , 2008. pdf.

Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle. Many Random Walks Are Faster Than One. SPAA-08: to appear in the 20th ACM Symposium on Parallelism in Algorithms and Architectures. Munich, Germany, June , 2008. pdf.

Roy Friedman, Gabriel Kliot, and Chen Avin. Probabilistic Quorum Systems in Wireless Ad Hoc Networks. DSN-DCCS 2008: to appear in the 38th IEEE International Conference on Dependable Systems and Networks, Anchorage, Alaska, June 2008. pdf.

Chen Avin and Bhaskar Krishnamachari, The Power of Choice in Random Walks: An Empirical Study. The 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, (MSWiM), Malaga, Spain, October 2006. [Best Paper Award]. pdf.

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.

Chen Avin and Ilya Shpitser and Judea Pearl. Identifiability of Path-Specific Effects. In Proceedings, Nineteenth International Joint Conference on Artificial Intelligence IJCAI-05, pp 357363. 2005. pdf. TR.

Chen Avin and Gunes Ercal. On The Cover Time of Random Geometric Graphs. In Proceedings. Automata, Languages and Programming, 32nd International Colloquium, ICALP-05, pages 677689, 2005. pdf. CSD-TR 040050.

Chen Avin and Gunes Ercal. Bounds on the Mixing Time and Partial Cover of Ad-Hoc and Sensor Networks. Second European Workshop on Wireless Sensor Networks (EWSN) Istanbul, Turkey, January 31 - February 2, 2005. pdf. CSD-TR 040028.

Chen Avin and Carlos Brito. Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques. In Proceedings of the Third IEEE/ACM International Symposium on Information Processing in Sensor Networks (IPSN 2004), pp. 396-404, Berkeley, California, April 26-27, 2004. pdf.

Chen Avin and Rachel Ben-Eliyahu Zohary. Algorithms for Computing X-Minimal Models. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '01). pp 322 - 335. 2001. pdf.

Under Review

Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari. Using Heterogeneity to Enhance Random Walk-based Queries. USC Computer Engineering Technical Report CENG-2006-8, August 2006.

Chen Avin. Distance Graphs: From Random Geometric Graphs to Bernoulli Graphs and Between. CSD-TR 060011

to:

# Chen Avin and Bhaskar Krishnamachari, The Power of Choice in Random Walks: An Empirical Study. Computer Networks, 52(1):4460, 2008.

# Chen Avin. Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs. To appear in Journal of Internet Mathematics.

# Chen Avin and Gunes Ercal. On The Cover Time and Mixing Time of Random Geometric Graphs. Theor. Comput. Sci., 380(1-2):222, 2007. pdf.

# Chen Avin and David Dayan-Rosenman. Evolutionary Reputation Games on Social Networks. Complex Systems, 17:259277, 2007. pdf.

# Chen Avin and Rachel Ben-Eliyahu-Zohary. An Upper Bound For Computing all X-minimal Models. AI Communications, 20(2):8792, 2007

! Conferences

# Chen Avin, Michal Koucky and Zvi Lotker. How to Explore a Fast-Changing World. (On the cover time of dynamic graphs). ICALP-08: to appear in the 35th International Colloquium on Automata, Languages and Programming. Reykjavik, Iceland, July , 2008. pdf.

# Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle. Many Random Walks Are Faster Than One. SPAA-08: to appear in the 20th ACM Symposium on Parallelism in Algorithms and Architectures. Munich, Germany, June , 2008. pdf.

# Roy Friedman, Gabriel Kliot, and Chen Avin. Probabilistic Quorum Systems in Wireless Ad Hoc Networks. DSN-DCCS 2008: to appear in the 38th IEEE International Conference on Dependable Systems and Networks, Anchorage, Alaska, June 2008. pdf.

# Chen Avin and Bhaskar Krishnamachari, The Power of Choice in Random Walks: An Empirical Study. The 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, (MSWiM), Malaga, Spain, October 2006. [Best Paper Award]. pdf.

# 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.

# Chen Avin and Ilya Shpitser and Judea Pearl. Identifiability of Path-Specific Effects. In Proceedings, Nineteenth International Joint Conference on Artificial Intelligence IJCAI-05, pp 357363. 2005. pdf. TR.

# Chen Avin and Gunes Ercal. On The Cover Time of Random Geometric Graphs. In Proceedings. Automata, Languages and Programming, 32nd International Colloquium, ICALP-05, pages 677689, 2005. pdf. CSD-TR 040050.

# Chen Avin and Gunes Ercal. Bounds on the Mixing Time and Partial Cover of Ad-Hoc and Sensor Networks. Second European Workshop on Wireless Sensor Networks (EWSN) Istanbul, Turkey, January 31 - February 2, 2005. pdf. CSD-TR 040028.

# Chen Avin and Carlos Brito. Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques. In Proceedings of the Third IEEE/ACM International Symposium on Information Processing in Sensor Networks (IPSN 2004), pp. 396-404, Berkeley, California, April 26-27, 2004. pdf.

# Chen Avin and Rachel Ben-Eliyahu Zohary. Algorithms for Computing X-Minimal Models. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '01). pp 322 - 335. 2001. pdf.

! Under Review

# Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari. Using Heterogeneity to Enhance Random Walk-based Queries. USC Computer Engineering Technical Report CENG-2006-8, August 2006.

# Chen Avin. Distance Graphs: From Random Geometric Graphs to Bernoulli Graphs and Between. CSD-TR 060011

# Chen Avin. Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs. To appear in Journal of Internet Mathematics.

# Chen Avin and Gunes Ercal. On The Cover Time and Mixing Time of Random Geometric Graphs. Theor. Comput. Sci., 380(1-2):222, 2007. pdf.

# Chen Avin and David Dayan-Rosenman. Evolutionary Reputation Games on Social Networks. Complex Systems, 17:259277, 2007. pdf.

# Chen Avin and Rachel Ben-Eliyahu-Zohary. An Upper Bound For Computing all X-minimal Models. AI Communications, 20(2):8792, 2007

! Conferences

# Chen Avin, Michal Koucky and Zvi Lotker. How to Explore a Fast-Changing World. (On the cover time of dynamic graphs). ICALP-08: to appear in the 35th International Colloquium on Automata, Languages and Programming. Reykjavik, Iceland, July , 2008. pdf.

# Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle. Many Random Walks Are Faster Than One. SPAA-08: to appear in the 20th ACM Symposium on Parallelism in Algorithms and Architectures. Munich, Germany, June , 2008. pdf.

# Roy Friedman, Gabriel Kliot, and Chen Avin. Probabilistic Quorum Systems in Wireless Ad Hoc Networks. DSN-DCCS 2008: to appear in the 38th IEEE International Conference on Dependable Systems and Networks, Anchorage, Alaska, June 2008. pdf.

# Chen Avin and Bhaskar Krishnamachari, The Power of Choice in Random Walks: An Empirical Study. The 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, (MSWiM), Malaga, Spain, October 2006. [Best Paper Award]. pdf.

# 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.

# Chen Avin and Ilya Shpitser and Judea Pearl. Identifiability of Path-Specific Effects. In Proceedings, Nineteenth International Joint Conference on Artificial Intelligence IJCAI-05, pp 357363. 2005. pdf. TR.

# Chen Avin and Gunes Ercal. On The Cover Time of Random Geometric Graphs. In Proceedings. Automata, Languages and Programming, 32nd International Colloquium, ICALP-05, pages 677689, 2005. pdf. CSD-TR 040050.

# Chen Avin and Gunes Ercal. Bounds on the Mixing Time and Partial Cover of Ad-Hoc and Sensor Networks. Second European Workshop on Wireless Sensor Networks (EWSN) Istanbul, Turkey, January 31 - February 2, 2005. pdf. CSD-TR 040028.

# Chen Avin and Carlos Brito. Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques. In Proceedings of the Third IEEE/ACM International Symposium on Information Processing in Sensor Networks (IPSN 2004), pp. 396-404, Berkeley, California, April 26-27, 2004. pdf.

# Chen Avin and Rachel Ben-Eliyahu Zohary. Algorithms for Computing X-Minimal Models. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '01). pp 322 - 335. 2001. pdf.

! Under Review

# Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari. Using Heterogeneity to Enhance Random Walk-based Queries. USC Computer Engineering Technical Report CENG-2006-8, August 2006.

# Chen Avin. Distance Graphs: From Random Geometric Graphs to Bernoulli Graphs and Between. CSD-TR 060011

November 17, 2008, at 08:20 AM
by

- Changed lines 1-36 from:

List

to:

! Journals

Chen Avin and Bhaskar Krishnamachari, The Power of Choice in Random Walks: An Empirical Study. Computer Networks, 52(1):4460, 2008.

Chen Avin. Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs. To appear in Journal of Internet Mathematics.

Chen Avin and Gunes Ercal. On The Cover Time and Mixing Time of Random Geometric Graphs. Theor. Comput. Sci., 380(1-2):222, 2007. pdf.

Chen Avin and David Dayan-Rosenman. Evolutionary Reputation Games on Social Networks. Complex Systems, 17:259277, 2007. pdf.

Chen Avin and Rachel Ben-Eliyahu-Zohary. An Upper Bound For Computing all X-minimal Models. AI Communications, 20(2):8792, 2007

Conferences

Chen Avin, Michal Koucky and Zvi Lotker. How to Explore a Fast-Changing World. (On the cover time of dynamic graphs). ICALP-08: to appear in the 35th International Colloquium on Automata, Languages and Programming. Reykjavik, Iceland, July , 2008. pdf.

Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle. Many Random Walks Are Faster Than One. SPAA-08: to appear in the 20th ACM Symposium on Parallelism in Algorithms and Architectures. Munich, Germany, June , 2008. pdf.

Roy Friedman, Gabriel Kliot, and Chen Avin. Probabilistic Quorum Systems in Wireless Ad Hoc Networks. DSN-DCCS 2008: to appear in the 38th IEEE International Conference on Dependable Systems and Networks, Anchorage, Alaska, June 2008. pdf.

Chen Avin and Bhaskar Krishnamachari, The Power of Choice in Random Walks: An Empirical Study. The 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, (MSWiM), Malaga, Spain, October 2006. [Best Paper Award]. pdf.

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.

Chen Avin and Ilya Shpitser and Judea Pearl. Identifiability of Path-Specific Effects. In Proceedings, Nineteenth International Joint Conference on Artificial Intelligence IJCAI-05, pp 357363. 2005. pdf. TR.

Chen Avin and Gunes Ercal. On The Cover Time of Random Geometric Graphs. In Proceedings. Automata, Languages and Programming, 32nd International Colloquium, ICALP-05, pages 677689, 2005. pdf. CSD-TR 040050.

Chen Avin and Gunes Ercal. Bounds on the Mixing Time and Partial Cover of Ad-Hoc and Sensor Networks. Second European Workshop on Wireless Sensor Networks (EWSN) Istanbul, Turkey, January 31 - February 2, 2005. pdf. CSD-TR 040028.

Chen Avin and Carlos Brito. Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques. In Proceedings of the Third IEEE/ACM International Symposium on Information Processing in Sensor Networks (IPSN 2004), pp. 396-404, Berkeley, California, April 26-27, 2004. pdf.

Chen Avin and Rachel Ben-Eliyahu Zohary. Algorithms for Computing X-Minimal Models. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '01). pp 322 - 335. 2001. pdf.

Under Review

Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari. Using Heterogeneity to Enhance Random Walk-based Queries. USC Computer Engineering Technical Report CENG-2006-8, August 2006.

Chen Avin. Distance Graphs: From Random Geometric Graphs to Bernoulli Graphs and Between. CSD-TR 060011

Chen Avin and Bhaskar Krishnamachari, The Power of Choice in Random Walks: An Empirical Study. Computer Networks, 52(1):4460, 2008.

Chen Avin. Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs. To appear in Journal of Internet Mathematics.

Chen Avin and Gunes Ercal. On The Cover Time and Mixing Time of Random Geometric Graphs. Theor. Comput. Sci., 380(1-2):222, 2007. pdf.

Chen Avin and David Dayan-Rosenman. Evolutionary Reputation Games on Social Networks. Complex Systems, 17:259277, 2007. pdf.

Chen Avin and Rachel Ben-Eliyahu-Zohary. An Upper Bound For Computing all X-minimal Models. AI Communications, 20(2):8792, 2007

Conferences

Chen Avin, Michal Koucky and Zvi Lotker. How to Explore a Fast-Changing World. (On the cover time of dynamic graphs). ICALP-08: to appear in the 35th International Colloquium on Automata, Languages and Programming. Reykjavik, Iceland, July , 2008. pdf.

Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle. Many Random Walks Are Faster Than One. SPAA-08: to appear in the 20th ACM Symposium on Parallelism in Algorithms and Architectures. Munich, Germany, June , 2008. pdf.

Roy Friedman, Gabriel Kliot, and Chen Avin. Probabilistic Quorum Systems in Wireless Ad Hoc Networks. DSN-DCCS 2008: to appear in the 38th IEEE International Conference on Dependable Systems and Networks, Anchorage, Alaska, June 2008. pdf.

Chen Avin and Bhaskar Krishnamachari, The Power of Choice in Random Walks: An Empirical Study. The 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, (MSWiM), Malaga, Spain, October 2006. [Best Paper Award]. pdf.

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.

Chen Avin and Ilya Shpitser and Judea Pearl. Identifiability of Path-Specific Effects. In Proceedings, Nineteenth International Joint Conference on Artificial Intelligence IJCAI-05, pp 357363. 2005. pdf. TR.

Chen Avin and Gunes Ercal. On The Cover Time of Random Geometric Graphs. In Proceedings. Automata, Languages and Programming, 32nd International Colloquium, ICALP-05, pages 677689, 2005. pdf. CSD-TR 040050.

Chen Avin and Gunes Ercal. Bounds on the Mixing Time and Partial Cover of Ad-Hoc and Sensor Networks. Second European Workshop on Wireless Sensor Networks (EWSN) Istanbul, Turkey, January 31 - February 2, 2005. pdf. CSD-TR 040028.

Chen Avin and Carlos Brito. Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques. In Proceedings of the Third IEEE/ACM International Symposium on Information Processing in Sensor Networks (IPSN 2004), pp. 396-404, Berkeley, California, April 26-27, 2004. pdf.

Chen Avin and Rachel Ben-Eliyahu Zohary. Algorithms for Computing X-Minimal Models. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '01). pp 322 - 335. 2001. pdf.

Under Review

Marco Zuniga, Chen Avin, and Bhaskar Krishnamachari. Using Heterogeneity to Enhance Random Walk-based Queries. USC Computer Engineering Technical Report CENG-2006-8, August 2006.

Chen Avin. Distance Graphs: From Random Geometric Graphs to Bernoulli Graphs and Between. CSD-TR 060011

November 16, 2008, at 11:02 PM
by

- Added line 1:

List