This paper deals with balanced leaf language complexity classes, introduced independently in [1] and [14]. We propose the seed concept for leaf languages, which allows us to give ā...
We consider the problem of job scheduling on a variable voltage processor with d discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for ...
This paper investigates the word problem for inverse monoids generated by a set Ī subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
The online squarefree recognition problem is to detect the ļ¬rst occurrence of a square in a string whose characters are provided as input one at a time. We present an eļ¬cient a...
We show the following results regarding complete sets. ⢠NP-complete sets and PSPACE-complete sets are many-one autoreducible. ⢠Complete sets of any level of PH, MODPH, or th...