diff --git a/docs/index.rst b/docs/index.rst
index fccfee51f..5b7b645dd 100644
--- a/docs/index.rst
+++ b/docs/index.rst
@@ -1,5 +1,4 @@
-.. finufft documentation master file, created by
-   sphinx-quickstart on Wed Nov  1 16:19:13 2017.
+.. finufft documentation master file.
    You can adapt this file completely to your liking, but it should at least
    contain the root `toctree` directive.
 
@@ -51,10 +50,11 @@ is faster than the `Chemnitz NFFT3 library <https://www-user.tu-chemnitz.de/~pot
 distributions and/or high precision.
 Our library does not require precomputation, and uses minimal RAM.
 
-For the case of small problems where repeated NUFFTs are needed with a fixed set of nonuniform points, we have started to build interfaces for this case.
+For the case of small problems where repeated NUFFTs are needed with a fixed set of nonuniform points, we have started to build advanced
+interfaces for this case.
 These are a factor of 2 or more faster than repeated calls to the plain
-interface, since certain costs such as FFTW setup and sorted are performed
-only once; see the advanced usage.
+interface, since certain costs such as FFTW setup and sorting are performed
+only once.
 
 .. note::
 
diff --git a/docs/refs.rst b/docs/refs.rst
index 78c2790dd..8b41e7dbc 100644
--- a/docs/refs.rst
+++ b/docs/refs.rst
@@ -3,7 +3,9 @@ References
 
 References for this software and the underlying mathematics include:
 
-[FIN] FINUFFT: a fast and lightweight nonuniform fast Fourier transform library. A. H. Barnett and J. F. Magland. In preparation (2017).
+[FIN]
+A parallel non-uniform fast Fourier transform library based on an ``exponential of semicircle'' kernel.
+A. H. Barnett, J. F. Magland, and L. af Klinteberg. Preprint (2018).
 
 [ORZ] Prolate Spheroidal Wave Functions of Order Zero: Mathematical Tools for Bandlimited Approximation.  A. Osipov, V. Rokhlin, and H. Xiao. Springer (2013).
 
diff --git a/docs/usage.rst b/docs/usage.rst
index fed5ca06b..78638e408 100644
--- a/docs/usage.rst
+++ b/docs/usage.rst
@@ -5,7 +5,9 @@ Here we describe calling FINUFFT from C++, C, and Fortran.
 
 We provide Type 1 (nonuniform to uniform), Type 2 (uniform to
 nonuniform), and Type 3 (nonuniform to nonuniform), in dimensions 1,
-2, and 3.  This gives nine routines in all.
+2, and 3.  This gives nine basic routines.
+There are also two :ref:`advanced interfaces <manyinterface>`
+for multiple 2d1 and 2d2 transforms with the same point locations.
 
 Using the library is a matter of filling your input arrays,
 allocating the correct output array size, possibly setting fields in
diff --git a/finufft-manual.pdf b/finufft-manual.pdf
index 5d4cf6291..d0284ec40 100644
Binary files a/finufft-manual.pdf and b/finufft-manual.pdf differ