default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Schröder 0001
Person information
- affiliation (since 2015): TU Darmstadt, Department of Mathematics, Germany
- affiliation (2014 - 2015): University of Vienna, Kurt Gödel Research Center, Austria
- affiliation (2008 - 2013): Bundeswehr University Munich, München, Germany
- affiliation (2007 - 2008): University of Siegen, Department of Mathematics, Germany
- affiliation (2004 - 2007): University of Edinburgh, School of Informatics, UK
- affiliation (PhD 2003): FernUniversität Hagen, Theoretische Informatik, Germany
Other persons with the same name
- Matthias Schröder 0002
![[0000-0002-5791-8782]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-5791-8782")
— Bielefeld University, Computer Graphics & Geometry Processing Group, Germany - Matthias Schröder 0003 — CERN, Geneva, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j21]Matthew de Brecht, Arno Pauly, Matthias Schröder:
Overt choice. Comput. 9(3-4): 169-191 (2020)- [i8]Matthias Schröder:
Admissibly Represented Spaces and Qcb-Spaces. CoRR abs/2004.09450 (2020)
2010 – 2019
- 2019
- [j20]Heiko Radatz, Matthias Schröder, Christian Becker, Christian Bramsiepe, Gerhard Schembecker:
Selection of equipment modules for a flexible modular production plant by a multi-objective evolutionary algorithm. Comput. Chem. Eng. 123: 196-221 (2019) - [i7]Matthew de Brecht, Arno Pauly, Matthias Schröder:
Overt choice. CoRR abs/1902.05926 (2019) - [i6]Willem L. Fouché, Hyunwoo Lee, Donghyun Lim, Sewon Park, Matthias Schröder, Martin Ziegler:
Randomized Computation of Continuous Data: Is Brownian Motion Computable? CoRR abs/1906.06684 (2019) - 2017
- [j19]Vasco Brattka, Andrea Cettolo, Guido Gherardi, Alberto Marcone, Matthias Schröder:
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. 168(8): 1605-1608 (2017) - [c20]Matthias Schröder, Florian Steinberg:
Bounded time computation on metric spaces and Banach spaces. LICS 2017: 1-12 - [i5]Matthias Schröder, Florian Steinberg:
Bounded time computation on metric spaces and Banach spaces. CoRR abs/1701.02274 (2017) - 2015
- [j18]Matthias Schröder, Victor L. Selivanov:
Hyperprojective hierarchy of qcb0-spaces. Comput. 4(1): 1-17 (2015) - [j17]Ingo Battenfeld, Matthias Schröder:
Observationally-induced lower and upper powerspace constructions. J. Log. Algebraic Methods Program. 84(5): 668-682 (2015) - [j16]Matthias Schröder, Victor L. Selivanov:
Some hierarchies of QCB 0-spaces. Math. Struct. Comput. Sci. 25(8): 1799-1823 (2015) - [c19]Matthew de Brecht, Matthias Schröder, Victor L. Selivanov:
Base-Complexity Classifications of QCB0-Spaces. CiE 2015: 156-166 - [c18]Matthias Schröder, Florian Steinberg, Martin Ziegler:
Average-Case Bit-Complexity Theory of Real Functions. MACIS 2015: 505-519 - 2014
- [c17]Matthias Schröder, Victor L. Selivanov:
Hyperprojective Hierarchy of qcb0-Spaces. CiE 2014: 352-361 - [i4]Matthias Schröder, Victor L. Selivanov:
Hyperprojective Hierarchy of QCB0-spaces. CoRR abs/1404.0297 (2014) - 2013
- [i3]Matthias Schröder, Victor L. Selivanov:
Some Hierarchies of QCB0-Spaces. CoRR abs/1304.1647 (2013) - 2011
- [c16]Ingo Battenfeld, Matthias Schröder:
Observationally-induced Effect Monads: Upper and Lower Powerspace Constructions. MFPS 2011: 105-119 - 2010
- [j15]Matthias Schröder:
A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces. J. Univers. Comput. Sci. 16(18): 2711-2732 (2010) - [i2]Matthias Schröder:
ℕℕℕ does not satisfy Normann's condition. CoRR abs/1010.2396 (2010)
2000 – 2009
- 2009
- [j14]Matthias Schröder:
An Effective Tietze-Urysohn Theorem for QCB-Spaces. J. Univers. Comput. Sci. 15(6): 1317-1336 (2009) - [j13]Matthias Schröder:
The sequential topology on ℕℕℕ is not regular. Math. Struct. Comput. Sci. 19(5): 943-957 (2009) - [c15]Matthias Schröder:
A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces (Extended Abstract). CCA 2009 - 2008
- [j12]Vasco Brattka, Hajime Ishihara, Matthias Schröder, Ning Zhong:
Computability and Complexity in Analysis. J. Univers. Comput. Sci. 14(6): 800 (2008) - [j11]Matthias Schröder:
On the Relationship between Filter Spaces and Weak Limit Spaces. J. Univers. Comput. Sci. 14(6): 996-1015 (2008) - [j10]Vasco Brattka, Hajime Ishihara, Matthias Schröder, Ning Zhong:
Editorial: Math. Log. Quart. 5/2008. Math. Log. Q. 54(5): 453 (2008) - [c14]Matthias Schröder:
An Effective Tietze-Urysohn Theorem for QCB-Spaces: (Extended Abstract). CCA 2008: 231-242 - 2007
- [j9]Tanja Grubba, Matthias Schröder, Klaus Weihrauch:
Computable metrization. Math. Log. Q. 53(4-5): 381-395 (2007) - [j8]Matthias Schröder:
Admissible representations for probability measures. Math. Log. Q. 53(4-5): 431-445 (2007) - [j7]Matthias Schröder, Alex Simpson:
Two preservation results for countable products of sequential spaces. Math. Struct. Comput. Sci. 17(1): 161-172 (2007) - [c13]Ingo Battenfeld, Matthias Schröder, Alex Simpson:
A Convenient Category of Domains. Computation, Meaning, and Logic 2007: 69-99 - [c12]Matthias Schröder:
On the Relationship between Filter Spaces and Weak Limit Spaces. CCA 2007: 267-277 - 2006
- [j6]Matthias Schröder, Alex Simpson:
Representing probability measures using probabilistic processes. J. Complex. 22(6): 768-782 (2006) - [j5]Ingo Battenfeld, Matthias Schröder, Alex Simpson:
Compactly generated domain theory. Math. Struct. Comput. Sci. 16(2): 141-161 (2006) - [c11]Matthias Schröder:
Admissible Representations in Computable Analysis. CiE 2006: 471-480 - [c10]Matthias Schröder:
Admissible Representations of Probability Measures. CCA 2006: 61-78 - [i1]Ingo Battenfeld, Matthias Schröder, Alex Simpson:
A convenient category of domains. Computational Structures for Modelling Space, Time and Causality 2006 - 2005
- [c9]Matthias Schröder, Alex K. Simpson:
Representing Probability Measures using Probabilistic Processes. CCA 2005: 211-226 - [c8]Vasco Brattka, Matthias Schröder:
Computing with Sequences, Weak Topologies and the Axiom of Choice. CSL 2005: 462-476 - [c7]Matthias Schröder, Alex Simpson:
Probabilistic Observations and Valuations: (Extended Abstract). MFPS 2005: 605-615 - 2004
- [j4]Matthias Schröder:
Spaces allowing Type-2 Complexity Theory revisited. Math. Log. Q. 50(4-5): 443-459 (2004) - [c6]Daren Kunkle, Matthias Schröder:
Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory. CCA 2004: 111-123 - 2003
- [b1]Matthias Schröder:
Admissible representations for continuous computations. University of Hagen, Germany, 2003, pp. 1-203 - 2002
- [j3]Matthias Schröder:
Effectivity in Spaces with Admissible Multirepresentations. Math. Log. Q. 48(S1): 78-90 (2002) - [j2]Matthias Schröder:
Extended admissibility. Theor. Comput. Sci. 284(2): 519-538 (2002) - [c5]Matthias Schröder:
A Natural Weak Limit Space with Admissible Representation which is not a Limit Space. CCA 2002: 165-175 - [c4]Vasco Brattka, Matthias Schröder, Klaus Weihrauch:
Preface. CCA 2002: 225-226 - [e1]Vasco Brattka, Matthias Schröder, Klaus Weihrauch:
Computability and Complexity in Analysis, CCA 2002, ICALP 2002 Satellite Workshop, Málaga, Spain, July 12-13, 2002. Electronic Notes in Theoretical Computer Science 66(1), Elsevier 2002 [contents] - 2000
- [c3]Matthias Schröder:
Admissible Representations of Limit Spaces. CCA 2000: 273-295
1990 – 1999
- 1999
- [j1]Matthias Schröder:
Online Computations of Differentiable Functions. Theor. Comput. Sci. 219(1-2): 331-345 (1999) - 1997
- [c2]Matthias Schröder:
Fast Online Multiplication of Real Numbers. STACS 1997: 81-92 - 1996
- [c1]Matthias Schröder:
Fast Online Real Multiplication. CCA 1996
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
