Matthias Schröder

52 papers A* 1A 1B 3C 14Journal 29Unranked 3

Year	Rank	Type	Title / Venue / Authors
2020	J	`jnl`	Admissibly Represented Spaces and Qcb-Spaces. CoRR Matthias Schröder
2020	J	`jnl`	Overt choice. Comput. Matthew de Brecht, Arno Pauly, Matthias Schröder
2019	J	`jnl`	Overt choice. CoRR Matthew de Brecht, Arno Pauly, Matthias Schröder
2019	J	`jnl`	Randomized Computation of Continuous Data: Is Brownian Motion Computable? CoRR Willem L. Fouché, Hyunwoo Lee, Donghyun Lim, Sewon Park, Matthias Schröder, Martin Ziegler
2019	J	`jnl`	Selection of equipment modules for a flexible modular production plant by a multi-objective evolutionary algorithm. Comput. Chem. Eng. Heiko Radatz, Matthias Schröder, Christian Becker, Christian Bramsiepe, Gerhard Schembecker
2017	J	`jnl`	Addendum to: "The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma" [Ann. Pure Appl. Logic 163 (6) (2012) 623-655]. Ann. Pure Appl. Log. Vasco Brattka, Andrea Cettolo, Guido Gherardi, Alberto Marcone, Matthias Schröder
2017	A*	`conf`	Bounded time computation on metric spaces and Banach spaces. LICS Matthias Schröder, Florian Steinberg
2017	J	`jnl`	Bounded time computation on metric spaces and Banach spaces. CoRR Matthias Schröder, Florian Steinberg
2016	J	`jnl`	Base-complexity classifications of qcb0-spaces1. Comput. Matthew de Brecht, Matthias Schröder, Victor L. Selivanov
2015	—	`conf`	Average-Case Bit-Complexity Theory of Real Functions. MACIS Matthias Schröder, Florian Steinberg, Martin Ziegler
2015	C	`conf`	Base-Complexity Classifications of QCB CiE Matthew de Brecht, Matthias Schröder, Victor L. Selivanov
2015	J	`jnl`	Hyperprojective hierarchy of qcb Comput. Matthias Schröder, Victor L. Selivanov
2015	J	`jnl`	Observationally-induced lower and upper powerspace constructions. J. Log. Algebraic Methods Program. Ingo Battenfeld, Matthias Schröder
2015	J	`jnl`	Some hierarchies of QCB Math. Struct. Comput. Sci. Matthias Schröder, Victor L. Selivanov
2014	J	`jnl`	Hyperprojective Hierarchy of QCB CoRR Matthias Schröder, Victor L. Selivanov
2014	C	`conf`	Hyperprojective Hierarchy of qcb CiE Matthias Schröder, Victor L. Selivanov
2013	J	`jnl`	Some Hierarchies of QCB CoRR Matthias Schröder, Victor L. Selivanov
2011	B	`conf`	Observationally-induced Effect Monads: Upper and Lower Powerspace Constructions. MFPS Ingo Battenfeld, Matthias Schröder
2010	J	`jnl`	A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces. J. Univers. Comput. Sci. Matthias Schröder
2010	J	`jnl`	ℕ CoRR Matthias Schröder
2009	C	`conf`	A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces (Extended Abstract). CCA Matthias Schröder
2009	J	`jnl`	An Effective Tietze-Urysohn Theorem for QCB-Spaces. J. Univers. Comput. Sci. Matthias Schröder
2009	J	`jnl`	The sequential topology on ℕ Math. Struct. Comput. Sci. Matthias Schröder
2008	C	`conf`	An Effective Tietze-Urysohn Theorem for QCB-Spaces: (Extended Abstract). CCA Matthias Schröder
2008	J	`jnl`	Computability and Complexity in Analysis. J. Univers. Comput. Sci. Vasco Brattka, Hajime Ishihara, Matthias Schröder, Ning Zhong
2008	J	`jnl`	Editorial: Math. Log. Quart. 5/2008. Math. Log. Q. Vasco Brattka, Hajime Ishihara, Matthias Schröder, Ning Zhong
2008	J	`jnl`	On the Relationship between Filter Spaces and Weak Limit Spaces. J. Univers. Comput. Sci. Matthias Schröder
2007	—	`conf`	A Convenient Category of Domains. Computation, Meaning, and Logic Ingo Battenfeld, Matthias Schröder, Alex Simpson
2007	J	`jnl`	Admissible representations for probability measures. Math. Log. Q. Matthias Schröder
2007	J	`jnl`	Computable metrization. Math. Log. Q. Tanja Grubba, Matthias Schröder, Klaus Weihrauch
2007	C	`conf`	On the Relationship between Filter Spaces and Weak Limit Spaces. CCA Matthias Schröder
2007	J	`jnl`	Two preservation results for countable products of sequential spaces. Math. Struct. Comput. Sci. Matthias Schröder, Alex Simpson
2006	—	`conf`	A convenient category of domains. Computational Structures for Modelling Space, Time and Causality Ingo Battenfeld, Matthias Schröder, Alex Simpson
2006	C	`conf`	Admissible Representations in Computable Analysis. CiE Matthias Schröder
2006	C	`conf`	Admissible Representations of Probability Measures. CCA Matthias Schröder
2006	J	`jnl`	Compactly generated domain theory. Math. Struct. Comput. Sci. Ingo Battenfeld, Matthias Schröder, Alex Simpson
2006	J	`jnl`	Representing probability measures using probabilistic processes. J. Complex. Matthias Schröder, Alex Simpson
2005	B	`conf`	Computing with Sequences, Weak Topologies and the Axiom of Choice. CSL Vasco Brattka, Matthias Schröder
2005	B	`conf`	Probabilistic Observations and Valuations: (Extended Abstract). MFPS Matthias Schröder, Alex Simpson
2005	C	`conf`	Representing Probability Measures using Probabilistic Processes. CCA Matthias Schröder, Alex K. Simpson
2004	C	`conf`	Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory. CCA Daren Kunkle, Matthias Schröder
2004	J	`jnl`	Spaces allowing Type-2 Complexity Theory revisited. Math. Log. Q. Matthias Schröder
2003	—	`—`	Admissible representations for continuous computations. Matthias Schröder
2002	C	`conf`	A Natural Weak Limit Space with Admissible Representation which is not a Limit Space. CCA Matthias Schröder
2002	C	`ed.`	Computability and Complexity in Analysis, CCA 2002, ICALP 2002 Satellite Workshop, Málaga, Spain, July 12-13, 2002 CCA Vasco Brattka, Matthias Schröder, Klaus Weihrauch
2002	J	`jnl`	Effectivity in Spaces with Admissible Multirepresentations. Math. Log. Q. Matthias Schröder
2002	J	`jnl`	Extended admissibility. Theor. Comput. Sci. Matthias Schröder
2002	C	`conf`	Preface. CCA Vasco Brattka, Matthias Schröder, Klaus Weihrauch
2000	C	`conf`	Admissible Representations of Limit Spaces. CCA Matthias Schröder
1999	J	`jnl`	Online Computations of Differentiable Functions. Theor. Comput. Sci. Matthias Schröder
1997	A	`conf`	Fast Online Multiplication of Real Numbers. STACS Matthias Schröder
1996	C	`conf`	Fast Online Real Multiplication. CCA Matthias Schröder