  The pivot algorithm is the most efficient known method for sampling polymer
configurations for self-avoiding walks and related models. Here we introduce
two recent improvements to an efficient binary tree implementation of the pivot
algorithm: an extension to an off-lattice model, and a parallel implementation.
