default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrei Gabrielov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
[j10]Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
Topological lower bounds for arithmetic networks. Comput. Complex. 26(3): 687-715 (2017)- [j9]Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
On Topological Lower Bounds for Algebraic Computation Trees. Found. Comput. Math. 17(1): 61-72 (2017) - 2013
- [j8]Saugata Basu
, Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
A Helly-Type Theorem for Semi-monotone Sets and Monotone Maps. Discret. Comput. Geom. 50(4): 857-864 (2013) - 2011
- [j7]Monique Azar, Andrei Gabrielov:
Some Lower Bounds in the B. and M. Shapiro Conjecture for Flag Varieties. Discret. Comput. Geom. 46(4): 636-659 (2011) - 2008
- [j6]Peter Bürgisser, Andrei Gabrielov, Teresa Krick, Gregorio Malajovich:
Guest Editor's Preface. J. Complex. 24(1): 2 (2008) - 2005
- [j5]Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae. Discret. Comput. Geom. 33(3): 395-401 (2005) - 2002
- [j4]A. Eremenko, Andrei Gabrielov:
Degrees of Real Wronski Maps. Discret. Comput. Geom. 28(3): 331-347 (2002) - [j3]A. Eremenko, Andrei Gabrielov:
Pole Placement by Static Output Feedback for Generic Linear Systems. SIAM J. Control. Optim. 41(1): 303-312 (2002) - 1998
- [j2]Andrei Gabrielov:
Frontier and Closure of a Semi-Pfaffian Set. Discret. Comput. Geom. 19(4): 605-617 (1998) - 1995
- [j1]Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
Complexity of Stratifications of Semi-Pfaffian Sets. Discret. Comput. Geom. 14(1): 71-91 (1995)
Conference and Workshop Papers
- 2001
- [c1]Andrei Gabrielov, Thierry Zell:
On the Number of Connected Components of the Relative Closure of a Semi-Pfaffian Family. Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science 2001: 65-75
Reference Works
- 2009
- [r1]Vladimir I. Keilis-Borok, Andrei Gabrielov, Alexandre Soloviev:
Geo-complexity and Earthquake Prediction. Encyclopedia of Complexity and Systems Science 2009: 4178-4194
Informal and Other Publications
- 2015
- [i2]Nicolai N. Vorobjov Jr., Andrei Gabrielov:
On topological lower bounds for algebraic computation trees. CoRR abs/1502.04341 (2015) - [i1]Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
Topological lower bounds for arithmetic networks. CoRR abs/1510.03387 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-02 19:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
