Simple universal bounds for Chebyshev-type quadratures. - Ron Peled (J. Approx. Theory, 2010)

Probabilistic existence of rigid combinatorial structures. - Greg Kuperberg; Shachar Lovett; Ron Peled (Electron. Colloquium Comput. Complex., 2011)

The maximal probability that k-wise independent bits are all 1. - Ron Peled; Ariel Yadin; Amir Yehudayoff (Random Struct. Algorithms, 2011)

Separating signal from noise. - Nir Lev; Ron Peled; Yuval Peres (CoRR, 2013)

Probabilistic existence of regular combinatorial structures - Greg Kuperberg; Shachar Lovett; Ron Peled (CoRR, 2013)

Lipschitz Functions on Expanders are Typically Flat. - Ron Peled; Wojciech Samotij; Amir Yehudayoff (Comb. Probab. Comput., 2013)

A differential version of the Chebyshev-Markov-Stieltjes inequalities. - Shoni Gilboa; Ron Peled (J. Approx. Theory, 2015)

Erratum to "A differential version of the Chebyshev-Markov-Stieltjes inequalities" [J. Approx. Theory 196 (2015) 13-54]. - Shoni Gilboa; Ron Peled (J. Approx. Theory, 2015)

A recursive construction of t-wise uniform permutations. - Hilary K. Finucane; Ron Peled; Yariv Yaari (Random Struct. Algorithms, 2015)