Search the dblp DataBase
C. L. Mallows: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- C. L. Mallows, N. J. A. Sloane
An Upper Bound for Self-Dual Codes [Citation Graph (0, 0)][DBLP]
Information and Control, 1973, v:22, n:2, pp:188-200 [Journal] - Frank K. Hwang, C. L. Mallows
Enumerating Nested and Consecutive Partitions. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1995, v:70, n:2, pp:323-333 [Journal] - C. L. Mallows
Baxter Permutations Rise Again. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1979, v:27, n:3, pp:394-396 [Journal] - C. L. Mallows
Identities Satisfied by Iterated Polynomials and (Q, x)-Binomial Coefficients. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1989, v:2, n:3, pp:366-370 [Journal] - C. L. Mallows, Larry A. Shepp
Enumerating pairs of permutations with the same up-down form. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1985, v:54, n:3, pp:301-311 [Journal]
Search in 0.001secs, Finished in 0.001secs
| 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