| 2025 | CiE | Some Structural Complexity Results for $\exists {\mathbb {R}}$. | Klaus Meer, Adrian Wurm |
| 2024 | UC | Software Testing in Computable Analysis. | Klaus Meer, Martin Ziegler |
| 2021 | CSR | A PCP of Proximity for Real Algebraic Polynomials. | Klaus Meer |
| 2019 | LATA | Automata over Infinite Sequences of Reals. | Klaus Meer, Ameen Naif |
| 2016 | LATA | Periodic Generalized Automata over the Reals. | Klaus Meer, Ameen Naif |
| 2016 | MFCS | Real Interactive Proofs for VPSPACE. | Martijn Baartse, Klaus Meer |
| 2015 | CiE | Some Results on Interactive Proofs for Real Computations. | Martijn Baartse, Klaus Meer |
| 2015 | MFCS | An Algebraic Proof of the Real Number PCP Theorem. | Martijn Baartse, Klaus Meer |
| 2014 | CSR | Testing Low Degree Trigonometric Polynomials. | Martijn Baartse, Klaus Meer |
| 2014 | TAMC | Generalized Finite Automata over Real and Complex Numbers. | Klaus Meer, Ameen Naif |
| 2013 | STACS | The PCP theorem for NP over the reals. | Martijn Baartse, Klaus Meer |
| 2011 | CSR | An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents. | Klaus Meer |
| 2011 | FCT | Almost Transparent Short Proofs for NPℝ. | Klaus Meer |
| 2009 | CiE | On Ladner's Result for a Class of Real Machines with Restricted Use of Constants. | Klaus Meer |
| 2008 | WG | On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. | Pascal Koiran, Klaus Meer |
| 2007 | CiE | Some Aspects of a Complexity Theory for Continuous Time Systems. | Marco Gori, Klaus Meer |
| 2007 | MFCS | Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. | Klaus Meer, Martin Ziegler |
| 2006 | CiE | Optimization and Approximation Problems Related to Polynomial System Solving. | Klaus Meer |
| 2006 | CiE | Uncomputability Below the Real Halting Problem. | Klaus Meer, Martin Ziegler |
| 2006 | UC | Approximation Classes for Real Number Optimization Problems. | Uffe Flarup Hansen, Klaus Meer |
| 2005 | CiE | On Some Relations Between Approximation Problems and PCPs over the Real Numbers. | Klaus Meer |
| 2005 | FCT | An Explicit Solution to Post's Problem over the Reals. | Klaus Meer, Martin Ziegler |
| 2005 | MFCS | Two Logical Hierarchies of Optimization Problems over the Real Numbers. | Uffe Flarup Hansen, Klaus Meer |
| 2005 | STACS | Computing Minimal Multi-homogeneous Bzout Numbers Is Hard. | Gregorio Malajovich, Klaus Meer |
| 2004 | ICALP | Transparent Long Proofs: A First PCP Theorem for NP | Klaus Meer |
| 2003 | MFCS | On the Complexity of Some Problems in Interval Arithmetic. | Klaus Meer |
| 2002 | FLOPS | On Consistency and Width Notions for Constraint Programs with Algebraic Constraints. | Klaus Meer |
| 2000 | CSL | On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale. | Johann A. Makowsky, Klaus Meer |
| 1999 | MFCS | Query Languages for Real Number Databases Based on Descriptive Complexity over R. | Klaus Meer |
| 1997 | FCT | Logics Which Capture Complexity Classes over the Reals. | Felipe Cucker, Klaus Meer |
| 1997 | MFCS | Counting Problems over the Reals. | Klaus Meer |
| 1996 | CCA | On diagonal sets in uncountable structures. | Klaus Meer |
| 1995 | STOC | Descriptive complexity theory over the real numbers. | Erich Grdel, Klaus Meer |