The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Klaus Meer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Erich Grädel, Klaus Meer
    Descriptive complexity theory over the real numbers. [Citation Graph (1, 0)][DBLP]
    STOC, 1995, pp:315-324 [Conf]
  2. Klaus Meer
    On diagonal sets in uncountable structures. [Citation Graph (0, 0)][DBLP]
    CCA, 1996, pp:- [Conf]
  3. Klaus Meer
    On Some Relations Between Approximation Problems and PCPs over the Real Numbers. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:322-331 [Conf]
  4. Klaus Meer
    Optimization and Approximation Problems Related to Polynomial System Solving. [Citation Graph (0, 0)][DBLP]
    CiE, 2006, pp:360-367 [Conf]
  5. Klaus Meer, Martin Ziegler
    Uncomputability Below the Real Halting Problem. [Citation Graph (0, 0)][DBLP]
    CiE, 2006, pp:368-377 [Conf]
  6. Johann A. Makowsky, Klaus Meer
    On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:399-410 [Conf]
  7. Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
    04061 Summary - Real Computation and Complexity. [Citation Graph (0, 0)][DBLP]
    Real Computation and Complexity, 2004, pp:- [Conf]
  8. Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
    04061 Abstracts Collection - Real Computation and Complexity. [Citation Graph (0, 0)][DBLP]
    Real Computation and Complexity, 2004, pp:- [Conf]
  9. Klaus Meer, Gregorio Malajovich
    On the Complexity of Computing Multi-Homogeneous Bézout Numbers. [Citation Graph (0, 0)][DBLP]
    Algorithms and Complexity for Continuous Problems, 2004, pp:- [Conf]
  10. Felipe Cucker, Klaus Meer
    Logics Which Capture Complexity Classes over the Reals. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:157-167 [Conf]
  11. Klaus Meer, Martin Ziegler
    An Explicit Solution to Post's Problem over the Reals. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:467-478 [Conf]
  12. Klaus Meer
    On Consistency and Width Notions for Constraint Programs with Algebraic Constraints. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2002, pp:88-102 [Conf]
  13. Klaus Meer
    Transparent Long Proofs: A First PCP Theorem for NPR. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:959-970 [Conf]
  14. Klaus Meer, Dieter Rautenbach
    On the OBDD Size for Graphs of Bounded Tree- and Clique-Width. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:72-83 [Conf]
  15. Uffe Flarup Hansen, Klaus Meer
    Two Logical Hierarchies of Optimization Problems over the Real Numbers. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:459-470 [Conf]
  16. Klaus Meer
    On the Complexity of Some Problems in Interval Arithmetic. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:582-591 [Conf]
  17. Klaus Meer
    Counting Problems over the Reals. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:398-407 [Conf]
  18. Klaus Meer
    Query Languages for Real Number Databases Based on Descriptive Complexity over R. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:12-22 [Conf]
  19. Klaus Meer
    On the Approximation of Interval Functions. [Citation Graph (0, 0)][DBLP]
    PARA, 2004, pp:169-178 [Conf]
  20. Gregorio Malajovich, Klaus Meer
    Computing Minimal Multi-homogeneous Bézout Numbers Is Hard. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:244-255 [Conf]
  21. Uffe Flarup Hansen, Klaus Meer
    Approximation Classes for Real Number Optimization Problems. [Citation Graph (0, 0)][DBLP]
    UC, 2006, pp:86-100 [Conf]
  22. Gregorio Malajovich, Klaus Meer
    Computing Multi-Homogeneous Bezout Numbers is Hard [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  23. Klaus Meer
    Probabilistically Checkable Proofs Over the Reals. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:123, n:, pp:165-177 [Journal]
  24. Klaus Meer
    Transparent Long Proofs: A First PCP Theorem for NPR. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2005, v:5, n:3, pp:231-255 [Journal]
  25. Martín Matamala, Klaus Meer
    On the computational structure of the connected components of a hard problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:3-4, pp:83-90 [Journal]
  26. Shai Ben-David, Klaus Meer, Christian Michaux
    A Note on Non-complete Problems in NPImage. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:1, pp:324-332 [Journal]
  27. Thomas Lickteig, Klaus Meer
    A Note on Testing the Resultant. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1995, v:11, n:3, pp:344-351 [Journal]
  28. Thomas Lickteig, Klaus Meer
    Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:1, pp:83-107 [Journal]
  29. Klaus Meer
    Computations over Z and R: A comparison. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1990, v:6, n:3, pp:256-263 [Journal]
  30. Klaus Meer
    A note on a P NP result for a restricted class of real machines. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1992, v:8, n:4, pp:451-453 [Journal]
  31. Klaus Meer
    Real Number Models under Various Sets of Operations. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1993, v:9, n:3, pp:366-372 [Journal]
  32. Klaus Meer
    Real Number Computations: On the Use of Information. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1994, v:18, n:3, pp:199-206 [Journal]
  33. Felipe Cucker, Klaus Meer
    Logics Which Capture Complexity Classes Over The Reals. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:1, pp:363-390 [Journal]
  34. Marco Gori, Klaus Meer
    A Step towards a Complexity Theory for Analog Systems. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2002, v:48, n:S1, pp:45-58 [Journal]
  35. Klaus Meer
    On the Relations Between Discrete and Continuous Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1995, v:41, n:, pp:281-286 [Journal]
  36. Uffe Flarup Hansen, Klaus Meer
    Two logical hierarchies of optimization problems over the real numbers. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2006, v:52, n:1, pp:37-50 [Journal]
  37. Klaus Meer
    On a Refined Analysis of Some Problems in Interval Arithmetic Using Real Number Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Reliable Computing, 2004, v:10, n:3, pp:209-225 [Journal]
  38. Gregorio Malajovich, Klaus Meer
    On the Structure of NP_C. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:27-35 [Journal]
  39. Klaus Meer
    Counting problems over the reals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:242, n:1-2, pp:41-58 [Journal]
  40. Klaus Meer
    On the Complexity of Quadratic Programming in Real Number Models of Computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:85-84 [Journal]
  41. Klaus Meer, Gerhard-Wilhelm Weber
    Some aspects of studying an optimization or decision problem in different computational models. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:143, n:2, pp:406-418 [Journal]
  42. Marco Gori, Klaus Meer
    Some Aspects of a Complexity Theory for Continuous Time Systems. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:554-565 [Conf]
  43. Klaus Meer, Martin Ziegler
    Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:726-737 [Conf]
  44. Klaus Meer, Martin Ziegler
    An Explicit Solution to Post's Problem over the Reals [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  45. Martin Ziegler, Klaus Meer
    Real Computational Universality: The Word Problem for a class of groups with infinite presentation [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  46. Klaus Meer
    Simulated Annealing versus Metropolis for a TSP instance. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:6, pp:216-219 [Journal]
  47. Gregorio Malajovich, Klaus Meer
    Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:4, pp:553-570 [Journal]
  48. Klaus Meer
    Some Relations between Approximation Problems and PCPs over the Real Numbers. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:41, n:1, pp:107-118 [Journal]

  49. On Ladner's Result for a Class of Real Machines with Restricted Use of Constants. [Citation Graph (, )][DBLP]


  50. Real Computational Universality: The Word Problem for a class of groups with infinite presentation. [Citation Graph (, )][DBLP]


  51. On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. [Citation Graph (, )][DBLP]


  52. On the OBDD size for graphs of bounded tree- and clique-width. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.304secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002