A combinatorial Gray code for a class of objects is a listing that contains each object from the
class exactly once such that any two consecutive objects in the list differ only by asmall …

Based on order relations inspired by the binary reflected Gray code (BRGC) we define Gray
codes and give a generating algorithm for q q-ary words avoiding a prescribed factor. These …

We present the first efficient algorithm to list necklaces, Lyndon words, or pseudo-necklaces
of length n in colexicographic order. The algorithm has two interesting properties. First, it can …

A Gray code for a combinatorial class is a method for listing the objects in the class so that
successive objects differ in some prespecified, small way, typically expressed as a bounded …

A generalized (resp. p-ary) ballot sequence is a sequence over the set of non-negative
integers (resp. integers less than p) where in any of its prefixes each positive integer i occurs …

The term restricted growth string typically refers to strings of non-negative integers a1a2··· an
(with a1= 0) in which the next symbol is at most one more than the maximum of the previous …

We compare performance of six single classifiers trained on German credit dataset, an
imbalanced dataset of 1000 instances with binary-valued dependent variable. To improve …

The manuscript presents enumerations for restricted growth functions (RGFs) avoiding (i)
single vincular pattern sets of length at most 3 and (ii) two-pattern sets of a vincular pattern …

An ascent sequence is a sequence x1x2··· xn of nonnegative integers such that x1= 0 and
xi≤ asc (x1x2··· xi− 1)+ 1(1) for 2≤ i≤ n, where asc (x1x2··· xk) is the number of ascents in …

Distributed query processing, when blank nodes might occur in sources and only the
signature of sources are known, may in the worst case require that all possible query …