next up previous contents
Next: About this document Up: LiDIA-1.1 Manual Previous: handlers

References

1
Abramowitz, M., Stegun, I.A.: Handbook of mathematical functions with formulas, graphs and mathematical tables. National Bureau of Standards, Washington D.C., 1964

2
Apostol, M. Tom: CALCULUS. Blaisdell Publ. Co., 1962

3
Berger, F.-D.: Faktorisieren mit elliptischen Kurven. Diplomarbeit, Universität des Saarlandes, 1992

4
Borwein, J.M., Borwein, P.B.: Pi and the AGM. Canadian Mathematical Society, Series of Monographs and Advanced Texts, Wiley-Interscience Publication, 1987

5
Brent, P. Richard: The Complexity of Multiple-Precision Arithmetic. Complexity of Computational Problem Solving (R.S. Anderssen and R.P. Brent Eds.), University of Queensland Press, 1976

6
Brent, P. Richard: Fast Multiple-Precision Evaluation of Elementary Functions. Journal of ACM, Vol. 23, p. 242, 1976

7
Brent, P. Richard: Multiple-precision zero finding methods and the complexity of elementary function evaluation. Proc. Symp. on Analytic Computational Complexity, J.F. Traub, Ed., Academic Press, pp. 151-176, 1976

8
Brent, P. Richard: Some New Algorithms for High-Precision Computation of Euler's Constant. Mathematics of Computation, Vol. 34, No. 149, p. 305, 1980

9
Buchmann, J., Kessler, V.: Computing a lattice basis from a generating system. preprint 1991

10
Carlson, B.C.: An Algorithm for Computing Logarithms and Arctangens. Mathematics of Computation, Vol. 26, No. 118, p. 543, 1972

11
Cohen, Henri: A Course in Computational Algebraic Number Theory. Springer-Verlag, 1993

12
Dentzer, Ralf: libI: Eine lange ganzzahlige Arithmetik. Universität Heidelberg, 1991

13
Domich, Paul D.: Residual Hermite Normal Form Computations. ACM Transactions on Mathematical Software, Vol. 15, no. 3, pp. 275-286, 1989

14
Düllmann, Stephan: Ein Algorithmus zur Bestimmung der Klassengruppe positiv definiter binärer quadratischer Formen. Dissertation, Universität des Saarlandes, 1991

15
Eckel, Bruce: Using C++. Osborne McGraw-Hill, 1989

16
Eirund, Helmut: Objektorientierte Programmierung. Leitfäden der angewandten Informatik, Teubner, 1993

17
Forster, Otto: Analysis I. Vieweg Verlag, 1983

18
Granlund, Torbjörn: The GNU Multiple Precision Arithmetic Library, Free Software Foundation Inc., Cambridge, 1993

19
Havas, George, Holt, Derek F., Rees, Sarah: Recognizing badly presented -modules. in: Linear Algebra and its Applications, Vol. 192, 1993, pp. 137-163

20
Havas, George, Majewski, Bohdan S.: Integer matrix diagonalization. Key Centre for Software Technology, Department of Computer Science, The University of Queensland, TR0277, 1994

21
Havas, George, Sterling, Leon S.: Integer matrices and Abelian groups. Springer-Verlag, Lecture Notes in Computer Science 72, 1979

22
IEEE: IEEE standard 754-1985 for binary floating-point arithmetic. reprinted in SIGPLAN 22, 2:9-25, 1987

23
Kernigham, W. Brian, Ritchie, M. Dennis: Programmieren in C. Carl Hanser Verlag, 1983

24
Klatte R., Kulisch U., Wiethoff A., Lawo C. , Rauch M.: C-XSC A C++ Class Library for Extended Scientific Computing. Springer-Verlag, 1993

25
Knuth, E. Donald: The Art of Computer Programming. Addison--Wesley Co., Inc., Vol. 2, 1980

26
König, Andrew: Der C-Experte: Programmieren ohne Panne. Addison--Wesley Publishing Company Inc., Reading, 1989

27
Lenstra, Arjen: lip: long integer package. Bellcore, 1989

28
Lenstra, A.K., Lenstra, H.W.Jr., Lovász, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261, pp. 515-534, 1982

29
Lenstra, H.W. Jr.: Factoring integers with elliptic curves. Annals of Mathematics 126, pp. 649-673, 1987

30
Lippman, Stanley B.: C++ Primer. Addison-Wesley Publishing Company, 1989, Reprinted with corrections March, 1990

31
Merscher, Patrick: Standards für objektorientiertes Programmieren in der Computeralgebra. Diplomarbeit, Universität des Saarlandes, 1992

32
Müller, Achim: Effiziente Algorithmen für Probleme der linearen Algebra über . Diplomarbeit, Universität des Saarlandes, 1994

33
Müller, Andreas: Eine FFT-Continuation für die Elliptische Kurven Methode. Diplomarbeit, Universität des Saarlandes, in preparation.

34
Perron, Oskar: Die Lehre von den Kettenbrüchen I, II. B.G. Teubner, Stuttgart, 1977

35
Pohl, Ira: C++ for C Programmers. The Benjamin/Cummings Publishing Company, Inc., 1989

36
Ramanujan, Srinivasa: Collected Papers of Srinivasa Ramanujan. Cambridge University Press, 1927

37
Schnorr, C.P., Euchner, M.: Lattice Basis Reduction: Improved practical algorithms and solving subset sum problems. Proceedings of the FCT 91, p. 68-85, 1991

38
Shanks, D., Wrench, J.W.: The Calculation of to 100,000 decimals. Mathematics of Computation, Vol. 16, p. 76, 1962

39
Stoer, Josef: Einführung in die numerische Mathematik I. Springer-Verlag, 1983

40
Stroustrup, Margaret A. Ellis, Bjarne: The Annotated C++ Reference Manual. Addison--Wesley Publishing Company, Reading, 1990, ANSI Base Document

41
Sweeny, D.W.: On the Computation of Euler's Constant. Mathematics of Computation, Vol. 15, 1961

42
UNIX System Laboratories, London, England: C++ Language System Release 3.0.1. 1992, Release Notes

43
UNIX System Laboratories, London, England: C++ Language System Release 3.0.1. 1992, Selected Readings

44
Watson, G.N.: A Treatise on the Theory of Bessel Functions. 2nd ed., Cambridge University Press, 1944

45
de Weger, B.: Algorithms for Diophantine approximation. Thesis, Centrum voor Wiskunde en Informatica (CWI), pp. 49-51, 1987


LiDIA Administrator
Thu Aug 10 16:41:08 MET DST 1995