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 und GRAVEL, Claude, 2017. The expected bit complexity of the von Neumann rejection algorithm. Statistics and Computing. 1 Mai 2017. Vol. 27, no. 3, p. 699-710. DOI 10.1007/s11222-016-9648-z.

Modern Language Association 9th edition

Devroye, L., und C. Gravel. „The Expected Bit Complexity of the Von Neumann Rejection Algorithm“. Statistics and Computing, Bd. 27, Nr. 3, Mai 2017, S. 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. und Gravel, C. (2017), „The expected bit complexity of the von Neumann rejection algorithm“, Statistics and Computing, Vol. 27 No. 3, S. 699-710.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.