A note on the binary additive divisor problem
  In this note we show that the methods of Motohashi and Meurman yield the same upper bound on the error term in the binary additive divisor problem. With this goal, we improve an estimate in the proof of Motohashi. 
Olga Balkanova, Dmitry Frolenkov
math.NT