Maximum Waiting Times are Asymptotically Independent. - Tamás F. Móri (Comb. Probab. Comput., 1992)

How Much Homogeneous Can the Appearing Pattern Be? - Tamás F. Móri (Random Struct. Algorithms, 1993)

How to transform correlated random variables into uncorrelated ones. - Arjun K. Gupta; Tamás F. Móri; Gábor J. Székely (Appl. Math. Lett., 2000)

On the Multiplicity of the Sample Maximum and the Longest Head Run. - Tamás F. Móri (Period. Math. Hung., 2000)

The Maximum Degree of the Barabasi-Albert Random Tree. - Tamás F. Móri (Comb. Probab. Comput., 2005)

Is envy one of the possible evolutionary roots of charity? - József Garay; Tamás F. Móri (Biosyst., 2011)

On Erdős-Gallai and Havel-Hakimi algorithms - Antal Iványi; Lorád Lucz; Tamás F. Móri; Péter Sótér (CoRR, 2011)

Testing Goodness of Fit of Random Graph Models. - Villõ Csiszár; Péter Hussami; János Komlós; Tamás F. Móri; Lídia Rejtõ; Gábor E. Tusnády (Algorithms, 2012)

A random model of publication activity. - Ágnes Backhausz; Tamás F. Móri (Discret. Appl. Math., 2014)

Asymptotic Properties of a Random Graph with Duplications. - Ágnes Backhausz; Tamás F. Móri (J. Appl. Probab., 2015)