A word is crucial with respect to a given set of prohibited words (or simply prohibitions) if it avoids the prohibitions but it cannot be extended to the right by any letter of its...
In this paper we present an attack to the BLOKE and BRAKE hash functions, which are weakened versions of the SHA-3 candidate BLAKE. In difference to BLAKE, the BLOKE hash functio...
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...