2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2009★ 2 cited
Forbidden substrings on weighted alphabets
Amy N. Myers
In an influential 1981 paper, Guibas and Odlyzko constructed a generating function for the number of length n strings over a finite alphabet that avoid all members of a given set o…
math.CO2007
Left-to-right maxima in words and multiset permutations
Amy Myers, Herb Wilf
We extend classical theorems of Renyi by finding the distributions of the numbers of both weak and strong left-to-right maxima (a.k.a. outstanding elements) in words over a given a…
math.CO2003★ 1 cited
Some new aspects of the coupon-collector's problem
Amy N. Myers, Herbert S. Wilf
We extend the classical coupon collector's problem to one in which two collectors are simultaneously and independently seeking collections of coupons. We find, in finite terms,…