American Psychological Association 6th edition

Devroye, L., & Gravel, C. (2017). The expected bit complexity of the von Neumann rejection algorithm. Statistics and Computing, 27(3), 699-710. https://doi.org/10.1007/s11222-016-9648-z

ISO-690 (author-date, English)

DEVROYE, Luc and GRAVEL, Claude, 2017. The expected bit complexity of the von Neumann rejection algorithm. Statistics and Computing. 1 May 2017. Vol. 27, no. 3, p. 699-710. DOI 10.1007/s11222-016-9648-z.

Modern Language Association 9th edition

Devroye, L., and C. Gravel. “The Expected Bit Complexity of the Von Neumann Rejection Algorithm”. Statistics and Computing, vol. 27, no. 3, May 2017, pp. 699-10, https://doi.org/10.1007/s11222-016-9648-z.

Mohr Siebeck - Recht (Deutsch - Österreich)

Devroye, Luc/Gravel, Claude: The expected bit complexity of the von Neumann rejection algorithm, Statistics and Computing 2017, 699-710.

Emerald - Harvard

Devroye, L. and Gravel, C. (2017), “The expected bit complexity of the von Neumann rejection algorithm”, Statistics and Computing, Vol. 27 No. 3, pp. 699-710.

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