Two Queues Attended by a Single Server. - Lajos Takács (Oper. Res., 1968)

The Distribution of the Occupation Time for Single-Server Queues. - Lajos Takács (Oper. Res., 1971)

On the Busy Periods of Single-Server Queues with Poisson Input and General Service Times. - Lajos Takács (Oper. Res., 1976)

An Identity for Ordered Partial Sums. - Lajos Takács (J. Comb. Theory A, 1977)

Random Walks on A 600-Cell. - Gérard Letac; Lajos Takács (SIAM J. Algebraic Discret. Methods, 1980)

On the "problème des ménages". - Lajos Takács (Discret. Math., 1981)

On a Combinatorial Theorem Related to a Theorem of G. Szegö. - Lajos Takács (J. Comb. Theory A, 1981)

7 Combinatorics. - Lajos Takács (Nonparametric Methods, 1984)

Counting forests. - Lajos Takács (Discret. Math., 1990)

On Cayley's formula for counting forests. - Lajos Takács (J. Comb. Theory A, 1990)

A generalization of an inequality of Stepanov. - Lajos Takács (J. Comb. Theory B, 1990)

On the Number of Distinct Forests. - Lajos Takács (SIAM J. Discret. Math., 1990)

On the Total Heights of Random Rooted Binary Trees. - Lajos Takács (J. Comb. Theory B, 1994)