Dima Grigoriev

1.7k total citations
71 papers, 564 citations indexed

About

Dima Grigoriev is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Dima Grigoriev has authored 71 papers receiving a total of 564 indexed citations (citations by other indexed papers that have themselves been cited), including 45 papers in Computational Theory and Mathematics, 26 papers in Artificial Intelligence and 11 papers in Geometry and Topology. Recurrent topics in Dima Grigoriev's work include Polynomial and algebraic computation (26 papers), Coding theory and cryptography (13 papers) and Complexity and Algorithms in Graphs (10 papers). Dima Grigoriev is often cited by papers focused on Polynomial and algebraic computation (26 papers), Coding theory and cryptography (13 papers) and Complexity and Algorithms in Graphs (10 papers). Dima Grigoriev collaborates with scholars based in France, United States and Germany. Dima Grigoriev's co-authors include Marek Karpiński, Vladimir Shpilrain, Nicolai Vorobjov, Michael F. Singer, Felipe Cucker, Russell Impagliazzo, Andreas Weber⋆, Sam Buss, Toniann Pitassi and Fritz Schwarz and has published in prestigious journals such as SHILAP Revista de lepidopterología, Scientific Reports and Journal of Computational Physics.

In The Last Decade

Dima Grigoriev

62 papers receiving 516 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Dima Grigoriev France	12	377	228	69	61	53	71	564
Michael Drmota Austria	16	256 0.7×	275 1.2×	133 1.9×	72 1.2×	82 1.5×	72	920
Hsien‐Kuei Hwang Taiwan	20	238 0.6×	518 2.3×	116 1.7×	56 0.9×	155 2.9×	89	1.1k
Ilia Krasikov Israel	12	191 0.5×	171 0.8×	68 1.0×	31 0.5×	43 0.8×	71	563
Amir Yehudayoff Israel	15	514 1.4×	410 1.8×	42 0.6×	23 0.4×	46 0.9×	88	755
Shachar Lovett United States	15	353 0.9×	402 1.8×	47 0.7×	31 0.5×	45 0.8×	103	680
Richard Zippel United States	13	360 1.0×	257 1.1×	63 0.9×	16 0.3×	52 1.0×	28	614
Zeev Dvir United States	13	332 0.9×	346 1.5×	44 0.6×	18 0.3×	34 0.6×	53	562
Neil J. Calkin United States	11	240 0.6×	137 0.6×	121 1.8×	34 0.6×	99 1.9×	48	504
Hariharan Narayanan United States	11	163 0.4×	126 0.6×	51 0.7×	23 0.4×	20 0.4×	42	443
D. Yu. Grigor'ev Russia	6	298 0.8×	103 0.5×	64 0.9×	19 0.3×	69 1.3×	15	383

Countries citing papers authored by Dima Grigoriev

Since Specialization

Citations

This map shows the geographic impact of Dima Grigoriev'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 Dima Grigoriev with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dima Grigoriev more than expected).

Fields of papers citing papers by Dima Grigoriev

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dima Grigoriev. 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 Dima Grigoriev. The network helps show where Dima Grigoriev may publish in the future.

Co-authorship network of co-authors of Dima Grigoriev

This figure shows the co-authorship network connecting the top 25 collaborators of Dima Grigoriev. A scholar is included among the top collaborators of Dima Grigoriev 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 Dima Grigoriev. Dima Grigoriev 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:

20 of 20 papers shown

Grigoriev, Dima, et al.. (2024). Semialgebraic Proofs, IPS Lower Bounds, and the \(\boldsymbol{\tau}\)-Conjecture: Can a Natural Number be Negative?. SIAM Journal on Computing. 53(3). 648–700.

Reinitz, John, et al.. (2024). Evolution of biological cooperation: an algorithmic approach. Scientific Reports. 14(1). 1468–1468. 1 indexed citations

Grigoriev, Dima, et al.. (2024). Tropical cryptography III: Digital signatures. Journal of Mathematical Cryptology. 18(1). 4 indexed citations

Bradford, Russell, James H. Davenport, Matthew England, et al.. (2019). Identifying the parametric occurrence of multiple steady states for some biological networks. Journal of Symbolic Computation. 98. 84–119. 10 indexed citations

Radulescu, Ovidiu, et al.. (2014). A Tropical Method based on Newton Polygon Approach for Algebraic Analysis of Biochemical Reaction Networks. 1 indexed citations

Fomin, Sergey, Dima Grigoriev, & Gleb Koshevoy. (2013). Subtraction-free complexity and cluster transformations.. arXiv (Cornell University). 1 indexed citations

Grigoriev, Dima. (2011). On a tropical dual Nullstellensatz. Advances in Applied Mathematics. 48(2). 457–464.

Grigoriev, Dima & Vladimir Shpilrain. (2010). Authentication schemes from actions on graphs, groups, or rings. Annals of Pure and Applied Logic. 162(3). 194–200. 5 indexed citations

Grigoriev, Dima. (2009). Time hierarchies for cryptographic function inversion with nonuniform advice. HAL (Le Centre pour la Communication Scientifique Directe).

10.

Grigoriev, Dima, John Harrison, & Edward Hirsch. (2006). Computer science -- theory and applications : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 : proceedings. Springer eBooks. 2 indexed citations

11.

Cucker, Felipe & Dima Grigoriev. (2001). There are No Sparse NP_w-Hard Sets. SIAM Journal on Computing. 31(1). 193–198.

12.

Grigoriev, Dima & Nicolai Vorobjov. (2001). Complexity of Null- and Positivstellensatz proofs. Annals of Pure and Applied Logic. 113(1-3). 153–160. 37 indexed citations

13.

Grigoriev, Dima. (2001). Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity. Theoretical Computer Science. 259(1-2). 613–622. 78 indexed citations

14.

Buss, Sam, Dima Grigoriev, Russell Impagliazzo, & Toniann Pitassi. (2001). Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes. Journal of Computer and System Sciences. 62(2). 267–289. 41 indexed citations

15.

Grigoriev, Dima. (2000). Topological Complexity of the Range Searching. Journal of Complexity. 16(1). 50–53. 4 indexed citations

16.

Cucker, Felipe & Dima Grigoriev. (1999). Complexity Lower Bounds for Approximation Algebraic Computation Trees. Journal of Complexity. 15(4). 499–512. 5 indexed citations

17.

Grigoriev, Dima. (1997). Nearly Sharp Complexity Bounds for Multiprocessor Algebraic Computations. Journal of Complexity. 13(1). 50–64. 4 indexed citations

18.

Grigoriev, Dima & Marek Karpiński. (1996). Computability of the additive complexity of algebraic circuits with root extracting. Theoretical Computer Science. 157(1). 91–99. 1 indexed citations

19.

Grigoriev, Dima, Marek Karpiński, & Michael F. Singer. (1991). The interpolation problem for k-sparse sums of eigenfunctions of operators. Advances in Applied Mathematics. 12(1). 76–81. 15 indexed citations

20.

Grigoriev, Dima. (1980). KOLMOGOROFF ALGORITHMS ARE STRONGER THAN TURING MACHINES. HAL (Le Centre pour la Communication Scientifique Directe). 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