Almost-Fisher families. - Shagnik Das; Benny Sudakov; Pedro Vieira 003 (J. Comb. Theory A, 2016)

Finding Hamilton cycles in random graphs with few queries. - Asaf Ferber; Michael Krivelevich; Benny Sudakov; Pedro Vieira 003 (Random Struct. Algorithms, 2016)

Finding paths in sparse random graphs requires many queries. - Asaf Ferber; Michael Krivelevich; Benny Sudakov; Pedro Vieira 003 (Random Struct. Algorithms, 2017)

Non-trivially intersecting multi-part families. - Matthew Kwan 001; Benny Sudakov; Pedro Vieira 003 (J. Comb. Theory A, 2018)

Two Remarks on Eventown and Oddtown Problems. - Benny Sudakov; Pedro Vieira 003 (SIAM J. Discret. Math., 2018)