1. V. B. Afanassiev, On the complexity of finite field arithmetic, inProceedings of the Fifth Joint Soviet–Swedish International Workshop on Information Theory: Convolutional Codes, Multiuser Communication, Moscow, USSR, 1991, pp. 9–12.
2. V. B. Afanassiev, On the complexity of FFT over finite field, inProceedings of the Sixth Joint Soviet–Swedish International Workshop on Information Theory, Mölle, Sweden, 1993, pp. 315–319.
3. V. B. Afanassiev and A. A. Davydov, On inversion in extended finite fields, inProceedings of the Fourth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT-4, Novgorod, Russia, 1994, pp. 4–7.
4. V. B. Afanassiev and A. A. Davydov, On the binary complexity of arithmetic of the finite field tower, inProceedings of International Symposium on Information Theory and Its Applications, ISITA96, Victoria, Canada, pp. 681–683.
5. V. B. Afanassiev and A. A. Davydov, Iterated presentation and complexity of arithmetic for tower of extended fields GF(qp∞), p∣(q – 1), inProceedings of the Sixth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT-VI, Pskov, Russia, 1998, pp. 1–4.