Computability
Pi and the AGM: a study in the analytic number theory and computational complexity
Pi and the AGM: a study in the analytic number theory and computational complexity
Exact real arithmetic formulating real numbers as functions
Research topics in functional programming
Complexity theory of real functions
Complexity theory of real functions
Recursive characterization of computable real-valued functions and relations
Theoretical Computer Science - Special issue on real numbers and computers
Computation by “while” programs on topological partial algebras
Theoretical Computer Science - Special issue on computability and complexity in analysis
Fast Multiple-Precision Evaluation of Elementary Functions
Journal of the ACM (JACM)
A Fortran Multiple-Precision Arithmetic Package
ACM Transactions on Mathematical Software (TOMS)
C-XSC: A C++ Class Library for Extended Scientific Computing
C-XSC: A C++ Class Library for Extended Scientific Computing
Fast on-line integer multiplication
Journal of Computer and System Sciences
A Survey of Exact Arithmetic Implementations
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Exact Real Arithmetic Systems: Results of Competition
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
RealLib: An efficient implementation of exact real arithmetic
Mathematical Structures in Computer Science
Constructive analysis, types and exact real numbers
Mathematical Structures in Computer Science
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
(Short) Survey of Real Hypercomputation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Theory of Real Computation According to EGC
Reliable Implementation of Real Number Algorithms: Theory and Practice
Time Complexity and Convergence Analysis of Domain Theoretic Picard Method
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
The dedekind reals in abstract stone duality
Mathematical Structures in Computer Science
Efficient exact arithmetic over constructive reals
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
The design of core 2: a library for exact numeric computation in geometry and algebra
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
On the Kolmogorov complexity of continuous real functions
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Admissible representations in computable analysis
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Complexity and intensionality in a type-1 framework for computable analysis
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Original article: Computational complexity of iterated maps on the interval
Mathematics and Computers in Simulation
The world's shortest correct exact real arithmetic program?
Information and Computation
Some steps into verification of exact real arithmetic
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Arb: a C library for ball arithmetic
ACM Communications in Computer Algebra
| Hi-index | 0.00 |
The iRRAM is a very efficient C++ package for error-free real arithmetic based on the concept of a Real-RAM. Its capabilities range from ordinary arithmetic over trigonometric functions to linear algebra even with sparse matrices. We discuss the concepts and some highlights of the implementation.