| 2025 | STACS | Tropical Proof Systems: Between R(CP) and Resolution. | Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch |
| 2020 | STOC | Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative? | Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret |
| 2018 | CASC | Tropical Newton-Puiseux Polynomials. | Dima Grigoriev |
| 2018 | CASC | Orthogonal Tropical Linear Prevarieties. | Dima Grigoriev, Nicolai N. Vorobjov Jr. |
| 2017 | CASC | Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks. | Matthew England, Hassan Errami, Dima Grigoriev, Ovidiu Radulescu, Thomas Sturm, Andreas Weber |
| 2017 | FCT | Tropical Combinatorial Nullstellensatz and Fewnomials Testing. | Dima Grigoriev, Vladimir V. Podolskii |
| 2017 | ISSAC | A Case Study on the Parametric Occurrence of Multiple Steady States. | Russell J. Bradford, James H. Davenport, Matthew England, Hassan Errami, Vladimir P. Gerdt, Dima Grigoriev, Charles Tapley Hoyt, Marek Kosta, Ovidiu Radulescu, Thomas Sturm, Andreas Weber |
| 2015 | CASC | Polynomial Complexity Recognizing a Tropical Linear Variety. | Dima Grigoriev |
| 2015 | CASC | Computing Highest-Order Divisors for a Class of Quasi-Linear Partial Differential Equations. | Dima Grigoriev, Fritz Schwarz |
| 2015 | CASC | Analysis of Reaction Network Systems Using Tropical Geometry. | Satya Swarup Samal, Dima Grigoriev, Holger Frhlich, Ovidiu Radulescu |
| 2015 | STACS | Tropical Effective Primary and Dual Nullstellens"atze. | Dima Grigoriev, Vladimir V. Podolskii |
| 2013 | CASC | Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates. | Hassan Errami, Markus Eiswirth, Dima Grigoriev, Werner M. Seiler, Thomas Sturm, Andreas Weber |
| 2013 | CASC | Polynomial Complexity of Solving Systems of Few Algebraic Equations with Small Degrees. | Dima Grigoriev |
| 2013 | CASC | Complexity in Tropical Algebra (Invited Talk). | Dima Grigoriev |
| 2013 | CASC | Computing Divisors and Common Multiples of Quasi-linear Ordinary Differential Equations. | Dima Grigoriev, Fritz Schwarz |
| 2013 | UC | Secure Information Transmission Based on Physical Principles. | Dima Grigoriev, Vladimir Shpilrain |
| 2012 | CASC | Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics. | Dima Grigoriev, Andreas Weber |
| 2010 | ISSAC | Absolute factoring of non-holonomic ideals in the plane. | Dima Grigoriev, Fritz Schwarz |
| 2008 | ISSAC | Loewy decomposition of third-order linear aPDE's in the plane. | Dima Grigoriev, Fritz Schwarz |
| 2005 | ISSAC | Generalized Loewy-decomposition of d-modules. | Dima Grigoriev, Fritz Schwarz |
| 2002 | ICALP | Exponential Lower Bound for Static Semi-algebraic Proofs. | Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik |
| 2002 | STACS | Complexity of Semi-algebraic Proofs. | Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik |
| 2001 | MFCS | There Are No Sparse NP | Felipe Cucker, Dima Grigoriev |
| 2000 | ISSAC | Bounds on numers of vectors of multiplicities for polynomials which are easy to compute. | Dima Grigoriev, Nicolai N. Vorobjov Jr. |
| 1999 | STOC | Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes. | Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi |
| 1998 | FOCS | Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs. | Dima Grigoriev |
| 1998 | FOCS | Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions Over Finite Fields. | Dima Grigoriev, Alexander A. Razborov |
| 1998 | ISSAC | Polytime Algorithm for the Shortest Path in a Homotopy Class Amidst Semi-Algebraic Obstacles in the Plane. | Dima Grigoriev, Anatol Slissenko |
| 1998 | STOC | Randomized Complexity Lower Bounds. | Dima Grigoriev |
| 1998 | STOC | An Exponential Lower Bound for Depth 3 Arithmetic Circuits. | Dima Grigoriev, Marek Karpinski |
| 1997 | STOC | Randomized Omega(n | Dima Grigoriev, Marek Karpinski |
| 1996 | ISSAC | Testing Shift-Equivalence of Polynomials Using Quantum Machines. | Dima Grigoriev |
| 1996 | STOC | A Lower Bound for Randomized Algebraic Decision Trees. | Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky |
| 1995 | FOCS | Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees. | Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr. |
| 1995 | ISSAC | Algorithms for Computing Sparse Shifts for Multivariate Polynomials. | Dima Grigoriev, Yagati N. Lakshman |
| 1994 | FOCS | Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates | Dima Grigoriev, Nicolai N. Vorobjov Jr. |
| 1994 | STOC | Lower bounds on testing membership to a polyhedron by algebraic decision trees. | Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr. |
| 1992 | ISSAC | Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis. | Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko |
| 1991 | FOCS | An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q] | Dima Grigoriev, Marek Karpinski |
| 1991 | ISSAC | Algorithms for Sparse Rational Interpolation. | Dima Grigoriev, Marek Karpinski |
| 1990 | FOCS | Interpolation of Sparse Rational Functions Without Knowing Bounds on Exponents | Dima Grigoriev, Marek Karpinski, Michael F. Singer |
| 1990 | ISSAC | How to Test in Subexponential Time Whether Two Points Can Be Connected by a Curve in a Semialgebraic Set. | Dima Grigoriev |
| 1990 | ISSAC | Complexity of Irreducibility Testing for a System of Linear Ordinary Differential Equations. | Dima Grigoriev |
| 1987 | FOCS | The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC (Extended Abstract) | Dima Grigoriev, Marek Karpinski |
| 1984 | MFCS | Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields. | Alexander L. Chistov, Dima Grigoriev |
| 1981 | MFCS | Multiplicative Complexity of a Bilinear Form over a Commutative Ring. | Dima Grigoriev |
| 1978 | MFCS | Multiplicative Complexity of a Pair of Bilinear Forms and of the Polynomial Multiplication. | Dima Grigoriev |