Sciweavers

37 search results - page 6 / 8
» mfcs 2005
Sort
View
70
Voted
MFCS
2005
Springer
15 years 2 months ago
On Small Hard Leaf Languages
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 ā...
Falk Unger
MFCS
2005
Springer
15 years 2 months ago
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
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 ...
Minming Li, Frances F. Yao
MFCS
2005
Springer
15 years 2 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
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...
Markus Lohrey, Nicole Ondrusch
64
Voted
MFCS
2005
Springer
15 years 2 months ago
Online and Dynamic Recognition of Squarefree Strings
The online squarefree recognition problem is to detect the first occurrence of a square in a string whose characters are provided as input one at a time. We present an efficient a...
Jesper Jansson, Zeshan Peng
MFCS
2005
Springer
15 years 2 months ago
Autoreducibility, Mitoticity, and Immunity
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...
Christian Glaßer, Mitsunori Ogihara, Aduri P...