 | 2011 |
|---|
| 8 |       | Alexander Burstein:
A Short Proof for the Number of Permutations Containing Pattern 321 Exactly Once.
Electr. J. Comb. 18(2): (2011) |
| 2010 |
|---|
| 7 | | Alexander Burstein,
Peter Hästö:
Packing sets of patterns.
Eur. J. Comb. 31(1): 241-253 (2010) |
| 2006 |
|---|
| 6 | | Alexander Burstein,
Sergi Elizalde,
Toufik Mansour:
Restricted Dumont permutations, Dyck paths, and noncrossing partitions.
Discrete Mathematics 306(22): 2851-2869 (2006) |
| 2005 |
|---|
| 5 | | Alexander Burstein,
Sergey Kitaev:
On Unavoidable Sets of Word Patterns.
SIAM J. Discrete Math. 19(2): 371-381 (2005) |
| 2003 |
|---|
| 4 | | Alexander Burstein,
Toufik Mansour:
Counting occurrences of some subword patterns.
Discrete Mathematics & Theoretical Computer Science 6(1): 1-12 (2003) |
| 2002 |
|---|
| 3 | | Alexander Burstein,
Sylvie Corteel,
Alexander Postnikov,
Carla D. Savage:
A lattice path approach to counting partitions with minimum rank t.
Discrete Mathematics 249(1-3): 31-39 (2002) |
| 2 | | Alexander Burstein,
Peter Hästö,
Toufik Mansour:
Packing Patterns into Words.
Electr. J. Comb. on(2): (2002) |
| 1 | | Alexander Burstein,
Toufik Mansour:
Words Restricted by Patterns with at Most 2 Distinct Letters.
Electr. J. Comb. on(2): (2002) |
Data released under the ODC-BY 1.0 license — See also our legal information page