Aubrey Blecher

Math. Comput. Sci., 2022

Alphabetic points in restricted growth functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Pushes in words-a primitive sorting algorithm.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2022

2021

Impulse Propagation in Compositions and Words.

[BibT_eX]

[DOI]

Int. J. Math. Math. Sci., 2021

2020

The Depth of Compositions.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2020

Counting Permutations by the Number of Vertical Edges in Their Bargraphs.

[BibT_eX]

[DOI]

Mark Shattuck

J. Autom. Lang. Comb., 2020

The number of distinct adjacent pairs in geometrically distributed words.

[BibT_eX]

[DOI]

Stephan Wagner

Mark Daniel Ward

Discret. Math. Theor. Comput. Sci., 2020

A simple sorting algorithm for compositions.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2020

Water capacity of Dyck paths.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2020

2017

The perimeter of words.

[BibT_eX]

[DOI]

Discret. Math., 2017

2016

Partitions according to multiplicities and part sizes.

[BibT_eX]

[DOI]

Australas. J Comb., 2016

2015

The height and width of bargraphs.

[BibT_eX]

[DOI]

Helmut Prodinger

Discret. Appl. Math., 2015

Greatest Descents after any Maxima in Compositions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

Levels in bargraphs.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2015

2014

Descents after maxima in compositions.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

2012

Compositions Of Positive Integers n Viewed As Alternating Sequences Of Increasing/Decreasing Partitions.

[BibT_eX]