The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. G. Rose, Klaus Weihrauch
    A characterization of the classes L1 and R1 of primitive recursive wordfunctions. [Citation Graph (0, 0)][DBLP]
    Automatentheorie und Formale Sprachen, 1973, pp:263-266 [Conf]
  2. Klaus Weihrauch
    A Foundation for Computable Analysis. [Citation Graph (0, 0)][DBLP]
    Foundations of Computer Science: Potential - Theory - Cognition, 1997, pp:185-199 [Conf]
  3. Tanja Grubba, Klaus Weihrauch
    A Computable Version of Dini's Theorem for Topological Spaces. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:117-129 [Conf]
  4. Klaus Weihrauch
    On Computable Metric Spaces Tietze-Urysohn Extension Is Computable. [Citation Graph (0, 0)][DBLP]
    CCA, 2000, pp:357-368 [Conf]
  5. Klaus Weihrauch
    Multi-Functions on Multi-Represented Sets are Closed under Flowchart Programming. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:267-300 [Conf]
  6. Klaus Weihrauch
    Computability on the probability measures on the Borel sets of the unit interval. [Citation Graph (0, 0)][DBLP]
    CCA, 1996, pp:- [Conf]
  7. Klaus Weihrauch, Ning Zhong 0002
    Is the Linear Schrödinger Propagator Turing Computable? [Citation Graph (0, 0)][DBLP]
    CCA, 2000, pp:369-377 [Conf]
  8. Klaus Weihrauch, Xizhong Zheng
    Computability on Continuous, Lower Semi-Continuous and Upper Semi-Continuous Real Functions. [Citation Graph (0, 0)][DBLP]
    CCA, 1996, pp:- [Conf]
  9. Peter Hertling, Klaus Weihrauch
    Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:237-242 [Conf]
  10. Klaus Weihrauch
    Computable Analysis. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:530-531 [Conf]
  11. Ker-I Ko, Klaus Weihrauch
    On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:150-159 [Conf]
  12. Vasco Brattka, Klaus Weihrauch, Xizhong Zheng
    Approaches to Effective Semi-continuity of Real Functions. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:184-193 [Conf]
  13. Klaus Weihrauch, Ning Zhong 0002
    Turing Computability of a Nonlinear Schrödinger Propagator. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:596-600 [Conf]
  14. Klaus Weihrauch, Xizhong Zheng
    Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:166-175 [Conf]
  15. Klaus Weihrauch
    A Simple and Powerful Approach for Studying Constructivity, Computability, and Complexity. [Citation Graph (0, 0)][DBLP]
    Constructivity in Computer Science, 1991, pp:228-246 [Conf]
  16. Klaus Weihrauch, Xizhong Zheng
    Effectiveness of the Global Modulus of Continuity on Metric Spaces. [Citation Graph (0, 0)][DBLP]
    Category Theory and Computer Science, 1997, pp:210-219 [Conf]
  17. Klaus Weihrauch
    A Genralized Computability Thesis. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:538-542 [Conf]
  18. Klaus Weihrauch
    Constructivity, Computability, and Computational Complexity in Analysis. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:480-493 [Conf]
  19. Friedrich W. von Henke, Klaus Indermark, Klaus Weihrauch
    Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:549-561 [Conf]
  20. Peter Hertling, Klaus Weihrauch
    Randomness Spaces. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:796-807 [Conf]
  21. Klaus Weihrauch
    The Compuational Complexity of Program Schemata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1974, pp:326-334 [Conf]
  22. Klaus Weihrauch
    Computability on the Probability Measures on the Borel Sets of the Unit Interval. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:166-176 [Conf]
  23. Klaus Weihrauch, Ning Zhong 0002
    The Wave Propagator Is Turing Computable. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:697-707 [Conf]
  24. Tanja Grubba, Klaus Weihrauch
    A Computable Version of Dini's Theorem for Topological Spaces. [Citation Graph (0, 0)][DBLP]
    ISCIS, 2005, pp:927-936 [Conf]
  25. Vasco Brattka, Klaus Weihrauch
    Recursive and Recursively Enumerable Closed Subsets of Euclidean Space. [Citation Graph (0, 0)][DBLP]
    MCU (2), 1998, pp:215-234 [Conf]
  26. Klaus Weihrauch
    A Generalized Computability Thesis (Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:570- [Conf]
  27. Klaus Weihrauch, Gisela Schäfer
    Admissible Representations of Effective CPO's. [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:544-553 [Conf]
  28. Klaus Weihrauch, Xizhong Zheng
    A Finite Hierarchy of the Recursively Enumerable Real Numbers. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:798-806 [Conf]
  29. Rutger Verbeek, Klaus Weihrauch
    The Influence of the Data Presentation on the Computational POwer of Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:551-558 [Conf]
  30. Xizhong Zheng, Klaus Weihrauch
    The Arithmetical Hierarchy of Real Numbers. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:23-33 [Conf]
  31. Klaus Weihrauch
    A Foundation for Computable Analysis. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1997, pp:104-121 [Conf]
  32. Robert Rettinger, Klaus Weihrauch
    The computational complexity of some julia sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:177-185 [Conf]
  33. Klaus Weihrauch, Ning Zhong 0002
    Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable? [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:783-792 [Conf]
  34. Christoph Kreitz, Klaus Weihrauch
    Complexity theory on real numbers and functions. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:165-174 [Conf]
  35. Klaus Weihrauch
    Recursion and Complexity Theory on CPO-S. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:195-202 [Conf]
  36. Klaus Weihrauch
    A Foundation of Computable Analysis. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1995, v:57, n:, pp:- [Journal]
  37. Klaus Weihrauch
    Computational Complexity on Computable Metric Spaces [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:014, pp:- [Journal]
  38. Angelika Reiser, Klaus Weihrauch
    Natural Numberings and Generalized Computability. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1980, v:16, n:1-3, pp:11-20 [Journal]
  39. Vasco Brattka, Matthias Schröder, Klaus Weihrauch
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:1, pp:- [Journal]
  40. Vasco Brattka, Ludwig Staiger, Klaus Weihrauch
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:120, n:, pp:1-0 [Journal]
  41. Yongcheng Wu, Klaus Weihrauch
    A Computable Version of the Daniell-Stone Theorem on Integration and Linear Functionals. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:120, n:, pp:217-230 [Journal]
  42. Robert Rettinger, Klaus Weihrauch
    The Computational Complexity of Some Julia Sets. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:1, pp:- [Journal]
  43. Klaus Weihrauch, Ning Zhong 0002
    The Solution Operator of the Korteweg-de Vries Equation is Computable. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:1, pp:- [Journal]
  44. Klaus Weihrauch, Ning Zhong 0002
    An Algorithm for Computing Fundamental Solutions. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:120, n:, pp:201-215 [Journal]
  45. Tanja Grubba, Klaus Weihrauch
    On Computable Metrization. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:167, n:, pp:345-364 [Journal]
  46. Hong Lu, Klaus Weihrauch
    Computable Riesz Representation for the Dual of C. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:167, n:, pp:157-177 [Journal]
  47. Douglas Cenzer, Ruth Dillhage, Tanja Grubba, Klaus Weihrauch
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:167, n:, pp:1-2 [Journal]
  48. Klaus Weihrauch, Ning Zhong 0002
    Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:167, n:, pp:33-59 [Journal]
  49. Peter Hertling, Klaus Weihrauch
    Random elements in effective topological spaces with measure. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:181, n:1, pp:32-56 [Journal]
  50. Klaus Weihrauch
    Program Schemata with Polynomial Bounded Counters. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:3, n:3, pp:91-96 [Journal]
  51. Ning Zhong 0002, Klaus Weihrauch
    Computatbility theory of generalized functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:4, pp:469-505 [Journal]
  52. Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng
    Weakly Computable Real Numbers. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:4, pp:676-690 [Journal]
  53. Klaus Weihrauch
    On the complexity of online computations of real functions. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1991, v:7, n:4, pp:380-394 [Journal]
  54. Klaus Weihrauch
    A Refined Model of Computation for Continuous Problems. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1998, v:14, n:1, pp:102-121 [Journal]
  55. Klaus Weihrauch, Ning Zhong 0002
    Computing Schrödinger propagators on Type-2 Turing machines. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2006, v:22, n:6, pp:918-935 [Journal]
  56. Klaus Weihrauch
    The Computational Complexity of Program Schemata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:12, n:1, pp:80-107 [Journal]
  57. Vasco Brattka, Xizhong Zheng, Klaus Weihrauch
    Approaches to Effective Semi-Continuity of Real Functions. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1999, v:45, n:, pp:481-496 [Journal]
  58. Klaus Weihrauch
    Computational complexity on computable metric spaces. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2003, v:49, n:1, pp:3-21 [Journal]
  59. Xizhong Zheng, Klaus Weihrauch
    The Arithmetical Hierarchy of Real Numbers. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:1, pp:51-65 [Journal]
  60. Klaus Weihrauch, Ning Zhong 0002
    An Algorithm for Computing Fundamental Solutions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:6, pp:1283-1294 [Journal]
  61. Vasco Brattka, Klaus Weihrauch
    Computability on Subsets of Euclidean Space I: Closed and Compact Subsets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:219, n:1-2, pp:65-93 [Journal]
  62. Ker-I Ko, Anil Nerode, Klaus Weihrauch
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:197- [Journal]
  63. Christoph Kreitz, Klaus Weihrauch
    Theory of Representations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:35-53 [Journal]
  64. Yongcheng Wu, Klaus Weihrauch
    A computable version of the Daniell-Stone theorem on integration and linear functionals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:28-42 [Journal]
  65. Rutger Verbeek, Klaus Weihrauch
    Data Representation and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1978, v:7, n:, pp:99-116 [Journal]
  66. Klaus Weihrauch
    Type 2 Recursion Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:17-33 [Journal]
  67. Klaus Weihrauch
    Computability on Computable Metric Spaces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:113, n:1, pp:191-210 [Journal]
  68. Klaus Weihrauch
    Computability on the Probability Measureson the Borel Sets of the Unit Interval. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:219, n:1-2, pp:421-437 [Journal]
  69. Klaus Weihrauch, Christoph Kreitz
    Type 2 Computational Complexity of Functions on Cantor's Space. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:82, n:1, pp:1-18 [Journal]
  70. Klaus Weihrauch, Ulrich Schreiber
    Embedding Metric Spaces Into CPO's. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:5-24 [Journal]
  71. Klaus Weihrauch, Gisela Schäfer
    Admissible Representations of Effective CPO's. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:131-147 [Journal]
  72. Klaus Weihrauch, Xizhong Zheng
    Computability on continuous, lower semi-continuous and upper semi-continuous real functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:109-133 [Journal]
  73. Klaus Weihrauch, Ning Zhong 0002
    Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:337-366 [Journal]
  74. Klaus Weihrauch, Xizhong Zheng
    Effectiveness of the Global Modulus of Continuity on Metric Spaces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:219, n:1-2, pp:439-450 [Journal]
  75. Decheng Ding, Klaus Weihrauch, Yongcheng Wu
    Absolutely Non-effective Predicates and Functions in Computable Analysis. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:595-604 [Conf]

  76. Computable Separation in Topology, from T_0 to T_3. [Citation Graph (, )][DBLP]


  77. On primitive recursive wordfunctions. [Citation Graph (, )][DBLP]


  78. Computable Riesz Representation for Locally Compact Hausdorff Spaces. [Citation Graph (, )][DBLP]


  79. Effectivity on Continuous Functions in Topological Spaces. [Citation Graph (, )][DBLP]


  80. Preface. [Citation Graph (, )][DBLP]


  81. Connectivity Properties of Dimension Level Sets. [Citation Graph (, )][DBLP]


  82. Complexity of Blowup Problems: Extended Abstract. [Citation Graph (, )][DBLP]


Search in 0.830secs, Finished in 0.833secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002