default search action
Norbert Th. Müller
Person information
- affiliation: University of Trier, Department of Computer Science and Business Informatics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Sewon Park
, Franz Brauße, Pieter Collins
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation. Log. Methods Comput. Sci. 20(2) (2024) - 2023
- [j6]Franz Brauße
The ksmt calculus is a δ-complete decision procedure for non-linear constraints. Theor. Comput. Sci. 975: 114125 (2023) - 2021
- [c22]Franz Brauße
The ksmt Calculus Is a δ-complete Decision Procedure for Non-linear Constraints. CADE 2021: 113-130 - [i7]Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller:
The ksmt calculus is a δ-complete decision procedure for non-linear constraints. CoRR abs/2104.13269 (2021)
2010 – 2019
- 2019
- [c21]Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller:
A CDCL-Style Calculus for Solving Non-linear Constraints. FroCos 2019: 131-148 - [i6]Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller:
A CDCL-style calculus for solving non-linear constraints. CoRR abs/1905.09227 (2019) - 2017
- [j5]Enyi Tang
Software Numerical Instability Detection and Diagnosis by Combining Stochastic and Infinite-Precision Testing. IEEE Trans. Software Eng. 43(10): 975-994 (2017) - 2016
- [i5]Norbert Th. Müller, Sewon Park, Norbert Preining, Martin Ziegler:
On Formal Verification in Imperative Multivalued Programming over Continuous Data Types. CoRR abs/1608.05787 (2016) - 2015
- [j4]Akitoshi Kawamura, Norbert Th. Müller, Carsten Rösnick, Martin Ziegler:
Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy. J. Complex. 31(5): 689-714 (2015) - [c20]Franz Brauße, Margarita V. Korovina, Norbert Th. Müller:
Towards Using Exact Real Arithmetic for Initial Value Problems. Ershov Memorial Conference 2015: 61-74 - [c19]Franz Brauße, Margarita Vladimirovna Korovina, Norbert Th. Müller:
Using Taylor Models in Exact Real Arithmetic. MACIS 2015: 474-488 - 2014
- [c18]Norbert Th. Müller, Martin Ziegler:
From Calculus to Algorithms without Errors. ICMS 2014: 718-724 - [c17]Shuai Wei, Enyi Tang, Tianyu Liu, Norbert Th. Müller, Zhenyu Chen:
Automatic Numerical Analysis Based on Infinite-Precision Arithmetic. SERE 2014: 216-224 - 2012
- [c16]Norbert Th. Müller, Christian Uhrhan:
Some Steps into Verification of Exact Real Arithmetic. NASA Formal Methods 2012: 168-173 - [i4]Akitoshi Kawamura, Norbert Th. Müller, Carsten Rösnick, Martin Ziegler:
Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime. CoRR abs/1211.4974 (2012) - 2010
- [c15]Norbert Th. Müller, Margarita V. Korovina:
Making big steps in trajectories. CCA 2010: 106-119
2000 – 2009
- 2008
- [c14]Norbert Th. Müller, Xishun Zhao:
Jordan Areas and Grids. CCA 2008: 191-206 - 2007
- [j3]Vasco Brattka
Foreword. RAIRO Theor. Informatics Appl. 41(1): 1-2 (2007) - [c13]Xishun Zhao, Norbert Th. Müller:
Complexity of Operators on Compact Sets. CCA 2007: 101-119 - 2005
- [j2]Norbert Th. Müller, Martín Hötzel Escardó, Paul Zimmermann:
Guest editors' introduction: Special issue on practical development of exact real number computation. J. Log. Algebraic Methods Program. 64(1): 1-2 (2005) - [c12]Norbert Th. Müller:
Implementing Exact Real Numbers Efficiently. CCA 2005: 378 - 2004
- [c11]Freimut Brenner, Norbert Th. Müller:
RESTAMP for the Estimation of Rare Event Probabilities in Systems with Multidimensional Parameter Spaces. MMB 2004: 135-144 - 2003
- [c10]Norbert Th. Müller, Freimut Brenner:
Sojourn Times and Rare Events. Annual Simulation Symposium 2003: 259-265 - [c9]Laurent Granvilliers, Vladik Kreinovich, Norbert Th. Müller:
Novel Approaches to Numerical Software with Result Verification. Numerical Software with Result Verification 2003: 274-305 - 2002
- [c8]Norbert Th. Müller:
The AACmethod for the Evaluation of Simulation Results. ESM 2002: 145-149 - [c7]Norbert Th. Müller:
Real Numbers and BDDs. CCA 2002: 139-153 - 2000
- [c6]Norbert Th. Müller:
The iRRAM: Exact Arithmetic in C++. CCA 2000: 222-252 - [c5]Norbert Th. Müller:
An analysis of the LRE-Algorithm using Sojourn times. ESM 2000: 149-153
1990 – 1999
- 1999
- [j1]Norbert Th. Müller:
Computability on Random Variables. Theor. Comput. Sci. 219(1-2): 287-299 (1999) - [e2]Dieter Baum, Norbert Th. Müller, Richard Rödler:
MMB '99, Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen, Vorträge der 10. GI/NTG-Fachtagung, 22.-24. September 1999, Trier. VDE Verlag GmbH, Berlin, Offenbach 1999, ISBN 3-8007-2472-3 [contents] - [i3]Dieter Baum, Norbert Th. Müller, Richard Rödler:
MMB '99, Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen, 10. GI/NTG-Fachtagung, 22.-24. September 1999, Trier, Kurzbeiträge und Toolbeschreibungen. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-16, 1999 [contents] - 1998
- [c4]Martin Luckow, Norbert Th. Müller:
Cascade: A Simple and Efficient Algorithm for Priority Queues. ESM 1998: 196-200 - 1996
- [c3]Norbert Th. Müller:
Towards a real Real RAM: a Prototype using C++. CCA 1996 - [e1]Ker-I Ko, Norbert Th. Müller, Klaus Weihrauch:
Second Workshop on Computability and Complexity in Analysis, CCA 1996, August 22-23, 1996, Trier, Germany. Technical Report TR 96-44, Unjiversity of Trier 1996 [contents] - [i2]Jens Hofmann, Norbert Th. Müller, Kasyap Natarajan:
Parallel versus Sequential Task-Processing: A New Performance Model in Discrete Time. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-46 (1996) - 1994
- [i1]Martin Luckow, Norbert Th. Müller:
Cascade: A Simple and Efficient Algorithm for Priority Queues. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-15 (1994)
1980 – 1989
- 1987
- [c2]Norbert Th. Müller:
Uniform Computational Complexity of Taylor Series. ICALP 1987: 435-444 - 1986
- [c1]Norbert Th. Müller:
Subpolynomial Complexity Classes of Real Functions and Real Numbers. ICALP 1986: 284-293
Coauthor Index
aka: Margarita Vladimirovna Korovina
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-10-07 21:16 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: