American Psychological Association 6th edition

Alistarh, D., Rybicki, J., & Voitovych, S. (2025). Near-Optimal Leader Election in Population Protocols on Graphs. Distributed Computing, 1-39. https://doi.org/10.1007/s00446-025-00487-7

ISO-690 (author-date, English)

ALISTARH, Dan, RYBICKI, Joel and VOITOVYCH, Sasha, 2025. Near-Optimal Leader Election in Population Protocols on Graphs. Distributed Computing. 27 June 2025. P. 1-39. DOI 10.1007/s00446-025-00487-7.

Modern Language Association 9th edition

Alistarh, D., J. Rybicki, and S. Voitovych. “Near-Optimal Leader Election in Population Protocols on Graphs”. Distributed Computing, June 2025, pp. 1-39, https://doi.org/10.1007/s00446-025-00487-7.

Mohr Siebeck - Recht (Deutsch - Österreich)

Alistarh, Dan/Rybicki, Joel/Voitovych, Sasha: Near-Optimal Leader Election in Population Protocols on Graphs, Distributed Computing 2025, 1-39.

Emerald - Harvard

Alistarh, D., Rybicki, J. and Voitovych, S. (2025), “Near-Optimal Leader Election in Population Protocols on Graphs”, Distributed Computing, pp. 1-39.

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