| 2006 |
|---|
| 24 | EE | Margarita V. Korovina,
Nicolai Vorobjov:
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems.
CiE 2006: 267-276 |
| 23 | EE | Margarita V. Korovina,
Nicolai Vorobjov:
Satisfiability of Viability Constraints for Pfaffian Dynamics.
Ershov Memorial Conference 2006: 260-269 |
| 22 | EE | Margarita V. Korovina,
Nicolai Vorobjov:
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems.
Reliable Implementation of Real Number Algorithms 2006 |
| 2005 |
|---|
| 21 | EE | Andrei Gabrielov,
Nicolai Vorobjov:
Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae.
Discrete & Computational Geometry 33(3): 395-401 (2005) |
| 2004 |
|---|
| 20 | EE | Margarita V. Korovina,
Nicolai Vorobjov:
Pfaffian Hybrid Systems.
CSL 2004: 430-441 |
| 2003 |
|---|
| 19 | EE | Nicolai Vorobjov:
Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture).
CSL 2003: 544 |
| 18 | EE | Nicolai Vorobjov:
Effective Quantifier Elimination over Real Closed Fields (Tutorial).
CSL 2003: 545 |
| 2001 |
|---|
| 17 | EE | Savvas Pericleous,
Nicolai Vorobjov:
New complexity bounds for cylindrical decompositions of sub-pfaffian sets.
ISSAC 2001: 268-275 |
| 16 | | Dima Grigoriev,
Nicolai Vorobjov:
Complexity of Null-and Positivstellensatz proofs.
Ann. Pure Appl. Logic 113(1-3): 153-160 (2001) |
| 2000 |
|---|
| 15 | EE | Dima Grigoriev,
Nicolai Vorobjov:
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute.
ISSAC 2000: 137-146 |
| 1999 |
|---|
| 14 | | Nicolai Vorobjov:
Complexity of Computing the Local Dimension of a Semialgebraic Set.
J. Symb. Comput. 27(6): 565-579 (1999) |
| 1998 |
|---|
| 13 | EE | Nicolai Vorobjov:
Computing Local Dimension of a Semialgebraic Set.
STOC 1998: 483-487 |
| 1997 |
|---|
| 12 | EE | Dima Grigoriev,
Marek Karpinski,
Nicolai Vorobjov:
Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees.
Discrete & Computational Geometry 17(2): 191-215 (1997) |
| 1996 |
|---|
| 11 | EE | Marie-Françoise Roy,
Nicolai Vorobjov:
Computing the Complexification of a Semi-Algebraic Set.
ISSAC 1996: 26-34 |
| 10 | EE | Dima Grigoriev,
Nicolai Vorobjov:
Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates.
Theor. Comput. Sci. 157(2): 185-214 (1996) |
| 1995 |
|---|
| 9 | | Dima Grigoriev,
Marek Karpinski,
Nicolai Vorobjov:
Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees.
FOCS 1995: 258-265 |
| 8 | | Andrei Gabrielov,
Nicolai Vorobjov:
Complexity of Stratifications of Semi-Pfaffian Sets.
Discrete & Computational Geometry 14(1): 71-91 (1995) |
| 7 | EE | André Galligo,
Nicolai Vorobjov:
Complexity of Finding Irreducible Components of a Semialgebraic Set.
J. Complexity 11(1): 174-193 (1995) |
| 1994 |
|---|
| 6 | | Dima Grigoriev,
Nicolai Vorobjov:
Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates
FOCS 1994: 548-552 |
| 5 | EE | Dima Grigoriev,
Marek Karpinski,
Nicolai Vorobjov:
Lower bounds on testing membership to a polyhedron by algebraic decision trees.
STOC 1994: 635-644 |
| 4 | | Marie-Françoise Roy,
Nicolai Vorobjov:
Finding Irreducible Components of Some Real Transcendental Varieties.
Computational Complexity 4: 107-132 (1994) |
| 1992 |
|---|
| 3 | | D. Yu. Grigoryev,
Nicolai Vorobjov:
Counting Connected Components of a Semialgebraic Set in Subexponential Time.
Computational Complexity 2: 133-186 (1992) |
| 2 | | Nicolai Vorobjov:
The Complexity of Deciding Consistency of Systems of Polynomial in Exponent Inequalities.
J. Symb. Comput. 13(2): 139-174 (1992) |
| 1988 |
|---|
| 1 | | Dima Grigoriev,
Nicolai Vorobjov:
Solving Systems of Polynomial Inequalities in Subexponential Time.
J. Symb. Comput. 5(1/2): 37-64 (1988) |
