Dima Grigoriev

204 papers A* 15A 4B 28Misc 1Journal 148Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Minimal solutions of tropical linear differential systems. Appl. Algebra Eng. Commun. Comput. Dima Grigoriev, Cristhian Garay-López
2026	J	`jnl`	Testing containment of tropical hypersurfaces within polynomial complexity. J. Symb. Comput. Dima Grigoriev
2026	J	`jnl`	Tropical cryptography IV: Digital signatures and secret sharing with arbitrary access structure. IACR Cryptol. ePrint Arch. Dima Grigoriev, Chris Monico, Vladimir Shpilrain
2025	J	`jnl`	Effective resolution of singularities. CoRR Edward Bierstone, Dima Grigoriev, Pierre D. Milman, Jaroslaw Wlodarczyk
2025	A	`conf`	Tropical Proof Systems: Between R(CP) and Resolution. STACS Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch
2024	J	`jnl`	Digital signature schemes using non-square matrices or scrap automorphisms. Int. J. Comput. Math. Comput. Syst. Theory JiaLe Chen, Dima Grigoriev, Vladimir Shpilrain
2024	J	`jnl`	Semialgebraic Proofs, IPS Lower Bounds, and the $\boldsymbol{\tau}$-Conjecture: Can a Natural Number be Negative? SIAM J. Comput. Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
2024	J	`jnl`	The entropy of the radical ideal of a tropical curve. Adv. Appl. Math. Dima Grigoriev
2024	J	`jnl`	Tropical cryptography III: Digital signatures. J. Math. Cryptol. JiaLe Chen, Dima Grigoriev, Vladimir Shpilrain
2024	J	`jnl`	Tropical proof systems. Electron. Colloquium Comput. Complex. Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch
2023	—	`conf`	BASS: Boolean Automorphisms Signature Scheme. SecITC Dima Grigoriev, Ilia Ilmer, Alexey Ovchinnikov, Vladimir Shpilrain
2023	J	`jnl`	BASS: Boolean Automorphisms Signature Scheme. CoRR Dima Grigoriev, Ilia Ilmer, Alexey Ovchinnikov, Vladimir Shpilrain
2023	J	`jnl`	BASS: Boolean Automorphisms Signature Scheme. IACR Cryptol. ePrint Arch. Dima Grigoriev, Ilia Ilmer, Alexey Ovchinnikov, Vladimir Shpilrain
2023	J	`jnl`	Digital signature schemes using non-square matrices or scrap automorphisms. CoRR JiaLe Chen, Dima Grigoriev, Vladimir Shpilrain
2023	J	`jnl`	Digital signature schemes using non-square matrices or scrap automorphisms. IACR Cryptol. ePrint Arch. JiaLe Chen, Dima Grigoriev, Vladimir Shpilrain
2023	J	`jnl`	Excitable media store and transfer complicated information via topological defect motion. Commun. Nonlinear Sci. Numer. Simul. Ivan Sudakow, Sergey Vakulenko, Dima Grigoriev
2023	J	`jnl`	Tropical Newton-Puiseux polynomials II. J. Symb. Comput. Dima Grigoriev
2023	J	`jnl`	Tropical cryptography III: digital signatures. CoRR JiaLe Chen, Dima Grigoriev, Vladimir Shpilrain
2023	J	`jnl`	Tropical cryptography III: digital signatures. IACR Cryptol. ePrint Arch. JiaLe Chen, Dima Grigoriev, Vladimir Shpilrain
2022	J	`jnl`	Entropy of tropical holonomic sequences. J. Symb. Comput. Dima Grigoriev
2022	J	`jnl`	On a tropical version of the Jacobian conjecture. J. Symb. Comput. Dima Grigoriev, Danylo V. Radchenko
2021	J	`jnl`	Complexity of deciding whether a tropical linear prevariety is a tropical variety. Appl. Algebra Eng. Commun. Comput. Dima Grigoriev, Nicolai N. Vorobjov Jr.
2021	J	`jnl`	Efficiently and Effectively Recognizing Toricity of Steady State Varieties. Math. Comput. Sci. Dima Grigoriev, Alexandru Iosif, Hamid Rahkooy, Thomas Sturm, Andreas Weber
2021	J	`jnl`	Probability theory and public-key cryptography. Int. J. Comput. Math. Comput. Syst. Theory Mariya Bessonov, Dima Grigoriev, Vladimir Shpilrain
2021	J	`jnl`	RSA and redactable blockchains. Int. J. Comput. Math. Comput. Syst. Theory Dima Grigoriev, Vladimir Shpilrain
2020	J	`jnl`	Decomposing tropical rational functions. J. Symb. Comput. Dima Grigoriev
2020	J	`jnl`	Entropy of tropical holonomic sequences. CoRR Dima Grigoriev
2020	J	`jnl`	Identifying the parametric occurrence of multiple steady states for some biological networks. J. Symb. Comput. 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
2020	J	`jnl`	Probability theory and public-key cryptography. CoRR Mariya Bessonov, Dima Grigoriev, Vladimir Shpilrain
2020	J	`jnl`	Probability theory and public-key cryptography. IACR Cryptol. ePrint Arch. Mariya Bessonov, Dima Grigoriev, Vladimir Shpilrain
2020	J	`jnl`	RSA and redactable blockchains. CoRR Dima Grigoriev, Vladimir Shpilrain
2020	J	`jnl`	RSA and redactable blockchains. IACR Cryptol. ePrint Arch. Dima Grigoriev, Vladimir Shpilrain
2020	A*	`conf`	Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative? STOC Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
2020	J	`jnl`	Tropical Combinatorial Nullstellensatz and Sparse Polynomials. Found. Comput. Math. Dima Grigoriev, Vladimir V. Podolskii
2020	J	`jnl`	Tropical recurrent sequences. Adv. Appl. Math. Dima Grigoriev
2019	J	`jnl`	Decomposing tropical rational functions. CoRR Dima Grigoriev
2019	J	`jnl`	Efficiently and Effectively Recognizing Toricity of Steady State Varieties. CoRR Dima Grigoriev, Alexandru Iosif, Hamid Rahkooy, Thomas Sturm, Andreas Weber
2019	J	`jnl`	Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks. CoRR 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
2019	J	`jnl`	Key agreement based on automaton groups. Groups Complex. Cryptol. Rostislav I. Grigorchuk, Dima Grigoriev
2019	J	`jnl`	Key-agreement based on automaton groups. CoRR Rostislav I. Grigorchuk, Dima Grigoriev
2019	J	`jnl`	Semi-Algebraic Proofs, IPS Lower Bounds and the $\tau$-Conjecture: Can a Natural Number be Negative? Electron. Colloquium Comput. Complex. Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
2019	J	`jnl`	Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative? CoRR Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
2018	—	`conf`	A Framework for Unconditionally Secure Public-Key Encryption (with Possible Decryption Errors). ICMS Mariya Bessonov, Dima Grigoriev, Vladimir Shpilrain
2018	J	`jnl`	On semiring complexity of Schur polynomials. Comput. Complex. Sergey Fomin, Dima Grigoriev, Dorian Nogneng, Éric Schost
2018	B	`conf`	Orthogonal Tropical Linear Prevarieties. CASC Dima Grigoriev, Nicolai N. Vorobjov Jr.
2018	J	`jnl`	Tropical Effective Primary and Dual Nullstellensätze. Discret. Comput. Geom. Dima Grigoriev, Vladimir V. Podolskii
2018	B	`conf`	Tropical Newton-Puiseux Polynomials. CASC Dima Grigoriev
2018	J	`jnl`	Tropical cryptography II: extensions by homomorphisms. CoRR Dima Grigoriev, Vladimir Shpilrain
2018	J	`jnl`	Tropical cryptography II: extensions by homomorphisms. IACR Cryptol. ePrint Arch. Dima Grigoriev, Vladimir Shpilrain
2018	J	`jnl`	Tropical recurrent sequences. CoRR Dima Grigoriev
2017	B	`conf`	A Case Study on the Parametric Occurrence of Multiple Steady States. ISSAC 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
2017	J	`jnl`	A Case Study on the Parametric Occurrence of Multiple Steady States. CoRR 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
2017	J	`jnl`	Bounds on the Number of Connected Components for Tropical Prevarieties. Discret. Comput. Geom. Alex Davydow, Dima Grigoriev
2017	J	`jnl`	Probabilistic solution of Yao's millionaires' problem. CoRR Mariya Bessonov, Dima Grigoriev, Vladimir Shpilrain
2017	J	`jnl`	Probabilistic solution of Yao's millionaires' problem. IACR Cryptol. ePrint Arch. Mariya Bessonov, Dima Grigoriev, Vladimir Shpilrain
2017	J	`jnl`	Secure Multiparty Computation without One-way Functions. FLAP Dima Grigoriev, Vladimir Shpilrain
2017	B	`conf`	Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks. CASC Matthew England, Hassan Errami, Dima Grigoriev, Ovidiu Radulescu, Thomas Sturm, Andreas Weber
2017	J	`jnl`	Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks. CoRR Matthew England, Hassan Errami, Dima Grigoriev, Ovidiu Radulescu, Thomas Sturm, Andreas Weber
2017	B	`conf`	Tropical Combinatorial Nullstellensatz and Fewnomials Testing. FCT Dima Grigoriev, Vladimir V. Podolskii
2017	J	`jnl`	Tropical Combinatorial Nullstellensatz and Fewnomials Testing. CoRR Dima Grigoriev, Vladimir V. Podolskii
2017	J	`jnl`	Tropical differential equations. Adv. Appl. Math. Dima Grigoriev
2017	J	`jnl`	Yao's Millionaires' Problem and Public-Key Encryption Without Computational Assumptions. Int. J. Found. Comput. Sci. Dima Grigoriev, Laszlo B. Kish, Vladimir Shpilrain
2016	J	`jnl`	Algorithms and Effectivity in Tropical Mathematics and Beyond (Dagstuhl Seminar 16482). Dagstuhl Reports Stéphane Gaubert, Dima Grigoriev, Michael Joswig, Thorsten Theobald
2016	J	`jnl`	Complexity of tropical Schur polynomials. J. Symb. Comput. Dima Grigoriev, Gleb A. Koshevoy
2016	J	`jnl`	Geometric analysis of pathways dynamics: Application to versatility of TGF-β receptors. Biosyst. Satya Swarup Samal, Aurélien Naldi, Dima Grigoriev, Andreas Weber, Nathalie Théret, Ovidiu Radulescu
2016	J	`jnl`	On semiring complexity of Schur polynomials. CoRR Sergey Fomin, Dima Grigoriev, Dorian Nogneng, Éric Schost
2016	J	`jnl`	Subtraction-Free Complexity, Cluster Transformations, and Spanning Trees. Found. Comput. Math. Sergey Fomin, Dima Grigoriev, Gleb A. Koshevoy
2015	B	`conf`	Analysis of Reaction Network Systems Using Tropical Geometry. CASC Satya Swarup Samal, Dima Grigoriev, Holger Fröhlich, Ovidiu Radulescu
2015	J	`jnl`	Complexity of Tropical and Min-plus Linear Prevarieties. Comput. Complex. Dima Grigoriev, Vladimir V. Podolskii
2015	B	`conf`	Computing Highest-Order Divisors for a Class of Quasi-Linear Partial Differential Equations. CASC Dima Grigoriev, Fritz Schwarz
2015	J	`jnl`	Detection of Hopf bifurcations in chemical reaction networks using convex coordinates. J. Comput. Phys. Hassan Errami, Markus Eiswirth, Dima Grigoriev, Werner M. Seiler, Thomas Sturm, Andreas Weber
2015	B	`conf`	Polynomial Complexity Recognizing a Tropical Linear Variety. CASC Dima Grigoriev
2015	J	`jnl`	Polynomial complexity recognizing a tropical linear variety. CoRR Dima Grigoriev
2015	—	`conf`	Symbolic Dynamics of Biochemical Pathways as Finite States Machines. CMSB Ovidiu Radulescu, Satya Swarup Samal, Aurélien Naldi, Dima Grigoriev, Andreas Weber
2015	A	`conf`	Tropical Effective Primary and Dual Nullstellens"atze. STACS Dima Grigoriev, Vladimir V. Podolskii
2015	J	`jnl`	Tropical differential equations. CoRR Dima Grigoriev
2014	J	`jnl`	Punctuated evolution and robustness in morphogenesis. Biosyst. Dima Grigoriev, John Reinitz, Sergei Vakulenko, Andreas Weber
2014	J	`jnl`	Tensor Rank: Matching Polynomials and Schur Rings. Found. Comput. Math. Dima Grigoriev, Mikhail E. Muzychuk, Ilia N. Ponomarenko
2014	J	`jnl`	Tropical Effective Primary and Dual Nullstellensätze. CoRR Dima Grigoriev, Vladimir V. Podolskii
2014	J	`jnl`	Yao's Millionaires' Problem and Decoy-Based Public Key Encryption by Classical Physics. Int. J. Found. Comput. Sci. Dima Grigoriev, Vladimir Shpilrain
2014	J	`jnl`	Yao's millionaires' problem and decoy-based public key encryption by classical physics. IACR Cryptol. ePrint Arch. Dima Grigoriev, Vladimir Shpilrain
2013	B	`conf`	Complexity in Tropical Algebra (Invited Talk). CASC Dima Grigoriev
2013	J	`jnl`	Complexity of Solving Tropical Linear Systems. Comput. Complex. Dima Grigoriev
2013	B	`conf`	Computing Divisors and Common Multiples of Quasi-linear Ordinary Differential Equations. CASC Dima Grigoriev, Fritz Schwarz
2013	B	`conf`	Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates. CASC Hassan Errami, Markus Eiswirth, Dima Grigoriev, Werner M. Seiler, Thomas Sturm, Andreas Weber
2013	B	`conf`	Polynomial Complexity of Solving Systems of Few Algebraic Equations with Small Degrees. CASC Dima Grigoriev
2013	J	`jnl`	Secrecy without one-way functions CoRR Dima Grigoriev, Vladimir Shpilrain
2013	J	`jnl`	Secrecy without one-way functions. Groups Complex. Cryptol. Dima Grigoriev, Vladimir Shpilrain
2013	J	`jnl`	Secrecy without one-way functions. IACR Cryptol. ePrint Arch. Dima Grigoriev, Vladimir Shpilrain
2013	—	`conf`	Secure Information Transmission Based on Physical Principles. UCNC Dima Grigoriev, Vladimir Shpilrain
2013	J	`jnl`	Secure information transmission based on physical principles. IACR Cryptol. ePrint Arch. Dima Grigoriev, Vladimir Shpilrain
2013	J	`jnl`	Subtraction-free complexity and cluster transformations. CoRR Sergey Fomin, Dima Grigoriev, Gleb A. Koshevoy
2013	J	`jnl`	Tropical cryptography CoRR Dima Grigoriev, Vladimir Shpilrain
2013	J	`jnl`	Tropical cryptography. IACR Cryptol. ePrint Arch. Dima Grigoriev, Vladimir Shpilrain
2013	J	`jnl`	Yao's millionaires' problem and decoy-based public key encryption by classical physics. CoRR Dima Grigoriev, Vladimir Shpilrain
2012	B	`conf`	Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics. CASC Dima Grigoriev, Andreas Weber
2012	J	`jnl`	Complexity of tropical and min-plus linear prevarieties CoRR Dima Grigoriev, Vladimir V. Podolskii
2012	J	`jnl`	Continuous hard-to-invert functions and biometric authentication. Groups Complex. Cryptol. Dima Grigoriev, Sergey I. Nikolenko
2012	—	`conf`	Hybrid models of the cell cycle molecular machinery HSB Vincent Noel, Dima Grigoriev, Sergei Vakulenko, Ovidiu Radulescu
2012	J	`jnl`	No-leak authentication by the Sherlock Holmes method. Groups Complex. Cryptol. Dima Grigoriev, Vladimir Shpilrain
2012	J	`jnl`	On a tropical dual Nullstellensatz. Adv. Appl. Math. Dima Grigoriev
2011	—	`conf`	Tropical Geometries and Dynamics of Biochemical Networks Application to Hybrid Cell Cycle Models. SASB Vincent Noel, Dima Grigoriev, Sergei Vakulenko, Ovidiu Radulescu
2010	J	`jnl`	A low complexity probabilistic test for integer multiplication. J. Complex. Dima Grigoriev, Gerald Tenenbaum
2010	B	`conf`	Absolute factoring of non-holonomic ideals in the plane. ISSAC Dima Grigoriev, Fritz Schwarz
2010	J	`jnl`	Authentication from matrix conjugation CoRR Dima Grigoriev, Vladimir Shpilrain
2010	J	`jnl`	Authentication schemes from actions on graphs, groups, or rings. Ann. Pure Appl. Log. Dima Grigoriev, Vladimir Shpilrain
2010	J	`jnl`	Authentication schemes from actions on graphs, groups, or rings. IACR Cryptol. ePrint Arch. Dima Grigoriev, Vladimir Shpilrain
2010	J	`jnl`	No-leak authentication by the Sherlock Holmes method. IACR Cryptol. ePrint Arch. Dima Grigoriev, Vladimir Shpilrain
2010	J	`jnl`	Preface. Theory Comput. Syst. Sergei N. Artëmov, Volker Diekert, Dima Grigoriev
2009	J	`jnl`	A Complete Public-Key Cryptosystem. Groups Complex. Cryptol. Dima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev
2009	J	`jnl`	Authentication from Matrix Conjugation. Groups Complex. Cryptol. Dima Grigoriev, Vladimir Shpilrain
2008	J	`jnl`	Foreword. Theory Comput. Syst. Sergei N. Artëmov, Volker Diekert, Dima Grigoriev
2008	B	`conf`	Loewy decomposition of third-order linear aPDE's in the plane. ISSAC Dima Grigoriev, Fritz Schwarz
2008	J	`jnl`	Probabilistic Communication Complexity Over The Reals. Comput. Complex. Dima Grigoriev
2008	J	`jnl`	Zero-knowledge authentication schemes from actions on graphs, groups, or rings CoRR Dima Grigoriev, Vladimir Shpilrain
2007	J	`jnl`	Loewy and primary decompositions of D-modules. Adv. Appl. Math. Dima Grigoriev, Fritz Schwarz
2007	J	`jnl`	Probabilistic communication complexity over the reals CoRR Dima Grigoriev
2006	J	`jnl`	A Complete Public-Key Cryptosystem. Electron. Colloquium Comput. Complex. Dima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev
2006	J	`jnl`	Algorithms and complexity in biological pattern formation problems. Ann. Pure Appl. Log. Dima Grigoriev, Sergei Vakulenko
2006	Misc	`ed.`	Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings CSR Dima Grigoriev, John Harrison, Edward A. Hirsch
2006	J	`jnl`	Homomorphic Public-Key Cryptosystems and Encrypting Boolean Circuits. Appl. Algebra Eng. Commun. Comput. Dima Grigoriev, Ilia N. Ponomarenko
2005	B	`conf`	Generalized Loewy-decomposition of d-modules. ISSAC Dima Grigoriev, Fritz Schwarz
2005	J	`jnl`	Polynomial-time computing over quadratic maps i: sampling in real algebraic sets. Comput. Complex. Dima Grigoriev, Dmitrii V. Pasechnik
2005	J	`jnl`	Time hierarchies for cryptographic function inversion with advice Electron. Colloquium Comput. Complex. Dima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev
2005	J	`jnl`	Weak Bézout inequality for D-modules. J. Complex. Dima Grigoriev
2004	J	`jnl`	Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon. Theor. Comput. Sci. Dima Burago, Dima Grigoriev, Anatol Slissenko
2004	J	`jnl`	Factoring and Solving Linear Partial Differential Equations. Computing Dima Grigoriev, Fritz Schwarz
2004	J	`jnl`	Polynomial-time computing over quadratic maps I. Sampling in real algebraic sets CoRR Dima Grigoriev, Dmitrii V. Pasechnik
2003	J	`jnl`	Algebraic proof systems over formulas. Theor. Comput. Sci. Dima Grigoriev, Edward A. Hirsch
2003	J	`jnl`	Homomorphic public-key cryptosystems and encrypting boolean circuits CoRR Dima Grigoriev, Ilia N. Ponomarenko
2003	J	`jnl`	Homomorphic public-key cryptosystems and encrypting boolean circuits. IACR Cryptol. ePrint Arch. Dima Grigoriev, Ilia Ponomarenko
2003	J	`jnl`	Homomorphic public-key cryptosystems over groups and rings CoRR Dima Grigoriev, Ilia N. Ponomarenko
2003	J	`jnl`	Weak Bezout inequality for D-modules CoRR Dima Grigoriev
2002	J	`jnl`	Approximation and Complexity II: Iterated Integration. Found. Comput. Math. Dima Grigoriev
2002	A	`conf`	Complexity of Semi-algebraic Proofs. STACS Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
2002	A*	`conf`	Exponential Lower Bound for Static Semi-algebraic Proofs. ICALP Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
2002	J	`jnl`	On non-abelian homomorphic public-key cryptosystems CoRR Dima Grigoriev, Ilia N. Ponomarenko
2002	J	`jnl`	Public-key cryptography and invariant theory CoRR Dima Grigoriev
2002	J	`jnl`	Public-key cryptography and invariant theory Electron. Colloquium Comput. Complex. Dima Grigoriev
2001	J	`jnl`	Algebraic proof systems over formulas Electron. Colloquium Comput. Complex. Dima Grigoriev, Edward A. Hirsch
2001	J	`jnl`	Approximation and Complexity: Liouvillean-Type Theorems for Linear Differential Equations on an Interval. Found. Comput. Math. Dima Grigoriev
2001	J	`jnl`	Complexity of Null-and Positivstellensatz proofs. Ann. Pure Appl. Log. Dima Grigoriev, Nicolai N. Vorobjov Jr.
2001	J	`jnl`	Complexity of Positivstellensatz proofs for the knapsack. Comput. Complex. Dima Grigoriev
2001	J	`jnl`	Complexity of semi-algebraic proofs Electron. Colloquium Comput. Complex. Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
2001	J	`jnl`	Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes. J. Comput. Syst. Sci. Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi
2001	J	`jnl`	Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity. Theor. Comput. Sci. Dima Grigoriev
2001	B	`conf`	There Are No Sparse NP MFCS Felipe Cucker, Dima Grigoriev
2001	J	`jnl`	There are No Sparse NP SIAM J. Comput. Felipe Cucker, Dima Grigoriev
2000	J	`jnl`	Algorithms for Computing Sparse Shifts for Multivariate Polynomials. Appl. Algebra Eng. Commun. Comput. Dima Grigoriev, Yagati N. Lakshman
2000	B	`conf`	Bounds on numers of vectors of multiplicities for polynomials which are easy to compute. ISSAC Dima Grigoriev, Nicolai N. Vorobjov Jr.
2000	J	`jnl`	Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields. Appl. Algebra Eng. Commun. Comput. Dima Grigoriev, Alexander A. Razborov
2000	J	`jnl`	Topological Complexity of the Range Searching. J. Complex. Dima Grigoriev
1999	J	`jnl`	Complexity Lower Bounds for Approximation Algebraic Computation Trees. J. Complex. Felipe Cucker, Dima Grigoriev
1999	J	`jnl`	Complexity lower bounds for randomized computation trees over zero characteristic fields. Comput. Complex. Dima Grigoriev
1999	A	`conf`	Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract). CCC Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi
1999	A*	`conf`	Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes. STOC Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi
1999	J	`jnl`	Randomized Complexity Lower Bound for Arrangements and Polyhedra. Discret. Comput. Geom. Dima Grigoriev
1998	A*	`conf`	An Exponential Lower Bound for Depth 3 Arithmetic Circuits. STOC Dima Grigoriev, Marek Karpinski
1998	J	`jnl`	An exponential lower bound on the size of algebraic decision trees for Max. Comput. Complex. Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao
1998	J	`jnl`	Computing the Additive Complexity of Algebraic Circuits with Root Extracting. SIAM J. Comput. Dima Grigoriev, Marek Karpinski
1998	A*	`conf`	Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions Over Finite Fields. FOCS Dima Grigoriev, Alexander A. Razborov
1998	B	`conf`	Polytime Algorithm for the Shortest Path in a Homotopy Class Amidst Semi-Algebraic Obstacles in the Plane. ISSAC Dima Grigoriev, Anatol Slissenko
1998	A*	`conf`	Randomized Complexity Lower Bounds. STOC Dima Grigoriev
1998	A*	`conf`	Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs. FOCS Dima Grigoriev
1997	J	`jnl`	A Lower Bound for Randomized Algebraic Decision Trees. Comput. Complex. Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky
1997	—	`conf`	Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane. AAECC Dima Grigoriev, Anatol Slissenko
1997	J	`jnl`	Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees. Discret. Comput. Geom. Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.
1997	J	`jnl`	Nearly Sharp Complexity Bounds for Multiprocessor Algebraic Computations. J. Complex. Dima Grigoriev
1997	J	`jnl`	On the Power of Real Turing Machines Over Binary Inputs. SIAM J. Comput. Felipe Cucker, Dima Grigoriev
1997	J	`jnl`	Randomization and the Computational Power of Analytic and Algebraic Decision Trees. Comput. Complex. Dima Grigoriev, Marek Karpinski, Roman Smolensky
1997	A*	`conf`	Randomized Omega(n STOC Dima Grigoriev, Marek Karpinski
1997	J	`jnl`	Testing Shift-Equivalence of Polynomials by Deterministic, Probabilistic and Quantum Machines. Theor. Comput. Sci. Dima Grigoriev
1996	A*	`conf`	A Lower Bound for Randomized Algebraic Decision Trees. STOC Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky
1996	J	`jnl`	Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates. Theor. Comput. Sci. Dima Grigoriev, Nicolai N. Vorobjov Jr.
1996	J	`jnl`	Computability of the Additive Complexity of Algebraic Circuits with Root Extracting. Theor. Comput. Sci. Dima Grigoriev, Marek Karpinski
1996	J	`jnl`	NC Solving of a System of Linear Ordinary Differential Equations in Several Unknowns. Theor. Comput. Sci. Dima Grigoriev
1996	J	`jnl`	Randomized Omega(n Electron. Colloquium Comput. Complex. Dima Grigoriev, Marek Karpinski
1996	J	`jnl`	Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann. Fundam. Informaticae Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko
1996	B	`conf`	Testing Shift-Equivalence of Polynomials Using Quantum Machines. ISSAC Dima Grigoriev
1995	J	`jnl`	A Lower Bound for Randomized Algebraic Decision Trees Electron. Colloquium Comput. Complex. Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky
1995	B	`conf`	Algorithms for Computing Sparse Shifts for Multivariate Polynomials. ISSAC Dima Grigoriev, Yagati N. Lakshman
1995	J	`jnl`	An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX Electron. Colloquium Comput. Complex. Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao
1995	A*	`conf`	Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees. FOCS Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.
1995	J	`jnl`	On Computing Algebraic Functions Using Logarithms and Exponentials. SIAM J. Comput. Dima Grigoriev, Michael F. Singer, Andrew Chi-Chih Yao
1994	A*	`conf`	Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates FOCS Dima Grigoriev, Nicolai N. Vorobjov Jr.
1994	J	`jnl`	Computational Complexity of Sparse Rational Interpolation. SIAM J. Comput. Dima Grigoriev, Marek Karpinski, Michael F. Singer
1994	J	`jnl`	Deviation Theorems for Solutions of Differential Equations and Applications to Lower Bounds on Parallel Complexity of Sigmoids. Theor. Comput. Sci. Dima Grigoriev
1994	A*	`conf`	Lower bounds on testing membership to a polyhedron by algebraic decision trees. STOC Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.
1993	—	`conf`	A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynominals. AAECC Dima Grigoriev, Marek Karpinski
1992	B	`conf`	Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis. ISSAC Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko
1991	B	`conf`	Algorithms for Sparse Rational Interpolation. ISSAC Dima Grigoriev, Marek Karpinski
1991	A*	`conf`	An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q] FOCS Dima Grigoriev, Marek Karpinski
1990	J	`jnl`	Complexity of Factoring and Calculating the GCD of Linear Ordinary Differential Operators. J. Symb. Comput. Dima Grigoriev
1990	B	`conf`	Complexity of Irreducibility Testing for a System of Linear Ordinary Differential Equations. ISSAC Dima Grigoriev
1990	J	`jnl`	Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields. SIAM J. Comput. Dima Grigoriev, Marek Karpinski, Michael F. Singer
1990	B	`conf`	How to Test in Subexponential Time Whether Two Points Can Be Connected by a Curve in a Semialgebraic Set. ISSAC Dima Grigoriev
1990	A*	`conf`	Interpolation of Sparse Rational Functions Without Knowing Bounds on Exponents FOCS Dima Grigoriev, Marek Karpinski, Michael F. Singer
1988	J	`jnl`	Complexity of Deciding Tarski Algebra. J. Symb. Comput. Dima Grigoriev
1988	J	`jnl`	Solving Systems of Polynomial Inequalities in Subexponential Time. J. Symb. Comput. Dima Grigoriev, Nicolai N. Vorobjov Jr.
1987	A*	`conf`	The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC (Extended Abstract) FOCS Dima Grigoriev, Marek Karpinski
1984	B	`conf`	Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields. MFCS Alexander L. Chistov, Dima Grigoriev
1982	J	`jnl`	Additive Complexity in Directed Computations. Theor. Comput. Sci. Dima Grigoriev
1981	B	`conf`	Multiplicative Complexity of a Bilinear Form over a Commutative Ring. MFCS Dima Grigoriev
1978	B	`conf`	Multiplicative Complexity of a Pair of Bilinear Forms and of the Polynomial Multiplication. MFCS Dima Grigoriev