Andrew J. Handley

According to our database, Andrew J. Handley authored at least 4 papers between 2009 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

The flip Markov chain for connected regular graphs.

Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley

Discret. Appl. Math., 2019

2013

Self-organising, self-randomising peer-to-peer networks.

Andrew J. Handley

PhD thesis, 2013

2011

Networks of random cycles.

Colin Cooper, Martin E. Dyer, Andrew J. Handley

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2009

The flip markov chain and a randomising P2P protocol.

Colin Cooper, Martin E. Dyer, Andrew J. Handley

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009