Forschung / Research

Implementation:

Publikationen / publications

  • Enhancing imperative exact real arithmetic with functions and logic
    • Sixth International Conference on Computability and Complexity in Analysis, 2009, Ljubljana
    • (Pdf-Version)
  • Making big steps in trajectories (mit Margarita Korovina)
  • Jordan Areas and Grids (mit X. Zhao)
    • Proceedings of the Fifth International Conference on Computability and Complexity in Analysis (CCA 2008, Hagen), Electronic Notes in Theoretical Computer Science, Vol. 221. pp 191-206, 2008
    • doi:10.1016/j.entcs.2008.12.017
  • Complexity of Operators on Compact Sets (mit X. Zhao)
    • Fourth International Conference on Computability and Complexity in Analysis (CCA 2007, Siena), Electronic Notes in Theoretical Computer Science, Vol. 202, pp 101-119, 2008
    • doi:10.1016/j.entcs.2008.03.011
  • Novel Approaches to Numerical Software with Result Verification (mit L. Granvilliers, V. Kreinovich)
    • Numerical Software with Result Verification, Lecture notes in computer science 2991, (Springer, Berlin, 2004), pp 274-305
    • PDF at Springer
  • RESTAMP for the Estimation of Rare Event Probabilities in Systems with Multidimensional Parameter Spaces (mit F. Brenner)
    • 12th MMB \& 3rd PGTS, 2004, Dresden, pp 135-144, VDE-Verlag, Berlin/Offenbach, ISBN 3-8007-2851-6
  • Sojourn Times and Rare Events (mit F. Brenner)
    • 36th Annual Simulation Symposium, 2003, Orlando, pp 259-265, IEEE Computer Science, ISBN 0-7695-1911-3
    • (Pdf-Version)
  • The AAc-Method for the Evaluation of Simulation Results
    • preliminary version, final version in: Proceedings of the 16th European Simulation Multiconference, Darmstadt, 2002
    • (Pdf-Version)
  • The iRRAM: Exact Arithmetic in C++
    • preliminary version, final version in: Proceedings Workshop on Constructivity and Complexity in Analysis, Swansea, 2000
    • (Postscript-Version)
  • An analysis of the LRE_Algorithm using Sojourn Times
    • Proceedings of the 14th European Simulation Multiconference, Ghent, 2000, (149-153)
    • (Pdf-Version)
  • Computability on Random Variables
  • Implementing limits in an interactive RealRAM
  • Second Workshop on Constructivity and Complexity in Analysis
  • Towards a real Real RAM: A Prototype using C++
  • Constructive aspects of analytic functions
  • Cascade: A Simple and Efficient Algorithm for Priority Queues (mit Martin Luckow)
  • Solving Initial Value Problems in Polynomial Time (mit Bernd Moiske)
  • Polynomial-Time Computation of Taylor Series
  • Uniform computational complexity of Taylor series
  • Subpolynomial complexity classes of real functions and real numbers