Norbert Th. Müller

Orcid: 0000-0003-3684-3029

Affiliations:
  • University of Trier, Department of Computer Science and Business Informatics


According to our database1, Norbert Th. Müller authored at least 32 papers between 1986 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation.
Log. Methods Comput. Sci., 2024

2023
The ksmt calculus is a <i>δ</i>-complete decision procedure for non-linear constraints.
Theor. Comput. Sci., October, 2023

2021
The ksmt Calculus Is a δ-complete Decision Procedure for Non-linear Constraints.
Proceedings of the Automated Deduction - CADE 28, 2021

2019
A CDCL-Style Calculus for Solving Non-linear Constraints.
Proceedings of the Frontiers of Combining Systems - 12th International Symposium, 2019

2017
Software Numerical Instability Detection and Diagnosis by Combining Stochastic and Infinite-Precision Testing.
IEEE Trans. Software Eng., 2017

2016
On Formal Verification in Imperative Multivalued Programming over Continuous Data Types.
CoRR, 2016

2015
Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy.
J. Complex., 2015

Using Taylor Models in Exact Real Arithmetic.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

Towards Using Exact Real Arithmetic for Initial Value Problems.
Proceedings of the Perspectives of System Informatics, 2015

2014
Automatic Numerical Analysis Based on Infinite-Precision Arithmetic.
Proceedings of the Eighth International Conference on Software Security and Reliability, 2014

From Calculus to Algorithms without Errors.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2012
Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime
CoRR, 2012

Some Steps into Verification of Exact Real Arithmetic.
Proceedings of the NASA Formal Methods, 2012

2010
Making big steps in trajectories
Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2010

2008
Jordan Areas and Grids.
Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007
Foreword.
RAIRO Theor. Informatics Appl., 2007

Complexity of Operators on Compact Sets.
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

2005
Guest editors' introduction: Special issue on practical development of exact real number computation.
J. Log. Algebraic Methods Program., 2005

Implementing Exact Real Numbers Efficiently.
Proceedings of the CCA 2005, 2005

2004
RESTAMP for the Estimation of Rare Event Probabilities in Systems with Multidimensional Parameter Spaces.
Proceedings of the MMB & PGTS 2004, 2004

2003
Novel Approaches to Numerical Software with Result Verification.
Proceedings of the Numerical Software with Result Verification, 2003

Sojourn Times and Rare Events.
Proceedings of the Proceedings 36th Annual Simulation Symposium (ANSS-36 2003), Orlando, Florida, USA, March 30, 2003

2002
Real Numbers and BDDs.
Proceedings of the Computability and Complexity in Analysis, 2002

The AA<sup>C</sup>method for the Evaluation of Simulation Results.
Proceedings of the 16<sup>th</sup> European Simulation Multiconference: Modelling and Simulation 2002, 2002

2000
An analysis of the LRE-Algorithm using Sojourn times.
Proceedings of the 14<sup>th</sup> European Simulation Multiconference, 2000

The iRRAM: Exact Arithmetic in C++.
Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999
Computability on Random Variables.
Theor. Comput. Sci., 1999

1996
Parallel versus Sequential Task-Processing: A New Performance Model in Discrete Time
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Towards a real Real RAM: a Prototype using C++.
Proceedings of the Second Workshop on Computability and Complexity in Analysis, 1996

1994
Cascade: A Simple and Efficient Algorithm for Priority Queues
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

1987
Uniform Computational Complexity of Taylor Series.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
Subpolynomial Complexity Classes of Real Functions and Real Numbers.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986


  Loading...