| 2018 | CASC | Orthogonal Tropical Linear Prevarieties. | Dima Grigoriev, Nicolai N. Vorobjov Jr. |
| 2006 | CiE | Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems. | Margarita V. Korovina, Nicolai N. Vorobjov Jr. |
| 2004 | CSL | Pfaffian Hybrid Systems. | Margarita V. Korovina, Nicolai N. Vorobjov Jr. |
| 2003 | CSL | Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture). | Nicolai N. Vorobjov Jr. |
| 2003 | CSL | Effective Quantifier Elimination over Real Closed Fields (Tutorial). | Nicolai N. Vorobjov Jr. |
| 2001 | ISSAC | New complexity bounds for cylindrical decompositions of sub-pfaffian sets. | Savvas Pericleous, Nicolai N. Vorobjov Jr. |
| 2000 | ISSAC | Bounds on numers of vectors of multiplicities for polynomials which are easy to compute. | Dima Grigoriev, Nicolai N. Vorobjov Jr. |
| 1998 | STOC | Computing Local Dimension of a Semialgebraic Set. | Nicolai N. Vorobjov Jr. |
| 1996 | ISSAC | Computing the Complexification of a Semi-Algebraic Set. | Marie-Franoise Roy, Nicolai N. Vorobjov Jr. |
| 1995 | FOCS | Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees. | Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr. |
| 1994 | FOCS | Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates | Dima Grigoriev, Nicolai N. Vorobjov Jr. |
| 1994 | STOC | Lower bounds on testing membership to a polyhedron by algebraic decision trees. | Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr. |