Multinomial identities arising from free probability theory. - Piotr Sniady (J. Comb. Theory A, 2003)

Generalized Cauchy identities, trees and multidimensional Brownian motions. Part I: bijective proof of generalized Cauchy identities. - Piotr Sniady (Electron. J. Comb., 2006)

Asymptotics of characters of symmetric groups, genus expansion and free probability. - Piotr Sniady (Discret. Math., 2006)

Permutations Without Long Decreasing Subsequences and Random Matrices. - Piotr Sniady (Electron. J. Comb., 2007)

On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism. - Cristopher Moore; Alexander Russell; Piotr Sniady (SIAM J. Comput., 2010)

Asymptotics of characters of symmetric groups: Structure of Kerov character polynomials. - Maciej Dolega; Piotr Sniady (J. Comb. Theory A, 2012)

Robinson-Schensted-Knuth Algorithm, Jeu de Taquin, and Kerov-Vershik Measures on Infinite Tableaux. - Piotr Sniady (SIAM J. Discret. Math., 2014)

Limit shapes of bumping routes in the Robinson-Schensted correspondence. - Dan Romik; Piotr Sniady (Random Struct. Algorithms, 2016)

Bijection Between Oriented Maps and Weighted Non-Oriented Maps. - Agnieszka Czyzewska-Jankowska; Piotr Sniady (Electron. J. Comb., 2017)

Asymptotics of Jack characters. - Piotr Sniady (J. Comb. Theory A, 2019)

Poisson limit theorems for the Robinson-Schensted correspondence and for the multi-line Hammersley process. - Mikolaj Marciniak; Lukasz Maslanka; Piotr Sniady (Adv. Appl. Math., 2023)

Bijection Between Trees in Stanley Character Formula and Factorizations of a Cycle. - Karolina Trokowska; Piotr Sniady (Electron. J. Comb., 2024)