Abstract. For Diophantine equations having infinitely many solutions, one can try to bound the number of solutions in large boxes. I will briefly discuss heuristics and survey some different results. Specifically, I will outline Heath-Brown's 'q-analogue' of van der Corput's method for exponential sums, and show some bounds that can be obtained.