default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDima Grigoriev
Person information
- affiliation: Institut des Mathématiques de Lille, France
- award: Humboldt Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j82]Dima Grigoriev:
The entropy of the radical ideal of a tropical curve. Adv. Appl. Math. 153: 102635 (2024)- [j81]Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
:
Semialgebraic Proofs, IPS Lower Bounds, and the \(\boldsymbol{\tau}\)-Conjecture: Can a Natural Number be Negative? SIAM J. Comput. 53(3): 648-700 (2024) - [i60]Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch:
Tropical proof systems. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j80]Ivan Sudakow, Sergey Vakulenko, Dima Grigoriev:
Excitable media store and transfer complicated information via topological defect motion. Commun. Nonlinear Sci. Numer. Simul. 116: 106844 (2023) - [j79]Dima Grigoriev:
Tropical Newton-Puiseux polynomials II. J. Symb. Comput. 115: 316-319 (2023) - [c54]Dima Grigoriev, Ilia Ilmer, Alexey Ovchinnikov, Vladimir Shpilrain:
BASS: Boolean Automorphisms Signature Scheme. SecITC 2023: 1-12 - [i59]Jiale Chen, Dima Grigoriev, Vladimir Shpilrain:
Digital signature schemes using non-square matrices or scrap automorphisms. CoRR abs/2306.08927 (2023) - [i58]Dima Grigoriev, Ilia Ilmer, Alexey Ovchinnikov, Vladimir Shpilrain:
BASS: Boolean Automorphisms Signature Scheme. CoRR abs/2306.11303 (2023) - [i57]Jiale Chen, Dima Grigoriev, Vladimir Shpilrain:
Tropical cryptography III: digital signatures. CoRR abs/2309.11256 (2023) - [i56]Jiale Chen, Dima Grigoriev, Vladimir Shpilrain:
Digital signature schemes using non-square matrices or scrap automorphisms. IACR Cryptol. ePrint Arch. 2023: 873 (2023) - [i55]Dima Grigoriev, Ilia Ilmer, Alexey Ovchinnikov, Vladimir Shpilrain:
BASS: Boolean Automorphisms Signature Scheme. IACR Cryptol. ePrint Arch. 2023: 957 (2023) - [i54]Jiale Chen, Dima Grigoriev, Vladimir Shpilrain:
Tropical cryptography III: digital signatures. IACR Cryptol. ePrint Arch. 2023: 1475 (2023) - 2022
- [j78]Dima Grigoriev:
Entropy of tropical holonomic sequences. J. Symb. Comput. 108: 91-97 (2022) - [j77]Dima Grigoriev, Danylo V. Radchenko:
On a tropical version of the Jacobian conjecture. J. Symb. Comput. 109: 399-403 (2022) - 2021
- [j76]Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Complexity of deciding whether a tropical linear prevariety is a tropical variety. Appl. Algebra Eng. Commun. Comput. 32(2): 157-174 (2021) - [j75]Dima Grigoriev, Vladimir Shpilrain:
RSA and redactable blockchains. Int. J. Comput. Math. Comput. Syst. Theory 6(1): 1-6 (2021) - [j74]Mariya Bessonov, Dima Grigoriev, Vladimir Shpilrain:
Probability theory and public-key cryptography. Int. J. Comput. Math. Comput. Syst. Theory 6(4): 285-290 (2021) - [j73]Dima Grigoriev, Alexandru Iosif, Hamid Rahkooy, Thomas Sturm, Andreas Weber:
Efficiently and Effectively Recognizing Toricity of Steady State Varieties. Math. Comput. Sci. 15(2): 199-232 (2021) - 2020
- [j72]Dima Grigoriev:
Tropical recurrent sequences. Adv. Appl. Math. 116: 102012 (2020) - [j71]Dima Grigoriev, Vladimir V. Podolskii:
Tropical Combinatorial Nullstellensatz and Sparse Polynomials. Found. Comput. Math. 20(4): 753-781 (2020) - [j70]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:
Identifying the parametric occurrence of multiple steady states for some biological networks. J. Symb. Comput. 98: 84-119 (2020) - [j69]Dima Grigoriev:
Decomposing tropical rational functions. J. Symb. Comput. 101: 61-72 (2020) - [c53]Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret:
Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative? STOC 2020: 54-67 - [i53]Dima Grigoriev, Vladimir Shpilrain:
RSA and redactable blockchains. CoRR abs/2001.10783 (2020) - [i52]Dima Grigoriev:
Entropy of tropical holonomic sequences. CoRR abs/2003.05466 (2020) - [i51]Mariya Bessonov, Dima Grigoriev, Vladimir Shpilrain:
Probability theory and public-key cryptography. CoRR abs/2006.01607 (2020) - [i50]Dima Grigoriev, Vladimir Shpilrain:
RSA and redactable blockchains. IACR Cryptol. ePrint Arch. 2020: 69 (2020) - [i49]Mariya Bessonov, Dima Grigoriev, Vladimir Shpilrain:
Probability theory and public-key cryptography. IACR Cryptol. ePrint Arch. 2020: 625 (2020)
2010 – 2019
- 2019
- [j68]Rostislav I. Grigorchuk, Dima Grigoriev:
Key agreement based on automaton groups. Groups Complex. Cryptol. 11(2): 77-81 (2019) - [i48]Dima Grigoriev:
Decomposing tropical rational functions. CoRR abs/1901.01180 (2019) - [i47]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:
Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks. CoRR abs/1902.04882 (2019) - [i46]Rostislav I. Grigorchuk, Dima Grigoriev:
Key-agreement based on automaton groups. CoRR abs/1905.03124 (2019) - [i45]Dima Grigoriev, Alexandru Iosif, Hamid Rahkooy, Thomas Sturm, Andreas Weber:
Efficiently and Effectively Recognizing Toricity of Steady State Varieties. CoRR abs/1910.04100 (2019) - [i44]Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret:
Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative? CoRR abs/1911.06738 (2019) - [i43]Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret:
Semi-Algebraic Proofs, IPS Lower Bounds and the $\tau$-Conjecture: Can a Natural Number be Negative? Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j67]Sergey Fomin, Dima Grigoriev, Dorian Nogneng, Éric Schost:
On semiring complexity of Schur polynomials. Comput. Complex. 27(4): 595-616 (2018) - [j66]Dima Grigoriev, Vladimir V. Podolskii:
Tropical Effective Primary and Dual Nullstellensätze. Discret. Comput. Geom. 59(3): 507-552 (2018) - [c52]Dima Grigoriev:
Tropical Newton-Puiseux Polynomials. CASC 2018: 177-186 - [c51]Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Orthogonal Tropical Linear Prevarieties. CASC 2018: 187-196 - [c50]Mariya Bessonov, Dima Grigoriev, Vladimir Shpilrain:
A Framework for Unconditionally Secure Public-Key Encryption (with Possible Decryption Errors). ICMS 2018: 45-54 - [i42]Dima Grigoriev:
Tropical recurrent sequences. CoRR abs/1807.10714 (2018) - [i41]Dima Grigoriev, Vladimir Shpilrain:
Tropical cryptography II: extensions by homomorphisms. CoRR abs/1811.06386 (2018) - [i40]Dima Grigoriev, Vladimir Shpilrain:
Tropical cryptography II: extensions by homomorphisms. IACR Cryptol. ePrint Arch. 2018: 1104 (2018) - 2017
- [j65]Dima Grigoriev:
Tropical differential equations. Adv. Appl. Math. 82: 120-128 (2017) - [j64]Alex Davydow, Dima Grigoriev:
Bounds on the Number of Connected Components for Tropical Prevarieties. Discret. Comput. Geom. 57(2): 470-493 (2017) - [j63]Dima Grigoriev, Vladimir Shpilrain:
Secure Multiparty Computation without One-way Functions. FLAP 4(4) (2017) - [j62]Dima Grigoriev, Laszlo B. Kish, Vladimir Shpilrain:
Yao's Millionaires' Problem and Public-Key Encryption Without Computational Assumptions. Int. J. Found. Comput. Sci. 28(4): 379-390 (2017) - [c49]Matthew England, Hassan Errami, Dima Grigoriev, Ovidiu Radulescu, Thomas Sturm, Andreas Weber:
Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks. CASC 2017: 93-108 - [c48]Dima Grigoriev, Vladimir V. Podolskii:
Tropical Combinatorial Nullstellensatz and Fewnomials Testing. FCT 2017: 284-297 - [c47]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:
A Case Study on the Parametric Occurrence of Multiple Steady States. ISSAC 2017: 45-52 - [i39]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:
A Case Study on the Parametric Occurrence of Multiple Steady States. CoRR abs/1704.08997 (2017) - [i38]Dima Grigoriev, Vladimir V. Podolskii:
Tropical Combinatorial Nullstellensatz and Fewnomials Testing. CoRR abs/1706.00080 (2017) - [i37]Matthew England, Hassan Errami, Dima Grigoriev, Ovidiu Radulescu, Thomas Sturm, Andreas Weber:
Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks. CoRR abs/1706.08794 (2017) - [i36]Mariya Bessonov, Dima Grigoriev, Vladimir Shpilrain:
Probabilistic solution of Yao's millionaires' problem. CoRR abs/1711.09675 (2017) - [i35]Mariya Bessonov, Dima Grigoriev, Vladimir Shpilrain:
Probabilistic solution of Yao's millionaires' problem. IACR Cryptol. ePrint Arch. 2017: 1129 (2017) - 2016
- [j61]Satya Swarup Samal, Aurélien Naldi, Dima Grigoriev, Andreas Weber, Nathalie Théret, Ovidiu Radulescu:
Geometric analysis of pathways dynamics: Application to versatility of TGF-β receptors. Biosyst. 149: 3-14 (2016) - [j60]Sergey Fomin, Dima Grigoriev, Gleb A. Koshevoy:
Subtraction-Free Complexity, Cluster Transformations, and Spanning Trees. Found. Comput. Math. 16(1): 1-31 (2016) - [j59]Dima Grigoriev, Gleb A. Koshevoy:
Complexity of tropical Schur polynomials. J. Symb. Comput. 74: 46-54 (2016) - [i34]Sergey Fomin, Dima Grigoriev, Dorian Nogneng, Éric Schost:
On semiring complexity of Schur polynomials. CoRR abs/1608.05043 (2016) - [i33]Stéphane Gaubert, Dima Grigoriev, Michael Joswig, Thorsten Theobald:
Algorithms and Effectivity in Tropical Mathematics and Beyond (Dagstuhl Seminar 16482). Dagstuhl Reports 6(11): 168-184 (2016) - 2015
- [j58]Dima Grigoriev, Vladimir V. Podolskii:
Complexity of Tropical and Min-plus Linear Prevarieties. Comput. Complex. 24(1): 31-64 (2015) - [j57]Hassan Errami, Markus Eiswirth, Dima Grigoriev, Werner M. Seiler, Thomas Sturm, Andreas Weber:
Detection of Hopf bifurcations in chemical reaction networks using convex coordinates. J. Comput. Phys. 291: 279-302 (2015) - [c46]Dima Grigoriev:
Polynomial Complexity Recognizing a Tropical Linear Variety. CASC 2015: 152-157 - [c45]Dima Grigoriev, Fritz Schwarz:
Computing Highest-Order Divisors for a Class of Quasi-Linear Partial Differential Equations. CASC 2015: 158-165 - [c44]Satya Swarup Samal, Dima Grigoriev, Holger Fröhlich, Ovidiu Radulescu:
Analysis of Reaction Network Systems Using Tropical Geometry. CASC 2015: 424-439 - [c43]Ovidiu Radulescu, Satya Swarup Samal, Aurélien Naldi, Dima Grigoriev, Andreas Weber:
Symbolic Dynamics of Biochemical Pathways as Finite States Machines. CMSB 2015: 104-120 - [c42]Dima Grigoriev, Vladimir V. Podolskii:
Tropical Effective Primary and Dual Nullstellens"atze. STACS 2015: 379-391 - [i32]Dima Grigoriev:
Tropical differential equations. CoRR abs/1502.08010 (2015) - [i31]Dima Grigoriev:
Polynomial complexity recognizing a tropical linear variety. CoRR abs/1503.06126 (2015) - 2014
- [j56]Dima Grigoriev, John Reinitz, Sergei Vakulenko, Andreas Weber:
Punctuated evolution and robustness in morphogenesis. Biosyst. 123: 106-113 (2014) - [j55]Dima Grigoriev, Mikhail E. Muzychuk, Ilia N. Ponomarenko:
Tensor Rank: Matching Polynomials and Schur Rings. Found. Comput. Math. 14(3): 457-481 (2014) - [j54]Dima Grigoriev, Vladimir Shpilrain:
Yao's Millionaires' Problem and Decoy-Based Public Key Encryption by Classical Physics. Int. J. Found. Comput. Sci. 25(4): 409-418 (2014) - [i30]Dima Grigoriev, Vladimir V. Podolskii:
Tropical Effective Primary and Dual Nullstellensätze. CoRR abs/1409.6215 (2014) - [i29]Dima Grigoriev, Vladimir Shpilrain:
Yao's millionaires' problem and decoy-based public key encryption by classical physics. IACR Cryptol. ePrint Arch. 2014: 384 (2014) - 2013
- [j53]Dima Grigoriev:
Complexity of Solving Tropical Linear Systems. Comput. Complex. 22(1): 71-88 (2013) - [j52]Dima Grigoriev, Vladimir Shpilrain:
Secrecy without one-way functions. Groups Complex. Cryptol. 5(1): 31-52 (2013) - [c41]Hassan Errami, Markus Eiswirth, Dima Grigoriev, Werner M. Seiler, Thomas Sturm, Andreas Weber:
Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates. CASC 2013: 88-99 - [c40]Dima Grigoriev:
Polynomial Complexity of Solving Systems of Few Algebraic Equations with Small Degrees. CASC 2013: 136-139 - [c39]Dima Grigoriev, Fritz Schwarz:
Computing Divisors and Common Multiples of Quasi-linear Ordinary Differential Equations. CASC 2013: 140-147 - [c38]Dima Grigoriev:
Complexity in Tropical Algebra (Invited Talk). CASC 2013: 148-154 - [c37]Dima Grigoriev, Vladimir Shpilrain:
Secure Information Transmission Based on Physical Principles. UCNC 2013: 113-124 - [i28]Dima Grigoriev, Vladimir Shpilrain:
Tropical cryptography. CoRR abs/1301.1195 (2013) - [i27]Dima Grigoriev, Vladimir Shpilrain:
Secrecy without one-way functions. CoRR abs/1301.5069 (2013) - [i26]Sergey Fomin, Dima Grigoriev, Gleb A. Koshevoy:
Subtraction-free complexity and cluster transformations. CoRR abs/1307.8425 (2013) - [i25]Dima Grigoriev, Vladimir Shpilrain:
Yao's millionaires' problem and decoy-based public key encryption by classical physics. CoRR abs/1312.1160 (2013) - [i24]Dima Grigoriev, Vladimir Shpilrain:
Tropical cryptography. IACR Cryptol. ePrint Arch. 2013: 12 (2013) - [i23]Dima Grigoriev, Vladimir Shpilrain:
Secrecy without one-way functions. IACR Cryptol. ePrint Arch. 2013: 55 (2013) - [i22]Dima Grigoriev, Vladimir Shpilrain:
Secure information transmission based on physical principles. IACR Cryptol. ePrint Arch. 2013: 261 (2013) - 2012
- [j51]Dima Grigoriev:
On a tropical dual Nullstellensatz. Adv. Appl. Math. 48(2): 457-464 (2012) - [j50]Dima Grigoriev, Sergey I. Nikolenko:
Continuous hard-to-invert functions and biometric authentication. Groups Complex. Cryptol. 4(1): 19-32 (2012) - [j49]Dima Grigoriev, Vladimir Shpilrain:
No-leak authentication by the Sherlock Holmes method. Groups Complex. Cryptol. 4(1): 177-189 (2012) - [c36]Dima Grigoriev, Andreas Weber:
Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics. CASC 2012: 143-154 - [c35]Vincent Noel, Dima Grigoriev, Sergei Vakulenko, Ovidiu Radulescu:
Hybrid models of the cell cycle molecular machinery. HSB 2012: 88-105 - [i21]Dima Grigoriev, Vladimir V. Podolskii:
Complexity of tropical and min-plus linear prevarieties. CoRR abs/1204.4578 (2012) - 2011
- [c34]Vincent Noel, Dima Grigoriev, Sergei Vakulenko, Ovidiu Radulescu:
Tropical Geometries and Dynamics of Biochemical Networks Application to Hybrid Cell Cycle Models. SASB 2011: 75-91 - 2010
- [j48]Dima Grigoriev, Vladimir Shpilrain:
Authentication schemes from actions on graphs, groups, or rings. Ann. Pure Appl. Log. 162(3): 194-200 (2010) - [j47]Dima Grigoriev, Gerald Tenenbaum:
A low complexity probabilistic test for integer multiplication. J. Complex. 26(3): 263-267 (2010) - [j46]Sergei N. Artëmov, Volker Diekert, Dima Grigoriev:
Preface. Theory Comput. Syst. 46(1): 1 (2010) - [c33]Dima Grigoriev, Fritz Schwarz:
Absolute factoring of non-holonomic ideals in the plane. ISSAC 2010: 93-97 - [i20]Dima Grigoriev, Vladimir Shpilrain:
Authentication from matrix conjugation. CoRR abs/1010.5034 (2010) - [i19]Dima Grigoriev, Vladimir Shpilrain:
Authentication schemes from actions on graphs, groups, or rings. IACR Cryptol. ePrint Arch. 2010: 24 (2010) - [i18]Dima Grigoriev, Vladimir Shpilrain:
No-leak authentication by the Sherlock Holmes method. IACR Cryptol. ePrint Arch. 2010: 624 (2010)
2000 – 2009
- 2009
- [j45]Dima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev:
A Complete Public-Key Cryptosystem. Groups Complex. Cryptol. 1(1): 1-12 (2009) - [j44]Dima Grigoriev, Vladimir Shpilrain:
Authentication from Matrix Conjugation. Groups Complex. Cryptol. 1(2): 199-205 (2009) - 2008
- [j43]Dima Grigoriev:
Probabilistic Communication Complexity Over The Reals. Comput. Complex. 17(4): 536-548 (2008) - [j42]Sergei N. Artëmov, Volker Diekert, Dima Grigoriev:
Foreword. Theory Comput. Syst. 43(2): 99 (2008) - [c32]Dima Grigoriev, Fritz Schwarz:
Loewy decomposition of third-order linear aPDE's in the plane. ISSAC 2008: 277-286 - [i17]Dima Grigoriev, Vladimir Shpilrain:
Zero-knowledge authentication schemes from actions on graphs, groups, or rings. CoRR abs/0802.1661 (2008) - 2007
- [j41]Dima Grigoriev, Fritz Schwarz:
Loewy and primary decompositions of D-modules. Adv. Appl. Math. 38(4): 526-541 (2007) - [i16]Dima Grigoriev:
Probabilistic communication complexity over the reals. CoRR abs/0710.2732 (2007) - 2006
- [j40]Dima Grigoriev, Ilia N. Ponomarenko:
Homomorphic Public-Key Cryptosystems and Encrypting Boolean Circuits. Appl. Algebra Eng. Commun. Comput. 17(3-4): 239-255 (2006) - [j39]Dima Grigoriev, Sergei Vakulenko:
Algorithms and complexity in biological pattern formation problems. Ann. Pure Appl. Log. 141(3): 412-428 (2006) - [e1]Dima Grigoriev, John Harrison, Edward A. Hirsch:
Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings. Lecture Notes in Computer Science 3967, Springer 2006, ISBN 3-540-34166-8 [contents] - [i15]Dima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev:
A Complete Public-Key Cryptosystem. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j38]Dima Grigoriev, Dmitrii V. Pasechnik:
Polynomial-time computing over quadratic maps i: sampling in real algebraic sets. Comput. Complex. 14(1): 20-52 (2005) - [j37]Dima Grigoriev:
Weak Bézout inequality for D-modules. J. Complex. 21(4): 532-542 (2005) - [c31]Dima Grigoriev, Fritz Schwarz:
Generalized Loewy-decomposition of d-modules. ISSAC 2005: 163-170 - [i14]Dima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev:
Time hierarchies for cryptographic function inversion with advice. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j36]Dima Grigoriev, Fritz Schwarz:
Factoring and Solving Linear Partial Differential Equations. Computing 73(2): 179-197 (2004) - [j35]Dima Burago, Dima Grigoriev, Anatol Slissenko:
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon. Theor. Comput. Sci. 315(2-3): 371-404 (2004) - [i13]Dima Grigoriev, Dmitrii V. Pasechnik:
Polynomial-time computing over quadratic maps I. Sampling in real algebraic sets. CoRR cs.SC/0403008 (2004) - 2003
- [j34]Dima Grigoriev, Edward A. Hirsch:
Algebraic proof systems over formulas. Theor. Comput. Sci. 303(1): 83-102 (2003) - [i12]Dima Grigoriev, Ilia N. Ponomarenko:
Homomorphic public-key cryptosystems and encrypting boolean circuits. CoRR cs.CR/0301022 (2003) - [i11]Dima Grigoriev, Ilia N. Ponomarenko:
Homomorphic public-key cryptosystems over groups and rings. CoRR cs.CR/0309010 (2003) - [i10]Dima Grigoriev:
Weak Bezout inequality for D-modules. CoRR cs.SC/0311053 (2003) - [i9]Dima Grigoriev, Ilia Ponomarenko:
Homomorphic public-key cryptosystems and encrypting boolean circuits. IACR Cryptol. ePrint Arch. 2003: 25 (2003) - 2002
- [j33]Dima Grigoriev:
Approximation and Complexity II: Iterated Integration. Found. Comput. Math. 2(3): 295-304 (2002) - [c30]Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik:
Exponential Lower Bound for Static Semi-algebraic Proofs. ICALP 2002: 257-268 - [c29]Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik:
Complexity of Semi-algebraic Proofs. STACS 2002: 419-430 - [i8]Dima Grigoriev, Ilia N. Ponomarenko:
On non-abelian homomorphic public-key cryptosystems. CoRR cs.CR/0207079 (2002) - [i7]Dima Grigoriev:
Public-key cryptography and invariant theory. CoRR cs.CR/0207080 (2002) - [i6]Dima Grigoriev:
Public-key cryptography and invariant theory. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j32]Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Complexity of Null-and Positivstellensatz proofs. Ann. Pure Appl. Log. 113(1-3): 153-160 (2001) - [j31]Dima Grigoriev:
Complexity of Positivstellensatz proofs for the knapsack. Comput. Complex. 10(2): 139-154 (2001) - [j30]Dima Grigoriev:
Approximation and Complexity: Liouvillean-Type Theorems for Linear Differential Equations on an Interval. Found. Comput. Math. 1(3): 289-295 (2001) - [j29]Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi:
Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes. J. Comput. Syst. Sci. 62(2): 267-289 (2001) - [j28]Felipe Cucker, Dima Grigoriev:
There are No Sparse NPw-Hard Sets. SIAM J. Comput. 31(1): 193-198 (2001) - [j27]Dima Grigoriev:
Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity. Theor. Comput. Sci. 259(1-2): 613-622 (2001) - [c28]Felipe Cucker, Dima Grigoriev:
There Are No Sparse NPW-Hard Sets. MFCS 2001: 285-291 - [i5]Dima Grigoriev, Edward A. Hirsch:
Algebraic proof systems over formulas. Electron. Colloquium Comput. Complex. TR01 (2001) - [i4]Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik:
Complexity of semi-algebraic proofs. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j26]Dima Grigoriev, Alexander A. Razborov:
Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields. Appl. Algebra Eng. Commun. Comput. 10(6): 465-487 (2000) - [j25]Dima Grigoriev, Yagati N. Lakshman:
Algorithms for Computing Sparse Shifts for Multivariate Polynomials. Appl. Algebra Eng. Commun. Comput. 11(1): 43-67 (2000) - [j24]Dima Grigoriev:
Topological Complexity of the Range Searching. J. Complex. 16(1): 50-53 (2000) - [c27]Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute. ISSAC 2000: 137-146
1990 – 1999
- 1999
- [j23]Dima Grigoriev:
Complexity lower bounds for randomized computation trees over zero characteristic fields. Comput. Complex. 8(4): 316-329 (1999) - [j22]Dima Grigoriev:
Randomized Complexity Lower Bound for Arrangements and Polyhedra. Discret. Comput. Geom. 21(3): 329-344 (1999) - [j21]Felipe Cucker, Dima Grigoriev:
Complexity Lower Bounds for Approximation Algebraic Computation Trees. J. Complex. 15(4): 499-512 (1999) - [c26]Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi:
Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract). CCC 1999: 5 - [c25]Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi:
Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes. STOC 1999: 547-556 - 1998
- [j20]Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao:
An exponential lower bound on the size of algebraic decision trees for Max. Comput. Complex. 7(3): 193-203 (1998) - [j19]Dima Grigoriev, Marek Karpinski:
Computing the Additive Complexity of Algebraic Circuits with Root Extracting. SIAM J. Comput. 27(3): 694-701 (1998) - [c24]Dima Grigoriev, Alexander A. Razborov:
Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions Over Finite Fields. FOCS 1998: 269-278 - [c23]Dima Grigoriev:
Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs. FOCS 1998: 648-652 - [c22]Dima Grigoriev, Anatol Slissenko:
Polytime Algorithm for the Shortest Path in a Homotopy Class Amidst Semi-Algebraic Obstacles in the Plane. ISSAC 1998: 17-24 - [c21]Dima Grigoriev:
Randomized Complexity Lower Bounds. STOC 1998: 219-223 - [c20]Dima Grigoriev, Marek Karpinski:
An Exponential Lower Bound for Depth 3 Arithmetic Circuits. STOC 1998: 577-582 - 1997
- [j18]Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky:
A Lower Bound for Randomized Algebraic Decision Trees. Comput. Complex. 6(4): 357-375 (1997) - [j17]Dima Grigoriev, Marek Karpinski, Roman Smolensky:
Randomization and the Computational Power of Analytic and Algebraic Decision Trees. Comput. Complex. 6(4): 376-388 (1997) - [j16]Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.:
Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees. Discret. Comput. Geom. 17(2): 191-215 (1997) - [j15]Dima Grigoriev:
Nearly Sharp Complexity Bounds for Multiprocessor Algebraic Computations. J. Complex. 13(1): 50-64 (1997) - [j14]Felipe Cucker, Dima Grigoriev:
On the Power of Real Turing Machines Over Binary Inputs. SIAM J. Comput. 26(1): 243-254 (1997) - [j13]Dima Grigoriev:
Testing Shift-Equivalence of Polynomials by Deterministic, Probabilistic and Quantum Machines. Theor. Comput. Sci. 180(1-2): 217-228 (1997) - [c19]Dima Grigoriev, Anatol Slissenko:
Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane. AAECC 1997: 114-129 - [c18]Dima Grigoriev, Marek Karpinski:
Randomized Omega(n2) Lower Bound for Knapsack. STOC 1997: 76-85 - 1996
- [j12]Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko:
Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann. Fundam. Informaticae 28(3-4): 297-301 (1996) - [j11]Dima Grigoriev:
NC Solving of a System of Linear Ordinary Differential Equations in Several Unknowns. Theor. Comput. Sci. 157(1): 79-90 (1996) - [j10]Dima Grigoriev, Marek Karpinski:
Computability of the Additive Complexity of Algebraic Circuits with Root Extracting. Theor. Comput. Sci. 157(1): 91-99 (1996) - [j9]Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates. Theor. Comput. Sci. 157(2): 185-214 (1996) - [c17]Dima Grigoriev:
Testing Shift-Equivalence of Polynomials Using Quantum Machines. ISSAC 1996: 49-54 - [c16]Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky:
A Lower Bound for Randomized Algebraic Decision Trees. STOC 1996: 612-619 - [i3]Dima Grigoriev, Marek Karpinski:
Randomized Omega(n2) Lower Bound for Knapsack. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j8]Dima Grigoriev, Michael F. Singer, Andrew Chi-Chih Yao:
On Computing Algebraic Functions Using Logarithms and Exponentials. SIAM J. Comput. 24(2): 242-246 (1995) - [c15]Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.:
Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees. FOCS 1995: 258-265 - [c14]Dima Grigoriev, Yagati N. Lakshman:
Algorithms for Computing Sparse Shifts for Multivariate Polynomials. ISSAC 1995: 96-103 - [i2]Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao:
An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX. Electron. Colloquium Comput. Complex. TR95 (1995) - [i1]Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky:
A Lower Bound for Randomized Algebraic Decision Trees. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j7]Dima Grigoriev, Marek Karpinski, Michael F. Singer:
Computational Complexity of Sparse Rational Interpolation. SIAM J. Comput. 23(1): 1-11 (1994) - [j6]Dima Grigoriev:
Deviation Theorems for Solutions of Differential Equations and Applications to Lower Bounds on Parallel Complexity of Sigmoids. Theor. Comput. Sci. 133(1): 23-33 (1994) - [c13]Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates. FOCS 1994: 548-552 - [c12]Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.:
Lower bounds on testing membership to a polyhedron by algebraic decision trees. STOC 1994: 635-644 - 1993
- [c11]Dima Grigoriev, Marek Karpinski:
A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynominals. AAECC 1993: 162-169 - 1992
- [c10]Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko:
Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis. ISSAC 1992: 117-122 - 1991
- [c9]Dima Grigoriev, Marek Karpinski:
An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q]. FOCS 1991: 662-669 - [c8]Dima Grigoriev, Marek Karpinski:
Algorithms for Sparse Rational Interpolation. ISSAC 1991: 7-13 - 1990
- [j5]Dima Grigoriev:
Complexity of Factoring and Calculating the GCD of Linear Ordinary Differential Operators. J. Symb. Comput. 10(1): 7-38 (1990) - [j4]Dima Grigoriev, Marek Karpinski, Michael F. Singer:
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields. SIAM J. Comput. 19(6): 1059-1063 (1990) - [c7]Dima Grigoriev, Marek Karpinski, Michael F. Singer:
Interpolation of Sparse Rational Functions Without Knowing Bounds on Exponents. FOCS 1990: 840-846 - [c6]Dima Grigoriev:
How to Test in Subexponential Time Whether Two Points Can Be Connected by a Curve in a Semialgebraic Set. ISSAC 1990: 104-105 - [c5]Dima Grigoriev:
Complexity of Irreducibility Testing for a System of Linear Ordinary Differential Equations. ISSAC 1990: 225-230
1980 – 1989
- 1988
- [j3]Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Solving Systems of Polynomial Inequalities in Subexponential Time. J. Symb. Comput. 5(1/2): 37-64 (1988) - [j2]Dima Grigoriev:
Complexity of Deciding Tarski Algebra. J. Symb. Comput. 5(1/2): 65-108 (1988) - 1987
- [c4]Dima Grigoriev, Marek Karpinski:
The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC (Extended Abstract). FOCS 1987: 166-172 - 1984
- [c3]Alexander L. Chistov, Dima Grigoriev:
Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields. MFCS 1984: 17-31 - 1982
- [j1]Dima Grigoriev:
Additive Complexity in Directed Computations. Theor. Comput. Sci. 19: 39-67 (1982) - 1981
- [c2]Dima Grigoriev:
Multiplicative Complexity of a Bilinear Form over a Commutative Ring. MFCS 1981: 281-286
1970 – 1979
- 1978
- [c1]Dima Grigoriev:
Multiplicative Complexity of a Pair of Bilinear Forms and of the Polynomial Multiplication. MFCS 1978: 250-256
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
