ROMAGUERA, S., SANCHEZ-PEREZ, E. A., & VALERO, O. (2003, Januar 1). Computing complexity distances between algorithms. 39(5). Praha: Academia, 2003. Abgerufen von http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=15674715
ISO-690 (author-date, English)ROMAGUERA, S, SANCHEZ-PEREZ, E. A und VALERO, O, 2003. Computing complexity distances between algorithms. In: [online]. Praha: Academia, 2003. 1 Januar 2003. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=15674715
Modern Language Association 9th editionROMAGUERA, S., E. A. SANCHEZ-PEREZ, und O. VALERO. Computing complexity distances between algorithms. Nr. 5, Praha: Academia, 2003., 2003, http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=15674715.
Mohr Siebeck - Recht (Deutsch - Österreich)Emerald - Harvard
ROMAGUERA, S., SANCHEZ-PEREZ, E.A. und VALERO, O. (2003), „Computing complexity distances between algorithms“, in , Bd. 39, Praha: Academia, 2003., verfügbar unter: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=15674715.