The classical RSK algorithm is a profound combinatorial object which is closely related to properties of Schur symmetric functions. I will present a recent generalization of this algorithm to the case of Hall-Littlewood functions, and discuss its combinatorial and probabilistic properties. Based on a joint work with K. Matveev. Speaker(s): Alexey Bufetov (MIT)