Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields. - Alexander L. Chistov; Dima Grigoriev (MFCS, 1984)

Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic. - Alexander L. Chistov (FCT, 1985)

Polynomial Complexity of the Newton-Puiseux Algorithm. - Alexander L. Chistov (MFCS, 1986)

Polynomial-Time Computation of the Dimension of Algebraic Varieties in Zero-Characteristic. - Alexander L. Chistov (J. Symb. Comput., 1996)

Polynomial Time Algorithms for Modules over Finite Dimensional Algebras. - Alexander L. Chistov; Gábor Ivanyos; Marek Karpinski (ISSAC, 1997)

Vandermonde Matrices, NP-Completeness, and Transversal Subspaces. - Alexander L. Chistov; Hervé Fournier; Leonid Gurvits; Pascal Koiran (Found. Comput. Math., 2003)

Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties. - Alexander L. Chistov (CSR, 2006)