American Psychological Association 6th edition

Chatterjee, S., Pandurangan, G., & Robinson, P. (2020). The complexity of leader election in diameter-two networks. Distributed Computing, 33(2), 189-205. https://doi.org/10.1007/s00446-019-00354-2

ISO-690 (author-date, English)

CHATTERJEE, Soumyottam, PANDURANGAN, Gopal and ROBINSON, Peter, 2020. The complexity of leader election in diameter-two networks. Distributed Computing. 1 April 2020. Vol. 33, no. 2, p. 189-205. DOI 10.1007/s00446-019-00354-2.

Modern Language Association 9th edition

Chatterjee, S., G. Pandurangan, and P. Robinson. “The Complexity of Leader Election in Diameter-Two Networks”. Distributed Computing, vol. 33, no. 2, Apr. 2020, pp. 189-05, https://doi.org/10.1007/s00446-019-00354-2.

Mohr Siebeck - Recht (Deutsch - Österreich)

Chatterjee, Soumyottam/Pandurangan, Gopal/Robinson, Peter: The complexity of leader election in diameter-two networks, Distributed Computing 2020, 189-205.

Emerald - Harvard

Chatterjee, S., Pandurangan, G. and Robinson, P. (2020), “The complexity of leader election in diameter-two networks”, Distributed Computing, Vol. 33 No. 2, pp. 189-205.

Warning: These citations may not always be 100% accurate.