Klaus Weihrauch

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Hong Lu 0011

> Home > Persons > Klaus Weihrauch

Publications

2008
[j37]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jucs/LuW08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jucs/LuW08
Hong Lu, Klaus Weihrauch:
Computable Riesz Representation for Locally Compact Hausdorff Spaces. J. Univers. Comput. Sci. 14(6): 845-860 (2008)
2007
[j33]
- view
  authority control:
- export record
  dblp key:
  - journals/mlq/LuW07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mlq/LuW07
Hong Lu, Klaus Weihrauch:
Computable Riesz representation for the dual of C [0; 1]. Math. Log. Q. 53(4-5): 415-430 (2007)
[c50]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/entcs/LuW08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/LuW08
Hong Lu, Klaus Weihrauch:
Computable Riesz Representation for Locally Compact Hausdorff Spaces. CCA 2007: 3-12
2006
[c44]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/entcs/LuW07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/LuW07
Hong Lu, Klaus Weihrauch:
Computable Riesz Representation for the Dual of C. CCA 2006: 157-177

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.