Photo of Nicolai Vorobjov

Nicolai Vorobjov

Prof

  • 1 WEST 3.62

20012019

Research output per year

If you made any changes in Pure these will be visible here soon.

Research Output

Filter
Chapter
2006

Upper and lower bounds on sizes of finite bisimulations of Pfaffian hybrid systems

Korovina, M. & Vorobjov, N., 2006, Logical Approaches to Computational Barriers, Proceedings. Vol. 3988. p. 267-276 10 p. (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingChapter

8 Citations (Scopus)
2004

Complexity of computations with Pfaffian and Noetherian functions

Vorobjov, N. & Gabrielov, A., 2004, Normal Forms, Bifurcations and Finiteness Problems in Differential Equations. Ilyashenko, Y. & Rousseau, C. (eds.). Springer, p. 211 1 p. (NATO Science Series II).

Research output: Chapter in Book/Report/Conference proceedingChapter

Pfaffian hybrid systems

Korovina, M. & Vorobjov, N., 2004, Computer Science Logic, Proceedings. Vol. 3210. p. 430-441 12 p. (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingChapter

9 Citations (Scopus)
2003

Effective model completeness of the theory of restricted Pfafflan functions

Vorobjov, N., 2003, Computer Science Logic, Proceedings. Vol. 2803. p. 544-544 1 p. (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingChapter

Effective quantifier elimination over real closed fields

Vorobjov, N., 2003, Computer Science Logic, Proceedings. Vol. 2803. p. 545-545 1 p. (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingChapter

New Complexity bounds for cylindrical decompositions of sub_Pfaffian sets

Vorobjov, N. & Pericleous, S., 2003, Discrete and Computational Geometry. Aronov, B. (ed.). Springer

Research output: Chapter in Book/Report/Conference proceedingChapter