Ron Peled

According to our database, Ron Peled authored at least 9 papers between 2010 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

A recursive construction of <i>t</i>-wise uniform permutations.

Hilary K. Finucane, Ron Peled, Yariv Yaari

Random Struct. Algorithms, 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 differential version of the Chebyshev-Markov-Stieltjes inequalities.

Shoni Gilboa, Ron Peled

J. Approx. Theory, 2015

2013

Lipschitz Functions on Expanders are Typically Flat.

Ron Peled, Wojciech Samotij, Amir Yehudayoff

Comb. Probab. Comput., 2013

Probabilistic existence of regular combinatorial structures

Greg Kuperberg, Shachar Lovett, Ron Peled

CoRR, 2013

Separating signal from noise.

Nir Lev, Ron Peled, Yuval Peres

CoRR, 2013

2012

Probabilistic existence of rigid combinatorial structures.

Greg Kuperberg, Shachar Lovett, Ron Peled

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

The maximal probability that <i>k</i>-wise independent bits are all 1.

Ron Peled, Ariel Yadin, Amir Yehudayoff

Random Struct. Algorithms, 2011

2010

Simple universal bounds for Chebyshev-type quadratures.

Ron Peled

J. Approx. Theory, 2010