Solving Systems of Polynomial Inequalities in Subexponential Time. - Dima Grigoriev; Nicolai N. Vorobjov Jr. (J. Symb. Comput., 1988)

Finding Connected Components of a Semialgebraic Set in Subexponential Time. - John F. Canny; D. Yu. Grigor'ev; Nicolai N. Vorobjov Jr. (Appl. Algebra Eng. Commun. Comput., 1991)

Counting Connected Components of a Semialgebraic Set in Subexponential Time. - D. Yu. Grigoryev; Nicolai N. Vorobjov Jr. (Comput. Complex., 1992)

The Complexity of Deciding Consistency of Systems of Polynomial in Exponent Inequalities. - Nicolai N. Vorobjov Jr. (J. Symb. Comput., 1992)

Foundations of game theory - noncooperative games. - Nicolai N. Vorobjov Jr. (Birkhäuser, 1994)

Lower bounds on testing membership to a polyhedron by algebraic decision trees. - Dima Grigoriev; Marek Karpinski; Nicolai N. Vorobjov Jr. (STOC, 1994)

Finding Irreducible Components of Some Real Transcendental Varieties. - Marie-Françoise Roy; Nicolai N. Vorobjov Jr. (Comput. Complex., 1994)

Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees. - Dima Grigoriev; Marek Karpinski; Nicolai N. Vorobjov Jr. (FOCS, 1995)

Complexity of Stratifications of Semi-Pfaffian Sets. - Andrei Gabrielov; Nicolai N. Vorobjov Jr. (Discret. Comput. Geom., 1995)

Complexity of Finding Irreducible Components of a Semialgebraic Set. - André Galligo; Nicolai N. Vorobjov Jr. (J. Complex., 1995)

Computing the Complexification of a Semi-Algebraic Set. - Marie-Françoise Roy; Nicolai N. Vorobjov Jr. (ISSAC, 1996)

Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates. - Dima Grigoriev; Nicolai N. Vorobjov Jr. (Theor. Comput. Sci., 1996)

Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees. - Dima Grigoriev; Marek Karpinski; Nicolai N. Vorobjov Jr. (Discret. Comput. Geom., 1997)

Computing Local Dimension of a Semialgebraic Set. - Nicolai N. Vorobjov Jr. (STOC, 1998)

Complexity of Computing the Local Dimension of a Semialgebraic Set. - Nicolai N. Vorobjov Jr. (J. Symb. Comput., 1999)

Bounds on numers of vectors of multiplicities for polynomials which are easy to compute. - Dima Grigoriev; Nicolai N. Vorobjov Jr. (ISSAC, 2000)

New complexity bounds for cylindrical decompositions of sub-pfaffian sets. - Savvas Pericleous; Nicolai N. Vorobjov Jr. (ISSAC, 2001)

Complexity of Null-and Positivstellensatz proofs. - Dima Grigoriev; Nicolai N. Vorobjov Jr. (Ann. Pure Appl. Log., 2001)

Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture). - Nicolai N. Vorobjov Jr. (CSL, 2003)

Effective Quantifier Elimination over Real Closed Fields (Tutorial). - Nicolai N. Vorobjov Jr. (CSL, 2003)

Pfaffian Hybrid Systems. - Margarita V. Korovina; Nicolai N. Vorobjov Jr. (CSL, 2004)

Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae. - Andrei Gabrielov; Nicolai N. Vorobjov Jr. (Discret. Comput. Geom., 2005)

Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems. - Margarita V. Korovina; Nicolai N. Vorobjov Jr. (CiE, 2006)

Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. - Margarita V. Korovina; Nicolai N. Vorobjov Jr. (Reliable Implementation of Real Number Algorithms, 2006)

Satisfiability of Viability Constraints for Pfaffian Dynamics. - Margarita V. Korovina; Nicolai N. Vorobjov Jr. (Ershov Memorial Conference, 2006)

Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. - Margarita V. Korovina; Nicolai N. Vorobjov Jr. (Theory Comput. Syst., 2008)

Computing combinatorial types of trajectories in Pfaffian Dynamics. - Margarita V. Korovina; Nicolai N. Vorobjov Jr. (J. Log. Algebraic Methods Program., 2010)

Reachability in One-Dimensional Controlled Polynomial Dynamical Systems. - Margarita V. Korovina; Nicolai N. Vorobjov Jr. (Ershov Memorial Conference, 2011)

A Helly-Type Theorem for Semi-monotone Sets and Monotone Maps. - Saugata Basu; Andrei Gabrielov; Nicolai N. Vorobjov Jr. (Discret. Comput. Geom., 2013)

Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242). - Peter Bürgisser; Felipe Cucker; Marek Karpinski; Nicolai N. Vorobjov Jr. (Dagstuhl Reports, 2015)

Topological lower bounds for arithmetic networks. - Andrei Gabrielov; Nicolai N. Vorobjov Jr. (Comput. Complex., 2017)

On Topological Lower Bounds for Algebraic Computation Trees. - Andrei Gabrielov; Nicolai N. Vorobjov Jr. (Found. Comput. Math., 2017)

Orthogonal Tropical Linear Prevarieties. - Dima Grigoriev; Nicolai N. Vorobjov Jr. (CASC, 2018)

Complexity of deciding whether a tropical linear prevariety is a tropical variety. - Dima Grigoriev; Nicolai N. Vorobjov Jr. (Appl. Algebra Eng. Commun. Comput., 2021)