Norbert Th. Müller

Norbert Th. Müller, Christian Uhrhan: Some Steps into Verification of Exact Real Arithmetic. NASA Formal Methods 2012: 168-173

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)

Norbert Th. Müller, Margarita V. Korovina: Making big steps in trajectories. CCA 2010: 106-119

Xishun Zhao, Norbert Th. Müller: Complexity of Operators on Compact Sets. Electr. Notes Theor. Comput. Sci. 202: 101-119 (2008)

Norbert Th. Müller, Xishun Zhao: Jordan Areas and Grids. Electr. Notes Theor. Comput. Sci. 221: 191-206 (2008)

Vasco Brattka, Christiane Frougny, Norbert Th. Müller: Foreword. ITA 41(1): 1-2 (2007)

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. Algebr. Program. 64(1): 1-2 (2005)

Norbert Th. Müller: Implementing Exact Real Numbers Efficiently. CCA 2005: 378

Freimut Brenner, Norbert Th. Müller: RESTAMP for the Estimation of Rare Event Probabilities in Systems with Multidimensional Parameter Spaces. MMB 2004: 135-144

Norbert Th. Müller, Freimut Brenner: Sojourn Times and Rare Events. Annual Simulation Symposium 2003: 259-265

Laurent Granvilliers, Vladik Kreinovich, Norbert Th. Müller: Novel Approaches to Numerical Software with Result Verification. Numerical Software with Result Verification 2003: 274-305

Norbert Th. Müller: Real Numbers and BDDs. Electr. Notes Theor. Comput. Sci. 66(1): 139-153 (2002)

Norbert Th. Müller: The AA^Cmethod for the Evaluation of Simulation Results. ESM 2002: 145-149

Norbert Th. Müller: The iRRAM: Exact Arithmetic in C++. CCA 2000: 222-252

Norbert Th. Müller: An analysis of the LRE-Algorithm using Sojourn times. ESM 2000: 149-153

Norbert Th. Müller: Computability on Random Variables. Theor. Comput. Sci. 219(1-2): 287-299 (1999)

Dieter Baum, Norbert Th. Müller, Richard Rödler (Eds.): 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

Martin Luckow, Norbert Th. Müller: Cascade: A Simple and Efficient Algorithm for Priority Queues. ESM 1998: 196-200

Norbert Th. Müller: Towards a real Real RAM: a Prototype using C++. CCA 1996

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)

Martin Luckow, Norbert Th. Müller: Cascade: A Simple and Efficient Algorithm for Priority Queues. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-15 (1994)

Norbert Th. Müller: Uniform Computational Complexity of Taylor Series. ICALP 1987: 435-444

Norbert Th. Müller: Subpolynomial Complexity Classes of Real Functions and Real Numbers. ICALP 1986: 284-293