Dima Grigoriev
Impact in
-
- Complexity and Algorithms in Graphs
- Polynomial and algebraic computation
- Advanced Graph Theory Research
- Formal Methods in Verification
- Computational Mathematics top 10%
Papers in
-
- Polynomial and algebraic computation 25
- Complexity and Algorithms in Graphs 10
- Formal Methods in Verification 6
-
- Coding theory and cryptography 13
- Cryptography and Data Security 7
- Co-authors
- Marek Karpiński (12 shared papers)Vladimir Shpilrain (5 shared papers)Nicolai Vorobjov (4 shared papers)Michael F. Singer (2 shared papers)Felipe Cucker (3 shared papers)Russell Impagliazzo (1 shared paper)Sam Buss (1 shared paper)Fritz Schwarz (3 shared papers)
- Journals
- Computational Complexity (5 papers)SIAM Journal on Computing (5 papers)Journal of Complexity (4 papers)Advances in Applied Mathematics (3 papers)Foundations of Computational Mathematics (3 papers)
- Partner nations
- FranceUnited StatesGermany
In The Last Decade
Dima Grigoriev
62 papers receiving 509 citations
Peers
Comparison fields: 5 of 59
- Computational Theory and Mathematics 369
- Computational Mathematics 12
- Algebra and Number Theory 51
- Computer Graphics and Computer-Aided Design 33
- Discrete Mathematics and Combinatorics 25
Countries citing papers authored by Dima Grigoriev
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
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-authors
The 25 scholars most cited alongside Dima Grigoriev, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 70 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2001 | 79 | |
| 2 | 2014 | 46 | |
| 3 | 2001 | 41 | |
| 4 | 2001 | 37 | |
| 5 | 2015 | 29 | |
| 6 | 1994 | 29 | |
| 7 | 1997 | 23 | |
| 8 | 1996 | 20 | |
| 9 | 2012 | 17 | |
| 10 | 1991 | 15 | |
| 11 | 2019 | 12 | |
| 12 | 2005 | 11 | |
| 13 | 2015 | 10 | |
| 14 | 2014 | 10 | |
| 15 | 2012 | 9 | |
| 16 | 2013 | 9 | |
| 17 | 2005 | 8 | |
| 18 | 2009 | 8 | |
| 19 | 2006 | 7 | |
| 20 | 2013 | 7 |
About Dima Grigoriev
Dima Grigoriev is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Geometry and Topology, Algebra and Number Theory and Molecular Biology, having authored 70 papers that have together received 553 indexed citations. Recurring topics across this work include Polynomial and algebraic computation (25 papers), Coding theory and cryptography (13 papers), Commutative Algebra and Its Applications (10 papers), Complexity and Algorithms in Graphs (10 papers), Gene Regulatory Network Analysis (8 papers), Cryptography and Data Security (7 papers), Advanced Numerical Analysis Techniques (7 papers) and Formal Methods in Verification (6 papers). The work is most often cited by research in Computational Theory and Mathematics (369 citations), Computational Mathematics (12 citations), Algebra and Number Theory (51 citations), Computer Graphics and Computer-Aided Design (33 citations) and Discrete Mathematics and Combinatorics (25 citations). Dima Grigoriev has collaborated with scholars based in France, United States and Germany. Frequent co-authors include Marek Karpiński, Vladimir Shpilrain, Nicolai Vorobjov, Michael F. Singer, Felipe Cucker, Russell Impagliazzo, Sam Buss, Fritz Schwarz, Toniann Pitassi and Andreas Weber⋆. Their work appears in journals such as Computational Complexity, SIAM Journal on Computing, Journal of Complexity, Advances in Applied Mathematics and Foundations of Computational Mathematics.
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.