2010-May-22:
- added section about mixed radix numbers with prescribed sum of digits
  (these are one-to-one with k-subsets of a multiset)

2010-May-20:
- added chapter about k-permutations (lexicographic order
  and Gray code)

2010-May-16:
- added section about correlation and convolution as
  multiplication with circulant matrices

2010-May-05:
- added short section about run-length limited (RLL) words

2010-May-04:
- algorithm for the computation of the minimal polynomial
  of an element in GF(2^n) requiring only space O(n)

2010-April-23:
- loopless algorithm for two-close Gray code for Dyck words

2010-April-18:
- Three more dragon cuves, respectively via counting in
  radix-7, radix-9, and radix-13

2010-April-16:
- dragon curve based on radix-7 counting (R7-dragon)

2010-April-15:
- dragon curve based on radix-5 counting (R5-dragon)

2009-July-17:
- 16th order product for elliptic K

2009-June-18:
- algorithm for random connected (indecomposable) permutation

2009-June-02:
- algorithm for random permutations such that
  relative order of first k elements is preserved.
- algorithm for random k-prefix of a permutation.

2009-May-26:
- algorithm for random permutation with prescribed parity

2009-March-25:
- changed title from "Algorithms for Programmers" to "Matters Computational"

2009-March-22:
- general paper-folding sequences and a triangular space-filling curve

2009-March-21:
- algorithm for random derangement (permutation without fixed point)

2009-March-18:
- algorithm for random involution (self-inverse permutation)

2009-March-11:
- algorithm for random permutation with prescribed cycle type

2009-March-09:
- algorithm to generate all involutions (self-inverse permutations)

2009-March-08:
- bit-level algorithm for the terdragon curve

2009-March-06:
- bit-level algorithm for paper-folding sequence and dragon curve

2009-March-05:
- added some curious identities for the eta-function

2009-February-25:
- added prefix transform and prefix convolution

2009-February-19:
- added successor computation for Golay-Rudin-Shapiro sequence

2009-February-18:
- added method for subset convolution (via weighted OR-convolution)

2008-December-31:
- added merge sort algorithm, also optimized 4-way variant

2008-October-25:
- added algorithm for paren strings via prefix shifts (Ruskey/Williams)

2008-October-24:
- added Williams' algorithm for permutations of a multiset via prefix shifts

2008-July-20:
- added Lunnon's Gray code for permutations of a multiset

2008-July-13:
- added left-right array (LR-array)
- added fast methods to convert permutations to and from
  Lehmer code (inversion table)

2008-July-07:
- added strong Gray code order for combinations that is
  obtained via modulo moves.

2008-June-26:
- added constant amortized time (CAT) algorithm for modular
  Gray code with mixed radix numbers.

2008-April-13:
- added improved irreducibility test for binary polynomials

2008-April-07:
- added fast method to compute the CORDIC constant K=1.6467602581210...

2008-March-23:
- added "detailed" generating function for permutations of given cycle type,
  similarly for set partitions

2008-March-16:
- added algorithm for the computation of the Schroeder iteration
  via series reversion

2008-March-04:
- added algorithm for the generation of bit-combinations in shifts-order

2008-March-03:
- added method for bit-counting large arrays via vertical addition

2008-March-02:
- added fast routine for the computation of field polynomials
  with type-2 optimal normal bases

2008-February-17:
- added one example of a multi-point iteration
- added closed form for Pade approximants of r-th root

2008-February-05:
- added description (in appendix) how to make the hyperlinks work
  on any machine.

2008-February-02:
- simplified arbitrary length FFT (chirp-z algorithm)
- code examples now have line numbers

2007-October-01:
- added algorithm for loopless generation of Gray code for k-ary trees
  where all changes are homogeneous

2007-September-24:
- added routines for conversion to and from self-reciprocal polynomials (SRP)

2007-September-16:
- added Ives' algorithm for permutations

2007-September-09:
- added Wells' Gray code for permutations and a variant by Lipski

2007-September-08:
- added three more algorithms for Gray codes for permutations.

2007-September-01:
- added algorithm for single track order for permutations with
  minimal number of changes (Gray code for odd n)

2007-August-30:
- added algorithm for compositions in colex order that is also
  efficient for the sparse case (i.e. k much greater than n)

2007-August-29:
- added recursions for Gray code for compositions corresponding
  to two-close combinations (enup moves) and Eades-McKay sequence.

2007-August-26:
- added iterative algorithm for combinations in Eades-McKay order
  (a strong minimal-change order).

2007-August-24:
- added iterative algorithm for combinations in endo order
  (a strong minimal-change order).

2007-August-16:
- added CAT algorithm for minimal-change order for permutations
  corresponding to the Gray code in rising factorial base.

2007-August-14:
- added algorithm for single track ordering for permutations

2007-August-05:
- added algorithm for multiset permutations in lexicographic order

2007-July-28:
- added algorithm for Gray code for permutations where any element is
  at most one position to the left or at most d positions to the right
  from its original position
- added algorithm for Gray code for permutations where any element is
  at most one position to the right of its original position

2007-July-27:
- added algorithm for Gray code for words where digit x is followed
  by at least x zeroes.

2007-July-24;
- added algorithm for alternative Gray for binary words with maximal
  r successive ones where r>=3 and r odd

2007-July-19:
- added algorithm for Gray code for binary words without substring 1xy1
- added (alternative) algorithm for Gray code for binary words without substring 111
- added (alternative) algorithm for Gray code for binary words without substring 1111

2007-July-04:
- added algorithm for Gray code for binary words without substring 1x1

2007-July-01:
- added algorithm for Gray code for strings with no two successive zeros

2007-June-28:
- added algorithm for Gray code for strings with no two successive nonzero digits

2007-June-27:
- added method to generate Gray codes for radix-(r+1) strings with
  forbidden substring rx where x!=0 (generalized Pell words)

2007-June-22:
- added method to generate Gray codes for binary words with
  at most r successive ones (generalized Fibonacci words)

2007-June-14:
- added method to obtain product representation of power series

2007-June-10:
- added method for simultaneous computation of logarithms of small primes

2007-May-29:
- added method for fast exact inversion over GF(2) and for n=2^k+-1

2007-April-23:
- added section about subsets in (minimal-change) shifts-order

2007-April-01:
- added section about computation of sparse bit subsets in Gray code order

2007-March-27:
- added section about fast computation of OR-convolution and AND-convolution

2007-March-25:
- added section about dual normal bases

2007-March-19:
- added algorithm to compute trace vector

2007-March-17:
- added chapter about wavelet transform
- generalized sum-of-digits test for modulus R^n-1 where R is the radix

2007-March-14:
- added section about fast radix conversion

2007-March-04:
- added short intro to the pari/gp language

2007-February-14:
- added section about rectangular schemes for the computation
  of power series [2007-February-24: simplified and extended]

2006-December-03:
- added special primality test for numbers of the form 12*k+7

2006-November-19:
- added section about Fibonacci-Haar and Fibonacci-Walsh transforms
- added section about Mersenne-Haar and Mersenne-Walsh transforms
- added section about non-existence of Gray codes for binary Lyndon words
  of even length n>=8

2006-October-08:
- added section about generation of revbin pairs via LFSR

2006-September-24:
- added section about subsets of a multiset via mixed radix counting

2006-September-11:
- added 3-way splitting schemes for multiplication and squaring
- added 4-way and 5-way splitting schemes for squaring

2006-August-19:
- added more superlinear iterations for Pi

2006-June-28:
- added intro text for chapter about combinatorial generation

2006-June-25:
- Added super fast routines for Heap permutations
- Added very fast routine for permutations by reversing prefixes

2006-June-24:
- Added very fast and versatile routines for Trotter/Johnson permutations

2006-June-22:
- Added Heap's algorithm for permutations in minimal-change order

2006-June-21:
- OEIS numbers now clickable
- OEIS numbers listed in index ("integer seq., by OEIS number")

2006-June-20:
- added section about a different type of restricted growth strings

2006-June-18:
- added section about restricted growth strings (RGS) for set partitions

2006-June-17:
- added section about mixed radix numbers in endo order,
  and Gray code for endo order

2006-June-16:
- added section about mixed radix counting
- added section about factorial representations for permutations
- added algorithm for Gray code for cyclic permutation

2006-June-11:
- added algorithm for Gray code for k-subsets where kmin<k<kmax

2006-May-22:
- added iterative algorithm for integer partitions

2006-May-18:
- added Hindenburg's algorithm for integer partitions into m parts

2006-May-14:
- added section about arctan relations for Pi

2006-May-13:
- added section about GCC builtins such as popcount()
- added section about undefined shifts greater or equal
  word length with the C-language.
- added section about computation of square roots modulo p

2005-November-13:
- completed bibliography entries (added Journals where missing)
- added URL to bib-entries where possible

2005-November-01:
- improved algorithm for the computation of the Chebyshev polynomials U

2005-October-29:
- added section about (generalized) Karatsuba multiplication of polynomials
  and an FFT multiplication scheme for binary polynomials.

2005-October-27:
- improved algorithm for the computation of the Chebyshev polynomials T

2005-October-19:
- added section about track-parallel computation of CRCs

2005-October-17:
- added subsections about argument reduction for log/exp/arctan/cos
- moved computation of transcendental functions with power series to own section
- added Ansatz for Binet form for recurrences when characteristic
  polynomial has multiple roots

2005-September-29:
- added subsection about p-adic version of iterations for roots
- added code for (improved) Pocklington-Lehmer primality test

2005-September-28:
- added section about bit-permutations via primitives

2005-September-23:
- added section about efficient reduction modulo x^2+x+1, x^2-x-1 and x^2+1

2005-September-20:
- added algorithm for the computation of the field polynomial
  for Gaussian normal bases with all computations over GF(2)

2005-September-19:
- added section about algorithm for finding binary polynomials
  corresponding to additive linear hybrid cellular automata

2005-September-18:
- added section about conversion of irreducible binary polynomials to LHCAs

2005-September-05:
- added (sub)section about fixed points of the blue code

2005-September-02:
- added Gao's construction for normal polynomials of degree 2^n

2005-September-01:
- added section about Z-code (space filling curve a la Morton)

2005-August-25:
- added Rabin's irreducibility test for binary polynomials

2005-August-23:
- added section about multiplication of hypercomplex numbers
  (Cayley-Dickson construction)

2005-August-17:
- allow CiteSeer to mirror copy of the book

2005-August-08:
- added section about generation of binary Fibonacci words
  in minimal-change order

2005-August-07:
- added section describing cost of binary exponentiation

2005-August-05:
- added algorithm for octonion multiplication

2005-July-28:
- added section about generation of permutations from counting
  in mixed-radix (factorial) base

2005-July-12:
- added recursive routine for k-subsets

2005-July-11:
- added branch free versions of bitcopy and bitswap

2005-July-10:
- added subsection about conditional swap

2005-July-09:
- added inverse via EGCD to section about arithmetic with binary polynomials
- moved section about the generation of all permutations to
  combinatorics chapter

2005-July-03:
- added optimizations in sections about arithmetic with binary polynomials

2005-July-02:
- added FKM algorithm for pre-necklaces
- added 'counter examples' to section about branchless functions

2005-July-01:
- added machine description (in appendix)
- added section about two-dimensional FHT

2005-June-30:
- added section about localized Hartley transform

2005-June-28:
- added section about localized Walsh transform

2005-June-27:
- added section about radix-4 and radix-8 Walsh transform

2005-June-26:
- improved sections about arithmetic with binary polynomials

2005-June-25:
- improved section about AGM based algorithms for hypergeometric functions

2005-June-14:
- all URLs are hyperlinks
- all file references to FXT and hfloat are hyperlinks

2005-June-13:
- revised binsplit section and added code and timings

2005-June-06:
- updated all timings to reflect AMD64 2.2GHz, dual channel 200MHz DDR-RAM

2005-May-29:
- Chebyshev polynomials: added recursion for coefficients of U_n(x)
- Chebyshev polynomials: added closed form solution for T_n(x)=z

2005-May-22:
- added upward recursion for diagonal Pade approximants of exp(z)

2005-May-21:
- added algorithm for diagonal Pade approximants of log(1+z)

2005-May-19:
- added CRC optimization via lookup table

2005-May-16:
- revised section about bit-reversal permutation

2005-May-15:
- revised section about bit-reversal

2005-April-28:
-  revised section about the symmetries of the Fourier transform

2005-April-12:
- added AMD64 assembler inlines at three places in the bit wizardry chapter

2005-March-19:
- added recursion for coefficients of diagonal Pade approximants of exp

2005-March-17:
- added some AGM based algorithms for hypergeometric functions

2005-March-06:
- added algorithm for exp() of a power series

2005-February-28:
- added explicit AGM based algorithms for
  F([1/2,1/2],[1],z) and F([1/3,1/3],[1],z)
- added section about transforming an inhomogeneous recurrence
  into an equivalent homogeneous recurrence of greater order

2005-February-20:
- added gcd based computation to solve u^2+v^2==p =4*k+1

2005-February-13:
- added section about Gray code for sparse signed binary words

2005-February-12:
- updated section about CRC

2005-February-07:
- added section about Gray code for Fibonacci words

2005-February-06:
- added section about the CAT generator for combinations

2005-January-31:
- improved section about subsets in minimal-change order

2005-January-28:
- added section about M.Paul's signed binary representation

2005-January-02:
- added recursive construction for compositions in minimal-change order

2004-December-28:
- added section about paren pairs in minimal-change order
  via restricted growth functions

2004-December-17:
- added section about set partitions (incl. minimal-change order)

2004-December-03:
- reworked section about emulation of coroutines
  and moved it to chapter "Data structures"

2004-November-28:
- added references to OEIS in several places
- added backward direction to the colex ordered parens

2004-November-23:
- added section about conversion to radix -2
- added subsection about connection between the towers of Hanoi puzzle
  and the period-doubling sequence
- added several references to (fxt-)demos

2004-November-22:
- more examples in section about equivalence classes

2004-November-04:
- added section about binary words that are paren-words

2004-November-02:
- added section "Initial approximations with iterations"

2004-October-31:
- Fibonacci Gray code was flawed, removed section

2004-October-30:
- added section: CRC

2004-October-25:
- added section: Rader's algorithm for FFTs of prime length

2004-October-23:
- added section: counting sort and radix sort

2004-October-22:
- added section: determination of equivalence classes

2004-October-18:
- start of changelog