DINITZ, Y., & SOLOMON, N. (2007, Januar 1). Two absolute bounds for distributed bit complexity. 384(2-3). Amsterdam: Elsevier, 2007. Abgerufen von http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19109042
ISO-690 (author-date, English)DINITZ, Yefim und SOLOMON, Noam, 2007. Two absolute bounds for distributed bit complexity. In: [online]. Amsterdam: Elsevier, 2007. 1 Januar 2007. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19109042
Modern Language Association 9th editionDINITZ, Y., und N. SOLOMON. Two absolute bounds for distributed bit complexity. Nr. 2-3, Amsterdam: Elsevier, 2007., 2007, http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19109042.
Mohr Siebeck - Recht (Deutsch - Österreich)Emerald - Harvard
DINITZ, Y. und SOLOMON, N. (2007), „Two absolute bounds for distributed bit complexity“, in , Bd. 384, Amsterdam: Elsevier, 2007., verfügbar unter: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19109042.