1. Akritas, A.G., Akritas, E.K., Malaschonok, G.I.: Various proofs of Sylvester’s (determinant) identity. In: Proc. Int. IMACS Symp. on Symbolic Computation, June 14–17, 1993, Lille, France, pp. 228–230 (1993)
2. Grigoriev, D.: Additive complexity in directed computations. Theoretical Computer Science 19, 39–67 (1982)
3. Grigoriev, D.: Analogy of Bruhat decomposition for the closure of a cone of Chevalley group of a classical series. Soviet Math. Dokl. 23, 393–397 (1981)
4. Malaschonok, G.I.: A fast algorithm for adjoint matrix computation. Tambov University Reports 5(1), 142–146 (2000)
5. Malaschonok, G.I.: Effective matrix methods in commutative domains. In: Krob, D., Mikhalev, A.A., Mikhalev, A.V. (eds.) Formal Power Series and Algebraic Combinatorics, pp. 506–517. Springer, Berlin (2000)