The complexity of depth-3 circuits computing symmetric Boolean functions. - Guy Wolfovitz (Inf. Process. Lett., 2006)

Bounds on the Number of Maximal Sum-Free Sets. - Guy Wolfovitz (Electron. Notes Discret. Math., 2007)

A New Derandomization of Auctions. - Oren Ben-Zwi; Ilan Newman; Guy Wolfovitz (SAGT, 2009)

Lower Bounds for the Size of Random Maximal H-Free Graphs. - Guy Wolfovitz (Electron. J. Comb., 2009)

4-cycles at the triangle-free process. - Guy Wolfovitz (Electron. Notes Discret. Math., 2009)

A Hat Trick. - Oren Ben-Zwi; Guy Wolfovitz (FUN, 2010)

Combinatorial model and bounds for target set selection. - Eyal Ackerman; Oren Ben-Zwi; Guy Wolfovitz (Theor. Comput. Sci., 2010)

Sub-Gaussian Tails for the Number of Triangles in G( n, p). - Guy Wolfovitz (Comb. Probab. Comput., 2011)

Triangle-free subgraphs in the triangle-free process. - Guy Wolfovitz (Random Struct. Algorithms, 2011)

A concentration result with application to subgraph count. - Guy Wolfovitz (Random Struct. Algorithms, 2012)

K 4-free graphs without large induced triangle-free subgraphs. - Guy Wolfovitz (Comb., 2013)

Hats, auctions and derandomization. - Oren Ben-Zwi; Ilan Newman; Guy Wolfovitz (Random Struct. Algorithms, 2015)