Fast Online Real Multiplication. - Matthias Schröder 001 (CCA, 1996)

Fast Online Multiplication of Real Numbers. - Matthias Schröder 001 (STACS, 1997)

Online Computations of Differentiable Functions. - Matthias Schröder 001 (Theor. Comput. Sci., 1999)

Admissible Representations of Limit Spaces. - Matthias Schröder 001 (CCA, 2000)

Preface. - Vasco Brattka; Matthias Schröder 001; Klaus Weihrauch (CCA, 2002)

A Natural Weak Limit Space with Admissible Representation which is not a Limit Space. - Matthias Schröder 001 (CCA, 2002)

Effectivity in Spaces with Admissible Multirepresentations. - Matthias Schröder 001 (Math. Log. Q., 2002)

Extended admissibility. - Matthias Schröder 001 (Theor. Comput. Sci., 2002)

Admissible representations for continuous computations. - Matthias Schröder 001 (2003)

Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory. - Daren Kunkle; Matthias Schröder 001 (CCA, 2004)

Spaces allowing Type-2 Complexity Theory revisited. - Matthias Schröder 001 (Math. Log. Q., 2004)

Computing with Sequences, Weak Topologies and the Axiom of Choice. - Vasco Brattka; Matthias Schröder 001 (CSL, 2005)

Probabilistic Observations and Valuations: (Extended Abstract). - Matthias Schröder 001; Alex Simpson (MFPS, 2005)

Admissible Representations in Computable Analysis. - Matthias Schröder 001 (CiE, 2006)

Admissible Representations of Probability Measures. - Matthias Schröder 001 (CCA, 2006)

Representing probability measures using probabilistic processes. - Matthias Schröder 001; Alex Simpson (J. Complex., 2006)

Compactly generated domain theory. - Ingo Battenfeld; Matthias Schröder 001; Alex Simpson (Math. Struct. Comput. Sci., 2006)

A Convenient Category of Domains. - Ingo Battenfeld; Matthias Schröder 001; Alex Simpson (Computation, Meaning, and Logic, 2007)

Computable metrization. - Tanja Grubba; Matthias Schröder 001; Klaus Weihrauch (Math. Log. Q., 2007)

Two preservation results for countable products of sequential spaces. - Matthias Schröder 001; Alex Simpson (Math. Struct. Comput. Sci., 2007)

An Effective Tietze-Urysohn Theorem for QCB-Spaces: (Extended Abstract). - Matthias Schröder 001 (CCA, 2008)

Computability and Complexity in Analysis. - Vasco Brattka; Hajime Ishihara; Matthias Schröder 001; Ning Zhong 002 (J. Univers. Comput. Sci., 2008)

On the Relationship between Filter Spaces and Weak Limit Spaces. - Matthias Schröder 001 (J. Univers. Comput. Sci., 2008)

Editorial: Math. Log. Quart. 5/2008. - Vasco Brattka; Hajime Ishihara; Matthias Schröder 001; Ning Zhong 002 (Math. Log. Q., 2008)

A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces (Extended Abstract). - Matthias Schröder 001 (CCA, 2009)

An Effective Tietze-Urysohn Theorem for QCB-Spaces. - Matthias Schröder 001 (J. Univers. Comput. Sci., 2009)

The sequential topology on ℕℕℕ is not regular. - Matthias Schröder 001 (Math. Struct. Comput. Sci., 2009)

ℕℕℕ does not satisfy Normann's condition - Matthias Schröder 001 (CoRR, 2010)

A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces. - Matthias Schröder 001 (J. Univers. Comput. Sci., 2010)

Observationally-induced Effect Monads: Upper and Lower Powerspace Constructions. - Ingo Battenfeld; Matthias Schröder 001 (MFPS, 2011)

Base-Complexity Classifications of QCB0-Spaces. - Matthew de Brecht; Matthias Schröder 001; Victor L. Selivanov (CiE, 2015)

Average-Case Bit-Complexity Theory of Real Functions. - Matthias Schröder 001; Florian Steinberg 001; Martin Ziegler 001 (MACIS, 2015)

Hyperprojective hierarchy of qcb0-spaces. - Matthias Schröder 001; Victor L. Selivanov (Comput., 2015)

Observationally-induced lower and upper powerspace constructions. - Ingo Battenfeld; Matthias Schröder 001 (J. Log. Algebraic Methods Program., 2015)

Some hierarchies of QCB 0-spaces. - Matthias Schröder 001; Victor L. Selivanov (Math. Struct. Comput. Sci., 2015)

Base-complexity classifications of qcb0-spaces1. - Matthew de Brecht; Matthias Schröder 001; Victor L. Selivanov (Comput., 2016)

Bounded time computation on metric spaces and Banach spaces. - Matthias Schröder 001; Florian Steinberg 001 (LICS, 2017)

Addendum to: "The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma" [Ann. Pure Appl. Logic 163 (6) (2012) 623-655]. - Vasco Brattka; Andrea Cettolo; Guido Gherardi; Alberto Marcone; Matthias Schröder 001 (Ann. Pure Appl. Log., 2017)

Selection of equipment modules for a flexible modular production plant by a multi-objective evolutionary algorithm. - Heiko Radatz; Matthias Schröder 001; Christian Becker 011; Christian Bramsiepe; Gerhard Schembecker (Comput. Chem. Eng., 2019)

Randomized Computation of Continuous Data: Is Brownian Motion Computable? - Willem L. Fouché; Hyunwoo Lee; Donghyun Lim; Sewon Park 001; Matthias Schröder 001; Martin Ziegler 001 (CoRR, 2019)

Overt choice. - Matthew de Brecht; Arno Pauly; Matthias Schröder 001 (Comput., 2020)

Admissibly Represented Spaces and Qcb-Spaces. - Matthias Schröder 001 (CoRR, 2020)