D. Yu. Grigor'ev

903 total citations
15 papers, 383 citations indexed

About

D. Yu. Grigor'ev is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, D. Yu. Grigor'ev has authored 15 papers receiving a total of 383 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Computational Theory and Mathematics, 7 papers in Artificial Intelligence and 3 papers in Geometry and Topology. Recurrent topics in D. Yu. Grigor'ev's work include Coding theory and cryptography (7 papers), Polynomial and algebraic computation (6 papers) and graph theory and CDMA systems (3 papers). D. Yu. Grigor'ev is often cited by papers focused on Coding theory and cryptography (7 papers), Polynomial and algebraic computation (6 papers) and graph theory and CDMA systems (3 papers). D. Yu. Grigor'ev collaborates with scholars based in Russia, France and United States. D. Yu. Grigor'ev's co-authors include Nicolai Vorobjov, John Canny and N. N. Vorob’ëv and has published in prestigious journals such as Theoretical Computer Science, Russian Mathematical Surveys and Journal of Symbolic Computation.

In The Last Decade

D. Yu. Grigor'ev

12 papers receiving 335 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
D. Yu. Grigor'ev Russia	6	298	103	69	64	60	15	383
Nicolai Vorobjov United Kingdom	10	327 1.1×	90 0.9×	96 1.4×	118 1.8×	67 1.1×	27	434
Y. N. Lakshman United States	11	296 1.0×	97 0.9×	26 0.4×	20 0.3×	67 1.1×	17	392
P. Gianni Italy	7	276 0.9×	95 0.9×	95 1.4×	84 1.3×	94 1.6×	12	349
Wojciech A. Trybulec	13	322 1.1×	89 0.9×	114 1.7×	188 2.9×	15 0.3×	18	605
Nets Hawk Katz United States	14	184 0.6×	100 1.0×	112 1.6×	174 2.7×	50 0.8×	30	774
Tateaki Sasaki Japan	12	312 1.0×	99 1.0×	17 0.2×	35 0.5×	106 1.8×	45	367
Henri Lombardi France	14	429 1.4×	141 1.4×	289 4.2×	233 3.6×	79 1.3×	67	654
Jorma K. Merikoski Finland	10	160 0.5×	40 0.4×	34 0.5×	84 1.3×	19 0.3×	62	321
Birkett Huber United States	9	374 1.3×	23 0.2×	151 2.2×	140 2.2×	203 3.4×	13	512
Adam Strzeboński United States	12	269 0.9×	57 0.6×	34 0.5×	58 0.9×	93 1.6×	27	351

Countries citing papers authored by D. Yu. Grigor'ev

Since Specialization

Citations

This map shows the geographic impact of D. Yu. Grigor'ev's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by D. Yu. Grigor'ev with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites D. Yu. Grigor'ev more than expected).

Fields of papers citing papers by D. Yu. Grigor'ev

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by D. Yu. Grigor'ev. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by D. Yu. Grigor'ev. The network helps show where D. Yu. Grigor'ev may publish in the future.

Co-authorship network of co-authors of D. Yu. Grigor'ev

This figure shows the co-authorship network connecting the top 25 collaborators of D. Yu. Grigor'ev. A scholar is included among the top collaborators of D. Yu. Grigor'ev based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with D. Yu. Grigor'ev. D. Yu. Grigor'ev is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

15 of 15 papers shown

Vorob’ëv, N. N. & D. Yu. Grigor'ev. (1994). Finding connected components of a semialgebraic set in subexponential time. Journal of Mathematical Sciences. 70(4). 1847–1872. 1 indexed citations

Canny, John, D. Yu. Grigor'ev, & Nicolai Vorobjov. (1992). Finding connected components of a semialgebraic set in subexponential time. Applicable Algebra in Engineering Communication and Computing. 2(4). 217–238. 13 indexed citations

Grigor'ev, D. Yu.. (1991). Complexity of deciding the first-order theory of real closed fields. Journal of Mathematical Sciences. 55(2). 1553–1587. 1 indexed citations

Vorob’ëv, N. N. & D. Yu. Grigor'ev. (1991). Solving systems of polynomial inequalities over a real closed field in subexponential time. Journal of Mathematical Sciences. 55(2). 1519–1540. 1 indexed citations

Grigor'ev, D. Yu.. (1990). Complexity of factoring and calculating the GCD of linear ordinary differential operators. Journal of Symbolic Computation. 10(1). 7–37. 39 indexed citations

Grigor'ev, D. Yu. & Nicolai Vorobjov. (1988). Solving systems of polynomial inequalities in subexponential time. Journal of Symbolic Computation. 5(1-2). 37–64. 168 indexed citations

Grigor'ev, D. Yu.. (1988). Complexity of deciding Tarski algebra. Journal of Symbolic Computation. 5(1-2). 65–108. 105 indexed citations

Grigor'ev, D. Yu.. (1987). THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS. Mathematics of the USSR-Izvestiya. 29(2). 459–475. 5 indexed citations

Grigor'ev, D. Yu.. (1983). Complexity of ?wild? matrix problems and of isomorphism of algebras and graphs. Journal of Mathematical Sciences. 22(3). 1285–1289. 3 indexed citations

10.

Grigor'ev, D. Yu.. (1982). Additive complexity in directed computations. Theoretical Computer Science. 19(1). 39–67. 12 indexed citations

11.

Grigor'ev, D. Yu.. (1982). Two reductions of graph isomorphism to problems on polynomials. Journal of Mathematical Sciences. 20(4). 2296–2298. 4 indexed citations

12.

Grigor'ev, D. Yu.. (1982). Time complexity of multidimensional Turing machines. Journal of Mathematical Sciences. 20(4). 2290–2295. 4 indexed citations

13.

Grigor'ev, D. Yu.. (1981). Relation between rank and multiplicative complexity of a bilinear form over a commutative Noetherian ring. Journal of Mathematical Sciences. 17(4). 1987–1998. 1 indexed citations

14.

Grigor'ev, D. Yu.. (1980). Application of separability and independence notions for proving lower bounds of circuit complexity. Journal of Mathematical Sciences. 14(5). 1450–1457. 24 indexed citations

15.

Grigor'ev, D. Yu.. (1979). THE RANK OF A PAIR OF MATRICES AND CONVOLUTION. Russian Mathematical Surveys. 34(2). 231–232. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact