| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6076229 | 2023-10-23 | Paper |
| Logics which capture complexity classes over the reals | 2022-12-09 | Paper |
| A PCP of proximity for real algebraic polynomials | 2022-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5004973 | 2021-08-03 | Paper |
| Periodic generalized automata over the reals | 2019-12-18 | Paper |
| Automata over infinite sequences of reals | 2019-12-04 | Paper |
| Interactive proofs and a Shamir-like result for real number computations | 2019-08-30 | Paper |
| Real Interactive Proofs for VPSPACE. | 2018-03-21 | Paper |
| An algebraic proof of the real number PCP theorem | 2017-05-24 | Paper |
| The PCP theorem for NP over the reals | 2017-01-30 | Paper |
| Periodic Generalized Automata over the Reals | 2016-04-13 | Paper |
| Some Results on Interactive Proofs for Real Computations | 2015-10-20 | Paper |
| An Algebraic Proof of the Real Number PCP Theorem | 2015-09-16 | Paper |
| Topics in real and complex number complexity theory | 2015-08-04 | Paper |
| The PCP theorem for NP over the reals | 2015-07-22 | Paper |
| Generalized finite automata over real and complex numbers | 2015-07-13 | Paper |
| An extended tree-width notion for directed graphs related to the computation of permanents | 2015-02-05 | Paper |
| Testing Low Degree Trigonometric Polynomials | 2014-06-24 | Paper |
| Generalized Finite Automata over Real and Complex Numbers | 2014-04-16 | Paper |
| SOME INITIAL THOUGHTS ON BOUNDED QUERY COMPUTATIONS OVER THE REALS | 2013-06-06 | Paper |
| On Ladner's result for a class of real machines with restricted use of constants | 2012-05-24 | Paper |
| Almost Transparent Short Proofs for NPℝ | 2011-08-19 | Paper |
| An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents | 2011-06-17 | Paper |
| On the expressive power of CNF formulas of bounded tree- and clique-width | 2011-01-14 | Paper |
| On Ladner’s Result for a Class of Real Machines with Restricted Use of Constants | 2010-07-28 | Paper |
| Tree-width in Algebraic Complexity | 2010-05-25 | Paper |
| Simulated annealing versus Metropolis for a TSP instance | 2010-03-24 | Paper |
| Real computational universality: the word problem for a class of groups with infinite presentation | 2009-10-19 | Paper |
| On the OBDD size for graphs of bounded tree- and clique-width | 2009-04-09 | Paper |
| On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width | 2009-01-20 | Paper |
| Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation | 2008-09-17 | Paper |
| On the OBDD Size for Graphs of Bounded Tree- and Clique-Width | 2008-06-03 | Paper |
| An explicit solution to Post's problem over the reals | 2008-03-26 | Paper |
| Complexity aspects of a semi-infinite optimization problem† | 2008-03-10 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Approximation Classes for Real Number Optimization Problems | 2007-11-29 | Paper |
| Some Aspects of a Complexity Theory for Continuous Time Systems | 2007-11-13 | Paper |
| Some relations between approximation problems and PCPs over the real numbers | 2007-09-06 | Paper |
| Computing minimal multi-homogeneous Bezout numbers is hard | 2007-08-23 | Paper |
| Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
| Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Transparent long proofs: A first PCP theorem for \(\text{NP}_{\mathbb R}\) | 2006-09-28 | Paper |
| Two logical hierarchies of optimization problems over the real numbers | 2006-03-24 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828904 | 2004-11-29 | Paper |
| On a refined analysis of some problems in interval arithmetic using real number complexity theory | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789198 | 2003-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409153 | 2003-06-30 | Paper |
| A Step towards a Complexity Theory for Analog Systems | 2003-01-08 | Paper |
| Some aspects of studying an optimization or decision problem in different computational models | 2002-11-20 | Paper |
| On the computational structure of the connected components of a hard problem | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753688 | 2001-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502591 | 2001-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234078 | 2001-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941885 | 2001-03-12 | Paper |
| Counting problems over the reals | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699316 | 1999-11-10 | Paper |
| Logics which capture complexity classes over the reals | 1999-06-29 | Paper |
| A survey on real structural complexity theory | 1999-03-14 | Paper |
| On the Structure of $\cal NP_\Bbb C$ | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4361549 | 1997-10-28 | Paper |
| Semi-algebraic complexity -- Additive complexity of matrix computational tasks | 1997-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4717945 | 1997-05-12 | Paper |
| A note on testing the resultant | 1996-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4869136 | 1996-03-10 | Paper |
| On the Relations Between Discrete and Continuous Complexity Theory | 1995-12-17 | Paper |
| Real number computations: On the use of information | 1995-04-04 | Paper |
| On the complexity of quadratic programming in real number models of computation | 1994-11-27 | Paper |
| Real number models under various sets of operations | 1994-01-13 | Paper |
| A note on a \(P \neq NP\) result for a restricted class of real machines | 1993-02-22 | Paper |
| Computations over \(\mathbb{Z}\) and \(\mathbb{R}\): a comparison | 1990-01-01 | Paper |
