From af30045c9b86c44a8d683a1bcc24861922706244 Mon Sep 17 00:00:00 2001 From: William Hart Date: Sat, 22 Aug 2015 19:34:59 +0000 Subject: [PATCH] Update AUTHORS and Contributors. --- AUTHORS | 4 ++-- doc/mpir.texi | 5 +++-- 2 files changed, 5 insertions(+), 4 deletions(-) diff --git a/AUTHORS b/AUTHORS index 75c1a83a..1e934db9 100644 --- a/AUTHORS +++ b/AUTHORS @@ -35,7 +35,7 @@ Jason Worth Martin Core 2 assembly support, merge of Moller's GCD patches, Michael Abshoff Build system patches and failure reports, valgrinding, build testing Niels Moller GCD patches, nhgcd2.c, contributions to the schoolbook - and divide and conquer division code + and divide and conquer division code, jacobi symbols Jason Moxham Dramatic speed improvements for K8, K10 and Core 2 assembler code and improvements to other x86_64 assembly code. Refactoring CPU detection code. Numerous bug and @@ -54,7 +54,7 @@ Torbjorn Granlund revised FFT code, schoolbook and divide and conquer Marco Bodrato mpz implementation of Toom 7, mpn implementation of toom 8.5, contributed to Schoolbook division code many improved number theoretical functions factorial, - multi-factorial, primorial, n-choose-k, jacobi symbols + multi-factorial, primorial, n-choose-k Robert Gerbicz fast factorial code Martin Boij Miscellaneous improvements to nextprime code David Harvey middle product and dc_divappr_q code, divide and conquer diff --git a/doc/mpir.texi b/doc/mpir.texi index 6eab9b7c..f977b108 100644 --- a/doc/mpir.texi +++ b/doc/mpir.texi @@ -10215,7 +10215,8 @@ Michael Abshoff helped resolve some build issues on various platforms. He served Mariah Lennox contributed patches to mpirbench and various build failure reports. She has also reported gcc bugs found during MPIR development. Niels Moller wrote the fast ngcd code for computing integer GCD, the quadratic -Hensel division code and precomputed inverse code for Euclidean division. +Hensel division code and precomputed inverse code for Euclidean division, along +with fast jacobi symbols code. He also made contributions to the Toom multiply code, especially helper functions to simplify Toom evaluations. @@ -10243,7 +10244,7 @@ and found optimal Toom multiplication sequences. Marco Bodrato wrote an mpz implementation of the Toom 7 code and wrote most of the Toom 8.5 multiply and squaring code. He also helped write the divide and conquer Euclidean division code. He also contributed many improved number theoretical functions including factorial, multi-factorial, primorial, -n-choose-k, jacobi symbols. +n-choose-k. Robert Gerbicz contributed fast factorial code.