American Psychological Association 6th edition

TIKHOMIROV, A., STOJUNINA, T., & NEKRUTKIN, V. (2007, January 1). Monotonous random search on a torus : Integral upper bounds for the complexity. 137(12). Amsterdam; Lausanne; New York,NY: Elsevier Science, 2007. Retrieved from http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19061108

ISO-690 (author-date, English)

TIKHOMIROV, A, STOJUNINA, T and NEKRUTKIN, V, 2007. Monotonous random search on a torus : Integral upper bounds for the complexity. In: [online]. Amsterdam; Lausanne; New York,NY: Elsevier Science, 2007. 1 January 2007. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19061108

Modern Language Association 9th edition

TIKHOMIROV, A., T. STOJUNINA, and V. NEKRUTKIN. Monotonous random search on a torus : Integral upper bounds for the complexity. no. 12, Amsterdam; Lausanne; New York,NY: Elsevier Science, 2007., 2007, http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19061108.

Mohr Siebeck - Recht (Deutsch - Österreich)

Emerald - Harvard

TIKHOMIROV, A., STOJUNINA, T. and NEKRUTKIN, V. (2007), “Monotonous random search on a torus : Integral upper bounds for the complexity”, in , Vol. 137, Amsterdam; Lausanne; New York,NY: Elsevier Science, 2007., available at: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19061108.

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