| 2008 |
|---|
| 27 | EE | Matthias Schröder:
On the Relationship between Filter Spaces and Weak Limit Spaces.
Electr. Notes Theor. Comput. Sci. 202: 267-277 (2008) |
| 26 | EE | Matthias Schröder:
An Effective Tietze-Urysohn Theorem for QCB-Spaces: (Extended Abstract).
Electr. Notes Theor. Comput. Sci. 221: 231-242 (2008) |
| 25 | | Vasco Brattka,
Hajime Ishihara,
Matthias Schröder,
Ning Zhong:
Computability and Complexity in Analysis.
J. UCS 14(6): 800 (2008) |
| 24 | | Matthias Schröder:
On the Relationship between Filter Spaces and Weak Limit Spaces.
J. UCS 14(6): 996-1015 (2008) |
| 23 | EE | Vasco Brattka,
Hajime Ishihara,
Matthias Schröder,
Ning Zhong:
Editorial: Math. Log. Quart. 5/2008.
Math. Log. Q. 54(5): 453 (2008) |
| 2007 |
|---|
| 22 | EE | Matthias Schröder:
Admissible Representations of Probability Measures.
Electr. Notes Theor. Comput. Sci. 167: 61-78 (2007) |
| 21 | EE | Ingo Battenfeld,
Matthias Schröder,
Alex Simpson:
A Convenient Category of Domains.
Electr. Notes Theor. Comput. Sci. 172: 69-99 (2007) |
| 20 | EE | Tanja Grubba,
Matthias Schröder,
Klaus Weihrauch:
Computable metrization.
Math. Log. Q. 53(4-5): 381-395 (2007) |
| 19 | EE | Matthias Schröder:
Admissible representations for probability measures.
Math. Log. Q. 53(4-5): 431-445 (2007) |
| 18 | EE | Matthias Schröder,
Alex Simpson:
Two preservation results for countable products of sequential spaces.
Mathematical Structures in Computer Science 17(1): 161-172 (2007) |
| 2006 |
|---|
| 17 | EE | Matthias Schröder:
Admissible Representations in Computable Analysis.
CiE 2006: 471-480 |
| 16 | EE | Ingo Battenfeld,
Matthias Schröder,
Alex Simpson:
A convenient category of domains.
Computational Structures for Modelling Space, Time and Causality 2006 |
| 15 | EE | Matthias Schröder,
Alex Simpson:
Probabilistic Observations and Valuations: (Extended Abstract).
Electr. Notes Theor. Comput. Sci. 155: 605-615 (2006) |
| 14 | EE | Matthias Schröder,
Alex Simpson:
Representing probability measures using probabilistic processes.
J. Complexity 22(6): 768-782 (2006) |
| 13 | EE | Ingo Battenfeld,
Matthias Schröder,
Alex Simpson:
Compactly generated domain theory.
Mathematical Structures in Computer Science 16(2): 141-161 (2006) |
| 2005 |
|---|
| 12 | | Matthias Schröder,
Alex K. Simpson:
Representing Probability Measures using Probabilistic Processes.
CCA 2005: 211-226 |
| 11 | EE | Vasco Brattka,
Matthias Schröder:
Computing with Sequences, Weak Topologies and the Axiom of Choice.
CSL 2005: 462-476 |
| 10 | EE | Daren Kunkle,
Matthias Schröder:
Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory.
Electr. Notes Theor. Comput. Sci. 120: 111-123 (2005) |
| 2004 |
|---|
| 9 | EE | Matthias Schröder:
Spaces allowing Type-2 Complexity Theory revisited.
Math. Log. Q. 50(4-5): 443-459 (2004) |
| 2002 |
|---|
| 8 | EE | Matthias Schröder:
A Natural Weak Limit Space with Admissible Representation which is not a Limit Space.
Electr. Notes Theor. Comput. Sci. 66(1): (2002) |
| 7 | EE | Vasco Brattka,
Matthias Schröder,
Klaus Weihrauch:
Preface.
Electr. Notes Theor. Comput. Sci. 66(1): (2002) |
| 6 | EE | Matthias Schröder:
Effectivity in Spaces with Admissible Multirepresentations.
Math. Log. Q. 48(S1): 78-90 (2002) |
| 5 | EE | Matthias Schröder:
Extended admissibility.
Theor. Comput. Sci. 284(2): 519-538 (2002) |
| 2000 |
|---|
| 4 | EE | Matthias Schröder:
Admissible Representations of Limit Spaces.
CCA 2000: 273-295 |
| 1999 |
|---|
| 3 | EE | Matthias Schröder:
Online Computations of Differentiable Functions.
Theor. Comput. Sci. 219(1-2): 331-345 (1999) |
| 1997 |
|---|
| 2 | | Matthias Schröder:
Fast Online Multiplication of Real Numbers.
STACS 1997: 81-92 |
| 1996 |
|---|
| 1 | EE | Matthias Schröder:
Fast Online Real Multiplication.
CCA 1996 |
