** Professor of Mathematics **

*Research Interests: *Analysis, combinatorics

## Publications

Subsets of Cayley Graphs That Induce Many Edges

– Theory of Computing

(2019)

15,

1

(DOI: 10.4086/toc.2019.v015a020)

Perverse incentives: How the reward structures of academia impede scholarly communication and good science

– Septentrio Conference Series

(2017)

(DOI: 10.7557/5.4267)

Freiman homomorphisms on sparse random sets

– Quarterly Journal of Mathematics

(2017)

68,

275

(DOI: 10.1093/qmath/haw058)

Inverse and stability theorems for approximate representations of finite groups

– Sbornik: Mathematics

(2017)

208,

1784

(DOI: 10.1070/sm8872)

Probabilistic combinatorics and the recent work of Peter Keevash

– Bulletin of the American Mathematical Society

(2016)

54,

107

(DOI: 10.1090/bull/1553)

Generalizations of Fourier analysis, and how to apply them

– Bulletin of the American Mathematical Society

(2016)

54,

1

(DOI: 10.1090/bull/1550)

The multiparty communication complexity of interleaved group products

– 2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS)

(2016)

289

(DOI: 10.1109/focs.2016.39)

The Communication Complexity of Interleaved Group Products

– STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING

(2015)

351

(DOI: 10.1145/2746539.2746560)

On the KŁR conjecture in random graphs

– Israel Journal of Mathematics

(2014)

203,

535

(DOI: 10.1007/s11856-014-1120-1)

- 1 of 9