Computations over Z and R: A comparison. - Klaus Meer (J. Complex., 1990)

A note on a P NP result for a restricted class of real machines. - Klaus Meer (J. Complex., 1992)

Real Number Models under Various Sets of Operations. - Klaus Meer (J. Complex., 1993)

Komplexitätsbetrachtungen für reelle Maschinenmodelle. - Klaus Meer (Shaker, 1993)

Real Number Computations: On the Use of Information. - Klaus Meer (J. Symb. Comput., 1994)

On the Complexity of Quadratic Programming in Real Number Models of Computation. - Klaus Meer (Theor. Comput. Sci., 1994)

Descriptive complexity theory over the real numbers. - Erich Grädel; Klaus Meer (STOC, 1995)

A Note on Testing the Resultant. - Thomas Lickteig; Klaus Meer (J. Complex., 1995)

On the Relations Between Discrete and Continuous Complexity Theory. - Klaus Meer (Math. Log. Q., 1995)

On diagonal sets in uncountable structures. - Klaus Meer (CCA, 1996)

Semi-algebraic Complexity–Additive Complexity of Matrix Computational Tasks. - Thomas Lickteig; Klaus Meer (J. Complex., 1997)

On the Structure of NP_C. - Gregorio Malajovich; Klaus Meer (SIAM J. Comput., 1998)

Query Languages for Real Number Databases Based on Descriptive Complexity over R. - Klaus Meer (MFCS, 1999)

On the computational structure of the connected components of a hard problem. - Martín Matamala; Klaus Meer (Inf. Process. Lett., 1999)

Logics Which Capture Complexity Classes Over The Reals. - Felipe Cucker; Klaus Meer (J. Symb. Log., 1999)

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 (CSL, 2000)

A Note on Non-complete Problems in NPImage. - Shai Ben-David; Klaus Meer; Christian Michaux (J. Complex., 2000)

Counting problems over the reals. - Klaus Meer (Theor. Comput. Sci., 2000)

On Consistency and Width Notions for Constraint Programs with Algebraic Constraints. - Klaus Meer (FLOPS, 2002)

Some aspects of studying an optimization or decision problem in different computational models. - Klaus Meer; Gerhard-Wilhelm Weber (Eur. J. Oper. Res., 2002)

A Step towards a Complexity Theory for Analog Systems. - Marco Gori; Klaus Meer (Math. Log. Q., 2002)

On the Complexity of Some Problems in Interval Arithmetic. - Klaus Meer (MFCS, 2003)

Optimization theory. - Hubertus Th. Jongen; Klaus Meer; Eberhard Triesch (Kluwer, 2004)

04061 Summary - Real Computation and Complexity. - Thomas Lickteig; Klaus Meer; Luis Miguel Pardo (Real Computation and Complexity, 2004)

04061 Abstracts Collection - Real Computation and Complexity. - Thomas Lickteig; Klaus Meer; Luis Miguel Pardo (Real Computation and Complexity, 2004)

On the Complexity of Computing Multi-Homogeneous Bézout Numbers. - Klaus Meer; Gregorio Malajovich (Algorithms and Complexity for Continuous Problems, 2004)

On the Approximation of Interval Functions. - Klaus Meer (PARA, 2004)

Computing Multi-Homogeneous Bezout Numbers is Hard - Gregorio Malajovich; Klaus Meer (CoRR, 2004)

Probabilistically Checkable Proofs Over the Reals. - Klaus Meer (WoLLIC, 2004)

On a Refined Analysis of Some Problems in Interval Arithmetic Using Real Number Complexity Theory. - Klaus Meer (Reliab. Comput., 2004)

Transparent Long Proofs: A First PCP Theorem for NPR. - Klaus Meer (Found. Comput. Math., 2005)

Optimization and Approximation Problems Related to Polynomial System Solving. - Klaus Meer (CiE, 2006)

Uncomputability Below the Real Halting Problem. - Klaus Meer; Martin Ziegler 001 (CiE, 2006)

Approximation Classes for Real Number Optimization Problems. - Uffe Flarup Hansen; Klaus Meer (UC, 2006)

Two logical hierarchies of optimization problems over the real numbers. - Uffe Flarup Hansen; Klaus Meer (Math. Log. Q., 2006)

Some Aspects of a Complexity Theory for Continuous Time Systems. - Marco Gori; Klaus Meer (CiE, 2007)

Simulated Annealing versus Metropolis for a TSP instance. - Klaus Meer (Inf. Process. Lett., 2007)

Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard. - Gregorio Malajovich; Klaus Meer (Theory Comput. Syst., 2007)

Some Relations between Approximation Problems and PCPs over the Real Numbers. - Klaus Meer (Theory Comput. Syst., 2007)

On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. - Pascal Koiran; Klaus Meer (WG, 2008)

An explicit solution to Post's Problem over the reals. - Klaus Meer; Martin Ziegler 001 (J. Complex., 2008)

On the OBDD size for graphs of bounded tree- and clique-width. - Klaus Meer; Dieter Rautenbach (Discret. Math., 2009)

Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. - Klaus Meer; Martin Ziegler 001 (Found. Comput. Math., 2009)

Tree-width in Algebraic Complexity. - Klaus Meer (Fundam. Informaticae, 2010)

Almost Transparent Short Proofs for NPℝ. - Klaus Meer (FCT, 2011)

On the expressive power of CNF formulas of bounded tree- and clique-width. - Irénée Briquel; Pascal Koiran; Klaus Meer (Discret. Appl. Math., 2011)

On Ladner's result for a class of real machines with restricted use of constants. - Klaus Meer (Inf. Comput., 2012)

Some Initial Thoughts on Bounded Query Computations over the Reals. - Klaus Meer (Int. J. Found. Comput. Sci., 2012)

Testing Low Degree Trigonometric Polynomials. - Martijn Baartse; Klaus Meer (CSR, 2014)

An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents. - Klaus Meer (Theory Comput. Syst., 2014)

Some Results on Interactive Proofs for Real Computations. - Martijn Baartse; Klaus Meer (CiE, 2015)

The PCP Theorem for NP Over the Reals. - Martijn Baartse; Klaus Meer (Found. Comput. Math., 2015)

Generalized finite automata over real and complex numbers. - Klaus Meer; Ameen Naif (Theor. Comput. Sci., 2015)

Real Interactive Proofs for VPSPACE. - Martijn Baartse; Klaus Meer (MFCS, 2016)

An algebraic proof of the real number PCP theorem. - Martijn Baartse; Klaus Meer (J. Complex., 2017)

Automata over Infinite Sequences of Reals. - Klaus Meer; Ameen Naif (LATA, 2019)

Interactive proofs and a Shamir-like result for real number computations. - Martijn Baartse; Klaus Meer (Comput. Complex., 2019)

Periodic generalized automata over the reals. - Klaus Meer; Ameen Naif (Inf. Comput., 2019)

A PCP of Proximity for Real Algebraic Polynomials. - Klaus Meer (CSR, 2021)

Software Testing in Computable Analysis. - Klaus Meer; Martin Ziegler 001 (UCNC, 2024)

Some Structural Complexity Results for $ exists { mathbb {R}}$. - Klaus Meer; Adrian Wurm (CiE, 2025)

Some structural complexity results for ∃ℝ. - Klaus Meer; Adrian Wurm (CoRR, 2025)