Large data centers host several application environments (AEs) that are subject to workloads whose intensity varies widely and unpredictably. Therefore, the servers of the data ce...
We study the algebraic structure of directed bigraphs, a bigraphical model of computations with locations, connections and resources previously introduced as a unifying generaliza...
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
We associate one or two posets (which we call "semistandard posets") to any given irreducible representation of a rank two semisimple Lie algebra over C. Elsewhere we ha...
L. Wyatt Alverson II, Robert G. Donnelly, Scott J....
We use combinatorial methods and permutation groups to classify homogeneous boolean functions. The property of symmetry of a boolean function limits the size of the function’s cl...