- Choongbum Lee, Po-Shen Loh, Benny Sudakov:
Judicious partitions of directed graphs. Random Struct. Algorithms 48(1): 147-170 (2016) - Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao:
Improved bounds for the randomized decision tree Complexity of recursive majority. Random Struct. Algorithms 48(3): 612-638 (2016) - Oshri Naparstek, Amir Leshem:
Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs. Random Struct. Algorithms 48(2): 384-395 (2016) - Pawel Pralat, Nicholas C. Wormald:
Meyniel's conjecture holds for random graphs. Random Struct. Algorithms 48(2): 396-421 (2016) - Dan Romik, Piotr Sniady:
Limit shapes of bumping routes in the Robinson-Schensted correspondence. Random Struct. Algorithms 48(1): 171-182 (2016) - Mark Rudelson, Ofer Zeitouni:
Singular values of Gaussian matrices and permanent estimators. Random Struct. Algorithms 48(1): 183-212 (2016)