Let Mk be a given set of k integers. Define Exact-Mk-Colorability to be the problem of determining whether or not (G), the chromatic number of a given...

We present a method to detect simple cycles of length 4 of a directed graph in O(n1/e2-2/) steps, where n denotes the number of nodes, e denotes the n...

Multi-exit iteration is a generalization of the standard binary Kleene star operation. The addition of this construct to Basic Process Algebra (BPA) y...

A property of binary strings is constructed that has a representation by a collection of read-once branching programs of quadratic size but which is n...

A non-clairvoyant scheduler makes decisions having no knowledge of jobs. It does not know when the jobs will arrive in the future, that is, it is onli...