| Publication | Date of Publication | Type |
|---|
| The entropy of the radical ideal of a tropical curve | 2024-01-29 | Paper |
| Excitable media store and transfer complicated information via topological defect motion | 2022-10-28 | Paper |
| Tropical Newton-Puiseux polynomials. II | 2022-09-22 | Paper |
| Analyzing and forecasting financial series with singular spectral analysis | 2022-09-16 | Paper |
| On a tropical version of the Jacobian conjecture | 2021-09-29 | Paper |
| Entropy of tropical holonomic sequences | 2021-08-05 | Paper |
| Efficiently and effectively recognizing toricity of steady state varieties | 2021-06-25 | Paper |
| Complexity of deciding whether a tropical linear prevariety is a tropical variety | 2021-06-11 | Paper |
| Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative? | 2021-01-19 | Paper |
| Probabilistic solution of Yao's millionaires' problem | 2020-12-15 | Paper |
| A Case Study on the Parametric Occurrence of Multiple Steady States | 2020-09-09 | Paper |
| Tropical combinatorial Nullstellensatz and sparse polynomials | 2020-09-07 | Paper |
| Decomposing tropical rational functions | 2020-06-15 | Paper |
| Key agreement based on automaton groups | 2020-05-11 | Paper |
| Tropical recurrent sequences | 2020-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5215785 | 2020-02-13 | Paper |
| Identifying the parametric occurrence of multiple steady states for some biological networks | 2020-01-15 | Paper |
| Tropical cryptography II: Extensions by homomorphisms | 2019-08-07 | Paper |
| On semiring complexity of Schur polynomials | 2018-12-10 | Paper |
| Upper bounds on Betti numbers of tropical prevarieties | 2018-11-08 | Paper |
| Tropical Newton-Puiseux polynomials | 2018-10-23 | Paper |
| Orthogonal tropical linear prevarieties | 2018-10-23 | Paper |
| A framework for unconditionally secure public-key encryption (with possible decryption errors) | 2018-08-17 | Paper |
| Tropical effective primary and dual Nullstellensätze | 2018-04-20 | Paper |
| Symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks | 2018-02-23 | Paper |
| Probabilistic solution of Yao's millionaires' problem | 2017-11-27 | Paper |
| Tropical combinatorial Nullstellensatz and fewnomials testing | 2017-11-22 | Paper |
| Yao’s Millionaires’ Problem and Public-Key Encryption Without Computational Assumptions | 2017-09-08 | Paper |
| Bounds on the number of connected components for tropical prevarieties | 2017-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955010 | 2017-01-24 | Paper |
| Detection of Hopf bifurcations in chemical reaction networks using convex coordinates | 2016-12-05 | Paper |
| Tropical differential equations | 2016-11-02 | Paper |
| Lower bounds on testing membership to a polyhedron by algebraic decision trees | 2016-09-01 | Paper |
| Subtraction-free complexity, cluster transformations, and spanning trees | 2016-03-04 | Paper |
| A geometric method for model reduction of biochemical networks with polynomial rate functions | 2016-02-23 | Paper |
| Complexity of tropical Schur polynomials | 2015-12-08 | Paper |
| Bounds on numers of vectors of multiplicities for polynomials which are easy to compute | 2015-11-26 | Paper |
| Polynomial Complexity Recognizing a Tropical Linear Variety | 2015-11-25 | Paper |
| Computing Highest-Order Divisors for a Class of Quasi-Linear Partial Differential Equations | 2015-11-25 | Paper |
| Analysis of Reaction Network Systems Using Tropical Geometry | 2015-11-25 | Paper |
| Absolute factoring of non-holonomic ideals in the plane | 2015-09-17 | Paper |
| Tropicalization and tropical equilibration of chemical reactions | 2015-09-11 | Paper |
| Generalized Loewy-decomposition of d-modules | 2015-07-16 | Paper |
| Complexity of tropical and MIN-plus linear prevarieties | 2015-07-08 | Paper |
| YAO'S MILLIONAIRES' PROBLEM AND DECOY-BASED PUBLIC KEY ENCRYPTION BY CLASSICAL PHYSICS | 2014-11-14 | Paper |
| Tensor rank: matching polynomials and Schur rings | 2014-09-04 | Paper |
| Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates | 2014-07-07 | Paper |
| Polynomial Complexity of Solving Systems of Few Algebraic Equations with Small Degrees | 2014-07-07 | Paper |
| Computing Divisors and Common Multiples of Quasi-linear Ordinary Differential Equations | 2014-07-07 | Paper |
| Complexity in Tropical Algebra (Invited Talk) | 2014-07-07 | Paper |
| Tropical Cryptography | 2014-04-25 | Paper |
| Tropical Geometries and Dynamics of Biochemical Networks Application to Hybrid Cell Cycle Models | 2014-03-21 | Paper |
| Secrecy without one-way functions | 2014-01-23 | Paper |
| Nikolai Aleksandrovich Shanin (obituary) | 2013-12-17 | Paper |
| Secure Information Transmission Based on Physical Principles | 2013-06-28 | Paper |
| Complexity of solving tropical linear systems | 2013-04-11 | Paper |
| Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 2 | 2012-11-20 | Paper |
| Universal stratifications and a Bertini-type theorem | 2012-11-02 | Paper |
| Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics | 2012-09-21 | Paper |
| Continuous hard-to-invert functions and biometric authentication | 2012-08-28 | Paper |
| No-leak authentication by the Sherlock Holmes method | 2012-08-28 | Paper |
| Effective Hironaka resolution and its Complexity (with appendix on applications in positive characteristic) | 2012-06-14 | Paper |
| Effective Hironaka resolution and its complexity | 2012-04-05 | Paper |
| On a tropical dual Nullstellensatz | 2012-03-29 | Paper |
| Authentication schemes from actions on graphs, groups, or rings | 2011-09-12 | Paper |
| Complexity of quantifier elimination in the theory of ordinary differential equations | 2011-04-16 | Paper |
| Complexity of a standard basis of a $D$-module | 2011-03-02 | Paper |
| A low complexity probabilistic test for integer multiplication | 2010-08-03 | Paper |
| Analogue of Newton-Puiseux series for non-holonomic D-modules and factoring | 2010-04-13 | Paper |
| Probabilistic communication complexity over the reals | 2010-03-15 | Paper |
| Authentication from Matrix Conjugation | 2010-03-11 | Paper |
| Time hierarchies for cryptographic function inversion with advice | 2010-01-15 | Paper |
| A Complete Public-Key Cryptosystem | 2009-03-23 | Paper |
| Loewy decomposition of third-order linear aPDE's in the plane | 2009-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3545322 | 2008-12-10 | Paper |
| Loewy and primary decompositions of \(\mathcal D\)-modules | 2007-09-19 | Paper |
| Complexity of Janet basis of a D-module | 2007-04-10 | Paper |
| Homomorphic public-key cryptosystems and encrypting Boolean circuits | 2006-10-25 | Paper |
| Public-key cryptography and invariant theory | 2006-01-03 | Paper |
| On non-Abelian homomorphic public-key cryptosystems | 2006-01-03 | Paper |
| Weak Bézout inequality for D-modules | 2005-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465362 | 2005-08-22 | Paper |
| Doubly-exponential growth of the number of vectors of multiplicities for solutions of systems of polynomial | 2005-08-05 | Paper |
| Polynomial-time computing over quadratic maps i: sampling in real algebraic sets | 2005-06-16 | Paper |
| Factoring and solving linear partial differential equations | 2004-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736859 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737162 | 2004-08-11 | Paper |
| Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470463 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4463045 | 2004-05-27 | Paper |
| Complexity of gene circuits, Pfaffian functions and the morphogenesis problem. | 2004-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4807964 | 2004-01-14 | Paper |
| Nikolai Aleksandrovich Shanin (on his 80th birthday) | 2003-08-28 | Paper |
| Biography of A. O. Slissenko | 2003-08-17 | Paper |
| Algebraic proof systems over formulas. | 2003-08-17 | Paper |
| Approximation and complexity. II: Iterated integration | 2003-04-02 | Paper |
| Approximation and complexity: Liouvillean-type theorems for linear differential equations on an interval | 2002-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779151 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542540 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542578 | 2002-08-01 | Paper |
| Skyrmed monopoles | 2002-07-17 | Paper |
| There are No Sparse NPw-Hard Sets | 2002-04-23 | Paper |
| Linear gaps between degrees for the polynomial calculus modulo distinct primes | 2002-03-24 | Paper |
| Complexity of Positivstellensatz proofs for the knapsack | 2002-03-13 | Paper |
| Complexity of Null- and Positivstellensatz proofs | 2002-03-13 | Paper |
| Testing the shift-equivalence of polynomials using quantum machines | 2001-11-27 | Paper |
| Algorithms for computing sparse shifts for multivariate polynomials | 2001-09-10 | Paper |
| Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234231 | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232467 | 2001-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526972 | 2001-02-28 | Paper |
| Complexity lower bounds for randomized computation trees over zero characteristic fields | 2001-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329399 | 2001-01-01 | Paper |
| Complexity lower bounds for approximation algebraic computation trees | 2000-09-03 | Paper |
| Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. | 2000-08-08 | Paper |
| Randomized complexity lower bound for arrangements and polyhedra | 2000-05-18 | Paper |
| Topological complexity of the range searching | 2000-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252710 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227323 | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228517 | 1999-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4237365 | 1999-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227280 | 1999-05-18 | Paper |
| An exponential lower bound on the size of algebraic decision trees for MAX | 1999-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3842460 | 1998-11-05 | Paper |
| Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. | 1998-07-22 | Paper |
| A lower bound for randomized algebraic decision trees | 1998-05-13 | Paper |
| Randomization and the computational power of analytic and algebraic decision trees | 1998-05-13 | Paper |
| Computing the Additive Complexity of Algebraic Circuits with Root Extracting | 1998-05-10 | Paper |
| On the Power of Real Turing Machines over Binary Inputs | 1997-11-10 | Paper |
| Nearly sharp complexity bounds for multiprocessor algebraic computations | 1997-10-13 | Paper |
| Complexity lower bounds for computation trees with elementary transcendental function gates | 1997-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3126174 | 1997-07-06 | Paper |
| Lower bound on testing membership to a polyhedron by algebraic decision and computation trees | 1997-03-23 | Paper |
| NC solving of a system of linear ordinary differential equations in several unknowns | 1997-02-27 | Paper |
| Computability of the additive complexity of algebraic circuits with root extracting | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4880465 | 1996-06-04 | Paper |
| On Computing Algebraic Functions Using Logarithms and Exponentials | 1996-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4308386 | 1994-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4308393 | 1994-12-20 | Paper |
| Deviation theorems for solutions of differential equations and applications to lower bounds on parallel complexity of sigmoids | 1994-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3135191 | 1994-11-29 | Paper |
| Computational Complexity of Sparse Rational Interpolation | 1994-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279514 | 1994-02-17 | Paper |
| Complexity of quantifier elimination in the theory of ordinary differentially closed fields | 1993-09-15 | Paper |
| Complexity of factorization and GCD computation for linear ordinary differential operators | 1993-09-15 | Paper |
| Counting connected components of a semialgebraic set in subexponential time | 1993-04-01 | Paper |
| Complexity of solution of linear systems in rings of differential operators | 1992-09-27 | Paper |
| Complexity of testing irreducibility of a system of linear ordinary differential equations | 1992-09-27 | Paper |
| Finding connected components of a semialgebraic set in subexponential time | 1992-09-27 | Paper |
| Finding connected components of a semialgebraic set in subexponential time | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3973338 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3980333 | 1992-06-26 | Paper |
| Complexity of computations in Commutative Division of the USSR Academy of Sciences | 1992-06-25 | Paper |
| The interpolation problem for \(k\)-sparse sums of eigenfunctions of operators | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3971133 | 1992-06-25 | Paper |
| Solving Ordinary Differential Equations in Terms of Series with Real Exponents | 1992-06-25 | Paper |
| Solving systems of polynomial inequalities over a real closed field in subexponential time | 1991-01-01 | Paper |
| Complexity of deciding the first-order theory of real closed fields | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3362348 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3362349 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3364033 | 1991-01-01 | Paper |
| Complexity of factoring and calculating the GCD of linear ordinary differential operators | 1990-01-01 | Paper |
| Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3203727 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3473702 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3481680 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484283 | 1989-01-01 | Paper |
| Solving systems of polynomial inequalities in subexponential time | 1988-01-01 | Paper |
| Complexity of deciding Tarski algebra | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3480175 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4733314 | 1988-01-01 | Paper |
| THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3820004 | 1987-01-01 | Paper |
| Factorization of polynomials over a finite field and the solution of systems of algebraic equations | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3026977 | 1986-01-01 | Paper |
| Lower bounds in algebraic computational complexity | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3746798 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3728104 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5184991 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5187264 | 1984-01-01 | Paper |
| Complexity of wild matrix problems and of isomorphism of algebras and graphs | 1983-01-01 | Paper |
| Additive complexity in directed computations | 1982-01-01 | Paper |
| Time complexity of multidimensional Turing machines | 1982-01-01 | Paper |
| Two reductions of graph isomorphism to problems on polynomials | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4741700 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4747509 | 1982-01-01 | Paper |
| A lower bound for the computational complexity of a set of disjunctives in a monotone basis | 1981-01-01 | Paper |
| Problem of path connections in graphs | 1981-01-01 | Paper |
| Relation between rank and multiplicative complexity of a bilinear form over a commutative Noetherian ring | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3920643 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3936194 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3936919 | 1981-01-01 | Paper |
| Kolmogoroff algorithms are stronger than Turing machines | 1980-01-01 | Paper |
| Application of separability and independence notions for proving lower bounds of circuit complexity | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3660527 | 1980-01-01 | Paper |
| The algebraic complexity of computing a family of bilinear forms | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3866089 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3866090 | 1979-01-01 | Paper |
| THE RANK OF A PAIR OF MATRICES AND CONVOLUTION | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3882558 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190764 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4196546 | 1979-01-01 | Paper |
| Algebraic complexity of the computation of a pair of bilinear forms | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4162484 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132142 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132143 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4166744 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4109584 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4113812 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4137305 | 1974-01-01 | Paper |
