Klaus Meer

563 total citations
37 papers, 243 citations indexed

About

Klaus Meer is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Klaus Meer has authored 37 papers receiving a total of 243 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Computational Theory and Mathematics, 13 papers in Artificial Intelligence and 4 papers in Geometry and Topology. Recurrent topics in Klaus Meer's work include Computability, Logic, AI Algorithms (18 papers), Complexity and Algorithms in Graphs (16 papers) and semigroups and automata theory (11 papers). Klaus Meer is often cited by papers focused on Computability, Logic, AI Algorithms (18 papers), Complexity and Algorithms in Graphs (16 papers) and semigroups and automata theory (11 papers). Klaus Meer collaborates with scholars based in Germany, Denmark and Israel. Klaus Meer's co-authors include Christian Michaux, Erich Grädel, Martin Ziegler, H. A. Schreiber, Felipe Cucker, Dieter Rautenbach, Marco Gori, Erzsébet Csuhaj-Varjú, Gerhard‐Wilhelm Weber and Pascal Koiran and has published in prestigious journals such as European Journal of Operational Research, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Klaus Meer

30 papers receiving 210 citations

Peers

Klaus Meer

CTM

AI

IME

CSE

GT

Bertrand Guenin Canada

Zsolt Tuza Hungary

Joachim Kneis Germany

Dariusz Dereniowski Poland

Frank Vavak United Kingdom

Amr Elmasry Egypt

Kyle Fox United States

Daniel Geist Israel

Toshinobu Kashiwabara Japan

Xuhong Gao China

Bertrand Guenin Canada

Klaus Meer

127 ×0.7

CTM

29 ×0.3

AI

18 ×0.7

IME

10 ×0.5

CSE

15 ×0.8

GT

Citations per year, relative to Klaus Meer Klaus Meer (= 1×) peers Bertrand Guenin

Countries citing papers authored by Klaus Meer

Since Specialization

Citations

This map shows the geographic impact of Klaus Meer's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Klaus Meer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Klaus Meer more than expected).

Fields of papers citing papers by Klaus Meer

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Klaus Meer. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Klaus Meer. The network helps show where Klaus Meer may publish in the future.

Co-authorship network of co-authors of Klaus Meer

This figure shows the co-authorship network connecting the top 25 collaborators of Klaus Meer. A scholar is included among the top collaborators of Klaus Meer based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Klaus Meer. Klaus Meer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Meer, Klaus, et al.. (2016). An algebraic proof of the real number PCP theorem. Journal of Complexity. 40. 34–77.

2.

Meer, Klaus, et al.. (2015). Generalized finite automata over real and complex numbers. Theoretical Computer Science. 591. 85–98. 1 indexed citations

3.

Csuhaj-Varjú, Erzsébet, et al.. (2014). Language, Life, Limits. Lecture notes in computer science. 6 indexed citations

4.

Koiran, Pascal, et al.. (2010). On the expressive power of CNF formulas of bounded tree- and clique-width. Discrete Applied Mathematics. 159(1). 1–14. 4 indexed citations

5.

Meer, Klaus & Dieter Rautenbach. (2008). On the OBDD size for graphs of bounded tree- and clique-width. Discrete Mathematics. 309(4). 843–851. 7 indexed citations

6.

Meer, Klaus & Martin Ziegler. (2007). An explicit solution to Post's Problem over the reals. Journal of Complexity. 24(1). 3–15. 10 indexed citations

7.

Meer, Klaus, et al.. (2007). Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard. Theory of Computing Systems. 40(4). 553–570. 7 indexed citations

8.

Meer, Klaus, et al.. (2004). On the Complexity of Computing Multi-Homogeneous Bézout Numbers.. Dagstuhl Seminar Proceedings. 0. 1 indexed citations

9.

Schreiber, H. A., et al.. (2002). Dimensional synthesis of planar Stephenson mechanisms for motion generation using circlepoint search and homotopy methods. Mechanism and Machine Theory. 37(7). 717–737. 15 indexed citations

10.

Meer, Klaus & Gerhard‐Wilhelm Weber. (2002). Some aspects of studying an optimization or decision problem in different computational models. European Journal of Operational Research. 143(2). 406–418. 3 indexed citations

11.

Ben-David, Shalev, Klaus Meer, & Christian Michaux. (2000). A Note on Non-complete Problems in NPR. Journal of Complexity. 16(1). 324–332. 3 indexed citations

12.

Meer, Klaus. (2000). Counting problems over the reals. Theoretical Computer Science. 242(1-2). 41–58. 16 indexed citations

13.

Cucker, Felipe & Klaus Meer. (1999). Logics which capture complexity classes over the reals. Journal of Symbolic Logic. 64(1). 363–390. 8 indexed citations

14.

Meer, Klaus, et al.. (1998). On the Structure of $\cal NP_\Bbb C$. SIAM Journal on Computing. 28(1). 27–35. 5 indexed citations

15.

Meer, Klaus, et al.. (1997). Semi-algebraic Complexity—Additive Complexity of Matrix Computational Tasks. Journal of Complexity. 13(1). 83–107. 1 indexed citations

16.

Meer, Klaus, et al.. (1995). A Note on Testing the Resultant. Journal of Complexity. 11(3). 344–351. 3 indexed citations

17.

Grädel, Erich & Klaus Meer. (1995). Descriptive complexity theory over the real numbers. 315–324. 20 indexed citations

18.

Meer, Klaus. (1993). Real Number Models under Various Sets of Operations. Journal of Complexity. 9(3). 366–372. 14 indexed citations

19.

Meer, Klaus. (1992). A note on a P ≠ NP result for a restricted class of real machines. Journal of Complexity. 8(4). 451–453. 19 indexed citations

20.

Meer, Klaus. (1990). Computations over Z and R: A comparison. Journal of Complexity. 6(3). 256–263. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact