American Psychological Association 6th edition

DINITZ, Y., & SOLOMON, N. (2007, January 1). Two absolute bounds for distributed bit complexity. 384(2-3). Amsterdam: Elsevier, 2007. Retrieved from http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19109042

ISO-690 (author-date, English)

DINITZ, Yefim and SOLOMON, Noam, 2007. Two absolute bounds for distributed bit complexity. In: [online]. Amsterdam: Elsevier, 2007. 1 January 2007. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19109042

Modern Language Association 9th edition

DINITZ, Y., and N. SOLOMON. Two absolute bounds for distributed bit complexity. no. 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. and SOLOMON, N. (2007), “Two absolute bounds for distributed bit complexity”, in , Vol. 384, Amsterdam: Elsevier, 2007., available at: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19109042.

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