The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Nicolai Vorobjov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  24. Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. [Citation Graph (, )][DBLP]


Search in 0.036secs, Finished in 0.038secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002