Rearranging small-ish sets for distinct partial sums

A 1971 conjecture of Graham (later repeated by Erdős and Graham) asserts that every set A of nonzero residues modulo p has an ordering whose partial sums are all distinct. We prove this conjecture for sets A of up to quasipolynomial size; our result improves the previous bound of log p/loglog p. The key ingredient in our argument is a structure theorem involving dissociated sets, which may be of independent interest. Based on joint work with Benjamin Bedert.