Search the dblp DataBase
Lajos Takács: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Lajos Takács
An Identity for Ordered Partial Sums. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1977, v:23, n:3, pp:364-365 [Journal] - Lajos Takács
On a Combinatorial Theorem Related to a Theorem of G. Szegö. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1981, v:30, n:3, pp:345-348 [Journal] - Lajos Takács
On Cayley's formula for counting forests. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1990, v:53, n:2, pp:321-323 [Journal] - Lajos Takács
A generalization of an inequality of Stepanov. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1990, v:48, n:2, pp:289-293 [Journal] - Lajos Takács
On the Total Heights of Random Rooted Binary Trees. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1994, v:61, n:2, pp:155-166 [Journal] - Lajos Takács
On the Number of Distinct Forests. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1990, v:3, n:4, pp:574-581 [Journal] - Lajos Takács
On the "problème des ménages". [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1981, v:36, n:3, pp:289-297 [Journal] - Lajos Takács
Counting forests. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1990, v:84, n:3, pp:323-326 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002